Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Exploring Landmark Placement Strategies for Topology-Based Localization in Wireless Sensor Networks | Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2008 Article ID 275658 12 pages doi 10.1155 2008 275658 Research Article Exploring Landmark Placement Strategies for Topology-Based Localization in Wireless Sensor Networks Farid Benbadis 1 Katia Obraczka 2 Jorge Cortes 3 and Alexandre Brandwajn2 1 Laboratoire LIP6 CNRS UMR 7606 Universite Pierre et Marie Curie 4 place jussieu 75005 Paris France 2 Department of Computer Engineering University of California Santa Cruz CA 95064 USA 3 Department of Mechanical and Aerospace Engineering University of California San Diego CA 92093 USA Correspondence should be addressed to Farid Benbadis farid.benbadis@lip6.fr Received 31 March 2007 Revised 24 September 2007 Accepted 21 December 2007 Recommended by Rong Zheng In topology-based localization each node in a network computes its hop-count distance to a finite number of reference nodes or landmarks . This paper studies the impact of landmark placement on the accuracy of the resulting coordinate systems. The coordinates of each node are given by the hop-count distance to the landmarks. We show analytically that placing landmarks on the boundary of the topology yields more accurate coordinate systems than when landmarks are placed in the interior. Moreover under some conditions we show that uniform landmark deployment on the boundary is optimal. This work is also the first empirical study to consider not only uniform synthetic topologies but also nonuniform topologies resembling more concrete deployments. Our simulation results show that in general if enough landmarks are used random landmark placement yields comparative performance to placing landmarks on the boundary randomly or equally spaced. This is an important result since boundary placement especially at equal distances may turn out to be infeasible and or prohibitively expensive in terms of communication processing overhead and power consumption in networks of nodes with limited .
