节点文献

移动自组网中的最长生命期路径(英文)

Longest Lifetime Path in Mobile Ad Hoc Networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 魏晓海陈国良万颖瑜张信明

【Author】 WEI Xiao-Hai1,2+, CHEN Guo-Liang1,2, WAN Ying-Yu1,2, ZHANG Xin-Ming1,2 1(National High Performance Computing Center at Hefei, Hefei 230027, China) 2(Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China)

【机构】 国家高性能计算中心国家高性能计算中心 (合肥) 安徽合肥230027中国科学技术大学计算机系安徽合肥230027(合肥) 安徽合肥230027中国科学技术大学计算机系

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

【Abstract】 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.

【基金】 华为科技基金;韩国高等教育财团国际交换学者奖~~
  • 【文献出处】 软件学报 ,Journal of Software , 编辑部邮箱 ,2006年03期
  • 【分类号】TN929.5
  • 【被引频次】16
  • 【下载频次】267
节点文献中: 

本文链接的文献网络图示:

本文的引文网络