Improving Delivery Probability in Mobile Opportunistic Networks with Social-Based Routing

There are contexts where TCP/IP is not suitable for performing data transmission due to long delays, timeouts, network partitioning, and interruptions. In these scenarios, mobile opportunistic networks (MONs) are a valid option, providing asynchronous transmissions in dynamic topologies. These architectures exploit physical encounters and persistent storage to communicate nodes that lack a continuous end-to-end path. In recent years, many routing algorithms have been based on social interactions. Smartphones and wearables are in vogue, applying social information to optimize paths between nodes. This work proposes Refine Social Broadcast (RSB), a social routing algorithm. RSB uses social behavior and node interests to refine the message broadcast in the network, improving the delivery probability while reducing redundant data duplication. The proposal combines the identification of the most influential nodes to carry the information toward the destination with interest-based routing. To evaluate the performance, RSB is applied to a simulated case of use based on a realistic loneliness detection methodology in elderly adults. The obtained delivery probability, latency, overhead, and hops are compared with the most popular social-based routers, namely, EpSoc, SimBet, and BubbleRap. RSB manifests a successful delivery probability, exceeding the second-best result (SimBet) by 17% and reducing the highest overhead (EpSoc) by 97%