A Probabilistic Routing Algorithm Based on Node Free Buffer-Utilization in Delay Tolerant Network

2013 ◽  
Vol 401-403 ◽  
pp. 2044-2047
Author(s):  
Hong Cheng Huang ◽  
Xi Zhang ◽  
Yi Ding Mao
Keyword(s):  
Network Architecture ◽  
Routing Algorithm ◽  
Buffer Management ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Excitation Threshold ◽  
Probabilistic Routing ◽  
Disruption Tolerant Network ◽  
Set Up

This Delay/Disruption Tolerant Network(DTN) is a New Network Architecture for Communication in Restricted Condition with High Latency and Intermittent Connectivity.In Order to Solve the Problem that Messages can Not be Delivered Reliably because of Mobility and Limited Buffer Size of Nodes in DTN,a Probabilistic Routing Algorithm Based on Node Free Buffer-Utilization (NFBU)is Proposed.The Algorithm Sets Node Free Buffer Warning/excitation Threshold,through Warning/incentive Factor to Increase/decrease the Node Forwarding Probability,and Set up the Buffer Management Strategy,message Time to Live(TTL)value is Smaller,the Higher its Priority,at the same Time Remove the Oldest Message to get more Buffer Space.Simulations Indicate that the Algorithm Improves Delivery Ratio and Reduces Network Latencies in Different Node Free Buffer-Utilization State Compared with some other Routing Algorithms,and it is Highly Adaptable to Network.

scholarly journals The Social Relationship Based Adaptive Multi-Spray-and-Wait Routing Algorithm for Disruption Tolerant Network

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Jianfeng Guan ◽  
Qi Chu ◽  
Ilsun You
Keyword(s):  
Social Relationship ◽  
Routing Algorithm ◽  
Buffer Management ◽  
Delivery Rate ◽  
Message Delivery ◽  
Dead End ◽  
The Social ◽  
Disruption Tolerant Network ◽  
Spray And Wait ◽  
Blind Spots

The existing spray-based routing algorithms in DTN cannot dynamically adjust the number of message copies based on actual conditions, which results in a waste of resource and a reduction of the message delivery rate. Besides, the existing spray-based routing protocols may result in blind spots or dead end problems due to the limitation of various given metrics. Therefore, this paper proposes a social relationship based adaptive multiple spray-and-wait routing algorithm (called SRAMSW) which retransmits the message copies based on their residence times in the node via buffer management and selects forwarders based on the social relationship. By these means, the proposed algorithm can remove the plight of the message congestion in the buffer and improve the probability of replicas to reach their destinations. The simulation results under different scenarios show that the SRAMSW algorithm can improve the message delivery rate and reduce the messages’ dwell time in the cache and further improve the buffer effectively.

scholarly journals Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

2012 ◽  
Vol 4 ◽  
pp. 13-18
Author(s):  
Qi Lie Liu ◽  
Guang De Li ◽  
Yun Li ◽  
Ying Jun Pan ◽  
Feng Zhi Yu
Keyword(s):  
Buffer Management ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Scheduling Policy ◽  
Optimal Theory ◽  
Overall Performance ◽  
Delay Tolerant ◽  
Ratio Transmission ◽  
Better Than

Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

scholarly journals DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Hezhe Wang ◽  
Hongwu Lv ◽  
Huiqiang Wang ◽  
Guangsheng Feng
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Movement Trajectory ◽  
Average Delay ◽  
Urban Scenario

When a delay/disruption tolerant network (DTN) is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

scholarly journals An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes

2018 ◽  
Vol 8 (8) ◽  
pp. 1344 ◽  
Author(s):  
Kyung Min Baek ◽  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Average Distance ◽  
Mobile Node ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Context Information ◽  
Delivery Ratio ◽  
Mobile Nodes

Delay tolerant network (DTN) protocol was proposed for a network where connectivity is not available. In DTN, a message is delivered to a destination node via store-carry-forward approach while using opportunistic contacts. Probabilistic routing protocol for intermittently connected networks (PRoPHET) is one of the widely studied DTN protocols. In PRoPHET, a message is forwarded to a contact node, if the contact node has a higher delivery predictability to the destination node of the message. In this paper, we propose an improved opportunistic routing protocol, where context information of average distance travelled and average time elapsed from the reception of a message to the delivery of the message to the destination node is used. In the proposed protocol, the average distance and average time are updated whenever a message is delivered to a destination node. Then, both average distance and average time as well as delivery predictability of PRoPHET protocol are used to decide a message forwarding. The performance of the proposed protocol is analyzed and compared with that of PRoPHET and reachable probability centrality (RPC) protocol, which is one of the latest protocols using the contact history information of a mobile node. Simulation results show that the proposed protocol has better performance than both PRoPHET and RPC, from the aspect of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771875787 ◽  
Author(s):  
Hezhe Wang ◽  
Guangsheng Feng ◽  
Huiqiang Wang ◽  
Hongwu Lv ◽  
Renjie Zhou
Keyword(s):  
Buffer Management ◽  
Network Routing ◽  
Routing Algorithms ◽  
Destination Node ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Resources ◽  
Hop Count ◽  
Management Algorithm ◽  
Disruption Tolerant Network

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

RACOD: Routing Using Ant Colony Optimization in DTN

2020 ◽  
Vol 10 (2) ◽  
pp. 262-275
Author(s):  
Naveen Singh ◽  
Awadhesh Singh
Keyword(s):  
Ant Colony Optimization ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Buffer Management ◽  
Ant Colony ◽  
Delay Tolerant Network ◽  
Management Method ◽  
Hoc Networks ◽  
Delay Tolerant ◽  
Hostile Environments

Background & Objective: Routing is a popular challenge in ad hoc networks. A routing algorithm developed for one type of ad hoc network may be adapted for other. However, such adaptation is very difficult for Delay Tolerant Network (DTN) due to special DTN characteristics like latency, intermittency, disruptions, etc. and its applications in hostile environments like extreme terrestrial and space. Methods: We have used Ant Colony Optimization (ACO) to develop a routing algorithm suited to DTNs. The ants wander for food and after few epochs they find shortest path to it. The ant’s movement in ACO can be mapped with propagation of messages that are replicated in DTN and look for their destination. Also, we apply an efficient buffer management method to boost the performance of our routing algorithm. Results & Conclusion: To highlight the effectiveness of our algorithm, the simulation results have been compared with some leading algorithms available in the literature and have found that our algorithm produces better result than other algorithms in terms of delivery, overhead and probability ratio.

Sign in / Sign up

Export Citation Format

Share Document