On connectivity for wireless sensor networks localization

Node localization in wireless sensor networks has been a topic of active research in recent years. Network connectivity has been shown to be effective with respect to increasing localization performance via redundant nodes. In this paper, we study the connectivity of wireless sensor networks from a network self-localization prospective. To the best of our knowledge, theoretic analyses of the network connectivity for node self-localization have not been previously studied in the networking literature. Assuming a spatial Poisson distribution of network nodes, we modeled the network as random graph and derived an analytical expression that allows the determination of the localizable probability of any an unknown node for given network density /spl rho/. The problems have also been investigated by simulation in various scenarios. Our results are of practical value for designing sensor network considering of node self-localization.

[1]  Chenyang Lu,et al.  SPEED: a stateless protocol for real-time communication in sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[2]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[3]  Jan M. Rabaey,et al.  Location in distributed ad-hoc wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[4]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[5]  Hongchi Shi,et al.  Performance study of localization methods for ad-hoc sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[6]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[7]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[8]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

[9]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.

[10]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Koen Langendoen,et al.  Distributed localization in wireless sensor networks: a quantitative compariso , 2003, Comput. Networks.

[12]  B. R. Badrinath,et al.  Trajectory based forwarding and its applications , 2003, MobiCom '03.

[13]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[14]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .