Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
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
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
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)
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
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
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
An efficient topology configuration scheme for wireless sensor networks
EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Performance analysis of MANET clustering algorithm in group mobility model
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
A PTAS for the minimum dominating set problem in unit disk graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Better learning of supervised neural networks based on functional graph: an experimental approach
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Virtual backbone has been used extensively in various aspects for wireless ad hoc or sensor networks recently. We propose an approximation solution to construct a virtual backbone based on a more generalized and realistic model of polynomial bounded growth. A localized distributed algorithm of MCDS_GBG for computing a Minimum Connected Dominating Sets as backbone in the growth-bounded graph is presented. This approach consists of three stages: firstly construct an MIS by network decomposition scheme; secondly compute a minimum dominating set in 2-separated collection with r transmission range and finally use Marking process and ruling k to reduce the virtual backbone with 3r transmission range. The computed Connected Dominating Set guarantees a constant stretch factor on the length of a shortest path and induces a subgraph of constant degree while the nodes only require direct neighborhood information. The efficiency of our approach is confirmed through both theoretical analysis and comparison study.