移动自组网中的最长生命期路径

动态拓扑是移动自组网区别于其他形式网络的本质特征,对其进行研究具有很大的理论价值和工业应用背景.提出一种方法,利用网络的最长生命期路径来研究其拓扑的动态性.在已有研究的基础上,改进了网络的数学模型,弥补了以往模型无法很好地描述移动自组网动态拓扑的缺陷,并在此基础上提出了最长生命期路贩径算法.利用该算法计算网络中的最长生命期路径,深入研究了其持续时间的分布规律.同时证明了使用最长生命期路径作为路由,可以使网络的重路由次数最少.模拟实验表明,利用对数正态分布可以很好地描述移动自组网的最长生命期路径持续时间.实验结果表明,与以往利用最短路径作为研究对象相比,最长生命期路径和最小重路由更适合用来衡量网络的动态性.

Longest Lifetime Path in Mobile Ad Hoc Networks

Dynamic topology is the essential difference between mobile ad hoc networks and other kinds. It is meaningful in both theory and industry application to study the dynamic topology of mobile ad hoc networks. In this paper, a method is proposed to study the dynamic topology with longest lifetime path. On basis of the previous research, the mathematic model of networks is improved to describe the change of topology. Based on it, the algorithm of longest lifetime path is presented and the distribution of its duration is studied. At the same time, it is proved that the re-routing is minimal with the longest lifetime paths as the routes. Simulation with NS -2 shows that the distribution of lognormal can be used to describe the duration of longest lifetime paths. The results show that the longest lifetime path and minimal re-routing are more suitable than the shortest path as the metrics to measure the dynamic of networks.