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

Lin, Yu‐Cheng; Chen, Zhigang; Wu, Jia; Wang, Leilei

doi:10.3390/a11080119

Cited by 9 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The people rank algorithm considers any person with more centrality values as a famous person 7 . Cosine similarity based routing decides the forwarding of a packet based on the degree of cosine similarity between two nodes by assigning a weight to the dataset 42 . Point of Interest aware multi attribute‐based routing makes a forwarding decision by comparing the probability of visiting the destination PoI with the encounters 9 .…”

Section: Related Workmentioning

confidence: 99%

Regular routine aware routing in opportunistic mobile social networks

Syed Rabiya,

Ramalakshmi,

Naskath

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Due to intermittent connectivity, routing protocols in opportunistic mobile social networks (OMSN) forward messages through opportunistic contacts. Previous opportunistic routing protocols focus on the past contact history of nodes to make a forwarding decision. It was found that predicting temporally evolving contacts and communities according to different times of the day would improve the accuracy of the prediction. In this paper, a routing paradigm called RRoutine is proposed that allows message holders to exchange multiple copies of the message based on the predicted number of communities. This distribution continues until the remaining copies of the message become one. Each message holder applies either inter or intra‐community forwarding and selects a set of potential forwarders based on the prediction of future encounters in the community and an expected remaining duration between two nodes (ERIMD). The estimation of ERIMD takes into account the sequence of daily activities, the time scale of current activities, and the return time to regular meetings of the nodes. Also, unlike traditional routing, where a single forwarder is selected, a set of potential candidates is selected and prioritized according to their contact prediction, with the most likely candidate receiving the highest priority. Simulation results obtained from synthetic and real mobility data show that the proposed paper improves the performance of the system in terms of message delivery rate, throughput, and latency.

show abstract

Section: Related Workmentioning

confidence: 99%

Regular routine aware routing in opportunistic mobile social networks

Syed Rabiya,

Ramalakshmi,

Naskath

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Hence with a combination of social characteristics and the relation amongst nodes along with knowledge of the challenges regarding the long-established routing algorithms of OppNet, cosine similarity (cosSim) based solution is proposed [23]. Cosine similarity being popularly used to calculate the similarity between the text can be used as a parameter of the social relationship strength by deriving the cosine alikeness amongst data packets of the node.…”

Section: Opportunistic Network Routing Based On Cosine Similaritymentioning

confidence: 99%

A Comprehensive Survey of Social Based Routing for Delay Tolerant Networks

Jain¹,

Vn²

2021

Preprint

View full text Add to dashboard Cite

Delay-tolerant networks (DTN) is an approach to deal with scarce network connectivity found in sparse mobile ad-hoc networks (MANETs) which makes the problem of routing messages a challenging task. DTNs have find their usefulness in many challenging environments such as tactical networks, underwater sensor networks, wildlife monitoring, disaster recovery etc. Pocket Switched Networks (PSNs) have emerged as a new application of the delay tolerant networks where network nodes are computing devices carried by humans. Hence, the study of how humans interact in their day-to-day life, the places they visit frequently, the people they meet frequently, the social groups in which they participate on regular basis etc. can help improve routing process in PSNs. This type of routing inspired from the way humans interact with each other is referred to as social based routing and had been a recent topic of research in the field of DTNs. This paper presents a comprehensive survey of the various social-based algorithms that have been designed for Delay Tolerant Networks.

show abstract

“…Consideration of other social attributes such as friendship and common interest helps finding an optimal path for message delivery. In cosine similarity‐based routing, cosine similarity is calculated for data packet set by representing the data packet set as vector and assigning weights to each data packet according to their frequency of occurrence, in order to calculate the similarity between two nodes. It takes forwarding decision according to the degree of similarity between two nodes.…”

Section: Related Workmentioning

confidence: 99%

“…The social property‐based routing protocol is divided into graph and community based. Recent research work focuses on developing a routing protocol utilizing either spatial or temporal aspects such as expected encounters and contact history, but none of the work considers both. Thus, achieving high packet delivery rate results in high resource consumption, which affects the overall performance, and the lifetime of the network …”

Section: Introductionmentioning

confidence: 99%

Multiattribute‐based routing for lifetime maximization in opportunistic mobile social networks

Ramalakshmi

2020

Int J Communication

View full text Add to dashboard Cite

With the advancement in wireless technology and portable devices, smart phones have become one of the belongings of human being. People share their data online, but it has limitations due to transmission range and mobility. Yet opportunistic mobile social network enables users to share data online even if there is no connected path between source and destination. The widespread use of mobile phones equipped with WiFi, Bluetooth, and several other components and contact opportunities among humans bridge the gap between internet available and nonavailable area. In this paper, we have proposed a new routing approach which utilizes both spatial and temporal attributes of user such as probability to meet a particular location and remaining intercontact time between two nodes to select better relay nodes. Generally, users visit different locations such as sports stadium and mall, with varying probability. Users with similar interest form group, and each user has different intercontact time with other users according to their point of interest and visiting pattern. By utilizing multiattributes, different forwarding strategies have been devised for both inter and intragroup routing. The proposed work "point of interest (PoI)-based routing" is implemented in Opportunistic Network Environment simulator, and the performance is analysed in terms of delivery rate, latency, overhead, goodput, and energy consumed. The simulation results show that PoI diminishes 23% of overhead and yields 24% improvement in goodput over the state-of-the-art protocol. Thus, the simulation results reveal that our proposed work provides the balance between routing performance and resource consumption. K E Y W O R D S delay-tolerant network (DTN), intercontact time, opportunistic mobile social network (OMSN) routing, opportunistic network (OPPNET), point of interest

show abstract

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

Cited by 9 publications

References 24 publications

Regular routine aware routing in opportunistic mobile social networks

Regular routine aware routing in opportunistic mobile social networks

A Comprehensive Survey of Social Based Routing for Delay Tolerant Networks

Multiattribute‐based routing for lifetime maximization in opportunistic mobile social networks

Contact Info

Product

Resources

About