Abstract
With the fast development of IoT and 5G technologies, opportunity social networks composed of portable mobile devices have become a hot research topic in recent years. However, arbitrary node movement in opportunity networks and the absence of end-to-end pathways make node communication unstable. At the same time, the problem of ignoring human social preferences and relying on wrong message relay nodes lead to a low data transmission rate and high network overhead. Based on the above issues, we propose a time-varying relationship groups-based routing query algorithm for mobile opportunity networks (Time-varying Relationship Groups, TVRGs). Firstly, we construct the relationship groups based on the time-varying characteristics according to the intimacy between users. Secondly, we calculate the importance of nodes by their connectivity time and communication frequency. Finally, we find the suitable message relay nodes according to the similarity of node weights and their action trajectories and design the routing query algorithm accordingly. The simulation results show that the algorithm can vastly improve the message query success rate, effectively improve the data transmission efficiency, and reduce the average delay and system overhead compared with the existing routing algorithms.
Highlights
With the development of mobile communication technologies [1,2], such as the Internet and the Internet of Things, people can access large volumes of network information through intelligent mobile terminals
The performance of the time-varying Relationship Groups (TVRGs) algorithm is compared with the classical Epidemic algorithm and the fair and socialaware message forwarding (FSMF) and DDMGS algorithms mentioned in related works in terms of transmission success rate, average delay, and average overhead in different cases to verify their performance
This paper proposes a query message routing algorithm TVRGs based on the timevarying relational cluster model to improve the transmission inefficiency problem of existing opportunity social network algorithms
Summary
With the development of mobile communication technologies [1,2], such as the Internet and the Internet of Things, people can access large volumes of network information through intelligent mobile terminals. The opportunity network [3,4] is crucial for mobile communication in the new era. It has a broader application with the promotion of 5G. This paper proposes a query message routing algorithm This algorithm has the following three main contributions. Based on the time-varying characteristics of nodes and their interests, we classify nodes into relationship groups and predict the likelihood of nodes joining other groups. The time-varying Relationship Groups (TVRGs) algorithm is part three.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
