Subscribe

Issue No.04 - April (2009 vol.8)

pp: 488-499

Rajiv Misra , Indian Institute of Technology, Kharagpur

Chittaranjan Mandal , Indian Institute of Technlogy, Kharagpur

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.128

ABSTRACT

Wireless ad hoc and sensor networks (WSNs) often require a connected dominating set (CDS) as the underlying virtual backbone for efficient routing. Nodes in a CDS have extra computation and communication load for their role as dominator, subjecting them to an early exhaustion of their battery. A simple mechanism to address this problem is to switch from one CDS to another fresh CDS, rotating the active CDS through a disjoint set of CDSs. This gives rise to the connected domatic partition (CDP) problem, which essentially involves partitioning the nodes V(G) of a graph G into node disjoint CDSs. We have developed a distributed algorithm for constructing the CDP using our maximal independent set (MIS)-based proximity heuristics, which depends only on connectivity information and does not rely on geographic or geometric information. We show that the size of a CDP that is identified by our algorithm is at least \lfloor{\frac{\delta+1}{\beta(c+1)}}\rfloor-f, where \delta is the minimum node degree of G, \beta\leq 2, c\leq 11 is a constant for a unit disk graph (UDG), and the expected value of f is \epsilon\delta|V|, where \epsilon \ll 1 is a positive constant, and \delta \geq 48. Results of varied testing of our algorithm are positive even for a network of a large number of sensor nodes. Our scheme also performs better than other related techniques such as the ID-based scheme.

INDEX TERMS

Connected dominating set (CDS), connected domatic partition (CDP), routing backbone, maximal independent set (MIS), proximity heuristics.

CITATION

Rajiv Misra, Chittaranjan Mandal, "Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks",

*IEEE Transactions on Mobile Computing*, vol.8, no. 4, pp. 488-499, April 2009, doi:10.1109/TMC.2008.128REFERENCES