The minimum weight dominating set problem for permutation graphs is in NC
Journal of Parallel and Distributed Computing
On weakly connected domination in graphs
Discrete Mathematics
Multicluster, mobile, multimedia radio network
Wireless Networks
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
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Journal of Parallel and Distributed Computing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A Two-Zone Hybrid Routing Protocol for Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
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
The capacity of wireless networks
IEEE Transactions on Information Theory
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
The Design and Simulation of a Mobile Radio Network with Distributed Control
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Neural Networks
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
The Journal of Supercomputing
Multi-document summarization via the minimum dominating set
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Deterministic dominating set construction in networks with bounded degree
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks
Computers and Electrical Engineering
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
Journal of Parallel and Distributed Computing
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Energy-efficient backbone formation in wireless sensor networks
Computers and Electrical Engineering
Constructing a MANET Based on Clusters
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports self-configuration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the most important issues in wireless ad hoc networks. The weakly connected dominating set (WCDS) is very suitable for cluster formation. As finding the minimum WCDS in an arbitrary graph is a NP-Hard problem, we propose an area-based distributed algorithm for WCDS construction in wireless ad hoc networks with time and message complexity O(n). This Area algorithm is divided into three phases: area partition, WCDS construction for each area and adjustment along the area borders. We confirm the effectiveness of our algorithm through analysis and comprehensive simulation study. The number of nodes in the WCDS constructed by this Area algorithm is up to around 50% less than that constructed by the previous well-known algorithm.