A new routing algorithm based on opportunistic networks Online publication date: Fri, 28-Jul-2017
by Shi Dong; Yingchun Qi; Dingding Zhou
International Journal of Information and Communication Technology (IJICT), Vol. 11, No. 1, 2017
Abstract: Opportunistic network completes the communication between nodes by 'storage-carry-forward' mode, the traditional routing algorithms can not be applied to the opportunistic network, so this article proposes network routing algorithm MPRA based on an efficient opportunistic network. The algorithm is based on the mobility prediction method to solve routing problems. We use existing mobility prediction method and apply it into the routing algorithm. Compared to existing routing method of opportunity network, MPRA method can handle dynamic route problem, improve the transmission success rate and decrease the transmission delay. Moreover, the algorithm can reduce the routing overhead and short the cache time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com