Discrete Mathematics - Topics on domination
An approximation algorithm for clustering graphs with dominating diametral path
Information Processing Letters
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Clustering bipartite and chordal graphs: complexity, sequential and parallel algorithm
Discrete Applied Mathematics
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
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
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Clustering in mobile wireless ad hoc networks: issues and approaches
Wireless communications systems and networks
Cluster Maintenance in Mobile Ad-hoc Networks
Cluster Computing
Limiting the impact of mobility on ad hoc clustering
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
Document clustering using small world communities
Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries
A survey on clustering algorithms for wireless sensor networks
Computer Communications
A self-organization structure for hybrid networks
Ad Hoc Networks
Efficiently reconfigurable backbones for wireless sensor networks
Computer Communications
Dynamic multi-hop clustering for mobile hybrid wireless networks
Proceedings of the 2nd international conference on Ubiquitous information management and communication
On the design of secure protocols for hierarchical sensor networks
International Journal of Security and Networks
Adaptive multi-hop clustering in mobile networks
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Efficient route discovery in hybrid networks
Ad Hoc Networks
Mobility increases the connectivity of K-hop clustered wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Fair and flexible budget-based clustering
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Robust self-stabilizing clustering algorithm
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Distributed node location in clustered multi-hop wireless networks
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Distributed k-clustering algorithms for random wireless multihop networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Implementation of a cluster based routing protocol for mobile networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Efficient broadcasting in self-organizing multi-hop wireless networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
WSN clustering using IC-SVD algorithms
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Large-scale access scheduling in wireless mesh networks using social centrality
Journal of Parallel and Distributed Computing
Mobility increases the connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Clustering is commonly used in order to limit the amount of routing information stored and maintained at individual hosts. A k-clustering is a framework in which the wireless network is divided into non-overlapping sub networks, also referred to as clusters, and where every two wireless hosts in a sub network are at most k hops from each other. The algorithmic complexity of k-clustering is known to be NP-Complete for simple undirected graphs. For the special family of graphs that represent ad hoc wireless networks, modeled as unit disk graphs, we introduce a two phase distributed polynomial time and message complexity approximation solution with O(k) worst case ratio over the optimal solution. The first phase constructs a spanning tree of the network and the second phase then partitions the spanning tree into subtrees with bounded diameters.