Memory Performance Optimization of Delay Tolerant Network Relay Node Based on Queuing Model

ABSTRAKAlgoritma routing pada jaringan klasik dapat berjalan jika hubungan end-to-end selalu ada.Algoritma routing ini bekerja dengan menggunakan informasi mengenai seluruh jalur yang tersedia.Untuk itu, pada jaringan dengan kondisi ekstrim seperti ini diperlukan algoritma routing yang sesuai.Salah satu algoritma routing yang dapat dijalankan pada Delay Tolerant Network (DTN) adalah First Contact.Algoritma iniakanmelakukan penggandaan pesan yang dibawanyauntuk kemudian diberikan kepada node lainnya yang pertama kali ditemui.Dalam penelitian ini ditambahkan stationary relay node untuk meningkatkan delivery probability.Dengan penambahan stationary relay node diperoleh peningkatan delivery probability 2 hingga 6% dibandingkan dengan jaringan tanpa stationary relay node. Parameter overhead ratio meningkat sebesar 7-18% dibandingkan jaringan tanpa Stationary relay node. Algoritma First Contact dengan tambahan Stationary relay nodejuga memberikan tambahan average latency, 118 – 171 detik.Nilaiini berbanding lurus dengan jumlah mobile node DTN yang ada pada area tersebut.Kata kunci: Delay Tolerant Network, first contact,Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency.ABSTRACTClassical routing algorithms only works if there is end to end connection.This algorithms uses the information about every available path, and then choose the best path related to spesific metric.. For the networks with the extreme condition, it is needed the suitable routing alorithms. One of the routing algorithms that is able to be applicated in Delay Tolerant Network (DTN) is First Contact. This algorithm will make a single copy message and then forward it to the first encountered node. In this research, the stationaryrelaynodes were added to improve delivery probability. The effect of adding stationary relay node is increasing the delivery probability about 2-6%, compared to networks without stationary relay node. The overhead ratio increased about 7-18% compared to networks without stationary relay node. First Contact algorithm with stationary relay node gives bigger average latency, 118 – 171 second. This value is directly proportional to the number of mobile DTN nodes that exist in the area.Keywords: Delay Tolerant Network, first contact, Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency..

Download Full-text

Performance Analysis of Multi-Copy Routing on Message Drop Control Source Relay (MDC-SR) and Stationary Relay Node in Delay Tolerant Network (DTN)

2019 International Conference on Sustainable Information Engineering and Technology (SIET) ◽

10.1109/siet48054.2019.8986115 ◽

2019 ◽

Author(s):

Heru Nurwarsito ◽

Dian Michael Ronaldo

Keyword(s):

Performance Analysis ◽

Relay Node ◽

Delay Tolerant Network ◽

Delay Tolerant ◽

Control Source

Download Full-text

A fair credit-based incentive mechanism for routing in DTN-based sensor network with nodes’ selfishness

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-020-01823-0 ◽

2020 ◽

Vol 2020 (1) ◽

Author(s):

Yuxin Mao ◽

Chenqian Zhou ◽

Ji Qi ◽

Xudong Zhu

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Real World ◽

Incentive Mechanism ◽

Relay Node ◽

Delay Tolerant Network ◽

Third Party ◽

Wireless Sensor ◽

Selfish Nodes ◽

Delay Tolerant

Abstract Due to the unguaranteed connectivity, wireless sensor networks based on delay tolerant network (DTN) are typically characterized by the opportunistic forwarding mechanism in transmission. Such a mechanism requires nodes to participate in forwarding messages actively. However, when the mechanism is used in the real world, selfish nodes will exhibit some non-cooperation behaviors. Therefore, some incentive mechanism may be designed to encourage selfish nodes. In order to solve the selfishness problem, we propose a fair credit-based incentive mechanism for routing in DTN-based sensor networks. In this mechanism, when a source node sends messages to its destination, each relay node will be rewarded with some credits. The accumulated credits are then used to evaluate the level of cooperation in the network. The selfish nodes with few credits are not able to get enough service from other nodes. With the fair incentive, all participating relays will get equal rewards by the trusted third party. In order to evaluate the proposed mechanism, we also perform some simulation, and the results demonstrate that the method can be used to support efficient routing for DTN-based sensor networks.

Download Full-text

Analisis Unjuk Kerja Protokol Spray and Focus di Jaringan Opportunistic

AITI ◽

10.24246/aiti.v15i1.67-74 ◽

2018 ◽

Vol 15 (1) ◽

pp. 67-74

Author(s):

Maria Hilary ◽

Bambang Soelistijanto

Keyword(s):

Routing Protocol ◽

Relay Node ◽

Delay Tolerant Network ◽

Destination Node ◽

Delivery Probability ◽

Performance Matrix ◽

Result Show ◽

Working Day ◽

One Simulator ◽

Delay Tolerant

Delay Tolerant Network (DTN) is a wireless connection which does not need infrastructure in its formation. In this research the writer test the performance of a spray and focus routing protocol in opportunistic network using ONE SIMULATOR. Performance matrix used are delivery probability, overhead, delay, and drop. Scenario used in every test are increasing the number of nodes, increasing the number of copy pesan, additional TTL (time-to-live), and addition of buffer capacity. The test result show that spray and focus routing protocol is better in working day movement when TTL is increasing because spray and focus uses transitivity to choise the best relay node so the message can reach its destination in a shorter time even though nodes are often forming a community. The delivery probabilty reached 99.4% which is mean in every 100 messages, 99 messages are sucessfully delivered to destination node.

Download Full-text

Detecting Blackhole Attack using Encounter Records on Multi-Copy Routing Protocols in Delay Tolerant Networks (DTN)

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.c1034.0193s20 ◽

2020 ◽

Vol 9 (3S) ◽

pp. 152-157

Keyword(s):

Relay Node ◽

Delay Tolerant Network ◽

Delivery Ratio ◽

Detection Accuracy ◽

Relay Nodes ◽

Malicious Nodes ◽

Blackhole Attack ◽

Delay Tolerant ◽

The Impact ◽

Spray And Wait

Delay Tolerant Network (DTN) is a solution for intermittent connectivity and high delay. However, due to constrained connectivity, DTN is vulnerably susceptible to Blackhole attacks in which malicious nodes will drop all packets received from source nodes or relay nodes. The impact of a Blackhole attack can reduce the packet delivery ratio and waste resources from relay nodes that carry and forward messages. The encounter record scheme is one solution that can be applied to detect Blackhole attacks on the DTN. The encounter record mechanism is performed by utilizing a relay node that will store several records obtained from encounters between previous nodes, then the node will detect when a packet has dropped and a blacklist is performed on the node detected as a malicious node. Based on testing the performance of the routing protocol obtained that the encounter record scheme is able to detect malicious nodes so that it can again increase the delivery ratio and overhead ratio. The simulation results of this research showed that the Encounter Record has successfully detected Blackhole attacks with an average detection time of 1,5992 seconds in the spray-and-wait routing and 1,5342 seconds in the epidemic routing for 15 malicious nodes. Detection accuracy is 100% on spray-and-wait routing and 73,85% on routing epidemic for 15 malicious nodes.

Download Full-text