Distributed clustering for ad hoc networks

  title={Distributed clustering for ad hoc networks},
  author={Stefano Basagni},
  journal={Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)},
  • S. Basagni
  • Published 23 June 1999
  • Computer Science
  • Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)
A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network: (ad hoc network) into clusters, this giving the network a hierarchical organization. Nodes are grouped by following a new weight-based criterion that allows the choice of the nodes that coordinate the clustering process based on node mobility-rebated parameters. The DCA is suitable for clustering "quasistatic" ad hoc networks… 

Figures from this paper

A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
Results show that the proposed distributed clustering algorithm performs better than the existing algorithms and is also tunable to different types of ad hoc networks.
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
An on-demand distributed clustering algorithm for multi-hop packet radio networks that takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes, and is aimed to reduce the computation and communication costs.
A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem
The Distributed Mobility-Adaptive Clustering due to Basagni partitions the nodes of a mobile ad hoc network into clusters, thus giving the network a hierarchical organization, and it is shown that the initialization problem can be solved in a multi-hop ad hoc wireless network of n stations.
A heterogeneity based clustering heuristic for mobile ad hoc networks
This paper approaches the problem of finding an optimal partition that explicitly takes into account the heterogeneity of the network, as an integer linear programming (ILP) problem and develops a new heuristic that approximates the ILP solution that is used in the clustering algorithm.
Clustering in Mobile Ad Hoc Networks With Some Nodes Having the Same Weight
The Distributed Mobility Adaptative Clustering (DMAC) due to Basagni parti- tions the nodes of a mobile ad hoc network into clusters, thus giving the network a hierarchical organization. This
Time and message complexities of the generalized distributed mobility-adaptive clustering (GDMAC) algorithm in wireless multihop networks
The results show how many time steps and signaling messages are typically needed after a single topology change to re-achieve a stable and valid cluster structure and show that tuning the density of clusterheads and employing a hysteresis parameter for cluster changes can significantly improve the performance.
Clustering algorithms in ad hoc networks
A new clustering algorithm is proposed, along with a reclustering algorithm to deal with topology changes caused by movement of mobile terminals, and simulations show that the proposed clustering algorithms results in fewer clusters than conventional algorithms, except for dense graphs.
A new method has been proposed for clusterhead selection using geometric mean by considering multiple factors and the simulation results prove that the proposed method results stable clusters with lower clusterhead change rate and re-affiliation rate than other existing algorithms.
A distributed clustering algorithm for large-scale dynamic networks
An algorithm that builds and maintains clusters over a network subject to mobility and is mobility-adaptive: after a series of topological changes, the algorithm converges to a clustering, which computes the largest possible number of clusters.
A Distributed Clustering Algorithm for Dynamic Networks
This algorithm is designed as a decentralized control algorithm for large scale networks and is mobility-adaptive: after a series of topological changes, the algorithm converges to a clustering, which computes the largest possible number of clusters.


Adaptive Clustering for Mobile Wireless Networks
  • C. Lin, M. Gerla
  • Computer Science, Business
    IEEE J. Sel. Areas Commun.
  • 1997
This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support that provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
Multicluster, mobile, multimedia radio network
A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time
The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm
A self-starting, distributed algorithm is proposed and developed that establishes and maintains a reliable structure that is especially suited to the needs of the HF Intra-Task Force (ITF) communication network, which is discussed in the paper.
Multimedia transport in multihop dynamic packet radio networks
  • C. Lin, M. Gerla
  • Computer Science, Business
    Proceedings of International Conference on Network Protocols
  • 1995
A distributed architecture which relies on code division access scheme for multimedia transport in a wireless mobile radio network without a fixed infrastructure that has the capability of rapid deployment and dynamic reconfiguration and can provide spatial reuse of the bandwidth due to node clustering.
A design concept for reliable mobile radio networks with frequency hopping signaling
This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.
The Design and Simulation of a Mobile Radio Network with Distributed Control
It is illustrated how fully distributed control methods can be combined with hierarchical control to create a network that is robust with respect to both node loss and connectivity changes.
Design concepts for a mobile-user radio network
Broadcast in peer-to-peer networks
  • Proceedings of the Second IASTED International Conference European Parallel and Distributed Systems
  • 1998
The design and simulation of a mobile radio network with distributed ontrol
  • IEEE Journal on Sele ted Areas
  • 1984