Atomic-shaped efficient delay and data gathering routing protocol for underwater wireless sensor networks

被引:8
|
作者
Farooq, Wajiha [1 ]
Ali, Tariq [1 ]
Shaf, Ahmad [1 ]
Draz, Umar [1 ]
Yasin, Sana [1 ]
机构
[1] COMSATS Univ Islamabad, Fac Comp Sci, Dept Comp Sci, Sahiwal, Pakistan
关键词
Underwater wireless sensor network; routing protocol; autonomous underwater vehicle; delay-efficient; data gathering; AUV;
D O I
10.3906/elk-1808-26
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
High end-to-end delay is a major challenge in autonomous underwater vehicle (AUV)-aided routing protocols for underwater monitoring applications. In this paper, a new routing protocol called atomic-shaped efficient delay and data gathering (ASEDG) has been introduced for underwater wireless sensor networks. The ASEDG is divided into two phases; in the first phase, the atomic-shaped trajectory model with horizontal and vertical ellipticals was designed for the movement of the AUV. In the second phase, two types of delay models were considered to make our protocol more delay efficient: member nodes (MNs) to MNs and MNs to gateway nodes (GNs). The MNs-to-MNs delay in the network specifies how long is required for the selection of the next possible forwarders by eliminating the chances of backtracking and a higher number of association links. The MNs-to-GNs delay is considered to choose the path from a multipath environment that takes a minimum amount of time for sending the packet from its generation to destination node. For efficient data gathering, this new trajectory model creates the maximum possible GNs for the association of the MNs. Furthermore, our protocol, ASEDG, has been evaluated by using the aquasim network simulator (NS-2), and its results were compared with the already existing protocol, an efficient data gathering (AEDG) routing protocol. The simulation results show that the ASEDG performed better than the AEDG in terms of end-to-end delay and throughput.
引用
收藏
页码:3454 / 3469
页数:16
相关论文
共 50 条
  • [31] Energy Efficient Layered Cluster Head Rotation Based Routing Protocol for Underwater Wireless Sensor Networks
    Datta, Amrita
    Dasgupta, Mou
    WIRELESS PERSONAL COMMUNICATIONS, 2022, 125 (03) : 2497 - 2514
  • [32] Energy Efficient Layered Cluster Head Rotation Based Routing Protocol for Underwater Wireless Sensor Networks
    Amrita Datta
    Mou Dasgupta
    Wireless Personal Communications, 2022, 125 : 2497 - 2514
  • [33] A Survey of Routing Protocols for Underwater Wireless Sensor Networks
    Luo, Junhai
    Chen, Yanping
    Wu, Man
    Yang, Yang
    IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2021, 23 (01): : 137 - 160
  • [34] Backbone tree based data gathering protocol for wireless sensor networks
    Niu Y.
    Wang J.
    Lee S.
    Lee Y.-K.
    Advances in Information Sciences and Service Sciences, 2011, 3 (08): : 351 - 360
  • [35] An Energy-Efficient and Scalable Routing Protocol for Distributed Wireless Sensor Networks
    Kim, Kyung Tae
    Youn, Hee Yong
    AD HOC & SENSOR WIRELESS NETWORKS, 2015, 29 (1-4) : 195 - 212
  • [36] Efficient Routing Protocol Based on Reinforcement Learning for Magnetic Induction Underwater Sensor Networks
    Wang, Sai
    Shin, Yoan
    IEEE ACCESS, 2019, 7 (82027-82037) : 82027 - 82037
  • [37] A Distributed Data-Gathering Protocol Using AUV in Underwater Sensor Networks
    Khan, Jawaad Ullah
    Cho, Ho-Shin
    SENSORS, 2015, 15 (08) : 19331 - 19350
  • [38] Reinforcement Learning-Based Routing Protocol for Underwater Wireless Sensor Networks: A Comparative Survey
    Rodoshi, Rehenuma Tasnim
    Song, Yujae
    Choi, Wooyeol
    IEEE ACCESS, 2021, 9 : 154578 - 154599
  • [39] Load balance and energy efficient data gathering in wireless sensor networks
    Mandala, Devendar
    Du, Xiaojiang
    Dai, Fei
    You, Chao
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2008, 8 (05) : 645 - 659
  • [40] EDGS: Efficient Data Gathering Scheme for Dense Wireless Sensor Networks
    Al-Ahmadi, Saad A.
    Al-Dhelaan, Abdullah
    2013 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2013, : 848 - 854