Discrete Mathematics - Topics on domination
Multicluster, mobile, multimedia radio network
Wireless Networks
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
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Enhancements for clustering stability in mobile ad hoc networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Algorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science
Association management for data dissemination over wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks
Wireless Personal Communications: An International Journal
A self-organization structure for hybrid networks
Ad Hoc Networks
A distributed algorithm for computing Connected Dominating Set in ad hoc networks
International Journal of Wireless and Mobile Computing
International Journal of Sensor Networks
Better tree - better fruits: using dominating set trees for MAX queries
Proceedings of the 5th workshop on Data management for sensor networks
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Simulation-Based Performance Comparison of VANETs Backbone Formation Algorithms
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Pervasive and Mobile Computing
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Communities on the road: fast triggering of interactive multimedia services
Multimedia Tools and Applications
Positive Influence Dominating Set in Online Social Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A new local algorithm for backbone formation in ad hoc networks
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Sleep scheduling for wireless sensor networks via network flow model
Computer Communications
IEEE Transactions on Neural Networks
Towards clustering algorithms in wireless sensor networks: a survey
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Algorithms for minimum m-connected k-dominating set problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Efficient data aggregation in multi-hop WSNs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DISC'09 Proceedings of the 23rd international conference on Distributed computing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed monitoring and aggregation in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Message-efficient CDS construction in MANETs
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Minimum CDS in multihop wireless networks with disparate communication ranges
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Fault tolerance of embryonic algorithms in mobile networks
ICES'10 Proceedings of the 9th international conference on Evolvable systems: from biology to hardware
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A Serial MIS Based CDS Constructing Algorithm for Wireless Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Aggregation convergecast scheduling in wireless sensor networks
Wireless Networks
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Energy efficient data aggregation in solar sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
The K-observer problem in computer networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Minimum latency data aggregation in the physical interference model
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Towards optimal broadcast in wireless networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Incremental construction of k-dominating sets in wireless sensor networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Towards optimal rate allocation for data aggregation in wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
A dominating set based clustering algorithm for mobile ad hoc networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
A coloring based backbone construction algorithm in wireless ad hoc network
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
International Journal of Sensor Networks
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Minimum-Cost broadcast through varying-size neighborcast
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
STAB-WIN: Self Organized, Topology Control Ability Backbone Node in Wireless Networks
Wireless Personal Communications: An International Journal
Efficient scheduling for periodic aggregation queries in multihop sensor networks
IEEE/ACM Transactions on Networking (TON)
Journal of Network and Computer Applications
A New Algorithm for Positive Influence Dominating Set in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
Time-bounded essential localization for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
| 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 cannot guarantee to generate a CDS of small size. Their message complexities can be as high as O(n2), and their time complexities may also be as large as O(n2) and O(n3). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O(n) time complexity and O(n log n) message complexity. By establishing the Ω(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.