Optimizing coverage in a K-covered and connected sensor network using genetic algorithms

Authors:
Kasim Sinan Yildirim;Tahir Emre Kalayci;Aybars Uǧur
Affiliations:
Ege University, Department of Computer Engineering, Bornova, Izmir, Türkiye;Ege University, Department of Computer Engineering, Bornova, Izmir, Türkiye;Ege University, Department of Computer Engineering, Bornova, Izmir, Türkiye
Venue:
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Year:
2008

Citing 3
Cited 2

The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Worst and Best-Case Coverage in Sensor Networks

IEEE Transactions on Mobile Computing

Optimal sensors network layout using evolutionary algorithms

ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sensing coverage of a sensor network characterizes how well an area is monitored or tracked by sensors. Connectivity is an important requirement that shows how nodes in a sensor network can effectively communicate. Some hotspot areas in the network are more important than other areas and need to be covered by more sensors. We are interested in an initial deployment strategy that maximizes the coverage area of wireless sensor network while preserving connectivity between nodes provided that all given hotspot regions are covered by at least k sensors. We propose a genetic algorithm based solution to find an optimal sensor node distribution. Experimental results are presented to evaluate our algorithm.