{"title":"关键任务物联网网络多路径数据传输中的可靠性感知分组复制","authors":"Soumya Nandan Mishra, Manas Khatua","doi":"10.1016/j.adhoc.2025.103940","DOIUrl":null,"url":null,"abstract":"<div><div>Mission-critical IoT applications require a strict reliability guarantee of at least 99% to ensure seamless operation. However, due to the resource-constrained nature of IoT networks, data transmissions inherently suffer from losses. This contradiction presents significant challenges for the traditional IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), which was originally designed for general IoT networks. To address this issue, various multi-path RPL-based routing approaches have been proposed. One such solution is Reliable Multi-Path RPL (RMP-RPL), which attempts to enhance reliability by replicating packets and forwarding them through multiple parents. However, meeting the reliability requirement even with a multi-parent-based approach is difficult when the wireless links have high error rates. This is because one transmission attempt to each parent for a packet is not enough for such links. On the other hand, increasing the number of parents is also limited by many factors like resource consumption. To address these issues, we propose Reliability-Aware Packet Replication in Multi-Path Data Transmission (RAPID), which dynamically selects the number of parents and optimally determines the number of replicated packets per parent to meet the reliability constraint while minimizing redundant transmissions. The proposed scheme introduces a joint delivery ratio metric, and proposes greedy-based (RAPID-G) and approximation-based (RAPID-A) packet replication strategies to manage packet replication efficiently. Experimental results in Contiki COOJA simulator show that RAPID-A can achieve the reliability requirements of 90%, 95% and 99% under varying packet reception ratio and network density with an average energy consumption reduction of 34.23% as compared to RMP-RPL. The proposed protocol, RAPID-G, outperforms another multi-path algorithm, LFC, by 41.23%, 39.23% and 35.63% in terms of packet delivery ratio, end-to-end delay and energy consumption, respectively, and RAPID-A outperforms LFC by 38.63%, 44.12%, and 40.12% in terms of packet delivery ratio, end-to-end delay and energy consumption, respectively.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"178 ","pages":"Article 103940"},"PeriodicalIF":4.4000,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reliability-Aware Packet Replication in Multi-Path Data Transmission for Mission-Critical IoT Networks\",\"authors\":\"Soumya Nandan Mishra, Manas Khatua\",\"doi\":\"10.1016/j.adhoc.2025.103940\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Mission-critical IoT applications require a strict reliability guarantee of at least 99% to ensure seamless operation. However, due to the resource-constrained nature of IoT networks, data transmissions inherently suffer from losses. This contradiction presents significant challenges for the traditional IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), which was originally designed for general IoT networks. To address this issue, various multi-path RPL-based routing approaches have been proposed. One such solution is Reliable Multi-Path RPL (RMP-RPL), which attempts to enhance reliability by replicating packets and forwarding them through multiple parents. However, meeting the reliability requirement even with a multi-parent-based approach is difficult when the wireless links have high error rates. This is because one transmission attempt to each parent for a packet is not enough for such links. On the other hand, increasing the number of parents is also limited by many factors like resource consumption. To address these issues, we propose Reliability-Aware Packet Replication in Multi-Path Data Transmission (RAPID), which dynamically selects the number of parents and optimally determines the number of replicated packets per parent to meet the reliability constraint while minimizing redundant transmissions. The proposed scheme introduces a joint delivery ratio metric, and proposes greedy-based (RAPID-G) and approximation-based (RAPID-A) packet replication strategies to manage packet replication efficiently. Experimental results in Contiki COOJA simulator show that RAPID-A can achieve the reliability requirements of 90%, 95% and 99% under varying packet reception ratio and network density with an average energy consumption reduction of 34.23% as compared to RMP-RPL. The proposed protocol, RAPID-G, outperforms another multi-path algorithm, LFC, by 41.23%, 39.23% and 35.63% in terms of packet delivery ratio, end-to-end delay and energy consumption, respectively, and RAPID-A outperforms LFC by 38.63%, 44.12%, and 40.12% in terms of packet delivery ratio, end-to-end delay and energy consumption, respectively.</div></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":\"178 \",\"pages\":\"Article 103940\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S157087052500188X\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S157087052500188X","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Reliability-Aware Packet Replication in Multi-Path Data Transmission for Mission-Critical IoT Networks
Mission-critical IoT applications require a strict reliability guarantee of at least 99% to ensure seamless operation. However, due to the resource-constrained nature of IoT networks, data transmissions inherently suffer from losses. This contradiction presents significant challenges for the traditional IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), which was originally designed for general IoT networks. To address this issue, various multi-path RPL-based routing approaches have been proposed. One such solution is Reliable Multi-Path RPL (RMP-RPL), which attempts to enhance reliability by replicating packets and forwarding them through multiple parents. However, meeting the reliability requirement even with a multi-parent-based approach is difficult when the wireless links have high error rates. This is because one transmission attempt to each parent for a packet is not enough for such links. On the other hand, increasing the number of parents is also limited by many factors like resource consumption. To address these issues, we propose Reliability-Aware Packet Replication in Multi-Path Data Transmission (RAPID), which dynamically selects the number of parents and optimally determines the number of replicated packets per parent to meet the reliability constraint while minimizing redundant transmissions. The proposed scheme introduces a joint delivery ratio metric, and proposes greedy-based (RAPID-G) and approximation-based (RAPID-A) packet replication strategies to manage packet replication efficiently. Experimental results in Contiki COOJA simulator show that RAPID-A can achieve the reliability requirements of 90%, 95% and 99% under varying packet reception ratio and network density with an average energy consumption reduction of 34.23% as compared to RMP-RPL. The proposed protocol, RAPID-G, outperforms another multi-path algorithm, LFC, by 41.23%, 39.23% and 35.63% in terms of packet delivery ratio, end-to-end delay and energy consumption, respectively, and RAPID-A outperforms LFC by 38.63%, 44.12%, and 40.12% in terms of packet delivery ratio, end-to-end delay and energy consumption, respectively.
期刊介绍:
The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to:
Mobile and Wireless Ad Hoc Networks
Sensor Networks
Wireless Local and Personal Area Networks
Home Networks
Ad Hoc Networks of Autonomous Intelligent Systems
Novel Architectures for Ad Hoc and Sensor Networks
Self-organizing Network Architectures and Protocols
Transport Layer Protocols
Routing protocols (unicast, multicast, geocast, etc.)
Media Access Control Techniques
Error Control Schemes
Power-Aware, Low-Power and Energy-Efficient Designs
Synchronization and Scheduling Issues
Mobility Management
Mobility-Tolerant Communication Protocols
Location Tracking and Location-based Services
Resource and Information Management
Security and Fault-Tolerance Issues
Hardware and Software Platforms, Systems, and Testbeds
Experimental and Prototype Results
Quality-of-Service Issues
Cross-Layer Interactions
Scalability Issues
Performance Analysis and Simulation of Protocols.