An on-demand weighted clustering algorithm (WCA) for ad hoc networks

@article{Chatterjee2000AnOW,
  title={An on-demand weighted clustering algorithm (WCA) for ad hoc networks},
  author={Mainak Chatterjee and Sajal K. Das and Damla Turgut},
  journal={Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137)},
  year={2000},
  volume={3},
  pages={1697-1701 vol.3}
}
  • M. Chatterjee, Sajal K. Das, D. Turgut
  • Published 27 November 2000
  • Computer Science
  • Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137)
We consider a multi-cluster, multi-hop packet radio network architecture for wireless systems which can dynamically adapt itself with the changing network configurations. Due to the dynamic nature of the mobile nodes, their association and dissociation to and from clusters perturb the stability of the system, and hence a reconfiguration of the system is unavoidable. At the same time it is vital to keep the topology stable as long as possible. The clusterheads, which form a dominant set in the… 

Figures from this paper

WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
TLDR
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 Node Stability Based Multi-metric Weighted Clustering Algorithm for Mobile Ad Hoc Networks
TLDR
The proposed work on cluster formation minimizes the cost of computation and communication while choosing suitable CH with given constraints, and proposes the use of eligibility criteria for each node.
Cluster Based Topology Control in Dynamic Mobile Ad Hoc Networks
TLDR
The proposed solution provides secure CH election and incentives to encourage nodes to honestly participating in election process and shows that the proposed approach outperforms the existing clustering schemes.
A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc Networks
TLDR
A comprehensive survey of some bench-mark one-hop clustering algorithms to understand the research trends in this area and facilitate the researchers as well as practitioners in choosing a suitable clustering algorithm on the basis of their formation and maintenance overhead, before any routing scheme is adopted in the mobile ad hoc network.
Analysis and Design of Protocols for Clustering in Mobile Ad Hoc Networks
TLDR
Simulation based survey has been made to study the strengths and weaknesses of existing algorithms that motivated for the design of energy efficient clustering in MANET to show that, TRAP reduces the delay in communication by reducing the number of cluster heads in the network.
A Novel Stability Weighted Clustering Algorithm for Multi-Hop Packet Radio Virtual Cellular Network
TLDR
A new algorithm called stability weighted clustering algorithm (SWCA) is proposed, which uses the relative speed of two nodes to represent the mobility of the network and achieves better stability than the traditional WCA.
Re-Clustering Approach Using WCA in AODV and DSDV Routing Protocols in MANET
TLDR
This paper represents a Re-clustering scheme in AODV and DSDV Routing Protocols in Mobile Ad-hoc Network and takes care of the stability of the network and therefore, decreases the computation and communication costs linked with it.
Topology control by transmission range adjustment protocol for clustered mobile ad hoc networks
TLDR
A distributed topology adaptive clustering algorithm is designed that requires local information by the nodes for the formation of clusters that achieves faster packet delivery and fairly distributed among the nodes to obtain a longer network lifetime.
EFFICIENCY ENHANCEMENT OF CLUSTER STABILITY AND ENERGY CONSUMPTION IN THE CLUSTERING ALGORITHMS
TLDR
The main focal point of the work is to enhance Weighted Clustering Algorithm (WCA) and other similar algorithms like Weighted based hierarchical clustering algorithm, An On-Demand Weighted Algorithm and many node degree based formula given in literature.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
Distributed clustering for ad hoc networks
  • S. Basagni
  • Computer Science
    Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)
  • 1999
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
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
A distributed control scheme in multi-hop packet radio networks for voice/data traffic support
  • C. Lin, M. Gerla
  • Computer Science, Business
    Proceedings IEEE International Conference on Communications ICC '95
  • 1995
TLDR
A self-organizing, multihop packet radio network architecture for multimedia that eliminates the overhead of a global clock or time synchronization mechanism and provides a good spatial reuse of the bandwidth.
A design concept for reliable mobile radio networks with frequency hopping signaling
TLDR
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.
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
TLDR
Simulation results show that the location search scheme generates less overhead than the schemes based on flooding, and results confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol.
A new approach to the design and analysis of peer‐to‐peer mobile networks
TLDR
This paper introduces a new model and methodological approach for dealing with the probabilistic nature of mobile networks based on the theory of random graphs, and shows that it is possible to construct a randomized distributed algorithm which provides connectivity with high probability, requiring exponentially fewer connections than the number of connections needed for an algorithm with a worst case deterministic guarantee.
A distributed architecture for multimedia in dynamic wireless networks
TLDR
The paper presents a self-organizing wireless mobile radio networking multimedia support that provides an instant infrastructure for real-time traffic transmission and a stable and loop-free routing protocol is implemented.
The Design and Simulation of a Mobile Radio Network with Distributed Control
TLDR
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.
Tsai,“Multicluster, Mobile, MultimediaRadioNetwork”, WirelessNetworks,1(3)1995,pp.255-265
  • 1995
Multicluster, Mobile, Multim edia Radio Network
  • Wireless Networks,
  • 1995
...
...