A Opportunity Network Routing Algorithm Based On Social Utility Vector

Nowadays, with the rapid development of mobile Internet and the widespread popularity and application of short distance wireless communication equipment(such as WIFI, Bluetooth, wearable devices, etc.), more and more application of opportunity network appears. Due to the opportunity network doesn’t need the existence of integrated link,message transmission mainly rely on meeting opportunities caused by node mobility. The self-organizing network with higher mobility result in local connectivity and global intermittent of network topological structure.In addition, because of the short-range communication device having an energy storage and bandwidth limitations, traditional routing protocols and packet transmitting strategy are unable to implement in the opportunity network. It brings a huge challenge to the design of route and data packet forwarding of opportunity network. Therefore, how to solve the routing and transmitting and improving the success rate of message delivery is the key technical points in the study of opportunity network. According to the stable cycle regularity of human activities, this article proposed an opportunity network routing transmitting algorithm based on social utility vector. The main work is as followed:(1)Community partitioning strategy is proposed. Community division made by the algorithm using the social relationship strength of node.In the initialization phase, distributing community id according to the location allocation of node, social utility vector carried by node updated once in each time period T.(2)Calculation of social utility vector. Each node needs to record history information about the meeting with other nodes. composing social utility value vector using the history information of nodes, such as the number of successful transmission of meeting, the connecting time of meeting, strength of social connection, social delay, social effectiveness and the community which nodes belongs to.(3)Design opportunity network message transmitting algorithm based on social utility vector. Each node in this algorithm carry social utility vector, and the message forwarding times were controlled by node and the destination node belongs to the same community and social delay, while taking advantage of connectivity duration, social validity to select which messages can be successfully forwarded to avoid fragmentation.(4)Simulation experiment about this algorithm and the Epidemic, Prophet classic algorithms on real data sets PMTR,analyzing the influence on routing performance caused by message survival time and node cache space from three aspects,the transmitting message number, average packet delay and success rate of delivery.