A Cooperation-Based Routing Algorithm in Mobile Opportunistic Networks

Mobile opportunistic networks can effectively improve network resource utilities and system performance. In this paper, we propose a cooperation-based routing algorithm to achieve mobile opportunistic communications. To this end, mobile agent nodes are designed to attain information sensitivity and remaining energy of the cluster nodes. For the neighbor cluster nodes with remaining energy and information sensitivity being best among other neighbor cluster nodes, we select them as the next cluster nodes acting as mobile agent nodes. Through the cooperation, the information about node's remaining energy and information sensitivity is shared among nodes. In this way, the optimal multi-hop forwarding routing can be established to adapt to the locally changing network topology. At the same time, network nodes can have more opportunities to access networks. Simulation results show that our approach is effective.