关键词: 机会网络, 派系过滤, 结构收缩

Abstract: Opportunistic network is a kind of Ad hoc network and it also has characteristics of delay tolerant networks. With the rapid popularization of portable mobile devices which have short distance communication functions, there are more application scenarios for social-based opportunistic network. Thus opportunistic network also has a phenomenon similar to node aggregation. Some features displayed by nodes in the network exhibit the characteristics of the community structure. However, existing routing algorithm doesn??t consider the social charac-teristics of nodes, which causes a low packet delivery ratio and high ratio of transmission delay and routing overhead. To solve these social-based routing problems, this paper proposes a data forwarding method under fully consideration of community and social features. According to the social relationships among nodes, the network can be divided into several community structures. This paper addresses a method to reduce the community size, using this algorithm to delete nodes which are inefficient, and makes the community structure centralized to reduce the energy consumption of useless nodes. Through a series of actions, this paper can improve the transmission efficiency. Simulation result shows that this algorithm has higher delivery ratio and lower transmission delay compared with Spray and Wait algorithm, PRoPHET algorithm and SCR(effective social relationship measurement and cluster based routing in mobile opportunistic networks) algorithm.

Key words: opportunistic network, clique percolation, structural shrinkage