Distributed Algorithm for Coverage and Connectivity in Wireless Sensor Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Distributed Algorithm for Coverage and Connectivity in Wireless Sensor Networks

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
339159_1_En_36_Chapter.pdf (438.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01789944 , version 1 (11-05-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
191 View
151 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More