A Novel Opportunistic Network Routing Method on Campus Based on the Improved Markov Model

Opportunities networks’ message transmission is significantly impacted by routing prediction, which has been a focus of opportunity network research. The network of student nodes with smart devices is a particular type of opportunity network in the campus setting, and the predictability of campus node movement trajectories is also influenced by the regularity of students’ social mobility. In this research, a novel Markov route prediction method is proposed under the campus background. When two nodes meet, they share the movement track data of other nodes stored in each other’s cache in order to predict the probability of two nodes meeting in the future. The impact of the node within the group is indicated by the node centrality. The utility value of the message is defined to describe the spread degree of the message and the energy consumption of the current node, then the cache is managed according to the utility value. By creating a concurrent hash mapping table of delivered messages, the remaining nodes are notified to delete the delivered messages and release the cache space in time after the messages are delivered to their destinations. The method suggested in this research can successfully lower the packet loss rate, minimize transmission latency and network overhead, and further increase the success rate of message delivery, according to experimental analysis and algorithm comparison.