DPRoPHET Routing in Delay Tolerant Network

2013 ◽  
Vol 684 ◽  
pp. 543-546 ◽  
Author(s):  
Phearin Sok ◽  
Sueng Hwan Lee ◽  
Kee Cheon Kim
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Source Node ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Distance Metric ◽  
Probabilistic Routing ◽  
History Of ◽  
Simulation Results ◽  
Delay Tolerant

PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.

scholarly journals An Improved PRoPHET Routing Protocol in Delay Tolerant Network

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Seung Deok Han ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Source Node ◽  
Destination Node ◽  
Average Delay ◽  
Intermediate Node ◽  
Delivery Probability ◽  
History Of ◽  
Delay Tolerant ◽  
Overhead Ratio

In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating messagem, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

scholarly journals A novel energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771738 ◽  
Author(s):  
Min Wook Kang ◽  
Yun Won Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Probabilistic Routing ◽  
History Of ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Intermittently Connected

In delay-tolerant wireless sensor networks, messages for sensor data are delivered using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path like the Internet and mobile nodes operate on battery, an energy-efficient routing protocol is needed. In this article, we consider the probabilistic routing protocol using history of encounters and transitivity protocol as the base protocol. Then, we propose an energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks, where messages are forwarded based on the node’s remaining battery, delivery predictability, and type of nodes. The performance of the proposed protocol is compared with that of probabilistic routing protocol using history of encounters and transitivity and probabilistic routing protocol using history of encounters and transitivity with periodic sleep in detail, from the aspects of delivery ratio, overhead ratio, delivery latency, and ratio of alive nodes. Simulation results show that the proposed protocol has better delivery probability, overhead ratio, and ratio of alive nodes, in most of the considered parameter settings, in spite of a small increase in delivery latency.

scholarly journals An Optimized Probabilistic Delay Tolerant Network (DTN) Routing Protocol Based on Scheduling Mechanism for Internet of Things (IoT)

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 243 ◽  
Author(s):  
Yuxin Mao ◽  
Chenqian Zhou ◽  
Yun Ling ◽  
Jaime Lloret
Keyword(s):  
Internet Of Things ◽  
Mobile Networks ◽  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Iot Applications ◽  
Efficient Data ◽  
History Of ◽  
One Simulator ◽  
Key Aspects ◽  
Delay Tolerant

Many applications of Internet of Things (IoT) have been implemented based on unreliable wireless or mobile networks like the delay tolerant network (DTN). Therefore, it is an important issue for IoT applications to achieve efficient data transmission in DTN. In order to improve delivery rate and optimize delivery delay with low overhead in DTN for IoT applications, we propose a new routing protocol, called Scheduling-Probabilistic Routing Protocol using History of Encounters and Transitivity (PROPHET). In this protocol, we calculate the delivery predictability according to the encountering frequency among nodes. Two scheduling mechanisms are proposed to extend the traditional PROPHET protocol and improve performance in both storage and transmission in DTN. In order to evaluate the proposed routing protocol, we perform simulations and compare it with other routing protocols in an Opportunistic Network Environment (ONE) simulator. The results demonstrate that the proposed Scheduling-PROPHET can achieve better performances in several key aspects compared with the existing protocols.

scholarly journals CHBR: Contact History Based Routing in Time Varying Approach

2014 ◽  
Vol 13 (2) ◽  
pp. 4237-4247 ◽  
Author(s):  
Pravesh S Patel ◽  
Hemal Shah ◽  
Yogeshwar Kosta
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Time Varying ◽  
Intermittent Connectivity ◽  
Real Trace ◽  
Synthetic Datasets ◽  
Delay Tolerant ◽  
Communication Path ◽  
Selection Of

In Delay tolerant network having intermittent connectivity so there is no guarantee of finding a complete communication path that connecting the source and destination. There no any end to end connectivity for delay-tolerant network selection of routing protocol is important to deliver the message in an efficient way and increases chance to deliver a message to the destination. Some existing routing protocols improve the delivery ratio but it also increases the overhead. Our paper proposed Contact History Based Routing (CHBR) that use Neighborhood Index and Time varying properties such as temporal distance, Temporal Diameter and centrality for benchmarking the existing routing protocol. First, temporal metrics are evaluated for synthetic and real trace data. Then CHBR protocol is compared with the Epidemic and PROPHET for delivery ratio, overhead and the number of messages dropped. This has been carried using Opportunistic Network Environment simulator under real and synthetic datasets.

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 Multipath Routing Protocol Based On Cross-Layer Approach for MANET

2017 ◽  
Vol 11 (1) ◽  
pp. 71
Author(s):  
Alaa Azmi Allahham ◽  
Muamer Mohammed ◽  
Nassir Sallom Kadhim
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Threshold Value ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Cross Layer Design ◽  
Continuous Change ◽  
Physical Layers ◽  
Layered Architecture

<p class="Abstract">Mobile Ad-hoc Networks (MANETs) involved in many applications, whether smart or traditional and for both civilian and military uses, and that because of their special features, where it does not depend on any infrastructure during its working, as well as the nodes in MANETs have a freedom of movement with the ability to self-configure, in addition, to working as a router or client at the same time. Moreover, MANETs considered as an infrastructure less network, so the cost of this type of networks is less in comparison to other traditional networks. On the other hand, the routing considered one of most important challenges in MANETs due to the  perpetual motion and randomness of the nodes that can causing a continuous change of the network topology and thus to all paths between nodes, where finding valid paths between the nodes is the core task of routing protocols. Recently, it has been argued that the traditional layered architecture is ineffective to deal with receiving signal strength related problems. In an effort to improve the performance of MANETs, there has been increased in protocols that rely on cross-layer interaction between different layers. In this paper, a Cross-layer design among Network, MAC and Physical layers based on Threshold Multipath Routing Protocol (CTMRP) is proposed. The CTMRP is designed for decision maker based on threshold value of average paths signal for efficient transmission of the Text, image, audio and video as well as sending the data via multiple paths, which mitigate the negatives effects causes from forcing the nodes to send the data via single. The Route Discovery Delay, Number of RREQ Messages, Number of RREP Messages, End-to-End Delay, Packet Delivery Ratio (PDR), and Throughput were selected as the main performance evaluation metrics. The results show that the proposed algorithm has better performance and lead to increase stability of transmission link.</p>

Sign in / Sign up

Export Citation Format

Share Document