Abstract

Social-aware routing in delay-tolerant networks (DTNs) are a recent emerging technology that addresses intermittent connection issues, and has the potential to better support context-aware ubiquitous learning and create a social learning community without the infrastructure. This study proposes a novel social-based routing protocol called the Social Relation Opportunistic Routing (SROR) algorithm for mobile opportunistic networks, based on the three properties of social relations, social profiles, and social mobility patterns. The time complexity of finding an optimal routing solution is NP-Complete. Thus, our objective is to compute the optimal relay node for routing the data so that the delivery ratio is maximised heuristically. We demonstrate that the SROR algorithm outperforms the existing benchmark routing protocols and achieves the highest data delivery ratio with maximised routing efficiency under the dynamic social environments. With this advanced technology, an authentic and seamless context-aware ubiquitous learning environment can be realised and supported in the future.

Full Text
Published version (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