GLP: A Group Link Prediction Algorithm in DTMNs
Wu Junying, Xia Chunhe, Liangshuang Lv, Haiquan Wang · 2010
In DTNs, links are rare. Making full use of every link shows great importance to routing protocols. Link Prediction (LP) can predict future links between two nodes. Plenty of algorithms for link prediction have been proposed and were applied to various real networks, like social network. But few were applied to wireless ad hoc networks. Some recent works were done to study mobility prediction on link availability prediction, which was to predict the reliability of existing links [1-8].In this paper, we study link prediction algorithms that use only topology information and adjust it to mobility ad hoc networks. We propose a Group Link Prediction Algorithm (GLP). GLP can predict future link not only between nodes, but also between groups. GLP is a distributed, lightweight algorithm. Simulation shows that GLP has significant performance in group mobility ad hoc networks. In the future, a routing protocol in the full use of GLP will be studied.