Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On greedy construction of connected dominating sets in wireless networks: Research Articles
Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
STAB-WIN: Self Organized, Topology Control Ability Backbone Node in Wireless Networks
Wireless Personal Communications: An International Journal
New heuristic approaches for the dominating tree problem
Applied Soft Computing
Hi-index | 0.00 |
Unlike a cellular or wired network, there is no base station or network infrastructure in a wireless ad-hoc network, in which nodes communicate with each other via peer communications. In order to make routing and flooding efficient in such an infrastructureless network, Connected Dominating Set (CDS) as a virtual backbone has been extensively studied. Most of the existing studies on the CDS problem have focused on unit disk graphs, where every node in a network has the same transmission range. However, nodes may have different powers due to difference in functionalities, power control, topology control, and so on. In this case, it is desirable to model such a network as a disk graph where each node has different transmission range. In this paper, we define Minimum Strongly Connected Dominating and Absorbent Set (MSCDAS) in a disk graph, which is the counterpart of minimum CDS in unit disk graph. We propose a constant approximation algorithm when the ratio of the maximum to the minimum in transmission range is bounded. We also present two heuristics and compare the performances of the proposed schemes through simulation.