TSIRP: A Temporal Social Interactions-Based Routing Protocol in Opportunistic Mobile Social Networks

Abstract

With the increasing number of smart device users, data transmission between users is becoming more important, and a network architecture called opportunistic mobile social network (OMSN) is gaining attention. However, routing in OMSNs is a challenging problem due to the frequent disconnection between nodes and the absence of paths from the source to the destination. It results in a complex topology and a low packet transmission success rate. Therefore, we propose a novel routing algorithm called the temporal social interactions-based routing protocol (TSIRP) for solving the problem of low network performance due to the improper selection of message relay nodes. First, we focus on the temporal context of social interactions. Specifically, at a certain time of the day, a person has specific people with whom the person usually interacts (e.g., workers usually meet co-workers during working hours; students usually meet their classmates during class). Based on temporal social interactions between nodes, potential forwarding metrics are proposed and calculated for each time of the day to make forwarding decisions. Second, we propose a new scheme to control the message spreading rate, which allows achieving a balance between delivery latency and overhead ratio. In addition, an analytical model is also designed using an absorbing Markov chain to estimate the performance of TSIRP. Simulations were also conducted, and the results indicate that TSIRP can achieve better performance than existing routing protocols in terms of packet delivery ratio, delivery latency, network overhead ratio, and average hop count.INDEX TERMS Forwarding token, opportunistic mobile social network, potential forwarding metric, spreading rate control value.

User‐optimized data transmission scheduling based on edge community service in opportunistic social network

“…Ref. [25] proposed a routing protocol based on time social interaction (TSIRP). By paying attention to the social interaction between nodes, the potential forwarding volume in each period is calculated to support forwarding decisions.…”

“…From the impact of dynamic priority, if multiple tasks rise alternately due to the small priority gap between them, it will lead to frequent cross preemption. This phenomenon is called system bump [25]. Task switching occurs every preemption, which will greatly increase the additional overhead of the system and consume system resources [31].…”

Efficient Data Transfer by Evaluating Closeness Centrality for Dynamic Social Complex Network-Inspired Routing

“…In these networks, nodes (users with mobile devices) can form on-the-fly social networks to communicate with each other. Considering users' social routines when determining whether a node should retransmit a message to another node can reduce transmission delay and routing overhead [8]. Consequently, minimizing routing overhead will decrease the average number of hops that message routes traverse before reaching their destination.…”