QLFR: A Q-Learning-Based Localization-Free Routing Protocol for Underwater Sensor Networks

被引:26
|
作者
Zhou, Yuan [1 ]
Cao, Tao [1 ]
Xiang, Wei [2 ]
机构
[1] Tianjin Univ, Sch Elect & Informat Engn, Tianjin, Peoples R China
[2] James Cook Univ, Coll Sci Technol & Engn, Cairns, Qld 4870, Australia
来源
2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2019年
关键词
Q-learning; Routing protocol; Holding time mechanism; Underwater sensor networks;
D O I
10.1109/globecom38437.2019.9013970
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Designing a routing protocol for underwater sensor networks is a great challenge due to characteristics of high energy consumption and high latency. This paper investigates a Q-learning-based localization-free routing protocol (QLFR) to prolong the lifetime as well as reduce the end-to-end delay for underwater sensor networks. Aiming to seek optimal routing policies, Q-value is calculated by jointly considering residual energy and depth information of sensor nodes throughout the routing process. More specifically, we define two cost functions (depth-related cost and energy-related cost) for Q-learning, in order to reduce delay and extend the network lifetime. In addition, a holding time mechanism for packet forwarding is designed according to the priority of forwarding nodes. The key contribution lies in: 1) a novel Q-learning-based routing protocol for UWSNs; 2) a new holding time mechanism for packet forwarding; and 3) a packet-delivery-ratio-based scheme to further reduce unnecessary transmissions. Extensive simulation results demonstrate superiority performance of our routing protocol in terms of reducing end-to-end delay and extending the network lifetime.
引用
收藏
页数:6
相关论文
共 50 条
  • [11] Q-learning based energy-efficient and void avoidance routing protocol for underwater acoustic sensor networks
    Khan, Zahoor Ali
    Karim, Obaida Abdul
    Abbas, Shahid
    Javaid, Nadeem
    Bin Zikria, Yousaf
    Tariq, Usman
    COMPUTER NETWORKS, 2021, 197
  • [12] Q-Learning for energy balancing and avoiding the void hole routing protocol in underwater sensor networks
    Javaid, Nadeem
    Karim, Obaida Abdul
    Sher, Arshad
    Imran, Muhammad
    Yasar, Ansar Ul Haque
    Guizani, Mohsen
    2018 14TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC), 2018, : 702 - 706
  • [13] Q-Learning-Based Data-Aggregation-Aware Energy-Efficient Routing Protocol for Wireless Sensor Networks
    Yun, Wan-Kyu
    Yoo, Sang-Jo
    IEEE ACCESS, 2021, 9 : 10737 - 10750
  • [14] QLACO: Q-learning Aided Ant Colony Routing Protocol for Underwater Acoustic Sensor Networks
    Fang, Zhengru
    Wang, Jingjing
    Jiang, Chunxiao
    Zhang, Biling
    Qin, Chuan
    Ren, Yong
    2020 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2020,
  • [15] QGeo: Q-Learning-Based Geographic Ad Hoc Routing Protocol for Unmanned Robotic Networks
    Jung, Woo-Sung
    Yim, Jinhyuk
    Ko, Young-Bae
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (10) : 2258 - 2261
  • [16] A Q-Learning-Based Topology-Aware Routing Protocol for Flying Ad Hoc Networks
    Arafat, Muhammad Yeasir
    Moh, Sangman
    IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (03): : 1985 - 2000
  • [17] A Q-Learning-based distributed routing protocol for frequency-switchable magnetic induction-based wireless underground sensor network
    Liu, Guanghua
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2023, 139 : 253 - 266
  • [18] 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
  • [19] Adaptive clustering routing protocol for underwater sensor networks
    Sun, Yao
    Zheng, Maochun
    Han, Xiao
    Li, Shuang
    Yin, Jingwei
    AD HOC NETWORKS, 2022, 136
  • [20] A Q-Learning-Based Adaptive MAC Protocol for Internet of Things Networks
    Wu, Chien-Min
    Kao, Yen-Chun
    Chang, Kai-Fu
    Tsai, Cheng-Tai
    Hou, Cheng-Chun
    IEEE ACCESS, 2021, 9 (09): : 128905 - 128918