Performance optimization in delay tolerant networks using backtracking algorithm for fully credits distribution to contr
- PDF / 1,293,639 Bytes
- 20 Pages / 439.37 x 666.142 pts Page_size
- 53 Downloads / 167 Views
Performance optimization in delay tolerant networks using backtracking algorithm for fully credits distribution to contrast selfish nodes Atul Sharma1 · Nitin Goyal2 · Kalpna Guleria2 Accepted: 30 October 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Delay Tolerant Network (DTN) can be characterized as a heterogeneous network of nodes in which nodes mobility is high and resources are limited to transmit messages. In DTN, nodes use store, carry, and forward principle for delivering messages to the destination node. To forward messages through intermediate nodes may cause security issues in the network since there may exist a few selfish nodes. These nodes can affect the network’s performance as they may drop messages due to their limited resources such as energy and storage capacity. To handle this kind of hazard, it is necessary to propose a mechanism that may decrease the degree of the selfishness of nodes and improve the network’s delivery ratio by fully distributing credits to nodes. In this article, a credit-based mechanism has been proposed based on Combined Trust Value (CTV) of nodes in DTN. In the proposed mechanism, an agent is used to compute each node’s trust value grounded of the number of messages relayed by sensor nodes. This trust value is used to distribute credits to the nodes in a distributed manner without any partiality with nodes. Backtracking approach is used to distribute credits to boundary nodes deserving credits but didn’t get credits by agent node. The proposed mechanism is implemented using ONE simulator, and the performance of the projected scheme is analyzed in comparison to existing techniques Dynamic Trust, SMART (Secure Multilayer credit based incentive Technique) and Credit-based. The results exhibit that the suggested mechanism is superior than existing techniques with reference to various performance metrics like 25% higher delivery ratio, 41% less overhead, 21% less average message delay, and 28% less packets dropped. The proposed mechanism might be helpful in scenarios where the degree of selfishness is high, and the distribution of credit follows a fully distributed approach rather than an existing partial distribution used in existing techniques. Keywords Credit · DTN · Faith value · Selfish degree · Selfish node · ONE simulator * Nitin Goyal [email protected] Extended author information available on the last page of the article
13
Vol.:(0123456789)
A. Sharma et al.
1 Introduction In traditional wireless networks, the data are transmitted through intermediate nodes because the direct communication between every node is not possible [1]. In this type of scenario, the data transmission sometimes gets failed due to network partitioning or communication delay/packet drop. Delay Tolerant Network (DTN) plays a vital role in such scenarios, to transfer messages successfully. Each node has its own limited buffer memory to temporarily store messages until the message is forwarded to another relay node [2]. DTN provides a store, carr
Data Loading...