On exploiting priority relation graph for reliable multi-path communication in mobile social networks

DOI10.1016/J.INS.2018.10.035MaRDI QIDQ2201685zbMATH OpenOpenAlexWikidataFDO

Authors Limei Lin, Li Xu, Yanze Huang, Yang Xiang, Xiangjian He

Publication date 29 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10453/137464

zbMATH Keywords

mobile social networksmulti-path technologypriority relation graphreliable communicationsocial features

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Review text

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.

Recommendations

• An effective data transmission algorithm based on social relationships in opportunistic mobile social networks
• Social relation-aware multicast routing mechanism for opportunistic networks
• scientific article; zbMATH DE number 2030060
• Modeling and analysis of dynamic social ties in D2D collaborative video transmission
• The method of forwarding node selection based on Bayesian probability tree social network

Cites work

• Community-Aware Opportunistic Routing in Mobile Social Networks
• scientific article; zbMATH DE number 1196643 (Why is no real title available?)
• Hypercube-Based Multipath Social Feature Routing in Human Contact Networks

Cited in

(5)

• Mining weighted subgraphs in a single large graph
• Reliability evaluation of bicube-based multiprocessor system under the g-good-neighbor restriction
• scientific article; zbMATH DE number 7267142 (Why is no real title available?)
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Reliability analysis of the cactus-based networks

This page was built for publication: On exploiting priority relation graph for reliable multi-path communication in mobile social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201685)