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
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Power Save Mechanisms for Multi-Hop Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Towards optimal sleep scheduling in sensor networks for rare-event detection
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
X-MAC: a short preamble MAC protocol for duty-cycled wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
IP is dead, long live IP for wireless sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
IEEE/ACM Transactions on Networking (TON)
Optimal wake-up scheduling of data gathering trees for wireless sensor networks
Journal of Parallel and Distributed Computing
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communication. In this paper, we present a new scheduling method called virtual backbone scheduling (VBS). VBS employs heterogeneous scheduling, where backbone nodes work with duty-cycling to preserve network connectivity, and nonbackbone nodes turn off radios to save energy. We formulate a maximum lifetime backbone scheduling (MLBS) problem to maximize the network lifetime using this scheduling model. Because the MLBS problem is NP-hard, two approximation solutions based on the schedule transition graph (STG) and virtual scheduling graph (VSG) are proposed. We also present an iterative local replacement (ILR) scheme as an distributed implementation of VBS. The path stretch problem is analyzed in order to explore the impact of VBS on the network structure. We show, through simulations, that VBS significantly prolongs the network lifetime under extensive conditions.