An energy aware competition based clustering for cluster head selection in wireless sensor network with mobility

被引:16
作者
Narendran, M. [1 ]
Prakasam, Periyasamy [2 ]
机构
[1] Anna Univ, Chennai, Tamil Nadu, India
[2] SNS Coll Engn, Dept Elect & Commun Engn, Coimbatore, Tamil Nadu, India
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2019年 / 22卷 / Suppl 5期
关键词
Wireless sensor network (WSN); Mobility; Cluster heads (CH) election; Random competition based clustering (RCC); Lower ID (LID); EFFICIENT; PROTOCOL;
D O I
10.1007/s10586-017-1286-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor networks (WSNs) are resource constrained networks wherein every sensor node in the network possesses restricted amount of resources. For saving resources as well as energy, data should be collated for reducing quantity of traffic in the network. Data aggregation is to be carried out with the assistance of a clustering strategy. Cluster-based routing in WSNs is an effective solution for enhancing energy efficacy of nodes as well as resourceful data aggregation. Several studies on network life time as well as data aggregation are suggested with low energy adaptive clustering hierarchy (LEACH) scheme which permits the part of the cluster head (CH) to be rotated amongst the sensor nodes and focuses on the distribution of energy use throughout all nodes. Life time of WSNs are impacted by the choosing of CHs; this is due to the fact that CH consumed more energy than other member nodes. In the current work, an energy effective CH election in mobile WSNs is suggested, analysed as well as evaluated based on residual energy as well as randomized election of nodes that were not designated as CHs in earlier rounds. The study proposes random competition based clustering (RCC) strategy which is more stable than the traditional clustering strategies like Lower ID (LID). IWO or Invasive Weed Optimization is a metaheuristic that has been developed recently to mimic the behaviour of the weeds. But the spatial dispersal operators and reproduction in the IWO that was originally used can make the seeds stay around the weed that is considered best that can result in convergence prematurely. In order to overcome this, EIWO or Enhanced IWO algorithm has been developed using TS or Tabu Search. Furthermore, the suggested method reveals considerable improvement in contrast to IWO LID as well as IWO-TS LID with regard to average end to end delays of sensor nodes, average packet delivery ratio of sensor nodes as well as improved network life time at the time of transmitting information.
引用
收藏
页码:11019 / 11028
页数:10
相关论文
共 27 条
  • [1] Mobile Sink-Based Adaptive Immune Energy-Efficient Clustering Protocol for Improving the Lifetime and Stability Period of Wireless Sensor Networks
    Abo-Zahhad, Mohammed
    Ahmed, Sabah M.
    Sabor, Nabil
    Sasaki, Shigenobu
    [J]. IEEE SENSORS JOURNAL, 2015, 15 (08) : 4576 - 4586
  • [2] Ahmed A, 2013, 2013 INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS AND TECHNOLOGIES (ICOSST), P120, DOI 10.1109/ICOSST.2013.6720617
  • [3] Al-Obaidi A.T.S., 2014, EDITORIAL PREFACE, V3, P7
  • [4] Al-Qadami N, 2015, INT CONF ADV COMMUN, P121, DOI 10.1109/ICACT.2015.7224770
  • [5] Energy Efficient and Safe Weighted Clustering Algorithm for Mobile Wireless Sensor Networks
    Amine, Dahane
    Nassreddine, Berrached
    Bouabdellah, Kechar
    [J]. 9TH INTERNATIONAL CONFERENCE ON FUTURE NETWORKS AND COMMUNICATIONS (FNC'14) / THE 11TH INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS AND PERVASIVE COMPUTING (MOBISPC'14) / AFFILIATED WORKSHOPS, 2014, 34 : 63 - 70
  • [6] Arshad M, 2012, 2012 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT AND ADVANCED SYSTEMS (ICIAS), VOLS 1-2, P280, DOI 10.1109/ICIAS.2012.6306202
  • [7] Bajelan M., 2013, J COMMUN ENG, V2, P351
  • [8] Genetically derived secure cluster-based data aggregation in wireless sensor networks
    Bhasker, Lathies
    [J]. IET INFORMATION SECURITY, 2014, 8 (01) : 1 - 7
  • [9] Davis A., 2012, INT J COMPUTER SCI E, V3, P1
  • [10] Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]