On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
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
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
On stability analysis of virtual backbone in mobile ad hoc networks
Wireless Networks
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Energy Lesser Broadcasting Algorithms Using Adjustable Transmission Ranges in Mobile Ad Hoc Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
An energy-efficient K-hop clustering framework for wireless sensor networks
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Evaluation of the energy consumption in MANET
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
A virtual circle-based clustering algorithm with mobility prediction in large-scale MANETs
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
| Hi-index | 0.00 |
Recently, the use of a virtual backbone (connected dominating set) in various applications in mobile ad hoc networks (MANETs) has become popular. These applications include topology management, point and area coverage, and routing protocol design. In a mobile environment such as a MANET, one challenging issue in constructing a virtual backbone is to accomplish a distributed and localized solution that aims at balancing several contradicting objectives: small approximation ratio, fast convergence, and low computation cost. Many existing distributed and localized algorithms select a virtual backbone without resorting to global or geographical information. However, these algorithms incur a high computation cost in a dense network. In this paper, we propose a distributed solution based on reducing the density of the network using two mechanisms: clustering and adjustable transmission range. By using adjustable transmission range, we also achieve another objective, energy-ef.cient design, as aby-product. As an application, we show an ef.cient broadcasting where nodes (and only nodes) in a virtual backbone are used to forward the broadcast message. The virtual backbone is constructed using Wu and Li's marking process [1] and the proposed density reduction process. The application of the density reduction process to other localized algorithms is also discussed. The ef.ciency of our approach is confirmed through both analytic and simulation study.