On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Self-Stabilizing Algorithm for Low Weight Connected Dominating Set
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
Hi-index | 0.00 |
Since there is no fixed infrastructure or centralized management in Wireless Sensors Networks (WSNs), a connected Dominating Set (CDS) has been proposed as the virtual backbone. The CDS play a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a Minimum CDS (MCDS). 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 power termination, message loss, memory corruption, and topology change. There are few publications dealing with Self-Stabilizing MCDS (SSMCDS) where all of them, the network has been modeled in Unit Disk Graph (UDG), in which each node has the same transmission range. In real world this kind of networks are not necessarily contain nodes with similar transmission range. As a new approach, network has been modeled by Disk Graph with Bidirectional links (DGB), in which nodes have different transmission range. In this paper has presented a new distributed approximation algorithm for SS-MCDS problem in DGB (called SS-MCDS-DGB) with constant approximation ratio and O(n2) time complexity using unfair central daemon.