Corpus ID: 64518682

Optimized Managed Mobile Adhoc Networks Using Intermittent Clusters

@article{Riyazuddin2017OptimizedMM,
  title={Optimized Managed Mobile Adhoc Networks Using Intermittent Clusters},
  author={Md. Riyazuddin and K. Babu},
  journal={International Journal of Research},
  year={2017},
  volume={4},
  pages={1984-1989}
}
We consider the problem of appropriate cluster head selection in wireless ad-hoc networks where it is necessary to provide robustness in the face of topological changes caused by node motion, node failure and node insertion/removal. The main contribution of our work is a new strategy for clustering a wireless AD HOC network and improvements in SWCA. Prior approaches didn’t implement any security aspects leading to a open manet architecture which is not feasible mission critical applications. So… Expand

References

SHOWING 1-8 OF 8 REFERENCES
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. Expand
A Distributed Weighted Cluster Based Routing Protocol for MANETs
TLDR
This paper proposes and implements a distributed weighted clustering algorithm for MANETs based on combined weight metric that takes into account several system parameters like the node degree, transmission range, energy and mobility of the nodes. Expand
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. Expand
Stable and Flexible Weight based Clustering Algorithm in Mobile Ad hoc Networks
Ad hoc networks are wireless, infrastructure less, multi-hop, dynamic network established by a collection of mobile nodes which provides significant features to the modern communication technologiesExpand
Quality of Service in Wireless Networks using Weighted Clustering Algorithm
In today’s Internet, inter-domain route control remains indefinable; however, such control could improve the performance, dependability, and usefulness of the network for end users and ISPs alike.Expand
A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks
TLDR
This work proposes a fully distributed clustering algorithm for mobile ad hoc networks in which the nodes can move at higher speeds and shows that optimal cluster head characteristics: connectivity, energy and mobility, lead to a stable topology in terms of reconfiguration frequency. Expand
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) intoExpand
The cluster density of a distributed clustering algorithm in ad hoc networks
  • C. Bettstetter
  • Computer Science
  • 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
  • 2004
TLDR
It is shown that the cluster density, i.e., the expected number of cluster- heads per unit area, is /spl rho//sub c/= /spl Rho//spl divide/(1+/spl mu//spl Divide/2), where /spl mu/ denotes the expectedNumber of neighbors of a node. Expand