TY - GEN
T1 - Achieving range-free localization beyond connectivity
AU - Zhong, Ziguo
AU - He, Tian
PY - 2009
Y1 - 2009
N2 - Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods for sensor node localization; on the other hand, range-free localization depending only on connectivity may underutilize the proximity information embedded in neighborhood sensing. In response to the above limitations, this paper presents a range-free approach to capturing a relative distance between 1-hop neighboring nodes from their neighborhood orderings that serve as unique high-dimensional location signatures for nodes in the network. With little overhead, the proposed design can be conveniently applied as a transparent supporting layer for many state-of-the-art connectivity-based localization solutions to achieve better positioning accuracy. We implemented our design with three well-known localization algorithms and tested it in two types of outdoor test-bed experiments: an 850-foot-long linear network with 54 MICAz motes, and a regular 2D network covering an area of 10000 square feet with 49 motes. Results show that our design helps eliminate estimation ambiguity with sub-hop resolution, and reduces localization errors by as much as 35%. In addition, extensive simulations reveal an interesting feature of robustness for our design under unevenly distributed radio propagation path loss, and confirm its effectiveness for large-scale networks.
AB - Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods for sensor node localization; on the other hand, range-free localization depending only on connectivity may underutilize the proximity information embedded in neighborhood sensing. In response to the above limitations, this paper presents a range-free approach to capturing a relative distance between 1-hop neighboring nodes from their neighborhood orderings that serve as unique high-dimensional location signatures for nodes in the network. With little overhead, the proposed design can be conveniently applied as a transparent supporting layer for many state-of-the-art connectivity-based localization solutions to achieve better positioning accuracy. We implemented our design with three well-known localization algorithms and tested it in two types of outdoor test-bed experiments: an 850-foot-long linear network with 54 MICAz motes, and a regular 2D network covering an area of 10000 square feet with 49 motes. Results show that our design helps eliminate estimation ambiguity with sub-hop resolution, and reduces localization errors by as much as 35%. In addition, extensive simulations reveal an interesting feature of robustness for our design under unevenly distributed radio propagation path loss, and confirm its effectiveness for large-scale networks.
KW - Range-free localization
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=74549122106&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=74549122106&partnerID=8YFLogxK
U2 - 10.1145/1644038.1644066
DO - 10.1145/1644038.1644066
M3 - Conference contribution
AN - SCOPUS:74549122106
SN - 9781605587486
T3 - Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, SenSys 2009
SP - 281
EP - 294
BT - Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, SenSys 2009
T2 - 7th ACM Conference on Embedded Networked Sensor Systems, SenSys 2009
Y2 - 4 November 2009 through 6 November 2009
ER -