Analisis Unjuk Kerja Protokol Spray and Focus di Jaringan Opportunistic

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

An Improved PRoPHET Routing Protocol in Delay Tolerant Network

The Scientific World JOURNAL ◽

10.1155/2015/623090 ◽

2015 ◽

Vol 2015 ◽

pp. 1-7 ◽

Cited By ~ 12

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.

Download Full-text

An Optimized Probabilistic Delay Tolerant Network (DTN) Routing Protocol Based on Scheduling Mechanism for Internet of Things (IoT)

Sensors ◽

10.3390/s19020243 ◽

2019 ◽

Vol 19 (2) ◽

pp. 243 ◽

Cited By ~ 16

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.

Download Full-text

RPRTD: Routing protocol based on remaining time to encounter nodes with destination node in delay tolerant network using artificial neural network

Peer-to-Peer Networking and Applications ◽

10.1007/s12083-020-00873-x ◽

2020 ◽

Vol 13 (5) ◽

pp. 1406-1422 ◽

Cited By ~ 1

Author(s):

Ahmad Karami ◽

Nahideh Derakhshanfard

Keyword(s):

Neural Network ◽

Artificial Neural Network ◽

Routing Protocol ◽

Delay Tolerant Network ◽

Destination Node ◽

Artificial Neural ◽

Delay Tolerant ◽

Remaining Time

Download Full-text

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

ELKOMIKA Jurnal Teknik Energi Elektrik Teknik Telekomunikasi & Teknik Elektronika ◽

10.26760/elkomika.v4i2.123 ◽

2018 ◽

Vol 4 (2) ◽

pp. 123 ◽

Cited By ~ 1

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

Download Full-text

Enhancement of Binary Spray and Wait Routing Protocol for Improving Delivery Probability and Latency in a Delay Tolerant Network

Lecture Notes in Networks and Systems - Advances on Broad-Band Wireless Computing, Communication and Applications ◽

10.1007/978-3-030-33506-9_10 ◽

2019 ◽

pp. 105-113 ◽

Cited By ~ 1

Author(s):

Evjola Spaho ◽

Klodian Dhoska ◽

Leonard Barolli ◽

Vladi Kolici ◽

Makoto Takizawa

Keyword(s):

Routing Protocol ◽

Delay Tolerant Network ◽

Delivery Probability ◽

Delay Tolerant ◽

Spray And Wait

Download Full-text

Routing in Opportunistic Networks: Implementation and Research Challenges

Journal of Engineering Research ◽

10.36909/jer.icari.15273 ◽

2021 ◽

Author(s):

Rahul Sachdeva ◽

◽

Amita Dev ◽

Keyword(s):

Relay Node ◽

Opportunistic Networks ◽

Network Routing ◽

Literature Survey ◽

Delay Tolerant Network ◽

Destination Node ◽

Extensive Literature ◽

Opportunistic Network ◽

Open Problems ◽

One Simulator

Opportunistic Networks can be defined as Delay Tolerant Network, which are formed dynamically with participating nodes’ help. Opportunistic Networks follows Store-Carry-Forward principle to deliver/route the data in the network. Routing in Opportunistic Network starts with the Seed Node (Source Node) which delivers the data with the help of Intermediate nodes. Intermediate nodes store the data while roaming in the network until it comes in contact with appropriate forwarding node (relay node) or destination node itself. An extensive literature survey is performed to analyse various routing protocols defined for Opportunistic Network. With mobility induced routing, establishing and maintaining the routing path is a major challenge. Further, Store-Carry-Forward routing paradigm imposes various challenges while implementing and executing the network. Due to the unavailability of the suitable relay node, data needs to be stored within the Node’s Memory, imposes buffer storage issues at the node level. Also, uncontrolled flooding may impose link-level Congestion and treated as overhead to maintain the network. Another major challenge can be maintaining the energy level of the nodes in the network. Recently developed ONE (Opportunistic Network Environment) Simulator is used to simulate and emulate the environment required by Opportunistic Network. Along with the extensive literature survey of the protocols, few of the existing protocols viz. Direct Delivery, ProPHET, Epidemic and Spray & Wait Routing are implemented using ONE Simulator to analyse their performance while in execution. Results are being compared, and the researchers’ future direction is identified to address the open problems and challenges in Opportunistic Network.

Download Full-text