Energy-Efficient Relay-Based Void Hole Prevention and Repair in Clustered Multi-AUV Underwater Wireless Sensor Network

被引:20
|
作者
Chaaf, Amir [1 ]
Muthanna, Mohammed Saleh Ali [2 ]
Muthanna, Ammar [3 ,4 ]
Alhelaly, Soha [5 ]
Elgendy, Ibrahim A. [6 ]
Iliyasu, Abdullah M. [7 ,8 ,9 ]
Abd El-Latif, Ahmed A. [10 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing, Peoples R China
[2] Chongqing Univ Posts & Telecommun, Sch Comp Sci & Technol, Chongqing, Peoples R China
[3] Bonch Bruevich St Petersburg State Univ Telecommu, Dept Telecommun Networks & Data Transmiss, St Petersburg 193232, Russia
[4] RUDN Univ, Dept Appl Probabil & Informat, Peoples Friendship Univ Russia, 6 Miklukho Maklaya St, Moscow 117198, Russia
[5] Saudi Elect Univ, Coll Comp & Informat, Riyadh, Saudi Arabia
[6] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin, Peoples R China
[7] Prince Sattam Bin Abdulaziz Univ, Elect Engn Dept, Al Kharj 11942, Saudi Arabia
[8] Tokyo Inst Technol, Sch Comp, Yokohama, Kanagawa 2268502, Japan
[9] Changchun Univ Sci & Technol, Sch Comp Sci & Technol, Changchun 130022, Peoples R China
[10] Menoufia Univ, Fac Sci, Math & Comp Sci Dept, Shibin Al Kawm, Egypt
关键词
ROUTING PROTOCOLS; INTERNET; SCHEME;
D O I
10.1155/2021/9969605
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Underwater wireless sensor networks (UWSNs) enable various oceanic applications which require effective packet transmission. In this case, sparse node distribution, imbalance in terms of overall energy consumption between the different sensor nodes, dynamic network topology, and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a relay-based void hole prevention and repair (ReVOHPR) protocol by multiple autonomous underwater vehicles (AUVs) for UWSN. ReVOHPR is a global solution that implements different phases of operations that act mutually in order to efficiently reduce and identify void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as ocean depth (levels)-based equal cluster formation, dynamic sleep scheduling, virtual graph-based routing, and relay-assisted void hole repair. For energy-efficient cluster forming, entropy-based eligibility ranking (E2R) is presented, which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented by the dynamic kernel Kalman filter (DK2F) algorithm in which sleep and active modes are based on the node's current status. Intercluster routing is performed by maximum matching nodes that are selected by dual criteria, and also the data are transmitted to AUV. Finally, void holes are detected and repaired by the bicriteria mayfly optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes and data packet loss and maximizes the quality of service (QoS) and energy efficiency of the network. This protocol is timely dealing with node failures in packet transmission via multihop routing. Simulation is implemented by the NS3 (AquaSim module) simulator that evaluates the performance in the network according to the following metrics: average energy consumption, delay, packet delivery rate, and throughput. The simulation results of the proposed REVOHPR protocol comparing to the previous protocols allowed to conclude that the REVOHPR has considerable advantages. Due to the development of a new protocol with a set of phases for data transmission, energy consumption minimization, and void hole avoidance and mitigation in UWSN, the number of active nodes rate increases with the improvement in overall QoS.
引用
收藏
页数:20
相关论文
共 50 条
  • [41] Energy-Efficient Distributed Multi-Sensor Scheduling Based on Energy Balance in Wireless Sensor Networks
    Liu, Yonggui
    Xu, Bugong
    [J]. AD HOC & SENSOR WIRELESS NETWORKS, 2014, 20 (3-4) : 307 - 328
  • [42] An Energy-Efficient Routing Strategy Based on Mobile Agent for Wireless Sensor Network
    Yang Jing
    Zhang Heng
    Wang Xiao
    Zhan Yuzhi
    Yang Ping
    Luo Xuemei
    Sun Yuefang
    Li Zetao
    [J]. 2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2017, : 2632 - 2636
  • [43] An energy-efficient technique for mobile-wireless-sensor-network-based IoT
    Singla, Jatin
    Mahajan, Rita
    Bagai, Deepak
    [J]. ETRI JOURNAL, 2022, 44 (03) : 389 - 399
  • [44] Reliable and Energy-Efficient Multicast Based on Network Coding for Wireless Sensor Networks
    Wang, Xing
    Tan, Yuanquan
    Zhou, Zhiheng
    Zhou, Liang
    [J]. 2011 6TH INTERNATIONAL ICST CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM), 2011, : 1142 - 1145
  • [45] WIRELESS SENSOR NETWORK ENERGY-EFFICIENT ROUTING TECHNIQUES BASED ON IMPROVED GEAR
    Shen, Yiming
    Wu, Qiong
    Wang, Xiaopeng
    Bi, Huibin
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT, PROCEEDINGS, 2009, : 114 - +
  • [46] Comparison on energy-efficient cluster based routing algorithms in wireless sensor network
    Dehghani, Shahrzad
    Pourzaferani, Mohammad
    Barekatain, Behrang
    [J]. THIRD INFORMATION SYSTEMS INTERNATIONAL CONFERENCE 2015, 2015, 72 : 535 - 542
  • [47] Contrast for QOS based clustered energy efficient protocol with PSO and multi-hop gateways in wireless sensor network
    K. Selvakumar
    R. Madonna Arieth
    [J]. Cluster Computing, 2019, 22 : 11883 - 11890
  • [48] MWCSGA-Multi Weight Chicken Swarm Based Genetic Algorithm for Energy Efficient Clustered Wireless Sensor Network
    Ajmi, Nader
    Helali, Abdelhamid
    Lorenz, Pascal
    Mghaieth, Ridha
    [J]. SENSORS, 2021, 21 (03) : 1 - 21
  • [49] E-NORS: A Repair Scheme for Energy-efficient Network Organization in Wireless Sensor Networks
    Xia Ming
    Dong Yabo
    Lu Dongming
    [J]. 2008 INTERNATIONAL MULTISYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS), 2008, : 69 - 74
  • [50] Contrast for QOS based clustered energy efficient protocol with PSO and multi-hop gateways in wireless sensor network
    Selvakumar, K.
    Arieth, R. Madonna
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 5): : 11883 - 11890