An Improved Cluster Head Election Algorithm Using Energy or Weight of Path in MANET
Abstract
Mobile ad hoc network is one of the well-known technologies among wireless networks. Due to mobility and dynamic topology the network suffers from different security and performances issue. Therefore, the clustering algorithms are implemented for improving the scalability and performance of the routing algorithms. The presented work demonstrates a MANET clustering algorithm and their design strategy. The overview of the proposed routing techniques is discussed in this paper.
Cite this Article
Kuldeep Tiwari, Priya Pathak. An Improved Cluster Head Election Algorithm Using Energy or Weight of Path in MANET. Journal of Mobile Computing, Communications & Mobile Networks. 2016; 3(1): 10–16p.
Keywords
Full Text:
PDFReferences
Mohamed A, Abdelfettah B. A node quality based clustering algorithm in wireless mobile AdHoc networks. 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014).
Mainak C, Sajal KD, Damla T, et al. WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks. Cluster Computing. 2002; 5: 193–204p.
Fabian GN, Julio SG, Ivan S, et al. Connectivity Based k-Hop Clustering in Wireless Networks. Telecommunication Systems. 2003; 22(1–4); 205–220p.
Ratish A, Mahesh M. Survey of clustering algorithms for MANET. International Journal on Computer Science and Engineering. 2009; 1(2): 98–104p.
Donald BM, Znati TF. A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks. IEEE JSAC. Aug 1999; 17: 1466–87p.
Refbacks
- There are currently no refbacks.
This site has been shifted to https://stmcomputers.stmjournals.com/