A location-unaware connected coverage protocol in wireless sensor networks

Authors:
Yingchi Mao;Lijun Chen;Daoxu Chen
Affiliations:
College of Computer and Information Engineering, Hohai University, Nanjing, China and Department of Computer Science, Nanjing University, Nanjing, China;Department of Computer Science, Nanjing University, Nanjing, China;Department of Computer Science, Nanjing University, Nanjing, China
Venue:
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Year:
2007

Citing 8
Cited 0

Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Area and perimeter derivatives of a union of disks

Computer Science in Perspective
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Energy-efficient coverage problems in wireless ad-hoc sensor networks

Computer Communications
Position-based routing in ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sensor networks consist of autonomous nodes with battery powered. Nodes can be sleep to extend the lifetime of network without compromising area coverage and network connectivity. Most existing approaches to connected coverage require knowledge of accurate location information. However, the energy cost and system complexity involved in obtaining the accurate location information may compromise the effectiveness of proposed solution as a whole. This paper addresses the problem of maximizing network lifetime while providing coverage and connectivity without accurate location information of sensor nodes. 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 in random geometric graphs. Based on the analytical results and Rule K algorithms constructing the connected dominating set, a Location-Unaware Connected Coverage Protocol (LUCCP) is proposed. Simulation studies show that the proposed LUCCP can effectively maintain both high quality sensing coverage and connectivity for a long time.