Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Authors:
Yuanzhu Peter Chen;Arthur L. Liestman
Affiliations:
Simon Fraser University, British Columbia, Canada;Simon Fraser University, British Columbia, Canada
Venue:
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Year:
2002

Citing 11
Cited 63

On weakly connected domination in graphs

Discrete Mathematics
A cluster-based approach for routing in dynamic networks

ACM SIGCOMM Computer Communication Review
Multicluster, mobile, multimedia radio network

Wireless Networks
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A new approach to the design and analysis of peer-to-peer mobile networks

Wireless Networks
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Routing Through Networks with Hierarchical Topology Aggregation

ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Distributed Clustering for Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Approximation Algorithms for Connected Dominating Sets

Algorithmica

K-clustering in wireless ad hoc networks

Proceedings of the second ACM international workshop on Principles of mobile computing
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
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Efficient gathering of correlated data in sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

Journal of Computer and System Sciences
Connected sensor cover: self-organization of sensor networks for efficient query execution

IEEE/ACM Transactions on Networking (TON)
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

Journal of Global Optimization
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

IEEE Transactions on Parallel and Distributed Systems
An efficient clustering scheme for large and dense mobile ad hoc networks (MANETs)

Computer Communications
Clustering wireless ad hoc networks with weakly connected dominating set

Journal of Parallel and Distributed Computing
Bounded-distance multi-coverage backbones in wireless sensor networks

Proceedings of the 2007 ACM symposium on Applied computing
Efficient gathering of correlated data in sensor networks

ACM Transactions on Sensor Networks (TOSN)
An energy efficient and self-healing 3-dimensional sensor cover

International Journal of Ad Hoc and Ubiquitous Computing
An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks

International Journal of Mobile Network Design and Innovation
Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks

Mobile Networks and Applications
CASAN: Clustering algorithm for security in ad hoc networks

Computer Communications
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
EQOWSN: Evolutionary-based query optimization over self-organized wireless sensor networks

Expert Systems with Applications: An International Journal
Hierarchical routing in ad hoc networks using k-dominating sets

ACM SIGMOBILE Mobile Computing and Communications Review
Variable radii connected sensor cover in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Mobility-aware clustering algorithms with interference constraints in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
PTAS for Minimum Connected Dominating Set in Unit Ball Graph

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Construction of strongly connected dominating sets in asymmetric multihop wireless networks

Theoretical Computer Science
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Information Processing Letters
A Gateway Access-Point Selection Problem and Traffic Balancing in Wireless Mesh Networks

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks

The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Bounds relating the weakly connected domination number to the total domination number and the matching number

Discrete Applied Mathematics
Maintaining weakly-connected dominating sets for clustering ad hoc networks

Ad Hoc Networks
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks

Journal of Global Optimization
A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks

IEEE Transactions on Neural Networks
Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones

Information Sciences: an International Journal
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

Computer Communications
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
An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

Computer Networks: The International Journal of Computer and Telecommunications Networking
Randomised algorithms for finding small weakly-connected dominating sets of regular graphs

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An energy efficient connected coverage protocol in wireless sensor networks

APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
A scalable and adaptive clustering scheme for MANETs

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach

Journal of Network and Computer Applications
On computing compression trees for data collection in wireless sensor networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Multi-document summarization via the minimum dominating set

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks

Journal of Parallel and Distributed Computing
Pareto-based evolutionary computational approach for wireless sensor placement

Engineering Applications of Artificial Intelligence
Deterministic dominating set construction in networks with bounded degree

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Design and analysis of mobility-aware clustering algorithms for wireless mesh networks

IEEE/ACM Transactions on Networking (TON)
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks

Computers and Electrical Engineering
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Wireless Personal Communications: An International Journal
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks

Journal of Parallel and Distributed Computing
Range adjustment for broadcast protocols with a realistic radio transceiver energy model in short-range wireless networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
A dominating set based clustering algorithm for mobile ad hoc networks

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
A clustering-based data replication algorithm in mobile ad hoc networks for improving data availability

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Constructing weakly connected dominating set for secure clustering in distributed sensor network

Journal of Combinatorial Optimization
A distributed backbone formation algorithm for mobile ad hoc networks

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A new weight based self-organizing approach to clustering in mobile ad hoc networks

Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
An efficient reliable one-hop broadcast in mobile ad hoc networks

Ad Hoc Networks
Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Computer Communications
Constructing a MANET Based on Clusters

Wireless Personal Communications: An International Journal
Mathematical model for LTE system dimensioning

Journal of Mobile Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a series of approximation algorithms for finding a smallweakly-connected dominating set (WCDS) in a given graph to be usedin clustering mobile ad hoc networks. The structure of a graph canbe simplified using WCDS's and made more succinct for routing in adhoc networks. The theoretical performance ratio of these algorithmsis O(ln Δ) compared to the minimum size WCDS, whereΔ is the maximum degree of the input graph. The first twoalgorithms are based on the centralized approximation algorithms ofGuha and Khuller cite guha-khuller-1998 for finding small connecteddominating sets (CDS's). The main contribution of this work is acompletely distributed algorithm for finding small WCDS's and theperformance of this algorithm is shown to be very close to that ofthe centralized approach. Comparisons between our work and someprevious work (CDS-based) are also given in terms of the size ofresultant dominating sets and graph connectivity degradation.