scholarly journals A centrality-based history prediction routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Amarpreet Bamrah
Keyword(s):  
Routing Protocol ◽  
High Mobility ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Radio Range ◽  
Communication Paradigm ◽  
The One ◽  
One Simulator ◽  
Delay Tolerant ◽  
Sparse Connectivity

Opportunistic networks are a subclass of delay tolerant networks based on a novel communication paradigm that aims at transmitting messages by exploiting direct contacts among nodes, without the need of a predefined infrastructure. Typical characteristics of OppNet include high mobility, short radio range, intermittent links, unstable topology, sparse connectivity, to name a few. As such, routing in such networks is a challenging task since it relies on node cooperation. This thesis focuses on using the concept of centrality to alleviate this task. Unlike other nodes in the network, central nodes are more likely to act as communication hubs to facilitate the message forwarding. In this thesis, a recently proposed History-Based Prediction Routing protocol is redesigned using this concept, yielding the so-called centrality-based HBPR protocol. The proposed CHBPR is evaluated by simulations using the ONE simulator, showing superior performance compared to HBPR without centrality and the Epidemic protocol with centrality.

scholarly journals A centrality-based history prediction routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Amarpreet Bamrah
Keyword(s):  
Routing Protocol ◽  
High Mobility ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Radio Range ◽  
Communication Paradigm ◽  
The One ◽  
One Simulator ◽  
Delay Tolerant ◽  
Sparse Connectivity

Opportunistic networks are a subclass of delay tolerant networks based on a novel communication paradigm that aims at transmitting messages by exploiting direct contacts among nodes, without the need of a predefined infrastructure. Typical characteristics of OppNet include high mobility, short radio range, intermittent links, unstable topology, sparse connectivity, to name a few. As such, routing in such networks is a challenging task since it relies on node cooperation. This thesis focuses on using the concept of centrality to alleviate this task. Unlike other nodes in the network, central nodes are more likely to act as communication hubs to facilitate the message forwarding. In this thesis, a recently proposed History-Based Prediction Routing protocol is redesigned using this concept, yielding the so-called centrality-based HBPR protocol. The proposed CHBPR is evaluated by simulations using the ONE simulator, showing superior performance compared to HBPR without centrality and the Epidemic protocol with centrality.

scholarly journals A history-based energy-efficient routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Khuram Khalid
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Opportunistic Network ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
One Simulator ◽  
Overhead Ratio

In this thesis, a history-based energy-efficient routing protocol (called AEHBPR) for opportunistic networks (OppNets) is proposed, which saves the energy consumption by avoiding unnecessary packets transmission in the network and by clearing the buffer of nodes carrying the copies of the already delivered packets. The proposed AEHBPR protocol is evaluated using the Opportunistic NEtwork (ONE) simulator with both synthetic and real mobility traces, showing a superior performance compared to the History-Based Prediction for Routing (HBPR) protocol and AEProphet, in terms of average remaining energy, number of dead nodes, number of delivered messages, and overhead ratio, where AEProphet is the ProPHet routing protocol for OppNets on which the same energy-aware mechanism has been implemented.

scholarly journals A history-based energy-efficient routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Khuram Khalid
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Opportunistic Network ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
One Simulator ◽  
Overhead Ratio

In this thesis, a history-based energy-efficient routing protocol (called AEHBPR) for opportunistic networks (OppNets) is proposed, which saves the energy consumption by avoiding unnecessary packets transmission in the network and by clearing the buffer of nodes carrying the copies of the already delivered packets. The proposed AEHBPR protocol is evaluated using the Opportunistic NEtwork (ONE) simulator with both synthetic and real mobility traces, showing a superior performance compared to the History-Based Prediction for Routing (HBPR) protocol and AEProphet, in terms of average remaining energy, number of dead nodes, number of delivered messages, and overhead ratio, where AEProphet is the ProPHet routing protocol for OppNets on which the same energy-aware mechanism has been implemented.

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

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 243 ◽  
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.

scholarly journals Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 504
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay Kumar Dhurandher ◽  
Jagdeep Singh ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Packet Transmission ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Hop Count

Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

scholarly journals Performance of Implementation IBR-DTN and Batman-Adv Routing Protocol in Wireless Mesh Networks

2016 ◽  
Vol 3 (1) ◽  
Author(s):  
Herman Yuliandoko ◽  
Sritrusta Sukaridhoto ◽  
M Udin Harun Al Rasyid ◽  
Nobuo Funabiki
Keyword(s):  
Wireless Mesh Networks ◽  
Routing Protocol ◽  
Mesh Networks ◽  
High Mobility ◽  
Network Connectivity ◽  
Test Bed ◽  
Data Packets ◽  
Wireless Mesh ◽  
Packet Data ◽  
Delay Tolerant

Wireless mesh networks is a network which has high mobility and flexibility network. In Wireless mesh networks nodes are free to move and able to automatically build a network connection with other nodes. High mobility, heterogeneous condition and intermittent network connectivity cause data packets drop during wireless communication and it becomes a problem in the wireless mesh networks. This condition can happen because wireless mesh networks use connectionless networking type such as IP protocol which it is not tolerant to delay. To solve this condition it is needed a technology to keep data packets when the network is disconnect. Delay tolerant technology is a technology that provides store and forward mechanism and it can prevent packet data dropping during communication. In our research, we proposed a test bed wireless mesh networks implementation by using proactive routing protocol and combining with delay tolerant technology. We used Batman-adv routing protocol and IBR-DTN on our research. We measured some particular performance aspect of networking such as packet loss, delay, and throughput of the network. We identified that delay tolerant could keep packet data from dropping better than current wireless mesh networks in the intermittent network condition. We also proved that IBR-DTN and Batman-adv could run together on the wireless mesh networks. In The experiment throughput test result of IBR-DTN was higher than Current TCP on the LoS (Line of Side) and on environment with obstacle.Keywords: Delay Tolerant, IBR-DTN, Wireless Mesh, Batman-adv, Performance

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.

scholarly journals Performance Comparison of Fresh and Spray & Wait Protocol through ONE Simulator

2021 ◽  
Vol 9 (2) ◽  
pp. 452-457
Author(s):  
Puneet Garg, Et. al.
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Performance Metrics ◽  
Opportunistic Networks ◽  
Performance Comparison ◽  
Intermittent Connectivity ◽  
Large Scope ◽  
Pros And Cons ◽  
One Simulator ◽  
Selection Of

Opportunistic Networks (OppNets) are becoming the prime interest for researchers day-by-day due to the large scope of further research into it. An opportunistic network is used to transmit data in an environment of intermittent connectivity. OppNet offers a variety of routing protocols based on different strategies. Each protocol has some pros and cons. Among the available ones, Fresh Routing Protocol and Spray-and-wait Routing Protocol are the most efficient routing protocols in terms of performance during data transmission. This paper aims to compare these two different routing protocols through simulation on the ground of standard performance metrics. It is believed that this simulation comparison will help upcoming researchers in the selection of appropriate routing protocol as per their requirement

scholarly journals Performance Evaluation of Social Routing Protocols Based on the Effect of Delivery Ratio and Average Hop Count in Delay-tolerant Networks (DTN)

2019 ◽  
Vol 4 (12) ◽  
pp. 155-158
Author(s):  
Sujan Chandra Roy ◽  
Farhana Enam ◽  
Md. Ashraful Islam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Destination Node ◽  
Delivery Ratio ◽  
Hop Count ◽  
Message Transmission ◽  
Delay Tolerant

Delay-Tolerant Networks (DTNs) are part of Opportunistic networks. In the case of opportunistic networks, the joined node of a network can have zero or partial knowledge about other nodes in a network. For this reason, the evident information towards the nodes in the existing network is most difficult to collect for forwarding the message. The application of Opportunistic networks is where have a high tolerance for long delays, high error rate, etc. DTNs are also sparse dynamic Ad-hoc networks were source to destination path does not present all-time for successfully message transmission. As DTN has no end-to-end path for message transmission source to destination node so, the routing design is so sophisticated. The social-based routing protocol is developed to improve the routing mechanism by focusing on social behavior and the interaction with the nodes of a network. Consequently, the performance analysis of existing several DTN routing protocols represents a significant role in designing or developing a new routing protocol for a specific scenario. This article investigates the execution of ordinary routing protocols of DTNs such as Epidemic, Binary Spray and Wait (BSNW), including two social-based routing protocols such as Scorp and dLife using Opportunistic Network Environment (ONE) simulator. The performance of these routing protocols is measured based on delivery ratio and average hop count with inevitable simulation settings. From the simulation result, it is condensed that for higher delivery ratio, BSNW is best, and for average hop count, dLife is the best routing protocol.  

scholarly journals Monitor Potential Attack Locations in a Specific Area within DTN Network

2021 ◽  
Vol 14 (2) ◽  
pp. 42
Author(s):  
IYAS ALODAT
Keyword(s):  
Routing Protocols ◽  
Specific Area ◽  
Delay Tolerant Networks ◽  
Delay Tolerance ◽  
Dtn Routing ◽  
Long Time ◽  
The One ◽  
One Simulator ◽  
Delay Tolerant ◽  
Complete Path

In this paper will discuss and examine message transmission from the attacker process within the scope of Delay Tolerance Networks (DTNs). DTNs are a new area of research that can be developed in networking. Delay-tolerant networks are those networks that may not have a complete path between networks end-to-end via direct links and may be under development for a long time. As part of the improvement, we will compare a survey of DTN routing protocols with a real region area, and then taking into account the possibilities of detecting the presence of areas of weakness that lead to penetration, which will occur in the nodes while on the move. In this study, we will use the ONE simulator to track messages within nodes.

Sign in / Sign up

Export Citation Format

Share Document