%0 Journal Article
%T Longest Lifetime Path in Mobile Ad Hoc Networks<br>移动自组网中的最长生命期路径
%A WEI Xiao-Hai
%A CHEN Guo-Liang
%A WAN Ying-Yu
%A ZHANG Xin-Ming
%A <br>魏晓海
%A 陈国良
%A 万颖瑜
%A 张信明
%J 软件学报
%D 2006
%I 
%X 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.
%K QoS
%K connectivity
%K mobile ad hoc network
%K path duration
%K re-routing
%K QoS<br>连通性
%K 移动自组网
%K 路径持续时间
%K 重路由
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C18ADD6BC5DF78D0&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=38B194292C032A66&sid=E3C3E274D87A8C16&eid=37F781FD8E744761&journal_id=1000-9825&journal_name=软件学报&referenced_num=8&reference_num=24