Disjoint-Path Routing Mechanism in Mobile Opportunistic Networks  

作　　者：Peiyan Yuan Hao Zhang Xiaoyan Huang 

机构地区：[1]School of Computer and Information Engineering,Henan Normal University,Xinxiang 453007,Henan,China [2]Engineering Laboratory of Intellectual Business and Internet of Things Technologies,Xinxiang 453007,Henan,China [3]Big Data Engineering Laboratory for Teaching Resources&Assessment of Education Quality,Xinxiang 453007,Henan,China

出　　处：《国际计算机前沿大会会议论文集》2020年第1期368-379,共12页International Conference of Pioneering Computer Scientists, Engineers and Educators（ICPCSEE）

基　　金：the National Natural Science Foundation of China under Grants U1804164,61902112 and U1404602;in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015,20A520019,20A520020.

摘　　要：The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets once except the source node,to effectively control the number of packet copies in the network.The discrete continuous time Markov chain(CTMC)was utilized to analyze the state transition between nodes,and the copy numbers of packets with the DP routing algorithm were calculated.Simulation results indicate that DP has a great improvement in terms of packet delivery ratio,average delivery delay,average network overhead,energy and average hop count.

关 键 词：MULTI-COPY Disjoint-path Mobile opportunistic networks ROUTING Continuous time Markov chain 

分 类 号：TN9[电子电信—信息与通信工程]