Localization and coverage for high density sensor networks

Authors:
Jacques M. Bahi;Abdallah Makhoul;Ahmed Mostefaoui
Affiliations:
Computer Science Laboratory, University of Franche-Comte (LIFC), Rue Engel Gros, BP 527, 90016 Belfort Cedex, France;Computer Science Laboratory, University of Franche-Comte (LIFC), Rue Engel Gros, BP 527, 90016 Belfort Cedex, France;Computer Science Laboratory, University of Franche-Comte (LIFC), Rue Engel Gros, BP 527, 90016 Belfort Cedex, France
Venue:
Computer Communications
Year:
2008

Citing 15
Cited 4

Fractals for secondary key retrieval

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multi-way partitioning via spacefilling curves and dynamic programming

DAC '94 Proceedings of the 31st annual Design Automation Conference
Improving memory hierarchy performance for irregular applications

ICS '99 Proceedings of the 13th international conference on Supercomputing
The cricket compass for context-aware mobile applications

Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
A Study of Spatial Clustering techniques

DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Distributed localization in wireless sensor networks: a quantitative comparison

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Theory of semidefinite programming for sensor network localization

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Integrated coverage and connectivity configuration for energy conservation in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
Localization and Coverage for High Density Sensor Networks

PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
A Mobile Beacon Based Approach for Sensor Network Localization

WIMOB '07 Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

All-nearest-neighbors finding based on the Hilbert curve

Expert Systems with Applications: An International Journal
Routing through holes in wireless sensor networks

Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Acoustic sensor network node self-localization based on adaptive particle swarm optimization

AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Efficient algorithm for serial data fusion in wireless sensor networks

Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems

Quantified Score

Hi-index	0.25

Visualization

Abstract

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.