On exploiting priority relation graph for reliable multi-path communication in mobile social networks (Q2201685): Difference between revisions

This paper studies using priority relation graph for reliable multi-path communication in mobile social networks. Let \(n\) be the number of key features in a mobile social network and \(k\) be an integer with \(k<\sqrt{n}\). If two users have their feature distance less than or equal to \(k\), they have a priority relationship in the mobile social network. If this distance is one, then their relationship is first-priority relationship. It is shown that a priority relation graph guarantees an efficient and systematic disjointed multi-path data delivery routing. The authors also establish a multi-path priority relation graph-based social feature routing algorithm and present some examples. Building on the natural order of nodes representation, the diameter, the regular degree and the multi-path technology, the above algorithm is applied to look for disjointed multi-paths in mobile social networks. Some numerical simulations and applications are discussed with an view to extend the routing algorithm to the general case.