scholarly journals Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks

2012 ◽  
Vol 4 (2) ◽  
pp. 15-27 ◽  
Author(s):  
Mallikarjun Avula
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Minimum Connected Dominating Set ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET

2010 ◽  
Vol 21 (03) ◽  
pp. 459-476 ◽  
Author(s):  
SAYAKA KAMEI ◽  
HIROTSUGU KAKUGAWA
Keyword(s):  
Approximation Algorithm ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Transient Faults ◽  
Minimum Connected Dominating Set ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Distributed Approximation

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory corruption, and topology change. Because such transient faults occur so frequently in mobile ad hoc networks, distributed algorithms on them should tolerate such events. In this paper, we propose a self-stabilizing distributed approximation algorithm for the minimum connected dominating set, which can be used, for example, as a virtual backbone or routing in mobile ad hoc networks. The size of the solution by our algorithm is at most 7.6|Dopt|+1.4, where Dopt is the minimum connected dominating set. The time complexity is O(k) rounds, where k is the depth of input BFS tree.

scholarly journals An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Chakradhar Penumalli ◽  
Yogesh Palanichamy
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Efficient Design ◽  
Activity Scheduling ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node’s remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node’s mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results.

Sign in / Sign up

Export Citation Format

Share Document