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

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 Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Relay Node ◽  
Network Routing ◽  
Transmission Factor ◽  
Transmission Scheme ◽  
Network Delay ◽  
Significant Burden

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.

Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai
Keyword(s):  
Routing Protocol ◽  
Vehicular Networks ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Network Routing ◽  
On Demand ◽  
Routing Mechanism ◽  
Demand Routing ◽  
On The Road ◽  
Low Efficiency

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

A Optimization Traffic Grooming Algorithm Based on Bidirectional SONET Ring Topology Network

2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui
Keyword(s):  
Resource Utilization ◽  
Network Performance ◽  
Minimum Weight ◽  
Routing Algorithm ◽  
Traffic Grooming ◽  
Network Routing ◽  
Ring Network ◽  
Network Resource ◽  
Blocking Rate ◽  
The Impact

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.

Sign in / Sign up

Export Citation Format

Share Document