An extended ACO-based mobile sink path determination in wireless sensor networks

被引:45
作者
Donta, Praveen Kumar [1 ]
Amgoth, Tarachand [1 ]
Annavarapu, Chandra Sekhara Rao [1 ]
机构
[1] Indian Inst Technol, Indian Sch Mines, Dept Comp Sci & Engn, Dhanbad, Jharkhand, India
关键词
Wireless sensor networks; Mobile sink path determination; Ant colony optimization; Network lifetime; Energy-hole problem; ROUTING ALGORITHM; LIFETIME;
D O I
10.1007/s12652-020-02595-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In wireless sensor networks (WSNs), a mobile sink accumulate the data instead of routing directly to the sink to avoid the hotspot problem. In this process, it traverses a predetermined path by visiting a set of nodes called the rendezvous point (RP), and all the non-rendezvous points can transmit their data to the closest RP. Identifying the best collection of RPs and determining the mobile sink traveling path will decrease data loss and improve network performance. However, choosing a set of RPs and the route between them is a challenging task. It is more complicated in the event-driven applications due to the uneven data rate of SNs. In this context, we propose an extended ant colony optimization (ACO)-based mobile sink path construction for event-driven WSNs. In this, the best set of the RPs and the efficient mobile sink traveling path between them is determined. In addition to this, the RPs re-selection mechanism also adopted for balancing the energy between the nodes. After that, the virtual RPs are introduced to minimize the data transmissions between the sensor nodes and RPs. This process will improve WSNs' performance in terms of reducing data losses while increasing network lifetime. The improved performance of the extended ACO-MSPD over existing is confirmed through simulation tests.
引用
收藏
页码:8991 / 9006
页数:16
相关论文
共 39 条
  • [1] Wireless sensor networks: a survey
    Akyildiz, IF
    Su, W
    Sankarasubramaniam, Y
    Cayirci, E
    [J]. COMPUTER NETWORKS, 2002, 38 (04) : 393 - 422
  • [2] Energy-aware routing algorithm for wireless sensor networks
    Amgoth, Tarachand
    Jana, Prasanta K.
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2015, 41 : 357 - 367
  • [3] An Analytical Approach for Optimizing Data Transfer Rate in a Faulty Wireless Sensor Network
    Amrizal, Muhammad Alfian
    Guillen, Luis
    Suganuma, Takuo
    [J]. 2019 IEEE 24TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC 2019), 2019, : 122 - 123
  • [4] A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
    Attiratanasunthron, Nattapat
    Fakcharcienphol, Jittat
    [J]. INFORMATION PROCESSING LETTERS, 2008, 105 (03) : 88 - 92
  • [5] Genetic algorithm based optimized leach protocol for energy efficient wireless sensor networks
    Bhola, Jyoti
    Soni, Surender
    Cheema, Gagandeep Kaur
    [J]. JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2020, 11 (03) : 1281 - 1288
  • [6] An Efficient Tree-Based Power Saving Scheme for Wireless Sensor Networks With Mobile Sink
    Chang, Jau-Yang
    Shen, Ting-Huan
    [J]. IEEE SENSORS JOURNAL, 2016, 16 (20) : 7545 - 7557
  • [7] Mobile sink-based energy efficient cluster head selection strategy for wireless sensor networks
    Chauhan, Vinith
    Soni, Surender
    [J]. JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2020, 11 (11) : 4453 - 4466
  • [8] Classification of data aggregation functions in wireless sensor networks
    Cui, Jin
    Boussetta, Khaled
    Valois, Fabrice
    [J]. COMPUTER NETWORKS, 2020, 178
  • [9] Data Collection and Path Determination Strategies for Mobile Sink in 3D WSNs
    Donta, Praveen Kumar
    Rao, Banoth Sanjai Prasada
    Amgoth, Tarachand
    Annavarapu, Chandra Sekhara Rao
    Swain, Silpamayee
    [J]. IEEE SENSORS JOURNAL, 2020, 20 (04) : 2224 - 2233
  • [10] Ant system: Optimization by a colony of cooperating agents
    Dorigo, M
    Maniezzo, V
    Colorni, A
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01): : 29 - 41