随机移动模型下移动自组网无序传输端到端延迟闭解分析  

Closed-form Solution of End-to-end Delay with Out-of-order Delivery in MANETs under Random Mobility Models

作　　者：王晓菲[1] 蔡英[1,2] 李卓[1,2] 

机构地区：[1]北京信息科技大学计算机学院,北京100101 [2]北京信息科技大学网络文化与数字传播研究北京市重点实验室,北京100101

出　　处：《电子与信息学报》2014年第1期34-40,共7页Journal of Electronics & Information Technology

基　　金：北京市教委科技发展计划面上项目(KM201311232014;KM201411232013)资助课题

摘　　要：针对移动自组网端到端延迟在封闭形式分析方面的局限性,该文提出一种有效的针对无序传输,单副本两跳中继算法的网络延迟建模方案,并给出其严格的理论延迟上界。首先针对多种随机移动模型,证明了移动节点的相遇间隔时间可归纳为统一表达式。然后,综合分析了媒介竞争、流量竞争、排队延迟等问题,合理划分并精确求解出了各延迟关键时间段,从而构造了数据包排队服务模型。最后推导出移动自组网端到端延迟的封闭形式理论上界。仿真结果表明,该理论延迟与实验数据紧密吻合。Due to the limitation of the closed-form analysis of end-to-end delay in mobile ad hoc networks, this paper develops an effective modeling scheme for delay in the networks where the delivery is out-of-order and the two-hop relay algorithm with single copy is involved, and presents a rigorous theoretical upper bound. First, for various random mobility models, it is proved that the inter-meeting time between mobile nodes can be expressed in a unified expression. Furthermore, taking the medium competition, the traffic competition and the queuing delay into consideration, the critical time period of delay is defined accurately, and then the queuing service is modeled. Finally, an exact upper bound of the end-to-end delay is derived in closed-form. Simulation results validate that the theoretical delay matches the experimentM data closely.

关 键 词：移动自组网 端到端延迟 随机移动模型 无序传输 排队服务模型 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]