Research On Pushing Protocol For Content In Mobile Social Opportunity Network

With the development of mobile intellect equipment, it is more popular that the opportunity network application which communicates through the mobile equipment carried by human. As there exists a society relationship between human beings, opportunity network is becoming mobile social opportunistic network gradually. In this network, people use various of kinds of mobile equipment to send and share the message with adjacent users or the people who exist in society relationship. Same as opportunity network, in mobile opportunistic network, the transfer of users realized the communication between users. And the society relationship between users drives the transfer of users. In communication, it not only has relationship with network topology, but also with the sending message. So mobile social opportunistic networks need the routing combines the content with the context. This paper aims to research the content pushing, with analyzing the context of users and the content of message.This paper first summarize the mobile social opportunistic networks, including the concept of mobile social opportunistic networks, research background, the research actuality at home and abroad, the main application and the critical issues and so on. Also we research and analyze the current content pushing mechanism of mobile social opportunistic networks and the routing algorithms. Current content pushing mechanism is divided into2kinds. One is central pushing. There is a third party, it is similar with server. Based on the theme record left by user at third party, it sends corresponding pushing message to users. Another kind is distributed pushing. User chooses appropriate message to push, with calculating the utility value created by the message to the user met with. Current routing algorithm optimizes the message transferring, mainly through analyzing the connection of nodes. However, it did not consider the relevance between message and nodes, maybe it will cause the issue of node receiving the no need or uninterested message and so on, wasting the precious network source.To aim at the shortcomings of the existing routing algorithms, this paper presented a dynamic routing protocol based on MPR and evaluating function (ORPME). Firstly, the MPR set is ensured and the nodes in the MPR set are ranked on the basis of the evaluation function. In wireless communications, data packets will be forwarded to nodes with high success rate of transferring according to the local-storage MPR set, if none of those nodes can be found in the MPR set, they will be the randomly selected outside of the MPR set, directional and random forwarding supplement to each other to make the data packets be accurately forwarded to destination node in a shorter time.To deal with the issues on the pushing algorithms at above, this paper considers abundantly the communication times between nodes, communication times, the similarity of theme collection, the relevance between message and context of nodes, proposes a Role-and Context-based content pushing. This mechanism builds the role aim function. With analyzing the communication times between nodes, communication time, the similarity of theme collection, divides the role for nodes, and designs corresponding pushing mechanism for different roles. Based on the role message of the node met with, it chooses the corresponding pushing mechanism, to realize pushing.Finally, we use the real dataset to make sure the range of the Role function. And we use NS-2network simulating tools to simulate the algorithm this paper proposed. Then, it compared the RCCP algorithm with ORPME and PrefCast algorithms, and analyses the experiment results.