Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The cricket compass for context-aware mobile applications
Proceedings of the 7th annual international conference on Mobile computing and networking
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
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
Distributed weighted-multidimensional scaling for node localization in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Theory of semidefinite programming for Sensor Network Localization
Mathematical Programming: Series A and B
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
Adaptive scheduling of wireless video sensor nodes for surveillance applications
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Journal of Network and Computer Applications
Coverage and activity management of wireless video sensor networks for surveillance applications
International Journal of Sensor Networks
Hi-index | 0.00 |
Wireless sensor networks (WSN) constitute a major area of research developing at a very fast pace. Target localisation and coverage are core issues in the field of WSN and represent constraints that affect the effectiveness of WSN. This article focuses on localisation and coverage and identifies a relationship of dependence between the two issues. Throughout this article, a localisation algorithm is proposed and also an energy efficient approach that aims to preserve coverage. The use of a mobile beacon is suggested to divide the region of interest into unit squares following the same method used in the Hilbert space filling curve. A proper choice of the order of the Hilbert curve (i.e. the region subdivisions) is studied to guarantee the localisation of all nodes as well as the total area of coverage. The mobile beacon assists to determine the physical location of undetected nodes by sending beacon packets while traversing the region of interest. It also locally derives an activity scheduling between nodes with a relatively low cost in terms of energy spent by nodes compared to other approaches. In order to validate the effectiveness of the above proposed approach, a series of experiments have been conducted and will be mentioned throughout this article.