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.

scholarly journals An Improved SimBet Routing Algorithm for Human Mobility Based DTN

10.29007/c28h ◽  
2018 ◽  
Author(s):  
Mehul Shah ◽  
Nikhil Gondaliya ◽  
Avani Barad
Keyword(s):  
Past History ◽  
Human Mobility ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Delay Tolerant Network ◽  
Pause Time ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Least Action ◽  
Routing Performance

Delay Tolerant Network (DTN) is useful for providing communication, where internet connection does not exist or in an Environment where long delay path and frequent partitions in transmission is present. A critical challenge for DTN is to determine the routing path through the network without ever having an end to end path, or finding which routers will be connected at any given instant of time. To find a routing path mobility of user needs attention, here we use human mobility model: Self Similar Least Action Walk (SLAW). In this paper, we extract pause time from past history of human mobility and utilize for routing in DTN. This concept will improve routing performance. In this paper, we propose the Multi-copy SimBet Routing with pause time factor. Finally, we conclude that the proposed routing method gives a message delivery ratio nearly equal to the Epidemic Routing, also reduce latency and overhead of the network.

An Efficient Cluster-Based Flooding Using Fuzzy Logic Scheme (CBF2S) In Mobile Adhoc Networks

2020 ◽  
Vol 14 ◽  
Author(s):  
S. Mahima ◽  
N. Rajendran
Keyword(s):  
Fuzzy Logic ◽  
Ad Hoc ◽  
Link Quality ◽  
Traffic Load ◽  
Node Degree ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Centralized Control ◽  
Hop Count

: Mobile ad hoc networks (MANET) hold a set of numerous mobile computing devices useful for communication with one another with no centralized control. Due to the inherent features of MANET such as dynamic topology, constrained on bandwidth, energy and computing resources, there is a need to design the routing protocols efficiently. Flooding is a directive for managing traffic since it makes use of only chosen nodes for transmitting data from one node to another. This paper intends to develop a new Cluster-Based Flooding using Fuzzy Logic Scheme (CBF2S). To construct clusters and choose proper cluster heads (CHs), thefuzzy logic approach is applied with the use of three parameters namely link quality, node mobility and node degree. The presented model considerably minimizes the number of retransmissions in the network. The presented model instructs the cluster members (CM) floods the packets inside a cluster called intra-cluster flooding and CHs floods the packets among the clusters called inter-cluster flooding. In addition, the gateway sends a packet to another gateway for minimizing unwanted data retransmissions when it comes under different CH. The presented CBF2S is simulated using NS2 tool under the presence of varying hop count. The CBF2S model exhibits maximum results over the other methods interms of overhead, communication overhead, traffic load, packet delivery ratio and the end to end delay.

scholarly journals Exponential Genetic Algorithm-Based Stable and Load-Aware QoS Routing Protocol for MANET

2017 ◽  
Vol 26 (4) ◽  
pp. 669-682
Author(s):  
A. Rama Rao ◽  
V. Valli Kumari ◽  
Ch. Satyananda Reddy
Keyword(s):  
Genetic Algorithm ◽  
Exponential Function ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Multimedia Data ◽  
Link Quality ◽  
Delivery Ratio

AbstractAs the actual links in mobile ad hoc networks (MANETs) are dynamic, the feasible path generated may not exist during the transmission of multimedia data. There is a need for generating multiple paths for guaranteed transmission. The multi-path finding can be achieved through a genetic-based algorithm that faces the major challenge in quality-of-service (QoS)-aware routing. To enhance the QoS communication over the MANETs, an exponential genetic algorithm (GA)-based stable and load-aware QoS routing protocol (SLAQR) is proposed in this paper. This paper chiefly focuses on the enhancement of the GA-based routing algorithm by including exponential function in the searching process and modifying the fitness function, which incorporates QoS metrics like the node’s static resource capacity, dynamic resource availability, neighborhood quality, and link quality. The originality of the proposed protocol comes from the fact that it introduces multiple parameters into the route quality computation and integrates the exponential function into the GA. For experimental validation, the simulation of the proposed method is done and the results are compared with existing protocols such as GAQR (GA-Based QoS Routing), QMRB-AODV (QoS Mobile Routing Backbone Over Ad Hoc On-Demand Distance Vector Routing), and EISGA (Ensemble of Immigrant Strategies with Genetic Algorithm). From the outcome, we conclude that the delivery ratio, throughput, and delay of our proposed SLAQR approach have improved the GAQR approach by 58%, 56%, and 97%, respectively.

Survey on Node Mobility Model for Opportunistic Network

2011 ◽  
Vol 52-54 ◽  
pp. 1253-1257 ◽  
Author(s):  
Ming Xia Yang ◽  
Shuang Xia Han ◽  
Cai Yun Yang ◽  
Lu Zhang ◽  
Dong Fen Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Ad Hoc ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Mobility Models ◽  
Opportunistic Network ◽  
Research Focus ◽  
Mobile Ad Hoc

Opportunistic networks is one of the newest hot research spots in wireless networks after mobile ad hoc net-works(MANET) and wireless sensor networks(WSN). Mobility model describes mobility manners of nodes. It has been widely used in research on wireless network. This paper firstly introduced, classifies, and compares the current familiar mobility models. Secondly, it classifies, and compares the current familiar mobility models. Next, it was discussed that current research focus on new mobility models, analysis of nodes mobility features, trace strategy, and evaluation of mobility model. Finally, this paper involved what calls for further study.

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.

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.

A Purpose-Driven User Mobility Model for Opportunistic Networks

2010 ◽  
Vol 171-172 ◽  
pp. 804-809
Author(s):  
Jian Bo Xu ◽  
Guang Yang
Keyword(s):  
Human Movement ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
User Mobility ◽  
Node Mobility ◽  
Opportunistic Network ◽  
Data Forwarding ◽  
Challenging Tasks ◽  
Efficient Data ◽  
Two Sides

An opportunistic Network is a network consisting exclusively of users’ mobile devices, with mobility being one of its essential features. Under the circumstances that a path may never exist between the two sides of communication, an opportunistic network exploits node mobility to realize delayed data delivery by capturing the opportunities of node meeting to relay messages. Designing efficient data forwarding strategies is one of the most challenging tasks in opportunistic network research, while currently the validation of any protocol for data forwarding almost absolutely relies on simulations of which node mobility models are one of the fundamental components. In this paper, we suggest a purpose-driven user mobility model for opportunistic networks which, to our best knowledge, is the first work considering the factor of purposes behind users’ movement. On the basis of location functionalization, our model can gain a better approximation of human movement patterns.

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.

Sign in / Sign up

Export Citation Format

Share Document