The Social Feature-Based Priority Relation Graph of Mobile Social Networks

Lin, Limei; Zhou, Shuming; Wu, Wei

doi:10.1109/cse.2014.352

Cited by 4 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We presented the concepts [20] of priority relationship between mobile groups and priority relation graph (PRG) to describe MSN more comprehensively. In this section, we show some available properties about the priority relationship and PRG to propose efficient multi-path data delivery routing.…”

Section: Priority Relation Graph-based Multi-path Reliable Communicationmentioning

confidence: 99%

“…Definition 1 [20] Let n be the number of key features in a mobile social network and let k be an integer with k < √ n. Two users in MSN have a priority relationship if their features distance is no more than k. If the feature distance between two users is one, then their relationship is called a first-priority relationship (FPR).…”

Section: Priority Relation Graph-based Multi-path Reliable Communicationmentioning

confidence: 99%

“…In Subsection 2.3, we define users with the same feature values of all key features as a group. Clearly, there is a many-to-one mapping between the M-space and the FPRspace [20] (see Fig. 3).…”

Section: Propertymentioning

confidence: 99%

See 2 more Smart Citations

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

Lin

Huang

Xiang

et al. 2019

Information Sciences

Self Cite

View full text Add to dashboard Cite

A mobile social network (MSN) consists of certain amount of mobile users with social characteristics, and it provides data delivery concerning social relationships between mobile users. In MSN, ordinary people contact each other more frequently if they have more social features in common. In this paper, we apply a new topology structure-priority relation graph (PRG) to evaluate the data delivery routing in MSN on the system-level. By using the natural order of nodes' representation, the diameter, the regular degree and the multi-path technology, we determine the priority relation graphbased social feature routing (PRG-SFR) algorithm to find disjointed multi-paths in MSN.Here, the multi-path technology can be exploited for ensuring that, between each pair of sender and receiver, the important information can be delivered through a highly reliable path. Then we calculate the tolerant ability of 'faults' and estimate the availability of MSN on the theoretical level. Finally, we analyze the efficiency of PRG-SFR algorithm from the numerical standpoint in terms of fault tolerance, forwarding number, transmission time and delivery rate. Moreover, we make comparisons between PRG-SFR algorithm and certain state-of-the-art technologies.

show abstract

Section: Priority Relation Graph-based Multi-path Reliable Communicationmentioning

confidence: 99%

Section: Priority Relation Graph-based Multi-path Reliable Communicationmentioning

confidence: 99%

See 1 more Smart Citation

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

Lin

Huang

Xiang

et al. 2019

Information Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…Machine learning-based methods can be supervised or unsupervised, and they are based on building classifiers that determine credibility scores for blogs as a measure of their factuality. Examples of this type are presented in [5,11,12]. These methods require recursive processing of data to train and test the algorithms to achieve the desired accuracy.…”

Section: Introductionmentioning

confidence: 99%

“…These methods require recursive processing of data to train and test the algorithms to achieve the desired accuracy. They talk about the "effective communicate degree", but did not fully use the user's relationship to evaluate its credibility [7,10,12].…”

Section: Introductionmentioning

confidence: 99%