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

Abstract

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%.

ML-Enhanced Live Video Streaming in Offline Mobile Ad Hoc Networks: An Applied Approach

“…In response to the challenge of streaming video in MANETs, the approaches presented in the literature may primarily focus on the routing process [12][13][14][15], while others provide adjustments to enhance performance. Thus, these works can essentially be classified into three groups [11]: multipath routing, QoS-aware routing, and prediction-based link routing.…”

Research on Generalized Intelligent Routing Technology Based on Graph Neural Network

“…Static routing algorithms are relatively simple and easy to set up, and are suitable for networks with small network scale and relatively stable topology. Dynamic routing algorithms can adjust routing strategies in real time according to network conditions, and are suitable for network environments of larger size and more complex topology [1]. Although traditional routing algorithms have been deployed in various network environment, with the continuous complexity of network structures, traditional routing algorithms are not able to guarantee better network quality of service (QoS) [2], such as by reducing the maximum link utilization, transmission delay, and packet loss rate.…”