Discrete Mathematics - Topics on domination
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
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Topology management in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Information Processing Letters
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A Distributed Formation of a Virtual Backbone in MANETs Using Adjustable Transmission Ranges
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
IEEE Transactions on Computers
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Bounded-distance multi-coverage backbones in wireless sensor networks
Proceedings of the 2007 ACM symposium on Applied computing
Techniques for maintaining connectivity in wireless ad-hoc networks under energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
A survey on clustering algorithms for wireless sensor networks
Computer Communications
Energy conservation in wireless sensor networks and connectivity of graphs
Theoretical Computer Science
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
Minimization of the Redundant Coverage for Dense Wireless Sensor Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Constructing special k-dominating sets using variations on the greedy algorithm
Pervasive and Mobile Computing
Pervasive and Mobile Computing
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
On the construction of 2-connected virtual backbone in wireless networks
IEEE Transactions on Wireless Communications
Information Sciences: an International Journal
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
An energy-efficient K-hop clustering framework for wireless sensor networks
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Algorithms for minimum m-connected k-dominating set problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Minimization of the redundant sensor nodes in dense wireless sensor networks
ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
Efficient multi-hop broadcasting in wireless networks using k-shortest path pruning
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A new pruning method for efficient broadcasting in ad hoc networks
International Journal of Mobile Network Design and Innovation
Incremental construction of k-dominating sets in wireless sensor networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Constructing k-connected k-cover set in wireless sensor networks based on self-pruning
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
On the construction of k-connected m-dominating sets in wireless networks
Journal of Combinatorial Optimization
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. We propose to construct a k-connected k-dominating set (k-CDS) as a backbone to balance efficiency and fault tolerance. Three localized k-CDS construction protocols are proposed. The first protocol randomly selects virtual backbone nodes with a given probability p_k, where p_k depends on network condition and the value of k. The second protocol is a deterministic approach. It extends Wu and Dai's coverage condition, which is originally designed for 1-CDS construction, to ensure the formation of a k-CDS. The last protocol is a hybrid of probabilistic and deterministic approaches. It provides a generic framework that can convert many existing CDS algorithms into k-CDS algorithms. These protocols are evaluated via a simulation study.