A novel weight based clustering algorithm for routing in MANET

被引:19
|
作者
Pathak, Sunil [1 ]
Jain, Sonal [1 ]
机构
[1] JK Lakshmipat Univ, Dept Comp Engn, Jaipur, Rajasthan, India
关键词
Clustering in MANET; Routing overhead; Clustering scheme; AD HOC NETWORKS; WIRELESS SENSOR NETWORKS; MOBILE; PROTOCOLS;
D O I
10.1007/s11276-015-1124-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cluster based routing in Mobile AdHoc Networks are considered one of the convenient method of routing. Existence of Cluster Head (CH) in a group of nodes for data forwarding improves the performance of routing in terms of routing overhead and power consumption. However, due to the movement of CH and frequent change in cluster members, cluster reformation is required and increases cluster formation overhead. The stability of the cluster highly dependent of stability of the CH and hence during CH selection special care should be taken so that the cluster head survives for longer time. In this paper a method of cluster formation is proposed which will take into account two most vital factor node degree and bandwidth requirement for construction of the cluster and selection of the cluster head. Further, when two clusters come closer to each other they merge and form a single cluster. In such case out of two CHs one has to withdraw the role and other will take over. A new mechanism of merging two clusters is also proposed in the paper. We call this method as an Improved Cluster Maintenance Scheme and primarily focused on minimizing CH changing process in order to enhance the performance. The stated method makes cluster more stable, and minimizes packet loss. The proposed algorithm is simulated in ns-2 and compared with Least Cluster head Change (LCC) and CBRP. Our algorithm shows better behavior in terms of number of clusterhead changes or number of cluster member changes.
引用
收藏
页码:2695 / 2704
页数:10
相关论文
共 50 条
  • [41] A MANET routing algorithm based on difference degree and stability of nodes
    Han, Yanyan
    Li, Deshi
    Nie, Jugen
    Sensors and Transducers, 2013, 22 (SPEC.ISSUE): : 22 - 28
  • [42] A Clustering Routing Algorithm Based on Improved Genetic Algorithm
    Jiao W.
    Ding F.
    Shi J.
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2023, 46 (06): : 83 - 88
  • [43] Trust Value Updation Algorithm for Multicast Routing Algorithm for Cluster Based MANET
    Kulkarni, Sapna B.
    Yuvaraju, B. N.
    2017 2ND IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, SIGNAL PROCESSING AND NETWORKING (WISPNET), 2017, : 1246 - 1249
  • [44] Routing Algorithm for Energy Conservation in MANET
    Gupta, Subodh Kumar
    Govil, Kapil
    Agarwal, Alok
    2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS (CICN), 2015, : 165 - 167
  • [45] Trust-based light weight authentication routing protocol for MANET
    Rajkumar, Banoth
    Narsimha, Gugulothu
    International Journal of Mobile Network Design and Innovation, 2015, 6 (01) : 31 - 39
  • [46] Genetic algorithm simulated annealing based clustering strategy in MANET
    Li, X
    ADVANCES IN NATURAL COMPUTATION, PT 1, PROCEEDINGS, 2005, 3610 : 1121 - 1131
  • [47] Clustering algorithm and analysis based on objective trust modeling in MANET
    Zhang, Qiang
    Hu, Guang-Ming
    Chen, Hai-Tao
    Gong, Zheng-Hu
    Tongxin Xuebao/Journal on Communication, 2009, 30 (02): : 12 - 21
  • [48] Weightage based Secure Energy Efficient Clustering Algorithm in MANET
    Kaur, Kanwaljeet
    Singh, Jaspinder
    Himani
    2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2015, : 1006 - 1012
  • [49] STACRP: a secure trusted auction oriented clustering based routing protocol for MANET
    Pushpita Chatterjee
    Indranil Sengupta
    S. K. Ghosh
    Cluster Computing, 2012, 15 : 303 - 320
  • [50] An Improved Weighted Clustering Algorithm in MANET
    WANG Jin XU Li ZHENG Bao-yu Deptartement of Information Engineering
    The Journal of China Universities of Posts and Telecommunications, 2004, (04) : 20 - 25