Review of microscopic and macroscopic routing algorithms in Opportunistic Networks

2016 ◽  
Author(s):  
S. R. Bharamagoudar ◽  
S. V. Saboji
Keyword(s):  
Opportunistic Networks ◽  
Routing Algorithms

scholarly journals A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Gang Xu ◽  
Xinyue Wang ◽  
Na Zhang ◽  
Zhifei Wang ◽  
Lin Yu ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Routing Algorithms ◽  
Time Slice ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Network Resources ◽  
Subsequent Time

Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.

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.

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.

Data Object Routing Algorithms for Data Aware Networking

2019 ◽  
Vol 7 (4) ◽  
pp. 644-646
Author(s):  
O.Koteswara Rao ◽  
Y K Sundara Krishna ◽  
G K Mohan Devarakonda
Keyword(s):  
Routing Algorithms ◽  
Data Object

Erasure-Coding Algorithm in Mobile Low-Duty-Cycle Opportunistic Networks Based on Energy-Aware

2013 ◽  
Vol 24 (2) ◽  
pp. 230-242
Author(s):  
Liang-Yin CHEN ◽  
Zhen-Lei LIU ◽  
Xun ZOU ◽  
Zheng-Kun XU ◽  
Zhen-Qian GUO ◽  
...  
Keyword(s):  
Duty Cycle ◽  
Opportunistic Networks ◽  
Erasure Coding ◽  
Energy Aware ◽  
Low Duty Cycle

Periodic Intermittently Connected-Based Data Delivery in Opportunistic Networks

2014 ◽  
Vol 24 (3) ◽  
pp. 507-525 ◽  
Author(s):  
Lei WU ◽  
De-An WU ◽  
Ming LIU ◽  
Xiao-Min WANG ◽  
Hai-Gang GONG
Keyword(s):  
Opportunistic Networks ◽  
Data Delivery ◽  
Intermittently Connected
Sign in / Sign up

Export Citation Format

Share Document