Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks

Abstract

The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CDS of competitive size with localized information, they either lack the mechanism to properly handle nodal mobility or require lengthy period of time to recover when CDS becomes corrupted. In this paper, a novel protocol, namely Multi-Initiator Connected Dominating Set protocol (MI-CDS), is proposed that constructs and maintains CDS of competitive size efficiently without introducing much communication overhead. The simulation results demonstrate that MI-CDS permits CDS to be available for the highest percentage of time in the mobile network scenario compared with the other CDS protocols.

Maintaining CDS in Mobile Ad Hoc Networks

“…Recently, several practical distributed CDS construction protocols capable of maintaining CDS [2,11,7] under the setting of MANETs have been proposed. Dai's protocol [2] extends the pruning rules of Wu's [10] for mobility handling.…”

“…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.…”

“…In this paper, we augment the CDS construction protocols in [11] and [7] by our Extended Mobility Handling (EMH) algorithm. The algorithm consists of two parts.…”

“…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.…”

“…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. For the rest of the protocols, when topology changes cause the CDS to be invalid, they will have to construct CDS from scratch, which in general is a time-consuming process.…”