Harris Hawks Jaya Algorithm-Based Routing Protocol in Delay Tolerant Network

Author(s):  
Pradosh Kumar Gantayat ◽  
Satyabrata Das

This paper introduces a trust-based multipath routing protocol for exploiting different paths between source as well as destination to mitigate energy constraints. The key idea is to determine optimal path from the entire paths available among source and target node. To improve the security in routing protocol, the factors, like trust factors, and distance are considered as major components. Based on these parameters, the multipath routing is carried out based on HH-Jaya Algorithm. The HH-Jaya is designed newly by integrating Harris Hawks Optimization (HHO) and Jaya Algorithm. After that, the reputation and trust-based context aware routing (RCAR) protocol is utilized to select the optimal path with more trust factor. Here, the trust is modelled by considering trust factors, like direct, indirect, history, forwarding rate, and availability factors, in addition to the utility function. The proposed HH-Jaya outperformed other methods with minimal delay of 0.007 sec, maximal throughput of 0.913 for 10 user and maximal packet deliver rate (PDR) of 0.991 for 20 users respectively.

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 243 ◽  
Author(s):  
Yuxin Mao ◽  
Chenqian Zhou ◽  
Yun Ling ◽  
Jaime Lloret

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.


2014 ◽  
Vol 13 (2) ◽  
pp. 4237-4247 ◽  
Author(s):  
Pravesh S Patel ◽  
Hemal Shah ◽  
Yogeshwar Kosta

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.


2018 ◽  
Vol 7 (3) ◽  
pp. 1299
Author(s):  
Dhanabal S ◽  
Dr Amudhavalli P ◽  
Dr Prasanna Venkatesan G. K. D ◽  
Dr Prasanna Venkatesan G. K. D

Delay tolerant networks are widely used in mobile communications because of network withstanding capability of delay. However, when the connectivity of nodes increases, data loss may occur while transmission. Due to the malicious behavior of nodes the data may get permanently lost, which is known as black hole attacks and there is a chance to partial data loss because of the lower energy level of a node, which is known as a gray hole attack. In existing work, the data capacity of a node is not limited, so most of the highly energy efficient node contains a huge amount of data, when compared to other nodes which may lead to random attack. To overcome this, we propose a subjective capability model (SCM) for each and every node to limit the capacity of each node. ASF-DTN prevents collision attack and injection attack by implementing Kalman filtering, which can statistically analyze the behavior of nodes while each and every transmission. Here, we propose an effective node optimization scheme using genetic algorithm with a fitness function to find out energy efficient nodes among the optimal path for effective communication and its performance.  


Sign in / Sign up

Export Citation Format

Share Document