scholarly journals Analisis Performansi Algoritma Routing First Contact dengan Stationary Relay Node pada Delay Tolerant Network

2018 ◽  
Vol 4 (2) ◽  
pp. 123 ◽  
Author(s):  
LEANNA VIDYA YOVITA ◽  
JODI NUGROHO RESTU
Keyword(s):  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Delay Tolerant Network ◽  
Delivery Probability ◽  
Average Latency ◽  
End To End ◽  
Delay Tolerant ◽  
First Contact ◽  
Overhead Ratio

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

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 Analisis Unjuk Kerja Protokol Spray and Focus di Jaringan Opportunistic

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

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

2020 ◽  
Vol 57 (17) ◽  
pp. 170608
Author(s):  
冀常鹏 Ji Changpeng ◽  
韩星美 Han Xingmei ◽  
冀雯馨 Ji Wenxin
Keyword(s):  
Performance Optimization ◽  
Memory Performance ◽  
Relay Node ◽  
Delay Tolerant Network ◽  
Queuing Model ◽  
Delay Tolerant

scholarly journals DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Hezhe Wang ◽  
Hongwu Lv ◽  
Huiqiang Wang ◽  
Guangsheng Feng
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Movement Trajectory ◽  
Average Delay ◽  
Urban Scenario

When a delay/disruption tolerant network (DTN) is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

scholarly journals Vehicular Delay Tolerant Network Routing Algorithm Based on Bayesian Network

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 18727-18740 ◽  
Author(s):  
Jiagao Wu ◽  
Yahang Guo ◽  
Hongyu Zhou ◽  
Lu Shen ◽  
Linfeng Liu
Keyword(s):  
Bayesian Network ◽  
Routing Algorithm ◽  
Network Routing ◽  
Delay Tolerant Network ◽  
Delay Tolerant

scholarly journals A Novel Routing Scheme for Creating Opportunistic Context-Virtual Networks in IoT Scenarios

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1875 ◽  
Author(s):  
Jaime Galán-Jiménez ◽  
Javier Berrocal ◽  
Jose Garcia-Alonso ◽  
Manuel Jesús Azabal
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Routing ◽  
Routing Algorithms ◽  
Limited Capacity ◽  
Virtual Networks ◽  
Battery Lifetime ◽  
Virtual Groups ◽  
Intermittent Connectivity ◽  
Delivery Probability ◽  
Carry And Forward

The massive amount of traffic required by the emerging Internet of Things (IoT) paradigm can be supported by the imminent arrival of 5G next-generation networks. However, the limited capacity of resources in IoT nodes, e.g., battery lifetime or buffer space, opens a challenge to be taken into account when proposing new routing solutions on IoT scenarios with intermittent connectivity. In this paper, we propose the concept of Opportunistic Context-Virtual Networks (OCVNs). The novelty of this approach is to create virtual groups of nodes that share interests in common for routing purposes. Therefore, only the nodes that are interested in the content of the messages that are flowing throughout the network are used as relaying nodes, providing their own resources for the sake of the communication. By leveraging the use of store-carry-and-forward mechanisms, a novel routing algorithm is proposed and evaluated over two realistic scenarios. Experimental results reveal that our solution outperforms other well-known opportunistic routing algorithms in terms of delivery probability and overhead ratio, while resource usage of relaying nodes is significantly reduced.

Sign in / Sign up

Export Citation Format

Share Document