scholarly journals An Efficient Routing Protocol with Overload Control for Group Mobility in Delay-Tolerant Networking

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 521
Author(s):  
Min Wook Kang ◽  
Yun Won Chung

In delay-tolerant networking (DTN), messages are delivered to destination nodes by using opportunistic contacts between contact nodes, even if stable routing paths from source nodes to destination nodes do not exist. In some DTN network environments, such as military networks, nodes movement follows a group movement model, and an efficient DTN routing protocol is required to use the characteristics of group mobility. In this paper, we consider a network environment, where both intra- and intergroup routing are carried out by using DTN protocols. Then, we propose an efficient routing protocol with overload control for group mobility, where delivery predictability for group mobility is defined and proactive overload control is applied. Performance evaluation results show that the proposed protocol had better delivery ratios and overhead ratios than compared protocols, although the delivery latency was increased.

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3758 ◽  
Author(s):  
Armir Bujari ◽  
Carlos Calafate ◽  
Juan-Carlos Cano ◽  
Pietro Manzoni ◽  
Claudio Palazzi ◽  
...  

In this paper, we propose GeoSaW, a delay-tolerant routing protocol for Airborne Networks in Search and Rescue scenarios. The protocol exploits the geographical information of UAVs to make appropriate message forwarding decisions. More precisely, the information about the future UAV’s motion path is exploited to select the best UAV carrying the message towards the destination. Simulation results show that the proposed solution outperforms the classic DTN routing protocols in terms of several performance metrics.


Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 839
Author(s):  
Min Wook Kang ◽  
Dong Yeong Seo ◽  
Yun Won Chung

Delay tolerant networks (DTN) is a good candidate for delivering information-centric networking (ICN) messages in fragmented networks due to disaster. In order to efficiently deliver ICN messages in DTN, the characteristics of multiple requester nodes for the same content and multiple provider nodes for the same request should be used efficiently. In this paper, we propose an efficient DTN routing protocol for ICN. In the proposed protocol, requester information for request packet, which is called an Interest in ICN, is shared by exchanging status table with requested Data ID, requester ID, and satisfaction flag, where satisfaction flag is defined to show the delivery status of Data, so that unnecessary forwarding of Data is avoided. Data is forwarded to a more probable node by comparing average delivery predictability to a set of requesters. Performance of the proposed protocol was evaluated using simulation from the aspect of Data delivery probability and Data overhead, for varying buffer sizes, number of relay nodes, and time-to-live (TTL) of Data. The results show that the proposed protocol has better Data delivery probability, compared to content distribution and retrieval framework in disaster networks for public protection (CIDOR) and opportunistic forwarding (OF) protocols, although there is a tradeoff from the aspect of Data overhead for varying buffer sizes and number of relay nodes.


2012 ◽  
Vol 23 (3) ◽  
pp. 629-647 ◽  
Author(s):  
Lei WU ◽  
Xiao-Min WANG ◽  
Ming LIU ◽  
Gui-Hai CHEN ◽  
Hai-Gang GONG

Author(s):  
Suzan Shukry

AbstractStable routing and energy conservation over a wireless sensor network (WSN) is a major issue in Internet of Things applications. The network lifetime can be increased when studying this issue with interest. Data transmission is a dominant factor in IoT networks for communication overhead and energy consumption. A proposed efficient node stable routing ($$ENSR$$ ENSR ) protocol is introduced to guarantee the stability of transmission data between the source and destination nodes, in a dynamic WSN conditions. $$ENSR$$ ENSR minimizes energy consumption and selects more stable nodes for packets forwarding. Stability becomes the most important factor that qualifies the node's centrality. A node’s stability is characterized by residual energy, link quality, and number of hops needed to reach the destination from the node. To calculate node's stability, an enhanced centrality concept, known as stable betweenness centrality ($$SBC$$ SBC ) is introduced. In $$ENSR$$ ENSR , at first, some nodes will be selected as the stable forwarding nodes, usually with maximum $$SBC$$ SBC between their neighbors within a limited communication radio range of a particular region. Furthermore, each stable forwarding node then broadcasts its identity, including $$SBC$$ SBC , to the source node separately. The source node can compute a stable path to forward packets to the corresponding stable forwarding node, based on a proper designed stable path routing metric ($$SPRM$$ SPRM ). Then, the stable forwarding node will behave as a new source node and start another stable path routing process until the packets are forwarded and reached to the destination node. In addition, the change of stable nodes over time balances and conserves node energy consumption, thereby mitigating “hot spots”. The proposed routing protocol is validated through simulation. The numerical results show that the proposed protocol outperforms the existing algorithms, global and local reliability-based routing ($$GLRR$$ GLRR ) and reliable energy-aware routing protocol $$(RER)$$ ( R E R ) , in terms of network efficiency and reliability.


2013 ◽  
Vol 19 (6) ◽  
pp. 1299-1316 ◽  
Author(s):  
Kyoung-Hak Jung ◽  
Wan-Seon Lim ◽  
Jae-Pil Jeong ◽  
Young-Joo Suh

Sign in / Sign up

Export Citation Format

Share Document