International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 8, No. 4, 8 Apr. 2016
Cover page and Table of Contents: PDF (size: 475KB)
Adaptive Weighted Clustering Algorithm for Mobile Ad-hoc Networks
Full Text (PDF, 475KB), PP.30-36
Views: 0 Downloads: 0
Author(s)
Adwan Yasin
1,*
Salah Jabareen
2
Index Terms
MANET, Clustering, Connectivity, Power, Node Capabilities, Transmission range
Abstract
In this paper we present a new algorithm for clustering MANET by considering several parameters. This is a new adaptive load balancing technique for clustering out Mobile Ad-hoc Networks (MANET). MANET is special kind of wireless networks where no central management exits and the nodes in the network cooperatively manage itself and maintains connectivity. The algorithm takes into account the local capabilities of each node, the remaining battery power, degree of connectivity and finally the power consumption based on the average distance between nodes and candidate cluster head. The proposed algorithm efficiently decreases the overhead in the network that enhances the overall MANET performance. Reducing the maintenance time of broken routes makes the network more stable, reliable. Saving the power of the nodes also guarantee consistent and reliable network.
Cite This Paper
Adwan Yasin, Salah Jabareen, "Adaptive Weighted Clustering Algorithm for Mobile Ad-hoc Networks", International Journal of Computer Network and Information Security(IJCNIS), Vol.8, No.4, pp.30-36, 2016. DOI:10.5815/ijcnis.2016.04.04
Reference
[1]Charles E.Perkins, “Ad hoc Networking”, Addison Wesley, 2001.J.
[2]Subir Kumar Sarkar, T.G. Basavaraju, C. Puttamadappa “Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications”, Auerbach Publications – Taylor & Francis Group, 2008.
[3]C. E. Perkins, E. M. Belding-Royer, and S. Das. Ad hoc OnDemand Distance Vector (AODV) Routing. RFC 3561, July 2003.
[4]Johnson, David B., David A. Maltz, and Josh Broch. "DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks." Ad hoc networking 5 (2001): 139-172.
[5]V. Park and S. Corson, Temporally Ordered Routing Algorithm (TORA) Version 1, Functional specification IETF Internet draft (1998).
[6]Perkins, Charles E., and Pravin Bhagwat. "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers." ACM SIGCOMM Computer Communication Review. Vol. 24. No. 4. ACM, 1994.
[7]Jacquet, Philippe, et al. "Optimized link state routing protocol for ad hoc networks." Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International. IEEE, 2001.
[8]Jha, Rakesh Kumar, and Pooja Kharga. "A Comparative Performance Analysis of Routing Protocols in MANET using NS3 Simulator." (2015). I. J. Computer Network and Information Security, 2015, 4, 62-68.
[9]M. Gerla and J. T. Tsai, “Multiuser, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, pp. 255–65, Oct. 1995.
[10]I. Er and W. Seah. “Mobility-based d-hop clustering algorithm for mobile ad hoc networks”. IEEE Wireless Communications and Networking Conference Vol. 4. pp. 2359-2364, 2004.
[11]A. D. Amis and R. Prakash, “Load-Balancing Clusters in Wireless Ad Hoc Networks,” in proceedings of 3rd IEEE ASSET’00, pp. 25–32 Mar. 2000.
[12]J. Wu et al., “On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” J. Commun. And Networks, vol. 4, no. 1, pp. 59–70 Mar. 2002.
[13]F. Li, S. Zhang, X. Wang, X. Xue, H. Shen, “Vote- Based Clustering Algorithm in Mobile Ad Hoc Networks”, In proceedings of International Conference on Networking Technologies, 2004.
[14]Zhang Jianwu, Zhang Lu “Research on Distance Measurement Based on RSSI of ZigBee” CCCM IEEE 2009.
[15]Neeraj Choudhary, Ajay K Sharma “Performance Evaluation of LR-WPAN for different Path-Loss M odels” International Journal of Computer Applications (0975 – 8887) Volume 7– No.10, October 2010.
[16]M. Joa-Ng and I.-T. Lu, “A Peer-to-Peer Zone-based ’ko-level Link State Routing for Mobile Ad Hoc Networks”, IEEE Journal on Selected Areas in Communications, Aug. 1999, pp. 1415-1425.
[17]A.D. Amis, R. Prakash, T.H.P Vuong, D.T. Huynh. "Max-Min DCluster Formation in Wireless Ad Hoc Networks". In proceedings of IEEE Conference on Computer Communications (INFOCOM) Vol. 1.pp. 32-41, 2000.
[18]G. Chen, F. Nocetti, J. Gonzalez, and I. Stojmenovic, “Connectivity based k-hop clustering in wireless networks”. Proceedings of the 35th Annual Hawaii International Conference on System Sciences. Vol. 7, pp. 188.3, 2002.
[19]T. Ohta, S. Inoue, and Y. Kakuda, “An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks,” in proceedings of 6th ISADS’03, Apr. 2003.
[20]P. Basu, N. Khan, and T. D. C. Little, “A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks,” in proceedings of IEEE ICDCSW’ 01, pp. 413–18, Apr. 2001.
[21]A. B. MaDonald and T. F. Znati, “A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks,” IEEE JSAC, vol. 17, pp. 1466–87, Aug. 1999.
[22]J.-H. Ryu, S. Song, and D.-H. Cho, “New Clustering Schemes for Energy Conservation in Two-Tiered Mobile Ad-Hoc Networks,” in proceedings of IEEE ICC’01, vo1. 3, pp. 862–66, June 2001.