A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks

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.

Keywords

• mobile group construction
• opportunity social network
• query routing
• time-varying group information forwarding