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

The mobile social network (MSN) can be considered as a system which provides a variety of data delivery services involving the social relationship among mobile users. Mobile social networks have the surprising property of being "searchable": Ordinary users contact with each other more frequently when they have more social features in common. In this paper, we first define a priority relationship between two mobile users in terms of their internal social features, and then we present a social feature-based priority relation graph of MSNs. The social feature-based priority relation graph is an (n{m1,...,mn}, k)-hypercube, in which two nodes are adjacent if and only if they differ in no more than k positions where k is the number of key features and k≪n. The priority relation graph of MSNs has some applications. First, it is the fundamental framework of data deliver routing. And then, a large area of circuit communication services can be guaranteed based on the priority relation graph in MSNs, which only need to a little cost.