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

DOI10.1016/J.INS.2018.10.035zbMATH Open1448.91215OpenAlexW2898610226WikidataQ129012634 ScholiaQ129012634MaRDI QIDQ2201685FDOQ2201685

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

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

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

zbMATH Keywords

reliable communicationmobile social networksmulti-path technologypriority relation graphsocial features

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Title not available (Why is that?)
• Hypercube-Based Multipath Social Feature Routing in Human Contact Networks
• Community-Aware Opportunistic Routing in Mobile Social Networks

Cited In (4)

• Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction
• Reliability analysis of the cactus-based networks
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Mining weighted subgraphs in a single large graph

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)