Title: A new routing algorithm based on opportunistic networks

Authors: Shi Dong; Yingchun Qi; Dingding Zhou

Addresses: School of Computer Science and Technology, Zhoukou Normal University, Henan, Zhoukou, China; School of Computer Science and Engineering, Huazhong University of Science and Technology, Wubei, Wuhan, China ' School of Computer Science and Technology, Zhoukou Normal University, Henan, Zhoukou, China ' Department of Laboratory and Equipment Management, Zhoukou Normal University, Henan, Zhoukou, China

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.

Keywords: opportunistic network; mobility prediction; routing overhead; transmission delay; transmission success rate.

DOI: 10.1504/IJICT.2017.085463

International Journal of Information and Communication Technology, 2017 Vol.11 No.1, pp.81 - 93

Accepted: 18 Oct 2014
Published online: 21 Jul 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article