Next Article in Journal
Probabilistic Interval-Valued Hesitant Fuzzy Information Aggregation Operators and Their Application to Multi-Attribute Decision Making
Previous Article in Journal
Sliding Suffix Tree
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(8), 119; https://doi.org/10.3390/a11080119

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

1,2
,
1,2,* , 1,2
and
1,2
1
School of Software, Central South University, Changsha 410075, China
2
“Mobile Health” Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China
*
Author to whom correspondence should be addressed.
Received: 6 July 2018 / Revised: 26 July 2018 / Accepted: 2 August 2018 / Published: 6 August 2018
Full-Text   |   PDF [2666 KB, uploaded 6 August 2018]   |  

Abstract

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. View Full-Text
Keywords: opportunistic network; routing algorithm; cosine distance; similarity; delivery ratio; routing overhead opportunistic network; routing algorithm; cosine distance; similarity; delivery ratio; routing overhead
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Lin, Y.; Chen, Z.; Wu, J.; Wang, L. An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes. Algorithms 2018, 11, 119.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top