On exploiting priority relation graph for reliable multi-path communication in mobile social networks (Q2201685): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4208556 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypercube-Based Multipath Social Feature Routing in Human Contact Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Community-Aware Opportunistic Routing in Mobile Social Networks / rank | |||
Normal rank |
Revision as of 17:16, 23 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On exploiting priority relation graph for reliable multi-path communication in mobile social networks |
scientific article |
Statements
On exploiting priority relation graph for reliable multi-path communication in mobile social networks (English)
0 references
29 September 2020
0 references
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.
0 references
reliable communication
0 references
priority relation graph
0 references
multi-path technology
0 references
social features
0 references
mobile social networks
0 references