Connected P-Percent Coverage in Wireless Sensor Networks based on Degree Constraint Dominating Set Approach

Habib Mostafaei, Morshed Chowdhury, MD Rafiqul Islam, Hojjat Gholizadeh

Research output: Book chapter/Published conference paperConference paperpeer-review

13 Citations (Scopus)

Abstract

In this paper, we propose an algorithm for connected p-percent coverage problem in Wireless Sensor Networks(WSNs) to improve the overall network life time. In this work, we investigate the p-percent coverage problem(PCP) in WSNs which requires p% of an area should be monitored correctly and to find out any additional requirements of the connected p-percent coverage problem. We propose pDCDS algorithm which is a learning automaton based algorithm for PCP. pDCDS is a Degree-constrained Connected Dominating Set based algorithm which detect the minimum number of nodes to monitor an area. The simulation results demonstrate that pDCDS can remarkably improve the network lifetime.
Original languageEnglish
Title of host publicationMSWiM 2015
Subtitle of host publicationProceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages157-160
Number of pages4
ISBN (Electronic)9781450337625
DOIs
Publication statusPublished - 2015
EventACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - Cancun, Mexico
Duration: 02 Nov 201506 Nov 2015

Conference

ConferenceACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
Period02/11/1506/11/15

Fingerprint

Dive into the research topics of 'Connected P-Percent Coverage in Wireless Sensor Networks based on Degree Constraint Dominating Set Approach'. Together they form a unique fingerprint.

Cite this