Localization and coverage for high density sensor networks

This paper tackles the problems of localization and coverage in randomly deployed high density sensor networks. In particular, it presents a novel and integrated approach that performs at once localization and coverage. We introduce here an approach based on a single mobile beacon aware of its position. Sensor nodes receiving beacon packets will be able to locate themselves. On the other hand, We exploit the localization phase to construct sets of active nodes that ensure as much as possible the zone coverage. In our approach the mobile beacon follows a Hilbert curve. The results of experiments conducted using the discrete event simulator Omnet++, are discussed, they allow us to justify our approach and to compare it to existing ones.

[1]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[2]  Ken Kennedy,et al.  Improving memory hierarchy performance for irregular applications , 1999, ICS '99.

[3]  Christian Böhm,et al.  Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.

[4]  Erik D. Demaine,et al.  Mobile-assisted localization in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  David Simplot-Ryl,et al.  Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[6]  C. Alpert,et al.  Multi-Way Partitioning Via Spacefilling Curves and Dynamic Programming , 1994, 31st Design Automation Conference.

[7]  H. Sagan.  Space-filling curves , 1994 .

[8]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Mihail L. Sichitiu,et al.  Localization of wireless sensor networks with a mobile beacon , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[11]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[12]  Jacques M. Bahi,et al.  Localization and Coverage for High Density Sensor Networks , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[13]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[14]  Miklós Maróti,et al.  Sensor node localization using mobile acoustic beacons , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

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

[16]  Erik D. Demaine,et al.  Anchor-Free Distributed Localization in Sensor Networks , 2003 .

[17]  Ahmed Mostefaoui,et al.  A Mobile Beacon Based Approach for Sensor Network Localization , 2007 .

[18]  Laurent El Ghaoui,et al.  Convex Optimization Methods for Sensor Node Position Estimation , 2001, INFOCOM.

[19]  Neal Patwari,et al.  Distributed Multidimensional Scaling with Adaptive Weighting for Node Localization in Sensor Networks , 2004 .

[20]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[21]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[22]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[23]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[24]  Seth J. Teller,et al.  The cricket compass for context-aware mobile applications , 2001, MobiCom '01.

[25]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[26]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[27]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[28]  Akhil Kumar.  A Study of Spatial Clustering techniques , 1994, DEXA.

[29]  Anthony Man-Cho So,et al.  Theory of semidefinite programming for Sensor Network Localization , 2005, SODA '05.

[30]  Jun Luo,et al.  Non-Interactive Location Surveying for Sensor Networks with Mobility-Differentiated ToA , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[31]  David M. Mark,et al.  A Comparative Analysis of some 2-Dimensional Orderings , 1990, Int. J. Geogr. Inf. Sci..