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 Stojmenovi´c, 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 u is not dominant if there exists in its 2hop neighborhood a connected set of nodes with higher priorities that covers u and its 1-hop neighbors. This new rule r...

• Type: Conference
• Year: 2007
• Where: COMSWARE
• Authors: François Ingelrest, David Simplot-Ryl, Ivan Stojmenovic
• Keywords: 1-hop Neighbors, COMSWARE 2007, Dominant Node, Dominating Sets