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 Rapid Emergncy Message Dissemination Routing In Delay Tolerant Network

2019 ◽  
Vol 8 (10) ◽  
pp. 2056-2060
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Communication Range ◽  
Emergency Rescue ◽  
Intermittent Connectivity ◽  
Message Dissemination ◽  
Delay Tolerant

In VANET, vehicles are move very fast as a consequence intermittent connectivity occurs frequently. In this delay-tolerant situation, the emergency rescue message broadcast is an extremely challenging task. The proposed routing protocol REMD give a solution to the problem. REMD follow the store carry forward method and flooding based message forwarding method. This paper expresses rapid emergency message dissemination routing in delay tolerant network called REMD Protocol. In this protocol, the source vehicle broadcast emergency message to the presented all neighbour vehicles in its communication range. The sender vehicle allocates message replicas and message time to live to the neighbour vehicles based on the corresponding vehicles credence value. Each vehicle credence value is calculated from their Visited Level Estimation (VLE) and Destination Reaches Level Estimation (DLE) values.

scholarly journals BiRep: A Reputation Scheme to Mitigate the Effects of Black-Hole Nodes in Delay-Tolerant Internet of Vehicles

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 835
Author(s):  
Catarina Nabais ◽  
Paulo Rogério Pereira ◽  
Naercio Magaia
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Network Performance ◽  
Error Rates ◽  
Delivery Ratio ◽  
Excellent Performance ◽  
Internet Of Vehicles ◽  
Intermittent Connectivity ◽  
Variable Delays ◽  
Delay Tolerant

Delay-tolerant networking (DTN) enables communication in disruptive scenarios where issues such as sparse and intermittent connectivity, long and variable delays, high latency, high error rates, or no end-to-end connectivity exist. Internet of Vehicles (IoV) is a network of the future in which integration between devices, vehicles, and users will be unlimited and universal, overcoming the heterogeneity of systems, services, applications, and devices. Delay-tolerant internet of vehicles (DT-IoV) is emerging and becoming a popular research topic due to the critical applications that can be realized, such as software or map update dissemination. For an IoV to work efficiently, a degree of cooperation between nodes is necessary to deliver messages to their destinations. However, nodes might misbehave and silently drop messages, also known as a black-hole attack, degrading network performance. Various solutions have been proposed to deal with black-hole nodes, but most are centralized or require each node to meet every other node. This paper proposes a decentralized reputation scheme called BiRep that identifies and punishes black-hole nodes in DT-IoV. BiRep is tested on the Prophet routing protocol. Simulation results show excellent performance in all scenarios, comparable or better to other reputation schemes, significantly increasing the delivery ratio of messages.

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 UDTN-RS: A New Underwater Delay Tolerant Network Routing Protocol for Facilitating Coastal Patrol and Surveillance Networks

2020 ◽  
Author(s):  
Ahmed Ali Neffati ◽  
Saiful Azad ◽  
Mufti Mahmud ◽  
Suryanti Awang ◽  
Kamal Z. Zamli ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Forward Error Correction ◽  
Network Routing ◽  
Delay Tolerant Network ◽  
Current Status ◽  
Surveillance Network ◽  
Suitable Alternative ◽  
Intermittent Connectivity ◽  
Correction Technique ◽  
Delay Tolerant

The Coastal Patrol and Surveillance Application (CPSA) is developed and deployed to detect, track and monitor water vessel traffic using automated devices. Latest advancements of marine technologies, including the Automatic Underwater Vehicles, have allowed the development of this type of applications. To facilitate their operations, installation of a Coastal Patrol and Surveillance Network (CPSN) is mandatory. One of the primary design objectives of this network is to deliver adequate amount of data within an effective time period. This is particularly essential for reporting a detection and notifying the current status of an intruder’s vessel through the adverse underwater communication channels. Additionally, intermittent connectivity of the nodes remain another important obstacle to overcome to allow smooth functioning of CPSA. Taking these objectives and obstacles into account, this work proposes a new protocol, named UDTN-RS, which is developed by ensembling forward error correction technique (namely Reed-Solomon codes or RS) in Underwater Delay Tolerant Network (UDTN) routing protocol with probabilistic spraying technique. In addition, the existing binary packet spraying technique is enhanced for supporting encoded packet exchange between the contacting nodes. A comprehensive simulation campaign is performed in identifying the effectiveness of the proposed protocol. The obtained results suggest that the proposed UDTN-RS protocol can be considered a suitable alternative of the existing protocols for sparse networks like CPSN.

scholarly journals APSSR: Adaptive Packet Size Selection Based Routing Protocol for Underwater Acoustic Sensor Networks

2021 ◽  
Vol 10 (3) ◽  
pp. 2313-2323
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Acoustic Sensor ◽  
Packet Size ◽  
Underwater Acoustic Sensor Networks ◽  
Acoustic Sensor Networks ◽  
Selection Of

Underwater Acoustic Sensor Networks offer very promising solutions to monitor the aqueous environments. Due to the distinctive characteristics of UASNs, it is very challenging to design a routing protocol that can achieve maximum data delivery ratio in the network. The main challenge is the communication medium (acoustic links) that is subject to temporary attenuation and high bit error rate (BER), which limits the throughput efficiency of the Network. Besides this, another major issue is the continuous movement of nodes due to water currents and the availability of limited resources. Due to nodes mobility distance among sensor nodes and consequently, BER varies, which have a direct impact on packet size, hence, leads to high packet loss and low data delivery ratio. To achieve a high data delivery ratio, the selection of optimal packet size is of utmost importance. Consequently, the selection of next-hop forwarding node based on optimal packet size is needed. Therefore, in this paper, we propose an adaptive routing protocol named Adaptive Packet Size Selection Based Routing (APSSR) Protocol for UASNs. APSSR determines the optimal packet size adaptively based on both varying distances between sensor nodes and BER and selects the next hop based on optimal packet size and BER. The simulation results show greater network performance in terms of Network Lifetime, Data Reception Ratio at Sink node, Average Network Delay, Packet Reception Ratio, and Packets Drop Ratio

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 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.

Sign in / Sign up

Export Citation Format

Share Document