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
Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Topology management in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Intrusion Detection Using Mobile Agents in Wireless Ad Hoc Networks
KMN '02 Proceedings of the IEEE Workshop on Knowledge Media Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Connectivity-Based k-Hop Clustering in Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
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
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A Dynamic Trust Model for Mobile Ad Hoc Networks
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
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
A Distributed Message-passing Approach for Clustering Cognitive Radio Networks
Wireless Personal Communications: An International Journal
Hybrid metaheuristic algorithms for minimum weight dominating set
Applied Soft Computing
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 |
Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless ad hoc or sensor networks recently. Previous methods are mostly designed to minimize the size of the backbone. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce a backbone with large cost. Then, an efficient distributed method to construct a weighted backbone with low cost is proposed. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes' costs are smooth (i.e., the maximum ratio of costs of adjacent nodes is bounded) or the network maximum node degree is bounded. We also show that, with a small modification, the backbone is efficient for unicast: The total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than three (or four) times the least cost (or hop) path in the original communication graph. Our theoretical results are corroborated by our simulation studies. Finally, we discuss several possible ad hoc network applications of our proposed backbone formation algorithms.