Maintaining CDS in Mobile Ad Hoc Networks

Sakai, Kazuya; Sun, Min-Te; Ku, Wei‐Shinn; Okada, Hiromi

doi:10.1007/978-3-540-88582-5_16

Cited by 18 publications

(11 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the only CDS protocols capable of maintaining CDS under the change of network topology are Dai's [5] and the tree-based [8], [9] protocols. The algorithms in [10] further help to optimize the mobility handling for the tree-based CDS protocols. All the other protocols [4], [6], [7] will have to construct the CDS from scratch when the CDS is corrupted due to nodal mobility.…”

Section: Literature Reviewmentioning

confidence: 99%

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

Sakai

Sun

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally preferred that the CDS protocol not only creates CDS of small size, incurs less communication and computational overheads, adapts to the nodal mobility, but also generates CDS as quickly as possible. Unfortunately, none of the existing CDS protocols possesses all of these desirable properties. In this paper, we propose an algorithm to rapidly grow a CDS tree from an initiator. By incorporating this algorithm with the Multi-Initiator CDS protocol, we have created the CDS protocol for MANETs which enjoys all the aforementioned desirable properties. The simulation results validate that our proposed protocol achieves its design goals. In addition, an analytical model is provided that can accurately estimate the convergence time required by our proposed CDS protocol.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

Sakai

Sun

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…Previous works (Sakai et al, 2008;Sheu et al, 2009), demonstrate the use of CDS based virtual backbones to propagate the broadcast messages so that they are exchanged only among the nodes in the CDS instead of being broadcast by all the nodes in the network, thus reducing the number of unnecessary retransmissions (Fly and Meghanathan, 2010). A minimum connected dominating set is the smallest CDS (in terms of number of nodes in the CDS) for the entire graph.…”

Section: Jcsmentioning

confidence: 99%

Construction of Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Sharmila¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone (minimum size CDS) incurs less communication overhead. Unfortunately, computing a minimum size CDS is NP-hard and thus many algorithms were developed which concentrates on how to construct smaller CDSs. Aiming for minimum number of nodes in CDS, results in CDSs that are highly unstable. Here we present four CDS algorithms which are constructed based on strategy, density, Threshold Neighborhood Distance Ratio (TNDR) and velocity. Any node in the network can be a strategic node depending upon the application and need and will be selected as the starting node instead of the node with highest density which concentrates on minimum size CDS. Simulation methods are used to establish the efficiency of the proposed algorithm.

show abstract

“…An extended mobility handling mechanism has been proposed by Sakai et al [11]. It incorporates Height-Reduction and Initiator-Reduction procedures to handle the nodal mobility better.…”

Section: Related Workmentioning

confidence: 99%

Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks

Avula

Yoo²,

Park

2012

J GRAPH-HOC

View full text Add to dashboard Cite

One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.

show abstract

Maintaining CDS in Mobile Ad Hoc Networks

Cited by 18 publications

References 9 publications

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

Construction of Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks

Contact Info

Product

Resources

About