On calculating connected dominating set for efficient routing in ad hoc wireless networks

Abstract

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances. Our simulation results show that the proposed approach outperforms a classical algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.

Maintaining CDS in Mobile Ad Hoc Networks

“…While computing the minimum CDS is known to be NP-hard [3], a number of distributed CDS protocols [8,5,10,2,11,7] have been proposed to construct a CDS of small size. Both Wan's protocol [8] and Li's protocol [5] obtain CDS by expending the maximal independent set.…”

“…To reduce the cost of routing table maintenance in the virtual backbone, it is preferred that the size of the corresponding CDS to be as small as possible. Although computing the minimal CDS is known to be NP-hard [3], a number of protocols [8,5,10,2,11,7] have been proposed to construct CDS with competitive size. Among these protocols, only few [2,11,7] are capable of maintaining CDS under topology changes.…”

Routing Transient Traffic in Mobile Ad Hoc Networks

“…One is to reduce the backbone complexity by building a small connected graph in the network. Building a backbone that has good approximation ratio to the ideal Minimum Connected Dominating Set (MCDS) has been the research focus of ad hoc clustering in recent years [22][23][24][25][26][27][28]. Another method is to reduce the protocol overhead forwarded on the backbone.…”

Abstract Frames for Reducing Overhearing in Wireless Sensor Networks

“…Since reducing energy consumption is the critical issue in sensor networks, many authors have proposed protocols for energy-efficient broadcast: CDS (Connected Dominating Sets) [7], MPR (Multi Point Relays) [8], or RNG (Relative Neighborhood Graphs) [9]. They try to reduce energy consumption of the network by limiting the number of required transmissions or by performing power control to reduce transmission power.…”

“…The most immediate one is to reduce the number of transmitted frames by avoiding redundant transmissions. Many proposed protocols select only a subset of nodes to flood a message while ensuring that all nodes eventually receive the message: CDS (Connected Dominating Sets) [7], MPR (Multi Point Relays) [8], or RNG (Relative Neighborhood Graphs) [9]. Another approach tries to optimize the transmission range by seeking a good tradeoff between consuming more energy required to reach farther nodes or having more retransmissions [10][11][12].…”