Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors

In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself dominant or neighbor of a dominant node. Application of such a set may for example be broadcasting, where the size of the set greatly impacts on energy consumption. Obtaining small sets is thus of prime importance. As a basis for our work, we use a heuristic given by Dai and Wu for constructing such a set. Their approach, in conjunction with the elimination of message overhead by Stojmenovic, has been recently shown to be an excellent compromise with respect to a wide range of metrics. In this paper, we present an enhanced definition to obtain smaller sets in the specific case where 2-hop information is considered. In our new definition, a node μ is not dominant if there exists in its 2-hop neighborhood a connected set of nodes with higher priorities that covers μ and its 1-hop neighbors. This new rule requires the same level of knowledge used by the original heuristic: only neighbors of nodes and neighbors of neighbors must be known to apply it. However, it takes advantage of some topological knowledge originally not taken into account, that may be used to deduce communication links between 1 -hop and 2-hop neighbors. We provide the proof that the new set is a subset of the one obtained with the original heuristic. We also give the proof that our set is always dominating for any graph, and connected for any connected graph. Two versions are considered: with topological and positional information, which differ in whether or not nodes are aware of links between their 2-hop neighbors that are not 1-hop neighbors. An algorithm for locally applying the concept at each node is described. We finally provide experimental data that demonstrates the superiority of our rule in obtaining smaller dominating sets. A centralized algorithm is used as a benchmark in the comparisons. The overhead of the size of connected dominating set is reduced by about 15% with the topological variant and by about 30% with the positional variant of our new definition.

[1]  Ivan Stojmenovic.  Comments and Corrections to "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks" , 2004, IEEE Trans. Parallel Distributed Syst..

[2]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[3]  Alessandro Panconesi,et al.  Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.

[4]  Ivan Stojmenovic,et al.  Optimal transmission radius for energy efficient broadcasting protocols in ad hoc and sensor networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[5]  Jie Wu,et al.  Distributed dominant pruning in ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[6]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[7]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[8]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[9]  Dharma P. Agrawal,et al.  Mobile Ad hoc Networking , 2002 .

[10]  StojmenovicIvan,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002 .

[11]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[12]  I. Stojmenovic,et al.  A Dominating Sets and Target Radius Based Localized Activity Scheduling and Minimum Energy Broadcast Protocol for Ad Hoc and Sensor Networks. , 2004 .

[13]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[14]  Marco Conti,et al.  Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Jie Wu,et al.  New metrics for dominating set based energy efficient activity scheduling in ad hoc networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[17]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[18]  Yi Pan,et al.  An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks , 2004, ISPA.

[19]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[20]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.