A distributed greedy algorithm for connected sensor cover in dense sensor networks

Authors:
Amitabha Ghosh;Sajal K. Das
Affiliations:
Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX;Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX
Venue:
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Year:
2005

Citing 11
Cited 3

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Hardness of Set Cover with Intersection 1

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Using proximity and quantized RSS for sensor localization in wireless networks

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Analysis on the redundancy of wireless sensor networks

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Estimating Coverage Holes and Enhancing Coverage in Mixed Sensor Networks

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Convergent SparseDT topology control protocol in dense sensor networks

Proceedings of the 2nd international conference on Scalable information systems
Information intensive wireless sensor networks: challenges and solutions

MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy in dense networks, and by scheduling nodes efficiently, minimum battery drainage is possible. In this paper, we focus on the problem of Minimum Connected Sensor Cover (MCSC), an NP-hard problem, and describe a distributed greedy algorithm to generate sub-optimal connected sensor covers for homogeneous dense static sensor networks. Our greedy algorithm is based on the notions of maximal independent sets on random geometric graphs, and on the structure of Voronoi diagram. We provide complexity analysis and bounds on the cardinalities of maximal independent sets (MIS) for our problem scenario, and derive an analytical expression for the size of the sub-optimal minimum connected sensor cover. We verify the bounds on the MIS using simulation.