A new distributed approximation algorithm for constructing minimum connected dominating set in wirelessad hoc networks

2005 ◽  
Vol 18 (8) ◽  
pp. 743-762 ◽  
Author(s):  
Bo Gao ◽  
Yuhang Yang ◽  
Huiye Ma
Keyword(s):  
Approximation Algorithm ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Minimum Connected Dominating Set ◽  
Hoc Networks ◽  
Distributed Approximation

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 Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems

Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1173 ◽  
Author(s):  
Ruizhi Li ◽  
Shuli Hu ◽  
Huan Liu ◽  
Ruiting Li ◽  
Dantong Ouyang ◽  
...  
Keyword(s):  
Local Search ◽  
Ad Hoc ◽  
Search Algorithm ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Local Optimum ◽  
Local Search Algorithm ◽  
Solution Quality ◽  
Minimum Connected Dominating Set ◽  
Hoc Networks

The minimum connected dominating set (MCDS) problem is a very significant NP-hard combinatorial optimization problem, and it has been used in many fields such as wireless sensor networks and ad hoc networks. In this paper, we propose a novel multi-start local search algorithm (MSLS) to tackle the minimum connected dominating set problem. Firstly, we present the fitness mechanism to design the vertex score mechanism so that our algorithm can jump out of the local optimum. Secondly, we use the configuration checking (CC) mechanism to avoid the cycling problem. Then, we propose the vertex flipping mechanism to change the vertex state by combing the CC mechanism with the vertex score mechanism. Finally, we propose a multi-start local search framework based on these mechanisms. We compare the algorithm MSLS with other compared algorithms on extensive instances. The results of experiment show that MSLS is superior to other algorithms in solution quality and time efficiency on most instances.

EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS

2009 ◽  
Vol 01 (04) ◽  
pp. 437-461 ◽  
Author(s):  
JAMES K. WILLSON ◽  
XIAOFENG GAO ◽  
ZHONGHUA QU ◽  
YI ZHU ◽  
YINGSHU LI ◽  
...  
Keyword(s):  
Shortest Path ◽  
Ad Hoc ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Communication Model ◽  
Virtual Backbone ◽  
Original Graph ◽  
Path Constraints ◽  
Hoc Networks ◽  
Distributed Approximation

A Connected Dominating Set (CDS) can be used to construct a virtual backbone for wireless and mobile ad-hoc networks to make the system hierarchical and efficient. A virtual backbone can significantly improve network throughput, optimize broadband utilization, extend network lifetime, and reduce interference as well as packet retransmissions. Calculating a minimum backbone for a network is critical to reduce routing computation and energy consumption. This problem is a well-known NP-hard optimization problem, which has various applications in practice. In this paper, we propose a new problem based on customer fairness, which looks for a minimum CDS in a given communication model with shortest path constraints. It guarantees that any two clients can communicate with each other through this CDS with hop counts the same as the best path from the original graph, which means that routing on such a CDS will not bring additional traffic for every client. We name this problem as shortest path connected dominating set (SPCDS) and prove its NP-hardness by reduction from Hitting Set. Then we propose a centralized greedy algorithm and an efficient distributed approximation algorithm with approximation ratio Δ to solve SPCDS, where Δ is the maximum vertex degree in the given topology. We also analyze the time complexity, message complexity, and evaluate the efficiency of our distributed heuristic by several numerical experiments and comparisons with previous literatures.

Sign in / Sign up

Export Citation Format

Share Document