Connected Set Cover Partitioning Problem in Wireless Sensor Networks.

Date of Submission

December 2009

Date of Award

Winter 12-12-2010

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Das, Nabanita (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Wireless ad-hoc sensor network has recently emerged as an effective way of monitoring remote or inhospitable areas. In overdeployed sensor networks, one effective way to conserve energy is to keep only a small subset of sensor nodes active at a particular instant covering the whole area. Connectivity in any active subset is another important issue since the information gathered by the sensor nodes in any subset should be finally transferred to the sink node via multi-hop paths, in general. So, in this paper we pose the problem of finding maximum number of connected set covers that can guarantee the required coverage of a query region. Once the connected set covers are known, the sets may remain active in a round robin fashion to cover the region enhancing the life time of the network significantly. Here we have developed two centralized versions of the algorithms, a distributed one and finally compared the performances by simulation


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.