scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes

2018 ◽  
Vol 8 (8) ◽  
pp. 1344 ◽  
Author(s):  
Kyung Min Baek ◽  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Average Distance ◽  
Mobile Node ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Context Information ◽  
Delivery Ratio ◽  
Mobile Nodes

Delay tolerant network (DTN) protocol was proposed for a network where connectivity is not available. In DTN, a message is delivered to a destination node via store-carry-forward approach while using opportunistic contacts. Probabilistic routing protocol for intermittently connected networks (PRoPHET) is one of the widely studied DTN protocols. In PRoPHET, a message is forwarded to a contact node, if the contact node has a higher delivery predictability to the destination node of the message. In this paper, we propose an improved opportunistic routing protocol, where context information of average distance travelled and average time elapsed from the reception of a message to the delivery of the message to the destination node is used. In the proposed protocol, the average distance and average time are updated whenever a message is delivered to a destination node. Then, both average distance and average time as well as delivery predictability of PRoPHET protocol are used to decide a message forwarding. The performance of the proposed protocol is analyzed and compared with that of PRoPHET and reachable probability centrality (RPC) protocol, which is one of the latest protocols using the contact history information of a mobile node. Simulation results show that the proposed protocol has better performance than both PRoPHET and RPC, from the aspect of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

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 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 An Improved Hybrid Routing Protocol Combining MANET and DTN

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 439 ◽  
Author(s):  
Min Wook Kang ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delay Tolerant Network ◽  
Destination Node ◽  
Delivery Ratio ◽  
Virtual Source ◽  
Hybrid Routing ◽  
Hybrid Protocols ◽  
Hybrid Routing Protocol

Hybrid protocols combining a mobile ad hoc network (MANET) and a delay tolerant network (DTN) have recently been proposed. In these works, a whole network is fragmented, and MANET is generally used for intra-fragment communication, while DTN is used for inter-fragment communication. In this paper, an improved hybrid routing protocol was proposed, wherein virtual source nodes are selected based on the delivery predictability to the destination node if routing path to the destination node is not successfully established using MANET protocol. Then, messages are delivered to the destination node from the original source node and selected virtual source nodes. Performance evaluation results show that the proposed protocol with appropriate selection of delivery predictability threshold values has a better delivery ratio than conventional protocol, at the expense of overhead ratio in the considered parameter setting.

DPRoPHET Routing in Delay Tolerant Network

2013 ◽  
Vol 684 ◽  
pp. 543-546 ◽  
Author(s):  
Phearin Sok ◽  
Sueng Hwan Lee ◽  
Kee Cheon Kim
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Source Node ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Distance Metric ◽  
Probabilistic Routing ◽  
History Of ◽  
Simulation Results ◽  
Delay Tolerant

PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.

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.  

A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks

2021 ◽  
Vol 27 (1) ◽  
pp. 1-12
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay K. Dhurandher ◽  
Jagdeep Singh ◽  
Leonard Barolli
Keyword(s):  
Communication Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Fuzzy Controller ◽  
Opportunistic Networks ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Relay Nodes

Unlike communication networks which are traditionally assumed to be connected, Opportunistic networks (OppNets) are a type of wireless ad hoc networks with no guarantee of end-to-end path for data routing, which is due to node mobility, volatile links, and frequent disconnections. As such, data transmission among the nodes relies on their cooperation and this is realized in a store-and-carry fashion. To this end, several opportunistic routing techniques have been proposed in the literature, some of which using geocasting, a technique that consists of scheduling the message to a specific region toward its destination. This paper proposes a Fuzzy-based Check-and-Spray Geocast (FCSG) routing protocol for OppNets, in which a Check-and-Spray mechanism is used to control the message flooding within the destination cast and a fuzzy controller is used for selecting the suitable relay nodes to carry the message toward the destination, with the aim to improve the delivery ratio. Using simulations, the proposed FCSG protocol is shown to outperform the F-GSAF, GeoEpidemic and EECSG routing protocols in terms of overhead ratio, average latency, and delivery ratio, under varying number of nodes, buffer size, and Time-to-Live.

scholarly journals Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

scholarly journals AODV-UI Proof of Concept on MIPS-based Wireless Router

2014 ◽  
Vol 10 (1) ◽  
pp. 14
Author(s):  
B. Anantasatya Adhi ◽  
Ruki Harwahyu ◽  
Abdusy Syarif ◽  
Harris Simaremare ◽  
R. Fitri Sari ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Proof Of Concept ◽  
Mobile Nodes ◽  
Media Access ◽  
Wireless Router ◽  
Hardware Configuration ◽  
Aodv Routing Protocol

AODV routing protocol facilitates changing and simple-to-setup network environment. It helps setting up a network without sufficient infrastructure, such as in disaster area. Development of AODV protocol has gathered a worldwide research interest. However, not many researches implement AODV routing protocol in real mobile nodes and real MANET. In addition, real implementation deals with other works concerning underlying protocol, firmware and hardware configuration, as well as detailed topology both in logical and physical arrangement. This work aims to implements Ad-hoc On-demand Distant Vector – particularly University of Indonesia AODV (AODV-UI) routing protocol on low-end inexpensive generic wireless routers as a proof of concept. AODV-UI is an improved version of AODV routing protocol that implements gateway interconnection and reverse route capability. This routing protocol has been previously successfully tested in NS-2. In this work, current AODV-UI protocol is ported to OpenWRT + MIPS (Microprocessor without Interlocked Pipeline Stages) little endian architecture then tested on the real networking environment. Underlying media access layer is also altered to provide the protocol greater control over the network. Performance of this implementation is measured in terms of energy consumption, routing overhead, end-to-end delay, protocol reliability and packet delivery ratio.

scholarly journals Utility-Aware Enhanced Reliable Opportunistic Routing Protocol for Mobile Adhoc Networks

2019 ◽  
Vol 8 (2) ◽  
pp. 4187-4194
Keyword(s):  
Network Lifetime ◽  
Routing Protocol ◽  
Topology Control ◽  
Opportunistic Routing ◽  
Delivery Ratio ◽  
Mobile Adhoc Networks ◽  
Packet Delivery ◽  
Source Routing ◽  
Control Overhead ◽  
Adhoc Networks

Usually, the nodes in Mobile Adhoc Networks (MANET) are bounded with the limited power resources to interact with each other nodes without any backbone infrastructures. As a result, an allocation of unbalanced traffic among nodes may increase the power dissipation in the overloaded nodes and path failures that degrade the network lifetime. To tackle this problem, an on-demand Power and LoadAware (PLA) multipath node-disjoint source routing scheme was proposed based on the Dynamic Source Routing (DSR) protocol that uses a new cost function to determine the multiple nodedisjoint power and select the load-aware optimal paths to their destinations. However, this protocol was affected by control overhead and the reliable packet delivery was also not effective. Hence in this article, Power and Load-aware i.e., Utility-Aware Reliable Opportunistic Routing (UAROR) protocol is proposed to enhance the efficiency and reliability of the routing protocol. In this protocol, topology control and link lifetime prediction algorithms are integrated into the PLA algorithm to predict the effect of the node mobility on routing performance. The link prediction algorithm considers both mobility speed and direction for improving the accuracy. As well, an opportunistic topology control algorithm uses packet delivery ratio to maintain the node’s stability. Moreover, Utility-Aware Enhanced ROR (UAEROR) protocol is proposed to improve the node’s stability and reduce the control overhead by employing the neighbor detection algorithm that uses degree and reachability of nodes. Finally, the simulation results show that the effectiveness of the proposed protocol compared to the existing protocol in terms of throughput, end-to-end delay, packet delivery ratio, network lifetime, energy consumption and control overhead

Sign in / Sign up

Export Citation Format

Share Document