Distributed Algorithm for Coverage and Connectivity in Wireless Sensor Networks

Abstract : Even if several algorithms were proposed in the literature to solve the coverage problem in Wireless Sensor Networks (WSNs), they still suffer from some weaknesses. This is the reason why we suggest in this paper, a distributed protocol, called Single Phase Multiple Initiator (SPMI). Its aim is to find Connect Cover Set (CCS) for assuring the coverage and connectivity in WSN. Our idea is based on determining a Connected Dominating Set (CDS) which has a minimum number of necessary and sufficient nodes to guarantee coverage of the area of interested (AI), when WSN model is considered as a graph. The suggested protocol only requires a single phase to construct a CDS in distributed manner without using sensors’ location information. Simulation results show that SPMI assures better coverage and connectivity of AI by using fewer active nodes and by inducing very low message overhead, and low energy consumption, when compared with some existing protocols.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01789944
Contributor : Hal Ifip <>
Submitted on : Friday, May 11, 2018 - 3:10:25 PM
Last modification on : Friday, May 11, 2018 - 3:13:36 PM
Long-term archiving on : Tuesday, September 25, 2018 - 3:03:59 PM

File

339159_1_En_36_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Abdelkader Khelil, Rachid Beghdad. Distributed Algorithm for Coverage and Connectivity in Wireless Sensor Networks. 5th International Conference on Computer Science and Its Applications (CIIA), May 2015, Saida, Algeria. pp.442-453, ⟨10.1007/978-3-319-19578-0_36⟩. ⟨hal-01789944⟩

Share

Metrics

Record views

247

Files downloads

88