K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Energy-aware data-centric routing in microsensor networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Regional gossip routing for wireless ad hoc networks
Mobile Networks and Applications
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
IEEE Transactions on Mobile Computing
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Maintaining a quality of service routing tree for mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Energy efficient distributed connected dominating sets construction in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Load mitigation in cellular data networks by peer data sharing over WLAN channels
Computer Networks: The International Journal of Computer and Telecommunications Networking - Wireless IP through integration of wireless LAN and cellular networks
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Fast distributed dominating set based routing in large scale MANETs
Computer Communications
Efficient virtual-backbone routing in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Sensor Networks
An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks
International Journal of Mobile Network Design and Innovation
An enhanced approach to determine connected dominating sets for routing in mobile ad hoc networks
International Journal of Mobile Communications
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Hierarchical routing in ad hoc networks using k-dominating sets
ACM SIGMOBILE Mobile Computing and Communications Review
Adjusted probabilistic route discovery in mobile ad hoc networks
Computers and Electrical Engineering
Speed adaptive probabilistic flooding in cooperative emergency warning
Proceedings of the 4th Annual International Conference on Wireless Internet
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Message ferries as generalized dominating sets in intermittently connected mobile networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Backbone construction for heterogeneous wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Analysis of probabilistic flooding: how do we choose the right coin?
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
VBS: maximum lifetime sleep scheduling for wireless sensor networks using virtual backbones
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
IEEE Transactions on Communications
Pervasive and Mobile Computing
Energy efficient data aggregation in solar sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
A maximal independent set based giant component formation in random unit-disk graphs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
A secure dominating set based routing and key management scheme in mobile ad hoc network
WSEAS TRANSACTIONS on COMMUNICATIONS
A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
About the self-stabilization of a virtual topology for self-organization in ad hoc networks
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Probabilistic flooding in stochastic networks: Analysis of global information outreach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Aware broadcasting method for wireless sensor network
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
On the construction of k-connected m-dominating sets in wireless networks
Journal of Combinatorial Optimization
Journal of Network and Computer Applications
An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Loop-Based topology maintenance in wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Distributed clustering algorithm for finding virtual backbone in ad hoc networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
The Journal of Supercomputing
Perfect contextual information privacy in WSNs undercolluding eavesdroppers
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
CorLayer: a transparent link correlation layer for energy efficient broadcast
Proceedings of the 19th annual international conference on Mobile computing & networking
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 |
Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDS of small size. Their message complexities can be as high as $O\left(n^{2}\right) $, and their time complexities may also be as large as $O\left(n^{2}\right) $ and $O\left(n^{3}\right) $. We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, $O\left(n\right) $ time complexity and $O\left(n\log n\right) $ message complexity. By establishing the $\Omega\left(n\log n\right) $ lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.