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 Design of an Optimized Multicast Routing Algorithm for Internet of Things

2019 ◽  
Vol 8 (2) ◽  
pp. 4048-4053 ◽  
Keyword(s):  
Internet Of Things ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Network Routing ◽  
Resource Optimization ◽  
System Throughput ◽  
Delivery Ratio ◽  
Portable Devices ◽  
Routing Performance ◽  
Multicast Routing Algorithm

Internet of Things (IoT) is a fast- growing technology in on-going research field that includes wireless sensor networks, cloud computing, big data analytics, ubiquitous computing, distributed decentralized systems, pervasive computing, embedded systems, mobile computing, machine learning etc. The above mentioned fields are mainly connected with IoT smart portable devices such as smartphones, home appliances, healthcare device, smart vehicle devices automation industry devices, etc. Though IoT enabled devices has been increased in many fields, the industries still faces many problem with connectivity issues because of several factors like mobility nature of devices; limited processing power and resource availability which includes energy, bandwidth constraints, routing cost and end to end delay; communication between node to node via intermediate mobile nodes towards destination may also fail links frequently, there by affecting the network performance. These limitations of existing topology based on reactive tree and mesh based routing protocols create challenging task while designing an optimized stable routing algorithm for IoT. In such a situation, resource optimization is an essential task to be performed by the IoT networks. In the proposed work resource optimization was done by Designed Optimized Multicast Routing Algorithm (DOMRA) for IoT. The DOMR algorithm implemented has route discovery process with nodes positions, directions of nodes, velocities of nodes, and then the path stability bases to overcome the connectivity issues. The proposed algorithm focusing to deploy various real time IoT enabled applications such as smart home automation, smart cites, smart agriculture, automation industry etc. To finalize the simulation results shows maximized system throughput, goodput, packet delivery ratio, network lifetime, network routing performance and reduced control overheads. The proposed algorithm hence produced better routing performance when compared with other existing algorithm in wireless networks.

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

Multi-priority routing algorithm based on source node importance in complex networks

2019 ◽  
Vol 30 (07) ◽  
pp. 1940010
Author(s):  
Yu Bai ◽  
Ding-Ding Han ◽  
Ming Tang
Keyword(s):  
Routing Algorithm ◽  
Large Degree ◽  
Transmission Capacity ◽  
Source Node ◽  
Normal Operation ◽  
Data Packets ◽  
Node Importance ◽  
Routing Strategy ◽  
Network Transmission ◽  
Important Nodes

Network transmission capacity is an important guarantee for the normal operation of the network. The effective routing strategy avoids the use of nodes with large degree value, which leads to low utilization of nodes and failure to consider the priorities of different packets. On this basis, a routing algorithm based on packet source node classification is proposed. This strategy introduces an adjustable parameter. By adjusting this parameter, the data packets generated at the important nodes are transferred to the nodes with higher degree, which is to say they can reach the destination faster. The data packets generated at the sub-important nodes are transmitted by nodes with smaller degrees, thus reaching the destination relatively slowly. The routing strategy is evaluated in terms of order parameters, average routing time and node utilization. Compared with nonclassified routing and randomly classified routing strategy, the network transmission capacity was increased by 19% and 38%, respectively. Each node in the network was used more evenly. At the same time, the network transmission capacity under different parameters is analyzed theoretically through a series of derivations. In order to explore the performance of routing strategy in actual networks, this paper selects the actual network of web-EPA for simulation. The experimental results show that the proposed routing strategy is 7% and 17% higher than the nonclassified routing and random classified routing, respectively.

scholarly journals ACE: A Routing Algorithm Based on Autonomous Channel Scheduling for Bluetooth Mesh Network

Electronics ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 113
Author(s):  
Minyue Wang ◽  
Yeming Li ◽  
Jiamei Lv ◽  
Yi Gao ◽  
Cheng Qiao ◽  
...  
Keyword(s):  
Smart Home ◽  
Heavy Traffic ◽  
Routing Algorithm ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Smart Building ◽  
Data Packets ◽  
Channel Scheduling ◽  
Networking Technology ◽  
The Internet Of Things

The Internet of Things (IoT) interconnects massive cyber-physical devices (CPD) to provide various applications, such as smart home and smart building. Bluetooth Mesh is an emerging networking technology, which can be used to organize a massive network with Bluetooth Low Energy (BLE) devices. Managed-flooding protocol is used in Bluetooth Mesh to route the data packets. Although it is a highly desirable option when data transmission is urgent, it is inefficient in a larger and denser mesh network due to the collisions of broadcast data packets. In this paper, we introduce ACE: a Routing Algorithm based on Autonomous Channel Scheduling for Bluetooth Mesh Network. ACE relies on the existing Bluetooth Mesh messages to distribute routes without additional traffic overhead and conducts a beacon-aware routing update adaptively as the topology evolves. In ACE, BLE channel resources can be efficiently utilized by a channel scheduling scheme for each node locally and autonomously without any neighborly negotiation. We implement ACE on the nRF52840 from Nordic Semiconductor and evaluate its effectiveness on our testbed. Compared to the Bluetooth Mesh, our experiments proved that ACE could reduce the end-to-end latency by 16%, alleviate packets collisions issues, and increase the packet delivery ratio (PDR) by 30% under heavy traffic. Moreover, simulation results verified that ACE has better scalability when the size and density of networks become larger and denser.

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.

Sign in / Sign up

Export Citation Format

Share Document