Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.00133

Help | Advanced Search

Computer Science > Networking and Internet Architecture

arXiv:2506.00133 (cs)
[Submitted on 30 May 2025 ]

Title: A Reinforcement Learning-Based Telematic Routing Protocol for the Internet of Underwater Things

Title: 基于强化学习的水下物联网路由协议

Authors:Mohammadhossein Homaei, Mehran Tarif, Agustin Di Bartolo, Oscar Mogollon Gutierrez, Mar Avila
Abstract: The Internet of Underwater Things (IoUT) faces major challenges such as low bandwidth, high latency, mobility, and limited energy resources. Traditional routing protocols like RPL, which were designed for land-based networks, do not perform well in these underwater conditions. This paper introduces RL-RPL-UA, a new routing protocol that uses reinforcement learning to improve performance in underwater environments. Each node includes a lightweight RL agent that selects the best parent node based on local information such as packet delivery ratio, buffer level, link quality, and remaining energy. RL-RPL-UA keeps full compatibility with standard RPL messages and adds a dynamic objective function to support real-time decision-making. Simulations using Aqua-Sim show that RL-RPL-UA increases packet delivery by up to 9.2%, reduces energy use per packet by 14.8%, and extends network lifetime by 80 seconds compared to traditional methods. These results suggest that RL-RPL-UA is a promising and energy-efficient routing solution for underwater networks.
Abstract: 水下物联网(IoUT)面临诸如带宽低、时延长、移动性强以及能量资源有限等主要挑战。传统路由协议(如为陆地网络设计的RPL)在这些水下条件下表现不佳。本文介绍了一种新的路由协议RL-RPL-UA,它利用强化学习来提升水下环境中的性能。每个节点都包含一个轻量级的RL代理,该代理基于数据包交付比率、缓冲区水平、链路质量和剩余能量等本地信息选择最佳的父节点。RL-RPL-UA完全兼容标准RPL消息,并增加了一个动态目标函数以支持实时决策。使用Aqua-Sim进行的仿真表明,与传统方法相比,RL-RPL-UA可将数据包交付率提高多达9.2%,每包能耗减少14.8%,网络寿命延长80秒。这些结果表明,RL-RPL-UA是一种有前景且节能的水下网络路由解决方案。
Comments: 8 Pages, 10 Figures, 2 Tables
Subjects: Networking and Internet Architecture (cs.NI) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as: arXiv:2506.00133 [cs.NI]
  (or arXiv:2506.00133v1 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2506.00133
arXiv-issued DOI via DataCite

Submission history

From: MohammadHossein Homaei [view email]
[v1] Fri, 30 May 2025 18:11:31 UTC (1,219 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.AI
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号