An opportunistic network routing algorithm based on cosine similarity of data packets between nodes

DOI10.3390/A11080119MaRDI QIDQ2331638zbMATH OpenOpenAlexWikidataFDO

Authors Yucheng Lin, Jia Wu, Leilei Wang, Zhi-Gang Chen

Publication date 30 October 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a11080119

zbMATH Keywords

cosine distancedelivery ratioopportunistic networkrouting algorithmrouting overheadsimilarity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Review text

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

Recommendations

• Routing algorithm in opportunistic networks based on node mobility
• A routing algorithm for the opportunistic network based on the gravitation field
• An effective data transmission algorithm based on social relationships in opportunistic mobile social networks
• Trust-based security routing decision method for opportunistic networks
• Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks

Cited in

(5)

• Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks
• A transmission prediction neighbor mechanism based on a mixed probability model in an opportunistic complex social network
• Data forwarding control mechanism with fuzzy controller in opportunistic network
• Routing algorithm in opportunistic networks based on node mobility
• A routing algorithm for the opportunistic network based on the gravitation field

This page was built for publication: An opportunistic network routing algorithm based on cosine similarity of data packets between nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331638)