Paper Info
Title
An energy efficient connected coverage protocol in wireless sensor networks
Abstract
The connected coverage is one of the most important problems in Wireless Sensor Networks. However, most existing approaches to connected coverage require knowledge of accurate location information. This paper solves a challenging problem: without accurate location information, how to schedule sensor nodes to save energy and meet both constraints of sensing area coverage and network connectivity. Our solution is based on the theoretical analysis of the sensing area coverage property of minimal dominating set. We establish the relationship between point coverage and area coverage, and derive the upper and lower bound that point coverage is equivalent to area coverage in random geometric graphs. Based on the analytical results and the existing algorithms which construct the connected dominating set, an Energy Efficient Connected Coverage Protocol (EECCP) is proposed. Extensive simulation studies show that the proposed connected coverage protocol can effectively maintain both high quality sensing coverage and connectivity for a long time.
Year
DOI
Venue
2007
10.1007/978-3-540-72524-4_41
APWeb/WAIM
Keywords
Field
DocType
minimal dominating set,existing algorithm,energy efficient connected coverage,wireless sensor network,existing approach,connected dominating set,proposed connected coverage protocol,connected coverage,accurate location information,point coverage,area coverage property,area coverage,random geometric graph,dominating set,upper and lower bounds,energy efficient
Key distribution in wireless sensor networks,Graph,Data mining,Dominating set,Upper and lower bounds,Efficient energy use,Computer science,Computer network,Connected dominating set,Wireless sensor network,Distributed computing,Area coverage
Conference
Volume
ISSN
Citations 
4505
0302-9743
2
PageRank 
References 
Authors
0.40
13
3
Name
Order
Citations
PageRank
Yingchi Mao1408.61
Zhuoming Xu220810.76
Yi Liang320.40