Connected P-percent coverage in wireless sensor networks based on degree constraint dominating set approach


Autoria(s): Mostafaei, Habib; Chowdhury, Morshed U.; Islam, Rafiqul; Gholiadeh, Hojjat
Data(s)

01/01/2015

Resumo

In this paper, we propose an algorihm for conneced p-percent coverage probem in Wireless Sensor Networks(WSNs) to improve the over netork life time. In this work, we invstigae the p-pernt coverage problem(PCP) in WSNs which require % of n area should be monitored correctl and to find ou ny additional requirements of the connec p-percent coverge prom. We prose pDCDS algorith which is a learnin autmaton basd algorithm fr PCP pDCDS is a Degreconsained Connected Domining Se based algoithm whch detect the minimum numbe of des to monitor an area. The simulation results demonstrate hat pDCDS can remarkably improve the network lifetime.

Identificador

http://hdl.handle.net/10536/DRO/DU:30081470

Idioma(s)

eng

Publicador

ACM Press

Relação

http://dro.deakin.edu.au/eserv/DU:30081470/chowdhury-connectedp-evid2-2015.pdf

http://dro.deakin.edu.au/eserv/DU:30081470/chowdhury-connectedppercent-2015.pdf

http://dro.deakin.edu.au/eserv/DU:30081470/chowdhury-connectedppercent-evid-2015.pdf

http://www.dx.doi.org/10.1145/2811587.2811625

Direitos

2015, ACM Press

Tipo

Conference Paper