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

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

scholarly journals TEKNIK KOMUNIKASI DATA PADA AD HOC NETWORK COMMUNICATION

2014 ◽  
Vol 11 (2) ◽  
Author(s):  
Budi Rahmadya
Keyword(s):  
Mobile Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Data Communication ◽  
High Mobility ◽  
Delay Tolerant Network ◽  
Network Communication ◽  
Destination Node ◽  
Delivery Ratio ◽  
Data Packets

Ad Hoc Network Communication is mobile networks communications and have a high mobility for each of its nodes. This type of network communications is a temporary networkwith utilizing a WiFi network or Bluethoot as a medium of communications. In the entirenetwork, node moves with a speed varying and unpredictable direction. Packets data delivery from the source node to destination node by using an ad hoc network requires its owntechniques. In this research discussed the existing data communication technique inVehicular Ad Hoc Network (VANETs) Communications with attention: Broadcasting Time, Routing Protocol, Message Dissemination, Delay Tolerant Network Dissemination and / DTN.These techniques can increase the delivery ratio / sending data packets to the destination as well as a smaller delay time. In order to maintain the integrity of the data packets received bythe destination node, the authors have proposed a method of duplicate messages in thisresearch.

The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET

2013 ◽  
Vol 5 (2) ◽  
pp. 46-57
Author(s):  
Naseer Ali Husieen ◽  
Suhaidi Hassan ◽  
Osman Ghazali ◽  
Lelyzar Siregar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobility Model ◽  
Network Size ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Dynamic Source

This paper evaluates the performance of Reliable Multipath Dynamic Source Routing Protocol (RM-DSR) protocol with different network size compared to DSR protocol. RM-DSR developed in the mobile ad-hoc network to recover from the transient failure quickly and divert the data packets into a new route before the link is disconnected. The performance of RM-DSR protocol is tested in the Network Simulator (NS-2.34) under the random way point mobility model with varying number of mobile nodes. The network size parameter is used to investigate the robustness and the efficiency of RM-DSR protocol compared to DSR protocol. The network size affects the time of the route discovery process during the route establishment and the route maintenance process which could influence the overall performance of the routing protocol. The simulation results indicate that RM-DSR outperforms DSR in terms of the packet delivery ratio, routing overhead, end-to-end delay, normalized routing load and packet drop.

scholarly journals Securing cluster based routing against cooperative black hole attack in mobile ad hoc network

2018 ◽  
Vol 7 (1.9) ◽  
pp. 6 ◽  
Author(s):  
Pandi Selvam Raman ◽  
Shankar K ◽  
Ilayaraja M
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Destination Node ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Mobile Ad Hoc ◽  
Cluster Based Routing

Mobile ad hoc networks (MANETs) are wireless infrastructure-less network consisting collection of autonomous nodes that communicate with each other in decentralized manner. Security remains major challenge due to its some unique characteristics like open medium, mobility and hence topology changes. Therefore, routing protocol for MANETs is much vulnerable to attacks. Black Hole is a type of attack, where malicious node falsely advertises itself having the shortest or optimal path to the destination node. This attack is more dangerous while a group of nodes are cooperating with each other.The objective of this paper is to design cluster based routing protocol and prevent it from the black hole attack. The simulation results show improvement in packet delivery ratio and control overhead.

Reliable and Energy Efficient Routing Protocol for Under Water Sensor Networks

2017 ◽  
Vol 13 (2) ◽  
pp. 14-26
Author(s):  
Fatima Al-Shihri ◽  
Mohammed Arafah
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Residual Energy ◽  
Link Quality ◽  
Destination Node ◽  
Delivery Ratio ◽  
Energy Efficient Routing ◽  
Packet Delivery ◽  
Forwarding Node ◽  
Water Sensor

The authors proposed a Reliable and energy efficient Routing Protocol (RRP) for underwater sensor network, integrating the desired features of the Directional Flooding based Routing (DFR) and Vector Based Void Avoidance (VBVA) protocols. The new algorithm considers reliability and takes into consideration the residual energy for each node before choosing the forwarding node. RRP relies on a packet flooding technique to increase reliability. However, to prevent a packet from flooding to the whole network, they control the number of nodes forwarding a packet by measuring a link quality between nodes in a hop by hop. To mitigate the effect of the inherent void problem, the authors consider residual energy, link quality, and distance from destination node to choose a reliable path to forward packet to destination. The authors observe that RRP protocol has better performance in terms of the packet delivery ratio than the DFR protocol due to the void avoidance technique.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Sign in / Sign up

Export Citation Format

Share Document