Mobility-Based Routing in Opportunistic Networks

2012 ◽  
Vol 3 (2) ◽  
pp. 28-35
Author(s):  
Shivan Fazil Kurdi
Keyword(s):  
Opportunistic Networks ◽  
Routing Algorithms ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Objects ◽  
Network Bandwidth ◽  
Research Findings ◽  
Complete Path ◽  
Intermittently Connected

In Opportunistic Networks (OppNets) nodes are only intermittently connected. A complete path from the sender node to the receiver does not exist. Mobile objects exploit direct contact for message transmission without relying on an existing end to end infrastructure. In such networks, routing is a challenging issue. Nevertheless, routing protocols in the mobility-based class of OppNets exploit some context information such as node mobility information and patterns to make forwarding decision, since the effectiveness of routing depends on node mobility. The aim of this research is to identify, evaluate, and compare the mobility-based routing algorithms of OppNets based on the simulation results obtained from published literature. The research findings indicate that mobility-based algorithms are suitable for conditions where network bandwidth and devices are considered significant constraints. They provide average delivery ratio with less resource consumption. In brief, they are ideal when network traffic and resource consumption are taken into consideration.

scholarly journals Low Overhead Localized Routing in Mobile Ad Hoc Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Sumet Prabhavat ◽  
Worrawat Narongkhachavana ◽  
Thananop Thongthavorn ◽  
Chanakan Phankaew
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Opportunistic Networks ◽  
Practical Implementation ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Network Bandwidth ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, especially smartphones and tablets. Mobile Ad Hoc Networks (MANETs), one of OppNets technologies, have a high potential to be used for facilitating an extension for the Internet and a backup communication platform in disaster situation. However, a connection disruption due to node mobility and unreliable wireless links is possible to trigger a flooding operation of route repair process. This results in transmission delay and packet loss. The flooding of routing packets is an expensive operation cost in MANETs which affects network reliability and wastes limited resources such as network bandwidth and node energy. These are obstacles to practical implementation of MANETs in real-world environment. In this paper, we propose Low Overhead Localized Flooding (LOLF), an efficient overhead reduction routing extension based on Query Localization (QL) routing protocol. The purpose of this work is to control the propagation of routing packets in the route discovery and route repair mechanisms while incurring only a small increase in the size of control information in the packet. Simulation results from extensive experiments show that our proposed method can reduce overall routing overhead, energy consumption, and end-to-end delay without sacrificing the packet delivery ratio compared to existing protocols.

scholarly journals Routing Algorithm Based on Trajectory Prediction in Opportunistic Networks

Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 49 ◽  
Author(s):  
Peijun Zou ◽  
Ming Zhao ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Network Topology ◽  
Dynamic Change ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Link Quality ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Trajectory Prediction ◽  
Routing Performance

Due to the dynamic change of the opportunistic network topology and the lack of stable information transmission paths between nodes, the traditional topology-based routing algorithm cannot achieve the desired routing performance. To address of this problem, this paper proposes a routing algorithm based on trajectory prediction (RATP). The routing protocol based on trajectory prediction can efficiently and quickly adapt to the network link quality instability and the dynamic changes of network topology. RATP algorithm constructs a node mobility model by analyzing the historical mobility characteristics of the nodes. According to the node prediction information, the metric value of the candidate node is calculated, and the node with the smaller metric value is selected as the data forwarding node, which can effectively reduce the packet loss rate and avoids excessive consumption. Simulation results show that compared with other algorithms, the proposed algorithm has higher data delivery ratio, and end-to-end data delay and routing overhead are significantly reduced.

Optimized Replication Strategy for Intermittently Connected Mobile Networks

2012 ◽  
Vol 8 (1) ◽  
pp. 1-18 ◽  
Author(s):  
C. Poongodi ◽  
A. M. Natarajan
Keyword(s):  
Mobile Networks ◽  
Mobile Ad Hoc Network ◽  
Relay Node ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
High Resource ◽  
Maximum Delay ◽  
Replication Strategy ◽  
Network Overhead ◽  
Intermittently Connected

Intermittently Connected Mobile Networks (ICMNs) are wireless networks where due to mobility of nodes and lack of connectivity, there may be disconnection among the nodes. Hence, the routing path from source to destination is not always available. In this case, Mobile Ad-hoc Network (MANET) protocols will not be utilized. In these networks, messages are to be flooded or multiple replications are needed to withstand the maximum delay and achieve the high delivery ratio. But multiple replication based protocols result in increased network overhead and high resource consumption because of uncontrolled replication. In this paper, the authors introduce a new simple scheme which applies knapsack policy based replication strategy in replicating the messages. The number of replication is reduced by appropriately selecting only limited messages based on the number of duplications of its own and its size. The messages are selected for forwarding to relay node based on the goodness of the relay node in contacting the destination and the buffer size of the relay node. Therefore, only limited messages will be replicated in the network and it will reduce the network overhead, resource consumption, delivery delay and increases the delivery ratio.

Replica Reduced Routing Protocol for Intermittent Connected Networks in Emergency Scenarios

2019 ◽  
Vol 10 (2) ◽  
pp. 84-109 ◽  
Author(s):  
M. Syed Rabiya ◽  
R. Ramalakshmi
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Delivery Rate ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Rescue Operation ◽  
Packet Delivery ◽  
Partitioned Networks ◽  
A New Technique ◽  
Emergency Scenarios

In an Intermittent Connected Networks / Opportunistic Networks, routing protocols follow store-carry-forward routing mechanism to deliver messages to destination. One of the application scenarios which makes use of opportunistic networks to route the packet from source to destination is an Emergency Search and Rescue operation where rescuer nodes get partitioned frequently and carry out their rescue activities in different locations. As wireless device has a short transmission range, communication between any two partitioned networks occurs only through the node mobility. The Probability based Routing, provides high packet delivery rate with high overhead. In this paper, a new technique called Replica Reduced and Energy-based routing protocol (REB) is proposed to control the replicas and increase the packet delivery ratio in emergency scenarios. Through simulation, this article demonstrates that the proposed system increases delivery rate and reduces overhead and energy consumption considerably, resulting in increased life span of the network.

Buffer Managed Multiple Replication Strategy Using Knapsack Policy for Intermittently Connected Mobile Networks

2014 ◽  
pp. 1-22
Author(s):  
C. Poongodi ◽  
A. M. Natarajan
Keyword(s):  
Mobile Networks ◽  
Relay Node ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
Global Knowledge ◽  
High Resource ◽  
Replication Strategy ◽  
Long Time ◽  
Network Overhead ◽  
Intermittently Connected

Intermittently Connected Mobile Networks (ICMNs) are a kind of wireless network where, due to mobility of nodes and lack of connectivity, there may be disconnections among the nodes for a long time. To deal with such networks, store-carry-forward method is adopted for routing. This method buffers the messages in each node for a long time until a forwarding opportunity comes. Multiple replications are made for each message. It results in an increase in network overhead and high resource consumption because of uncontrolled replications. Uncontrolled replications are done due to lack of global knowledge about the messages and the forwarding nodes. The authors introduce a new simple scheme that applies knapsack policy-based replication strategy while replicating the messages residing in a node buffer. The numbers of replications are controlled by appropriately selecting messages based on the total count on replications already made and the message size. In addition, the messages are selected for forwarding based on the relay node goodness in contacting the destination and the remaining buffer size of that relay node. Therefore, useful replications are made based on the dynamic environment of a network, and it reduces the network overhead, resource consumption, delivery delay, and in turn, increases the delivery ratio.

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 FSF: Applying Machine Learning Techniques to Data Forwarding in Socially Selfish Opportunistic Networks

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2374 ◽  
Author(s):  
Camilo Souza ◽  
Edjair Mota ◽  
Diogo Soares ◽  
Pietro Manzoni ◽  
Juan-Carlos Cano ◽  
...  
Keyword(s):  
Social Ties ◽  
Relay Node ◽  
Opportunistic Networks ◽  
Machine Learning Techniques ◽  
Delivery Ratio ◽  
Critical Element ◽  
Node Mobility ◽  
Additional Advantage ◽  
Promising Alternative ◽  
The Social

Opportunistic networks are becoming a solution to provide communication support in areas with overloaded cellular networks, and in scenarios where a fixed infrastructure is not available, as in remote and developing regions. A critical issue, which still requires a satisfactory solution, is the design of an efficient data delivery solution trading off delivery efficiency, delay, and cost. To tackle this problem, most researchers have used either the network state or node mobility as a forwarding criterion. Solutions based on social behaviour have recently been considered as a promising alternative. Following the philosophy from this new category of protocols, in this work, we present our “FriendShip and Acquaintanceship Forwarding” (FSF) protocol, a routing protocol that makes its routing decisions considering the social ties between the nodes and both the selfishness and the device resources levels of the candidate node for message relaying. When a contact opportunity arises, FSF first classifies the social ties between the message destination and the candidate to relay. Then, by using logistic functions, FSF assesses the relay node selfishness to consider those cases in which the relay node is socially selfish. To consider those cases in which the relay node does not accept receipt of the message because its device has resource constraints at that moment, FSF looks at the resource levels of the relay node. By using the ONE simulator to carry out trace-driven simulation experiments, we find that, when accounting for selfishness on routing decisions, our FSF algorithm outperforms previously proposed schemes, by increasing the delivery ratio up to 20%, with the additional advantage of introducing a lower number of forwarding events. We also find that the chosen buffer management algorithm can become a critical element to improve network performance in scenarios with selfish nodes.

Friend-Based Prediction Routing Protocol in Socially-Aware Opportunistic Networks

2014 ◽  
Vol 519-520 ◽  
pp. 241-244
Author(s):  
Li Liu
Keyword(s):  
Mobile Devices ◽  
Routing Protocol ◽  
Social Relationship ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Average Latency ◽  
Simulation Results ◽  
Carry And Forward ◽  
Intermittently Connected

Mobile devices are popular used in peoples life. Generally, most of portable mobile devices are carried by people. Thus, the mobility of mobile devices is influenced heavily by peoples social relationship. Socially-aware Opportunistic Networks are used in intermittently connected networks by use of store-carry-and-forward fashion. It is mainly based on social relationship to design solutions for problem such as routing protocol or data dissemination. In this paper, we exploit social relationship about friendships information among people and use them to predict the contact opportunities. We present Friend-based Prediction routing protocol (FBP) and establish experiment based on ONE. The simulation results show that the efficiency of FBP outperforms Epidemic and PROPHET in higher delivery ratio, lower overhead and shorter average latency.

A Community-Based Message Transmission Algorithm for Opportunistic Networks

2013 ◽  
Vol 427-429 ◽  
pp. 2333-2337
Author(s):  
Zhi Ren ◽  
Yan Wei Liu ◽  
Shuang Peng ◽  
Ji Bi Li
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Transmission Condition ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Community Based ◽  
Delivery Delay ◽  
Message Transmission ◽  
Simulation Results ◽  
Determination Mechanism

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.

scholarly journals Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

2018 ◽  
Vol 10 (8) ◽  
pp. 74 ◽  
Author(s):  
Kanghuai Liu ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Yutong Xiao ◽  
Heng Zhang
Keyword(s):  
Opportunistic Networks ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Complex Data ◽  
Relay Nodes ◽  
End To End Delay ◽  
The Social ◽  
Optimal Stopping Theory ◽  
Social Scene ◽  
End To End

In the social scene of opportunistic networks, message applications find suitable relay nodes or certain transmission destinations from the surrounding neighbors through specific network addresses of users. However, at the dawn of big data and 5G networks, the variational location information of nodes is difficult to be available to mobile devices all the time, and a long wait for the destination may cause severe end-to-end delay. To improve the transmission environment, this study constructs an efficient routing-delivery scheme (Predict and Forward) based on node profile for the opportunistic networks. The node profile effectively characterizes nodes by analyzing and comparing their attributes instead of network addresses, such as physical characteristics, places of residence, workplaces, occupations or hobbies. According to the optimal stopping theory, this algorithm implements the optimal transmission for Prelearn messages by dividing the complex data transmission process into two different phases (Predict and Forward). Through simulations and the comparison of routing algorithms in opportunistic networks, the proposed strategy increases the delivery ratio by 80% with the traditional methods on average, and the average end-to-end delay in this algorithm is the lowest.

Sign in / Sign up

Export Citation Format

Share Document