Incentive-Aware Opportunistic Network Routing

2013 ◽  
pp. 383-401 ◽  
Author(s):  
Greg Bigwood ◽  
Tristan Henderson
Keyword(s):  
Network Routing ◽  
Opportunistic Network

scholarly journals An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes

Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 119 ◽  
Author(s):  
Yucheng Lin ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Routing Algorithm ◽  
Network Routing ◽  
Cosine Similarity ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
Text Data ◽  
Data Packets ◽  
Network Transmission ◽  
Definition Of ◽  
Cosine Distance

The mobility of nodes leads to dynamic changes in topology structure, which makes the traditional routing algorithms of a wireless network difficult to apply to the opportunistic network. In view of the problems existing in the process of information forwarding, this paper proposed a routing algorithm based on the cosine similarity of data packets between nodes (cosSim). The cosine distance, an algorithm for calculating the similarity between text data, is used to calculate the cosine similarity of data packets between nodes. The data packet set of nodes are expressed in the form of vectors, thereby facilitating the calculation of the similarity between the nodes. Through the definition of the upper and lower thresholds, the similarity between the nodes is filtered according to certain rules, and finally obtains a plurality of relatively reliable transmission paths. Simulation experiments show that compared with the traditional opportunistic network routing algorithm, such as the Spray and Wait (S&W) algorithm and Epidemic algorithm, the cosSim algorithm has a better transmission effect, which can not only improve the delivery ratio, but also reduce the network transmission delay and decline the routing overhead.

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.

Autonomic behaviour of opportunistic network routing

2008 ◽  
Vol 1 (1) ◽  
pp. 122 ◽  
Author(s):  
Chiara Boldrini ◽  
Marco Conti ◽  
Andrea Passarella
Keyword(s):  
Network Routing ◽  
Opportunistic Network

Research on Robustness of Typically Opportunistic Network Routing Algorithm under Flooding Attack

2014 ◽  
Vol 989-994 ◽  
pp. 2227-2231
Author(s):  
Geng Yu ◽  
Dong Fang Yuan ◽  
Yan Cui ◽  
Ying Dong Wang ◽  
Ping Zong
Keyword(s):  
Evaluation Method ◽  
Routing Algorithm ◽  
Transmission Efficiency ◽  
Network Routing ◽  
Opportunistic Network ◽  
Flooding Attack ◽  
Flooding Attacks ◽  
The Index System ◽  
Direct Delivery ◽  
Spray And Wait

This paper designed the evaluation method and the index system. Through simulating behavior of pedestrian with mobile intelligent Bluetooth devices in the real city scene and did a quantitative analysis about the effects of flooding attacks to opportunity network in the three aspects of transmission capacity, transmission efficiency and energy consumption of nodes , in order to evaluate Direct Delivery, Spray and Wait and MaxProp the three opportunity network routing algorithm’s robustness under the flooding attack results showed that Direct Deliven algorithm robustness is best, it can withstand flooding attacks completely, robustness of the Spray and Wait algorithm is the worst, their performance will decline more than 80% in some scenarios, the performance of MaxProp algorithm under flood attacks will decrease remarkably.

scholarly journals GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 201158-201172
Author(s):  
Limiao Li ◽  
Haotian Wang ◽  
Zhixiong Liu ◽  
Hui Ye
Keyword(s):  
Game Theory ◽  
Routing Algorithm ◽  
Network Routing ◽  
Opportunistic Network

scholarly journals Novel Opportunistic Network Routing Based on Social Rank for Device-to-Device Communication

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Yunfeng Wang ◽  
Mengbo Tang
Keyword(s):  
Communication Networks ◽  
Social Rank ◽  
Large Data ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
Fifth Generation ◽  
Device To Device ◽  
Data Files

In recent years, there has been dramatic proliferation of research concerned with fifth-generation (5G) mobile communication networks, among which device-to-device (D2D) communication is one of the key technologies. Due to the intermittent connection of nodes, the D2D network topology may be disconnected frequently, which will lead to failure in transmission of large data files. In opportunistic networks, in case of encountering nodes which never meet before a flood message blindly to cause tremendous network overhead, a novel opportunistic network routing protocol based on social rank and intermeeting time (SRIT) is proposed in this paper. An improved utility approach applied in utility replication based on encounter durations and intermeeting time is put forward to enhance the routing efficiency. Meanwhile, in order to select better candidate nodes in the network, a social graph among people is established when they socially relate to each other in social rank replication. The results under the scenario show an advantage of the proposed opportunistic network routing based on social rank and intermeeting time (SRIT) over the compared algorithms in terms of delivery ratio, average delivery latency, and overhead ratio.

Evaluation of Energy Efficiency of Opportunistic Network Routing Protocols

2021 ◽  
pp. 207-223
Author(s):  
Md. Khalid Mahbub Khan ◽  
Muhammad Sajjadur Rahim ◽  
Abu Zafor Md. Touhidul Islam
Keyword(s):  
Energy Efficiency ◽  
Routing Protocols ◽  
Network Routing ◽  
Opportunistic Network
Sign in / Sign up

Export Citation Format

Share Document