延时容忍网络的路由技术研究
|
摘要
与互联网(Internet)的倍受关注不同,许多工业用途的专用网络离人们的视线比较远,但是它们在人们生活中发挥的作用却非常重要,例如道路监测网络、灾难发生地的临时通信网络等。这类网络的绝大部分都有这些特征:以无线电波为载体、节点能力受限、节点移动频繁、通信环境恶劣等。在这类网络里,用于Internet的协议很难正常工作,于是人们提出延时容忍网络(DTN:Delay-Tolerant Network)的概念来描述这类网络,并努力为之建立一套协议标准。
在本论文中,DTN被定义为一种抽象的网络模型,它不是针对某一个特定的网络的每个层面,相反,它关注具有延时容忍(Delay-Tolerant)特性的所有网络。延时容忍是指网络协议能够在某些极端情形下仍然能够工作而不至于崩溃;所谓极端(Challenging)情形是指节点之间信道非常不稳定、高不对称,节点处理能力多样,网络整体拓扑不稳定,经常出现长时间的分割,业务分布不可预测等,其中网络拓扑的不稳定是主要特征。从本质上说,DTN否定了传统网络模型中的一个根本前提——在路由期间或者数据包传递期间,存在一条或多条从源端到目的端的路径。这个前提隐含在传统路由协议中,即便是以节点动态性为主要背景的MANET(Mobile Ad hoc Network)的代表路由协议AODV(Ad-hoc On-demand DistanceVector)协议,其路由发现过程也必须在存在路径的条件下完成。
和众多自组织类网络一样,DTN的核心问题是路由。DTN对传统路由中“路由期间存在从源端到目的端的路径”这一假设的否定,其实是重新定义了路径的概念。在传统网络中,甚至包括MANET,虽然考虑的拓扑的动态性,但是拓扑的稳态持续时间相对于数据包的RTT(Round Trip Time)来说还是还是要高很多;这样,在一次数据投递过程中,拓扑是静态的,路径是与时间无关的。而DTN下,数据包每转发一次之后,网络的拓扑可能已经改变,网络中有的链路已经不存在了,同时又有新的链路建立;这样,从整体看来,路径在时间的维度上是有纵深的,即DTN路径中的每一条链路只有在数据包位于该链路的两端的节点上时该链路依然存在时才是有效链路。在这个基础上,对于路由算法而言,其输入已经不再是一个静态的无向图了,而是一个随时间变化的图,其输出也变成以(链路,时间)二元组为基本元素的序列了。针对这个变化,人们提出了空-时图(Space-Time Graph)来描述DTN的拓扑。在空-时图中,网络中的节点处于很多个层中,每一层代表了一个时刻的拓扑,数据包可能的传递路径就是从第一层的源节点开始逐层往下(沿时间方向)直到遇到目的节点。
本论文的研究重点是DTN的路由。就路由算法所需耍的路由信息的不同,DTN的路由协议可以分为两类:需要先验知识的的路由协议和不需要先验知识的家路由协议。先验知识的引入是DTN区别于传统网络模型的另一个重要标志。这里的先验知识是网络全局信息的一部分。在传统网络中,路由算法依赖于当前的网络状况,而DTN则还要依赖于将来的网络状况。因为网络状态相对稳定,传统网络中,当前的网络状况一般是通过路由信息交互协议获取的过去某个时刻的网络状况的预测得到的。DTN需要未来较长时间内的网络状况,仅仅通过对过去状况的简单预测并不准确,因此需要需要引入先验知识。
在研究了MANET,WSN等网络路由协议的基础上,本文主要对DTN的路由研究作出了如下贡献:
着眼于路由算法的信息集中最重要的参数——延时,建立了DTN中数据包的单跳延时模型。把延时作为选择最佳路径的标准可以减少数据包在网络中的驻留时间,减少网络缓存的消耗,反过来增加网络的容量。在DTN的研究中延时的构成以及其量化的分析还没有涉及。本文给出了单跳的范围,即链路上的延时模型,指出延时构成的几个基本量,即传输延时、排队延时、等待链路建立延时和传播延时。为了分析这几个参量的相互关系,把链路作为服务窗建立排队模型,提出了一种新的“带随机休假的非空竭排队系统”,利用排队论的分析方法,对队列长度、排队延时进行随机分解,最后得到队长和延时的分布函数,以及它们与业务分布等参数的数学期望之间的关系。最后通过仿真证实了实际测量值和计算值之间有很高的拟合度,在一定精度下本文的分析结果可以成立。
在标准Earliest Delivery算法的基础上,把先验知识的准确性考虑进去,提出AED(Adaptive Earliest Delivery)算法。Earliest Delivery算法只具有理论上的意义,它给出了一种很好的描述DTN路由问题的方式;但是在实用性方面,它对先验知识过高的需求造成实现的困难。但是,从另一个方面来看,现实中存在这一些可以预先知道链路容量函数的场景,例如卫星通信;这时Earliest Delivery算法可以提供更好的路由效果,但是,现实中预知的链路容量函数总是存在误差,如何衡量这种误差,以及如何使Earliest Delivery算法在误差下也能够有较好的性能就成为了本文的一个研究内容。首先,建立误差模型,从理论上分析丢包概率与误差强度的关系,给出了表达式;然后,把误差的标准差作为参数去修正延时,就是AED算法。仿真表明新的算法对误差的容忍能力有明显提高。
提出一种基于模板运算的运动模式识别框架PM~3D,并提出基于运动模式的路由模型。运动模式是用来描述节点(群)的运动规律的概念,但是本文中的运动模式不关注物理的参数,而是宏观上的模式;这种模式可以从网络的空-时图的各元素(只考虑0和1,也就是通和断)之间的位置关系中反映出来。一种基于模板运算的机制PM~3D被用来从空-时图中识别这些运动模式,并用一个统一的数据结构——访问列表(VL:Visit List)来存储。运动模式的引入并不依赖于具体的路由算法,但是需要在路由决策时加入对VL的应用,即需要一个接口让路由算法来访问VL,并从中获得必要的信息以辅助决定下一跳。仿真结果表明PM~3D能够识别出运动模式,并且运动模式能够反映出网络拓扑的变化趋势,提高了数据投递率。
Being different from the Internet,many networks used in industry seem far from people's sight,but they play an important role in people's life,such as road inspect network,temporary communication network in disaster etc.These networks have the characteristics such as:the com-munication is on radio,nodes have limited capability,nodes move frequently and the environment is tough etc.People present the concept DTN(Delay-Tolerant Network)to describe these networks and want to establish a suit of protocols accordingly.
DTN is defined as an abstract network model in this dissertation,and it's not for all sides of one particular network but for all the networks which possess the characteristic of Delay-Tolerant. Delay-Tolerant means network protocol can work in the challenging environment in which the links among nodes are very unstable,high asymmetric,the nodes' capability differ from each other, the topology of the network is volatile and suffers from long-time partitioning and the traffic's distribution is unpredictable.Essentially,DTN discards the basic assumption in traditional network—the existence of a path between source node and destination node during the delivery process of a packet.Even AODV(Ad hoc On-demand Distance Vector)protocol of MANET(Mobile Ad hoc Network)which deals with the dynamic topology situation needs this assumption—its route discovery procedure can complete only when there exists a path.
As an self-organized network,DTN's main problem is routing.DTN actually redefines "path" when it discards the basic assumption in traditional network.In traditional network including MANET,the topology is relatively stable compared with the RTT(Round Trip Time)of a packet, so paths have nothing to do with time during the delivery.In DTN,the topology may have changed after one forwarding—some links break down while new ones appear,so the paths have a time dimension,that is,a path makes sense only when it still exists when the packet arrives one of its ends.As for routing algorithms,the input is not a steady graph but a time-variant graph,and the output is not a path but a sequence of(link,time)duplets.Researchers provide Space-Time graph to describe the topology of DTN.In Space-Time graph,the nodes are in a series of layers,and a layer corresponds to a snapshot of the topology,so a likely path of a packet is from the source in the first layer to the destination in the lower layer(along with time).
This dissertation focuses on DTN routing issues.DTN routing protocols can be classified into two classes:protocols that need Oracles(Oracle is a concept to describe transcendental knowledge in DTN)and the others.The use of Oracles is another important difference between DTN and traditional network.Oracle is part of global routing information,and it can't be constructed by routing information exchange protocol as the traditional network does,because DTN's routing algorithm needs the future routing information.
By researching the routing protocols of MANET,WSN etc.this dissertation has the contribu-tions to DTN as below:
This dissertation provides a mathematical model for the one-hop delay which is the most im-portant parameter in routing information set in DTN.The criterion of choosing the optimal path is delay because small delay means packets spend less time in the network so it can save the capacity of the network.This dissertation puts forward a model of the delay and figures out its components: transmission time,queue time,time before the link's set-up and the propagation time.By consider-ing the link as the service window a new "non-exhaustive queue system with probabilistic vacation" is presented to analyze the relationship among the delay issues.The distribution of queue length and delay,and the relation among the mathematical expectations of these parameters are obtained. The simulations prove the conclusions.
This dissertation considers the precision of the Oracles and presents AED(Adaptive Earliest Delivery)algorithm based on standard Earliest Delivery.Earliest Delivery algorithm needs a very strict Oracle,which makes it hard to use.On the other hand,there exist some situations that their links capacity can be obtained in advance,such as satellite network etc.But the Oracle may have a little difference from the real situation,that is,error.So how to analyze the error and how to make protocol survive from the error should be brought into consideration.Firstly,we put forward a model to describe the error.Secondly,we give the function of the packet drop ratio along with error.Finally,we use the standard deviation to modify the metric then present AED.Simulations prove that AED can endure error much better.
This dissertation presents a framework PM~3D to detect mobility models based on template operations and a routing model to deal with mobility models.Mobility model is used to describe the characteristics of the mobility of node(s),and it doesn't focus on physical parameters but the macro mobility in large scale.The mobility models are reflected by the up and down state of links) in Space-Time graph.PM~3D is a framework to detect these mobility models and store them in a universal data structure—VL(Visit List).The use of mobility models doesn't depend on routing algorithms,and we provide a set of interfaces to let routing algorithms to visit the VLs and use them in route decision.Simulations prove that PM~3D can detect mobility models,reflect the change of network topology,and improve the delivery ratio.
在本论文中,DTN被定义为一种抽象的网络模型,它不是针对某一个特定的网络的每个层面,相反,它关注具有延时容忍(Delay-Tolerant)特性的所有网络。延时容忍是指网络协议能够在某些极端情形下仍然能够工作而不至于崩溃;所谓极端(Challenging)情形是指节点之间信道非常不稳定、高不对称,节点处理能力多样,网络整体拓扑不稳定,经常出现长时间的分割,业务分布不可预测等,其中网络拓扑的不稳定是主要特征。从本质上说,DTN否定了传统网络模型中的一个根本前提——在路由期间或者数据包传递期间,存在一条或多条从源端到目的端的路径。这个前提隐含在传统路由协议中,即便是以节点动态性为主要背景的MANET(Mobile Ad hoc Network)的代表路由协议AODV(Ad-hoc On-demand DistanceVector)协议,其路由发现过程也必须在存在路径的条件下完成。
和众多自组织类网络一样,DTN的核心问题是路由。DTN对传统路由中“路由期间存在从源端到目的端的路径”这一假设的否定,其实是重新定义了路径的概念。在传统网络中,甚至包括MANET,虽然考虑的拓扑的动态性,但是拓扑的稳态持续时间相对于数据包的RTT(Round Trip Time)来说还是还是要高很多;这样,在一次数据投递过程中,拓扑是静态的,路径是与时间无关的。而DTN下,数据包每转发一次之后,网络的拓扑可能已经改变,网络中有的链路已经不存在了,同时又有新的链路建立;这样,从整体看来,路径在时间的维度上是有纵深的,即DTN路径中的每一条链路只有在数据包位于该链路的两端的节点上时该链路依然存在时才是有效链路。在这个基础上,对于路由算法而言,其输入已经不再是一个静态的无向图了,而是一个随时间变化的图,其输出也变成以(链路,时间)二元组为基本元素的序列了。针对这个变化,人们提出了空-时图(Space-Time Graph)来描述DTN的拓扑。在空-时图中,网络中的节点处于很多个层中,每一层代表了一个时刻的拓扑,数据包可能的传递路径就是从第一层的源节点开始逐层往下(沿时间方向)直到遇到目的节点。
本论文的研究重点是DTN的路由。就路由算法所需耍的路由信息的不同,DTN的路由协议可以分为两类:需要先验知识的的路由协议和不需要先验知识的家路由协议。先验知识的引入是DTN区别于传统网络模型的另一个重要标志。这里的先验知识是网络全局信息的一部分。在传统网络中,路由算法依赖于当前的网络状况,而DTN则还要依赖于将来的网络状况。因为网络状态相对稳定,传统网络中,当前的网络状况一般是通过路由信息交互协议获取的过去某个时刻的网络状况的预测得到的。DTN需要未来较长时间内的网络状况,仅仅通过对过去状况的简单预测并不准确,因此需要需要引入先验知识。
在研究了MANET,WSN等网络路由协议的基础上,本文主要对DTN的路由研究作出了如下贡献:
着眼于路由算法的信息集中最重要的参数——延时,建立了DTN中数据包的单跳延时模型。把延时作为选择最佳路径的标准可以减少数据包在网络中的驻留时间,减少网络缓存的消耗,反过来增加网络的容量。在DTN的研究中延时的构成以及其量化的分析还没有涉及。本文给出了单跳的范围,即链路上的延时模型,指出延时构成的几个基本量,即传输延时、排队延时、等待链路建立延时和传播延时。为了分析这几个参量的相互关系,把链路作为服务窗建立排队模型,提出了一种新的“带随机休假的非空竭排队系统”,利用排队论的分析方法,对队列长度、排队延时进行随机分解,最后得到队长和延时的分布函数,以及它们与业务分布等参数的数学期望之间的关系。最后通过仿真证实了实际测量值和计算值之间有很高的拟合度,在一定精度下本文的分析结果可以成立。
在标准Earliest Delivery算法的基础上,把先验知识的准确性考虑进去,提出AED(Adaptive Earliest Delivery)算法。Earliest Delivery算法只具有理论上的意义,它给出了一种很好的描述DTN路由问题的方式;但是在实用性方面,它对先验知识过高的需求造成实现的困难。但是,从另一个方面来看,现实中存在这一些可以预先知道链路容量函数的场景,例如卫星通信;这时Earliest Delivery算法可以提供更好的路由效果,但是,现实中预知的链路容量函数总是存在误差,如何衡量这种误差,以及如何使Earliest Delivery算法在误差下也能够有较好的性能就成为了本文的一个研究内容。首先,建立误差模型,从理论上分析丢包概率与误差强度的关系,给出了表达式;然后,把误差的标准差作为参数去修正延时,就是AED算法。仿真表明新的算法对误差的容忍能力有明显提高。
提出一种基于模板运算的运动模式识别框架PM~3D,并提出基于运动模式的路由模型。运动模式是用来描述节点(群)的运动规律的概念,但是本文中的运动模式不关注物理的参数,而是宏观上的模式;这种模式可以从网络的空-时图的各元素(只考虑0和1,也就是通和断)之间的位置关系中反映出来。一种基于模板运算的机制PM~3D被用来从空-时图中识别这些运动模式,并用一个统一的数据结构——访问列表(VL:Visit List)来存储。运动模式的引入并不依赖于具体的路由算法,但是需要在路由决策时加入对VL的应用,即需要一个接口让路由算法来访问VL,并从中获得必要的信息以辅助决定下一跳。仿真结果表明PM~3D能够识别出运动模式,并且运动模式能够反映出网络拓扑的变化趋势,提高了数据投递率。
Being different from the Internet,many networks used in industry seem far from people's sight,but they play an important role in people's life,such as road inspect network,temporary communication network in disaster etc.These networks have the characteristics such as:the com-munication is on radio,nodes have limited capability,nodes move frequently and the environment is tough etc.People present the concept DTN(Delay-Tolerant Network)to describe these networks and want to establish a suit of protocols accordingly.
DTN is defined as an abstract network model in this dissertation,and it's not for all sides of one particular network but for all the networks which possess the characteristic of Delay-Tolerant. Delay-Tolerant means network protocol can work in the challenging environment in which the links among nodes are very unstable,high asymmetric,the nodes' capability differ from each other, the topology of the network is volatile and suffers from long-time partitioning and the traffic's distribution is unpredictable.Essentially,DTN discards the basic assumption in traditional network—the existence of a path between source node and destination node during the delivery process of a packet.Even AODV(Ad hoc On-demand Distance Vector)protocol of MANET(Mobile Ad hoc Network)which deals with the dynamic topology situation needs this assumption—its route discovery procedure can complete only when there exists a path.
As an self-organized network,DTN's main problem is routing.DTN actually redefines "path" when it discards the basic assumption in traditional network.In traditional network including MANET,the topology is relatively stable compared with the RTT(Round Trip Time)of a packet, so paths have nothing to do with time during the delivery.In DTN,the topology may have changed after one forwarding—some links break down while new ones appear,so the paths have a time dimension,that is,a path makes sense only when it still exists when the packet arrives one of its ends.As for routing algorithms,the input is not a steady graph but a time-variant graph,and the output is not a path but a sequence of(link,time)duplets.Researchers provide Space-Time graph to describe the topology of DTN.In Space-Time graph,the nodes are in a series of layers,and a layer corresponds to a snapshot of the topology,so a likely path of a packet is from the source in the first layer to the destination in the lower layer(along with time).
This dissertation focuses on DTN routing issues.DTN routing protocols can be classified into two classes:protocols that need Oracles(Oracle is a concept to describe transcendental knowledge in DTN)and the others.The use of Oracles is another important difference between DTN and traditional network.Oracle is part of global routing information,and it can't be constructed by routing information exchange protocol as the traditional network does,because DTN's routing algorithm needs the future routing information.
By researching the routing protocols of MANET,WSN etc.this dissertation has the contribu-tions to DTN as below:
This dissertation provides a mathematical model for the one-hop delay which is the most im-portant parameter in routing information set in DTN.The criterion of choosing the optimal path is delay because small delay means packets spend less time in the network so it can save the capacity of the network.This dissertation puts forward a model of the delay and figures out its components: transmission time,queue time,time before the link's set-up and the propagation time.By consider-ing the link as the service window a new "non-exhaustive queue system with probabilistic vacation" is presented to analyze the relationship among the delay issues.The distribution of queue length and delay,and the relation among the mathematical expectations of these parameters are obtained. The simulations prove the conclusions.
This dissertation considers the precision of the Oracles and presents AED(Adaptive Earliest Delivery)algorithm based on standard Earliest Delivery.Earliest Delivery algorithm needs a very strict Oracle,which makes it hard to use.On the other hand,there exist some situations that their links capacity can be obtained in advance,such as satellite network etc.But the Oracle may have a little difference from the real situation,that is,error.So how to analyze the error and how to make protocol survive from the error should be brought into consideration.Firstly,we put forward a model to describe the error.Secondly,we give the function of the packet drop ratio along with error.Finally,we use the standard deviation to modify the metric then present AED.Simulations prove that AED can endure error much better.
This dissertation presents a framework PM~3D to detect mobility models based on template operations and a routing model to deal with mobility models.Mobility model is used to describe the characteristics of the mobility of node(s),and it doesn't focus on physical parameters but the macro mobility in large scale.The mobility models are reflected by the up and down state of links) in Space-Time graph.PM~3D is a framework to detect these mobility models and store them in a universal data structure—VL(Visit List).The use of mobility models doesn't depend on routing algorithms,and we provide a set of interfaces to let routing algorithms to visit the VLs and use them in route decision.Simulations prove that PM~3D can detect mobility models,reflect the change of network topology,and improve the delivery ratio.
引文
[1]http://www.ipnsig.org.
[2]Kevin Fall.A delay-tolerant network architecture for challenged internets.In SIGCOMM '03:Proceedings of the 2003 conference on Applications,technologies,architectures,and protocols for computer communications,pages 27-34,New York,NY,USA,2003.ACM.ISBN 1-58113-735-4.doi:http://doi.acm.org/10.1145/863955.863960.
[3]http://www.irtf.org.
[4]http://www.dtnrg.org,.
[5]http://www.darpa.mil/ato/solicit/dtn/.
[6]http://www-valoria.univ-ubs.fr/casa/sarah/sarah-en.html.
[7]http://www.ee.surrey.ac.uk/personal/l.wood/dtn/.
[8]Delay-tolerant network - a tutorial,.
[9]A.E.;Al-Karaki,J.N.;Kamal.Routing techniques in wireless sensor networks:a survey.Wireless Communications,IEEE[see also IEEE Personal Communications],11(6):6-28,2004.
[10]Sushant Jain,Kevin Fall,and Rabin Patra.Routing in a delay tolerant network.In SIGCOMM '04:Proceedings of the 2004 conference on Applications,technologies,architectures,and protocols for computer communications,pages 145-158,New York,NY,USA,2004.ACM.ISBN 1-58113-862-8.doi:http://doi.acm.org/10.1145/1015467.1015484.
[11]Andrew S.Tanenbaum.计算机网络(第三版).清华大学出版社,1998.
[12]Mostafa H.(Mostafa Hamed)Zegura Ellen W.Merugu,Shashidhar Ammar.Routing in space and time in networks with predictable mobility.Technical Report CC Technical Report;GITCC-04-07,Routing in Space and Time in Networks with Predictable Mobility,2004.
[13]陈飘,卢汉成,李津生,洪佩琳.Amed:用于dtn的增强型med路由算法.计算机工程,21,2007.
[14]Anders Lindgren,Avri Doria,and Olov Schelen.Probabilistic routing in intermittently connected networks.SIGMOBILE Mob.Comput.Commun.Rev.,7(3):19-20,2003.ISSN 1559-1662.doi:http://doi.acm.org/10.1145/961268.961272.
[15]Evan P.C.Jones,Lily Li,and Paul A.S.Ward.Practical routing in delay-tolerant networks. In WDTN '05:Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking,pages 237-243,New York,NY,USA,2005.ACM.ISBN 1-59593-026-4.doi:http://doi.acm.org/10.114511080139.1080141.
[16]S.Biswas and R.Morris.Opportunistic routing in multi-hop wireless networks,2005.URL citeseer,ist.psu.edu/article/biswas05opportunistic.html.
[17]A,Vahdat and D.Becker.Epidemic routing for partially connected ad hoc networks,2000.URL citeseer,ist.psu.edu/vahdat00epidemic.html.
[18]周晓波,周健,卢汉成,洪佩琳.Dtn网络的延时模型分析.计算机研究与发展,2008.2录用.
[19]田乃硕.休假随机服务系统.北京大学出版社,2001.
[20]周晓波,卢汉成,李津生,洪佩琳.Aed:一种用于dtn的增强型earliest-delivery算法.电子与信息学报,8:1956-1960,2007.
[21]徐守时.信号与系统 理论、方法和应用.合肥-中国科学技术大学出版社,2003.
[22]Ad hoc on demand distance vector(aodv)routing(rfc 3561),July 2003.
[23]方兆本,缪柏其.随机过程.中国科学技术大学出版社,1993。
[24]Thrasyvoulos Spyropoulos,Konstantinos Psounis,and Cauligi S.Raghavendra.Spray and wait:an efficient routing scheme for intermittently connected mobile networks.In WDTN '05:Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking,pages 252-259,New York,NY,USA,2005.ACM.ISBN 1-59593-026-4.doi:http://doi.acm.org/10.1145/1080139.1080143.
[25]Matthias Grossglauser and David N.C.Tse.Mobility increases the capacity ofad hoc wireless networks.IEEE/ACM Trans.Netw.,10(4):477-486,2002.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/TNET.2002.801403.
[26]http://nsnam.isi.edu/nsnam/index.php.
[27]http://www.qualnet.com.cn.
[28]http://www.opnet.com/.
[29]无线移动自组织网.人民邮电出版社,ISBN:7-115-12859-6/TN.2368,2005.
[30]D.N.C.Grossglauser,M.Tse.Mobility increases the capacity of ad hoc wireless networks.Networking,IEEE/ACM Transactions on,10(4):477 - 486,2002.
[31]T.Camp,J.Boleng,and V.Davies.A survey of mobility models for ad hoc network research.Wireless Communications & Mobile Computing(WCMC):Special issue on Mobile Ad Hoc Networking:Research,Trends and Applications,2(5):483-502,2002.URL citeseer.ist.psu.edu/camp02survey.html.
[32]Joy Ghosh,Matthew J.Beal,Hung Q.Ngo,and Chunming Qiao.On profiling mobility and predicting locations of wireless users.In REALMAN '06:Proceedings of the 2nd international workshop on Multi-hop ad hoc networks:from theory to reality,pages 55-62,New York,NY,USA,2006.ACM.ISBN 1-59593-360-3.doi:http://doi.acm.org/10.1145/1132983.1132993.
[33]Joy Ghosh,Sumesh J.Philip,and Chunming Qiao.Sociological orbit aware location approximation and routing(solar)in manet.Ad Hoc Netw.,5(2):189-209,2007.ISSN 1570-8705.doi:http://dx.doi.org/10.1016/j.adhoc.2005.10.003.
[34]Xiaoyan Hong,Mario Gerla,Guangyu Pei,and Ching-Chuan Chiang.A group mobility model for ad hoc wireless networks.In MSWiM '99:Proceedings of the 2nd ACM international workshop on Modeling,analysis and simulation of wireless and mobile systems,pages 53-60,New York,NY,USA,1999.ACM.ISBN 1-58113-173-9.doi:http://doi.acm.org/10.1145/313237.313248.
[35]A.Bai,F.Narayanan Sadagopan Helmy.Important:a framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks.In INFOCOM 2003.Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies.IEEE,volume 2,pages 825 - 835,2003.
[36]Michele Garetto and Emilio Leonardi.Analysis of random mobility models with pde's.In MobiHoc '06:Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing,pages 73-84,New York,NY,USA,2006.ACM.ISBN 1-59593-368-9.doi:http://doi.acm.org/10.1145/1132905.1132914.
[37]Christian Bettstetter.Smooth is better than sharp:a random mobility model for simulation of wireless networks.In MSWIM '01:Proceedings of the 4th ACM international workshop on Modeling,analysis and simulation of wireless and mobile systems,pages 19-27,New York,NY,USA,2001.ACM.ISBN 1-58113-378-2.doi:http://doi.acm.org/10.1145/381591.381600.
[38]Athanasios Bamis,Azzedine Boukerche,Ioannis Chatzigiannakis,and Sotiris Nikoletseas.A mobility sensitive approach for efficient routing in ad hoc mobile networks.In MSWiM '06:Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems,pages 357-364,New York,NY,USA,2006.ACM.ISBN 1-59593-477-4.doi:http://doi.acm.org/10.1145/1164717.1164778.
[39]Mirco Musolesi and Cecilia Mascolo.A community based mobility model for ad hoc network research.In REALMAN '06:Proceedings of the 2nd international workshop on Multi-hop ad hoc networks:from theory to reality,pages 31-38,New York,NY,USA,2006.ACM.ISBN 1-59593-360-3.doi:http://doi.acm.org/10.1145/1132983.1132990.
[40]K.H.Baochun Li Wang.Group mobility and partition prediction in wireless ad-hoc networks.In Communications,2002.ICC 2002.IEEE International Conference on,volume 2,pages 1017 - 1021,2002.
[41]王树和.图论及其算法.中国科学技术大学出版社,1990.
[42]M.E.J.Newman and M.Girvan.Finding and evaluating community structure in networks.Physical Review E,69:026113,2004.URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0308217.
[43]M.E.J.Newman.Fast algorithm for detecting community structure in networks.Physical Re-view E,69:066133,2004.URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0309508.
[44]M.E.J.Newman.Modularity and community structure in networks.PROC.NATL.ACAD.SCI.USA,103:8577,2006.URL doi:10.1073/pnas.0601602103.
[45]M.E.J.Newman.Mixing patterns in networks.Physical Review E,67:026126,2003.URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0209450.
[46]Chenxi Zhu and M.S.Corson.A live-phase reservation protocol(fprp)for mobile ad hoc networks.Wirel.Netw.,7(4):371-384,2001.
[47]Chenxi Zhu and Corson M S.An evolutinary-tdma scheduling protocol(e-tdma)for mobile ad hoc networks.Technical Report CSHCN TR 2001-17,ISR(Institution of System Research),Maryland,US,2001.
[48]Cesana M Frotta L.Borgonovo F.Capone A.Rr-aloha.a reliable r-aloha broadcaset channel for ad hoc inter-vehicle comminication networks.In Med-Hoc-Net,Baia Chia,Italy,2002.
[49]Cahill V.Cunningham R.Time bounded medium access control for ad hoc networks.In POMC(Principles of Mobile Computing),Toulouse,France,2002.
[50]Garcia-Luna-Aceves J J.Tang Zheyu.Hop-reservation multiple access(hrma)for ad hoc networks.In IEEE INFOCOM,pages 194-201,New York,USA,1994.IEEE.
[51]Phil Karn.Maca - a new channel access method for packet radio.
[52]Vaduvur Bharghavan,Alan Demers,Scott Shenker,and Lixia Zhang.Macaw:a media access protocol for wireless lan's,pages 212-225,New York,NY,USA,1994.ACM.
[53]M.Talucci,F.Gerla.Maca-bi(maca by invitation),a wireless mac protocol for high speed ad hoc networking.In Universal Personal Communications Record,1997.Conference Record.,1997 IEEE 6th International Conference on,volume 2,pages 913 - 917,San Diego,CA,1997.
[54]M.Lin,C.R.Gerla.Asynchronous multimedia multihop wireless networks.In INFOCOM '97.Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings IEEE,volume 1,pages 118 - 125,Kobe,Japan.IEEE.
[55]IEEE.Ieee standard 802.11-wireless lan medium access control(mac)and physical layer(phy)specification[s],pages 72-85,1999.
[56]Hsu-Chun Yen Der Jiunn.Quality-of-service provisioning system for multimedia transmission in ieee 802.11 wireless lans.Selected Areas in Communications,23(6):1240-1252,2005.
[57]Xing Li Xin Wang,Qianli Zhang.Protocol enhancement for ieee 802.11e edcf.In Networks,2004.(ICON 2004).Proceedings.12th IEEE International Conference on,pages 80-84,2004.
[58]Network Simulator Version 2.http://www.isi.edu/nsnam/ns/.
[59]M.Carlson et al.S.Blake,D.Black.An architecture for differentiated services.RFC 2475,1998.
[60]Bahl P.Vaidya N.H.and Gupa S.Distributed fair scheduling in a wireless lan.In MobiCorn '00:Proceedings of the 6th annual international conference on Mobile computing and networking,pages 167-178,New York,NY,USA,2000.ACM.
[61]A.Grilo and M.Nunes.Performance evaluation of ieee 802.1 le.In Personal,Indoor and Mobile Radio Communications,2002.The 13th IEEE International Symposium on,volume 1,pages 511-517,Lisboa,Portugal,2002.
[62]A.Gupta S.Bahl P.Vaidya,N.Dugar.Distributed fair scheduling in a wireless lan.In Mobile Computing,IEEE Transactions on,volume 4,pages 616-629.IEEE,2005.
[63]H.Zhang J.C.R.Bennett.Wf2q:worst-case fair weighted fair queueing.In Procedings of the IEEE INFOCOM'96.IEEE.
[64]王辉,李津生,洪佩琳.802.11 wlan中一种基于循环队列的分布式公平队列调度算法.电子与信息学报,10(1):93-97,2004.
[65]S.J.Golestani.A self-clocked fair queueing scheme for broadband applications.In A selfclocked fair queueing scheme for broadband applications,pages 636-646.IEEE,1994.
[66]Thyagarajan Nandagopal,Tae-Eun Kim,Xia Gao,and Vaduvur Bharghavan.Achieving mac layer fairness in wireless packet networks.In MobiCom '00:Proceedings of the 6th annual international conference on Mobile computing and networking,pages 87-98,New York,NY,USA,2000.ACM.ISBN 1-58113-197-6.doi:http://doi.acm.org/10.1145/345910.345925.
[67]X.Banchs,A.Perez.Distributed weighted fair queuing in 802.11 wireless lan.In Communications,2002.ICC 2002.IEEE lnternational Conference on,volume 5,pages 3121-3127.IEEE.
[68]龚向阳 程时端王重钢,隆克平.分组交换网络中队列调度算法的研究及其展望.电子学报,4,2001.
[69]M.Ruixue Fan Suzuki H.Shimonishi,H.Yoshida.An improvement of weighted round robin cell scheduling in atm networks.In Global Telecommunications Conference,1997.GLOBECOM '97.,IEEE,volume 2,pages 1119-1123.IEEE,1997.
[70]M.Shreedhar and George Varghese.Efficient fair queueing using deficit round-robin.IEEE/ACM Trans.Netw.,4(3):375-385,1996.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.502236.
[71]Y.Yoshida T.Altintas,O.Atsumi.Urgency-based round robin:a new scheduling discipline for packet switching networks.In Communications,1998.ICC 98.Conference Record.1998IEEE International Conference on,volume 2,pages 1179-1184.IEEE,1998.
[72]Abhay K.Parekh and Robert G.Gallager.A generalized processor sharing approach to flow control in integrated services networks:the single-node case.IEEE/ACM Trans.Netw.,1(3):344-357,1993.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.234856.
[73]J.C.R.Hui Zhang Bennett.WF~2q:worst-case fair weighted fair queueing,pages 120-128,1996.
[74]S.J.Golestani.A self-clocked fair queueing scheme for broadband applications.In INFOCOM '94.Networking for Global Communications.13th Proceedings IEEE,volume 2,pages 636-646,1994.
[75]Pawan Goyal,Harrick M.Vin,and Haichen Cheng.Start-time fair queueing:a scheduling algorithm for integrated services packet switching networks.IEEE/ACM Trans.Netw.,5(5):690-704,1997.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.649569.
[76]Dimitrios Stiliadis and Anujan Varma.Efficient fair queueing algorithms for packet-switched networks.IEEE/ACM Trans.Netw.,6(2):175-185,1998.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.664266.
[77]Subhash Suri,George Varghese,and Girish Chandranmenon.Leap forward virtual clock:a new fair queuing scheme with guaranteed delays and throughput fairness.In PODC '97:Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing,page 281,New York,NY,USA,1997.ACM.ISBN 0-89791-952-1.doi:http://doi.acm.org/10.1145/259380.259482.
[78]Jorge A.Cobb,Mohamed G.Gouda,and Amal El-Nahas.Time-shift scheduling fair scheduling of flows in high-speed networks.IEEE/ACM Trans.Netw.,6(3):274-285,1998.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.700891.
[79]R.L.Polyzos G.C.Sariowan,H.Cruz.Scheduling for quality of service guarantees via service curves.In Computer Communications and Networks,1995.Proceedings.,Fourth International Conference on,pages 512-520.
[80]Hanrijanto Sariowan,Rene L.Cruz,and George C.Polyzos.Sced:a generalized scheduling policy for guaranteeing quality-of-service.IEEE/ACM Trans.Netw.,7(5):669-684,1999.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.803382.
[81]Ion Stoica,Hui Zhang,and T.S.Eugene Ng.A hierarchical fair service curve algorithm for link-sharing,real-time and priority services.In SIGCOMM '97:Proceedings of the ACM SIGCOMM '97 conference on Applications,technologies,architectures,and protocols for computer communication,pages 249-262,New York,NY,USA,1997.ACM.ISBN 0-89791-905-X.doi:http://doi.acm.org/10.1145/263105.263175.
[82]R.Guerin and V.Peris.Quality-of-service in packet networks:Basic mechanisms and direc-tions,1999.URL citeseer.ist.psu.edu/283222.html.
[83]A.Vahdat and D.Becker.Epidemic muting for partially connected ad hoc networks.Technical Report Technical Report CS-200006,Duke University,2000.
[84]K.Raghavendra C.S.Spyropoulos,T.Psounis.Single-copy routing in intermittently connected mobile networks.In Sensor and Ad Hoc Communications and Networks,2004.IEEE SECON 2004.2004 First Annual IEEE Communications Society Conference on,pages 235-244,2004.
[85]周晓波,张幸,彭敏,卢汉成,洪佩琳.Dtn中基于泛模板运算的运动模式发现机制.电子与信息学报,2008.3录用.
[2]Kevin Fall.A delay-tolerant network architecture for challenged internets.In SIGCOMM '03:Proceedings of the 2003 conference on Applications,technologies,architectures,and protocols for computer communications,pages 27-34,New York,NY,USA,2003.ACM.ISBN 1-58113-735-4.doi:http://doi.acm.org/10.1145/863955.863960.
[3]http://www.irtf.org.
[4]http://www.dtnrg.org,.
[5]http://www.darpa.mil/ato/solicit/dtn/.
[6]http://www-valoria.univ-ubs.fr/casa/sarah/sarah-en.html.
[7]http://www.ee.surrey.ac.uk/personal/l.wood/dtn/.
[8]Delay-tolerant network - a tutorial,.
[9]A.E.;Al-Karaki,J.N.;Kamal.Routing techniques in wireless sensor networks:a survey.Wireless Communications,IEEE[see also IEEE Personal Communications],11(6):6-28,2004.
[10]Sushant Jain,Kevin Fall,and Rabin Patra.Routing in a delay tolerant network.In SIGCOMM '04:Proceedings of the 2004 conference on Applications,technologies,architectures,and protocols for computer communications,pages 145-158,New York,NY,USA,2004.ACM.ISBN 1-58113-862-8.doi:http://doi.acm.org/10.1145/1015467.1015484.
[11]Andrew S.Tanenbaum.计算机网络(第三版).清华大学出版社,1998.
[12]Mostafa H.(Mostafa Hamed)Zegura Ellen W.Merugu,Shashidhar Ammar.Routing in space and time in networks with predictable mobility.Technical Report CC Technical Report;GITCC-04-07,Routing in Space and Time in Networks with Predictable Mobility,2004.
[13]陈飘,卢汉成,李津生,洪佩琳.Amed:用于dtn的增强型med路由算法.计算机工程,21,2007.
[14]Anders Lindgren,Avri Doria,and Olov Schelen.Probabilistic routing in intermittently connected networks.SIGMOBILE Mob.Comput.Commun.Rev.,7(3):19-20,2003.ISSN 1559-1662.doi:http://doi.acm.org/10.1145/961268.961272.
[15]Evan P.C.Jones,Lily Li,and Paul A.S.Ward.Practical routing in delay-tolerant networks. In WDTN '05:Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking,pages 237-243,New York,NY,USA,2005.ACM.ISBN 1-59593-026-4.doi:http://doi.acm.org/10.114511080139.1080141.
[16]S.Biswas and R.Morris.Opportunistic routing in multi-hop wireless networks,2005.URL citeseer,ist.psu.edu/article/biswas05opportunistic.html.
[17]A,Vahdat and D.Becker.Epidemic routing for partially connected ad hoc networks,2000.URL citeseer,ist.psu.edu/vahdat00epidemic.html.
[18]周晓波,周健,卢汉成,洪佩琳.Dtn网络的延时模型分析.计算机研究与发展,2008.2录用.
[19]田乃硕.休假随机服务系统.北京大学出版社,2001.
[20]周晓波,卢汉成,李津生,洪佩琳.Aed:一种用于dtn的增强型earliest-delivery算法.电子与信息学报,8:1956-1960,2007.
[21]徐守时.信号与系统 理论、方法和应用.合肥-中国科学技术大学出版社,2003.
[22]Ad hoc on demand distance vector(aodv)routing(rfc 3561),July 2003.
[23]方兆本,缪柏其.随机过程.中国科学技术大学出版社,1993。
[24]Thrasyvoulos Spyropoulos,Konstantinos Psounis,and Cauligi S.Raghavendra.Spray and wait:an efficient routing scheme for intermittently connected mobile networks.In WDTN '05:Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking,pages 252-259,New York,NY,USA,2005.ACM.ISBN 1-59593-026-4.doi:http://doi.acm.org/10.1145/1080139.1080143.
[25]Matthias Grossglauser and David N.C.Tse.Mobility increases the capacity ofad hoc wireless networks.IEEE/ACM Trans.Netw.,10(4):477-486,2002.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/TNET.2002.801403.
[26]http://nsnam.isi.edu/nsnam/index.php.
[27]http://www.qualnet.com.cn.
[28]http://www.opnet.com/.
[29]无线移动自组织网.人民邮电出版社,ISBN:7-115-12859-6/TN.2368,2005.
[30]D.N.C.Grossglauser,M.Tse.Mobility increases the capacity of ad hoc wireless networks.Networking,IEEE/ACM Transactions on,10(4):477 - 486,2002.
[31]T.Camp,J.Boleng,and V.Davies.A survey of mobility models for ad hoc network research.Wireless Communications & Mobile Computing(WCMC):Special issue on Mobile Ad Hoc Networking:Research,Trends and Applications,2(5):483-502,2002.URL citeseer.ist.psu.edu/camp02survey.html.
[32]Joy Ghosh,Matthew J.Beal,Hung Q.Ngo,and Chunming Qiao.On profiling mobility and predicting locations of wireless users.In REALMAN '06:Proceedings of the 2nd international workshop on Multi-hop ad hoc networks:from theory to reality,pages 55-62,New York,NY,USA,2006.ACM.ISBN 1-59593-360-3.doi:http://doi.acm.org/10.1145/1132983.1132993.
[33]Joy Ghosh,Sumesh J.Philip,and Chunming Qiao.Sociological orbit aware location approximation and routing(solar)in manet.Ad Hoc Netw.,5(2):189-209,2007.ISSN 1570-8705.doi:http://dx.doi.org/10.1016/j.adhoc.2005.10.003.
[34]Xiaoyan Hong,Mario Gerla,Guangyu Pei,and Ching-Chuan Chiang.A group mobility model for ad hoc wireless networks.In MSWiM '99:Proceedings of the 2nd ACM international workshop on Modeling,analysis and simulation of wireless and mobile systems,pages 53-60,New York,NY,USA,1999.ACM.ISBN 1-58113-173-9.doi:http://doi.acm.org/10.1145/313237.313248.
[35]A.Bai,F.Narayanan Sadagopan Helmy.Important:a framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks.In INFOCOM 2003.Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies.IEEE,volume 2,pages 825 - 835,2003.
[36]Michele Garetto and Emilio Leonardi.Analysis of random mobility models with pde's.In MobiHoc '06:Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing,pages 73-84,New York,NY,USA,2006.ACM.ISBN 1-59593-368-9.doi:http://doi.acm.org/10.1145/1132905.1132914.
[37]Christian Bettstetter.Smooth is better than sharp:a random mobility model for simulation of wireless networks.In MSWIM '01:Proceedings of the 4th ACM international workshop on Modeling,analysis and simulation of wireless and mobile systems,pages 19-27,New York,NY,USA,2001.ACM.ISBN 1-58113-378-2.doi:http://doi.acm.org/10.1145/381591.381600.
[38]Athanasios Bamis,Azzedine Boukerche,Ioannis Chatzigiannakis,and Sotiris Nikoletseas.A mobility sensitive approach for efficient routing in ad hoc mobile networks.In MSWiM '06:Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems,pages 357-364,New York,NY,USA,2006.ACM.ISBN 1-59593-477-4.doi:http://doi.acm.org/10.1145/1164717.1164778.
[39]Mirco Musolesi and Cecilia Mascolo.A community based mobility model for ad hoc network research.In REALMAN '06:Proceedings of the 2nd international workshop on Multi-hop ad hoc networks:from theory to reality,pages 31-38,New York,NY,USA,2006.ACM.ISBN 1-59593-360-3.doi:http://doi.acm.org/10.1145/1132983.1132990.
[40]K.H.Baochun Li Wang.Group mobility and partition prediction in wireless ad-hoc networks.In Communications,2002.ICC 2002.IEEE International Conference on,volume 2,pages 1017 - 1021,2002.
[41]王树和.图论及其算法.中国科学技术大学出版社,1990.
[42]M.E.J.Newman and M.Girvan.Finding and evaluating community structure in networks.Physical Review E,69:026113,2004.URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0308217.
[43]M.E.J.Newman.Fast algorithm for detecting community structure in networks.Physical Re-view E,69:066133,2004.URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0309508.
[44]M.E.J.Newman.Modularity and community structure in networks.PROC.NATL.ACAD.SCI.USA,103:8577,2006.URL doi:10.1073/pnas.0601602103.
[45]M.E.J.Newman.Mixing patterns in networks.Physical Review E,67:026126,2003.URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0209450.
[46]Chenxi Zhu and M.S.Corson.A live-phase reservation protocol(fprp)for mobile ad hoc networks.Wirel.Netw.,7(4):371-384,2001.
[47]Chenxi Zhu and Corson M S.An evolutinary-tdma scheduling protocol(e-tdma)for mobile ad hoc networks.Technical Report CSHCN TR 2001-17,ISR(Institution of System Research),Maryland,US,2001.
[48]Cesana M Frotta L.Borgonovo F.Capone A.Rr-aloha.a reliable r-aloha broadcaset channel for ad hoc inter-vehicle comminication networks.In Med-Hoc-Net,Baia Chia,Italy,2002.
[49]Cahill V.Cunningham R.Time bounded medium access control for ad hoc networks.In POMC(Principles of Mobile Computing),Toulouse,France,2002.
[50]Garcia-Luna-Aceves J J.Tang Zheyu.Hop-reservation multiple access(hrma)for ad hoc networks.In IEEE INFOCOM,pages 194-201,New York,USA,1994.IEEE.
[51]Phil Karn.Maca - a new channel access method for packet radio.
[52]Vaduvur Bharghavan,Alan Demers,Scott Shenker,and Lixia Zhang.Macaw:a media access protocol for wireless lan's,pages 212-225,New York,NY,USA,1994.ACM.
[53]M.Talucci,F.Gerla.Maca-bi(maca by invitation),a wireless mac protocol for high speed ad hoc networking.In Universal Personal Communications Record,1997.Conference Record.,1997 IEEE 6th International Conference on,volume 2,pages 913 - 917,San Diego,CA,1997.
[54]M.Lin,C.R.Gerla.Asynchronous multimedia multihop wireless networks.In INFOCOM '97.Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings IEEE,volume 1,pages 118 - 125,Kobe,Japan.IEEE.
[55]IEEE.Ieee standard 802.11-wireless lan medium access control(mac)and physical layer(phy)specification[s],pages 72-85,1999.
[56]Hsu-Chun Yen Der Jiunn.Quality-of-service provisioning system for multimedia transmission in ieee 802.11 wireless lans.Selected Areas in Communications,23(6):1240-1252,2005.
[57]Xing Li Xin Wang,Qianli Zhang.Protocol enhancement for ieee 802.11e edcf.In Networks,2004.(ICON 2004).Proceedings.12th IEEE International Conference on,pages 80-84,2004.
[58]Network Simulator Version 2.http://www.isi.edu/nsnam/ns/.
[59]M.Carlson et al.S.Blake,D.Black.An architecture for differentiated services.RFC 2475,1998.
[60]Bahl P.Vaidya N.H.and Gupa S.Distributed fair scheduling in a wireless lan.In MobiCorn '00:Proceedings of the 6th annual international conference on Mobile computing and networking,pages 167-178,New York,NY,USA,2000.ACM.
[61]A.Grilo and M.Nunes.Performance evaluation of ieee 802.1 le.In Personal,Indoor and Mobile Radio Communications,2002.The 13th IEEE International Symposium on,volume 1,pages 511-517,Lisboa,Portugal,2002.
[62]A.Gupta S.Bahl P.Vaidya,N.Dugar.Distributed fair scheduling in a wireless lan.In Mobile Computing,IEEE Transactions on,volume 4,pages 616-629.IEEE,2005.
[63]H.Zhang J.C.R.Bennett.Wf2q:worst-case fair weighted fair queueing.In Procedings of the IEEE INFOCOM'96.IEEE.
[64]王辉,李津生,洪佩琳.802.11 wlan中一种基于循环队列的分布式公平队列调度算法.电子与信息学报,10(1):93-97,2004.
[65]S.J.Golestani.A self-clocked fair queueing scheme for broadband applications.In A selfclocked fair queueing scheme for broadband applications,pages 636-646.IEEE,1994.
[66]Thyagarajan Nandagopal,Tae-Eun Kim,Xia Gao,and Vaduvur Bharghavan.Achieving mac layer fairness in wireless packet networks.In MobiCom '00:Proceedings of the 6th annual international conference on Mobile computing and networking,pages 87-98,New York,NY,USA,2000.ACM.ISBN 1-58113-197-6.doi:http://doi.acm.org/10.1145/345910.345925.
[67]X.Banchs,A.Perez.Distributed weighted fair queuing in 802.11 wireless lan.In Communications,2002.ICC 2002.IEEE lnternational Conference on,volume 5,pages 3121-3127.IEEE.
[68]龚向阳 程时端王重钢,隆克平.分组交换网络中队列调度算法的研究及其展望.电子学报,4,2001.
[69]M.Ruixue Fan Suzuki H.Shimonishi,H.Yoshida.An improvement of weighted round robin cell scheduling in atm networks.In Global Telecommunications Conference,1997.GLOBECOM '97.,IEEE,volume 2,pages 1119-1123.IEEE,1997.
[70]M.Shreedhar and George Varghese.Efficient fair queueing using deficit round-robin.IEEE/ACM Trans.Netw.,4(3):375-385,1996.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.502236.
[71]Y.Yoshida T.Altintas,O.Atsumi.Urgency-based round robin:a new scheduling discipline for packet switching networks.In Communications,1998.ICC 98.Conference Record.1998IEEE International Conference on,volume 2,pages 1179-1184.IEEE,1998.
[72]Abhay K.Parekh and Robert G.Gallager.A generalized processor sharing approach to flow control in integrated services networks:the single-node case.IEEE/ACM Trans.Netw.,1(3):344-357,1993.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.234856.
[73]J.C.R.Hui Zhang Bennett.WF~2q:worst-case fair weighted fair queueing,pages 120-128,1996.
[74]S.J.Golestani.A self-clocked fair queueing scheme for broadband applications.In INFOCOM '94.Networking for Global Communications.13th Proceedings IEEE,volume 2,pages 636-646,1994.
[75]Pawan Goyal,Harrick M.Vin,and Haichen Cheng.Start-time fair queueing:a scheduling algorithm for integrated services packet switching networks.IEEE/ACM Trans.Netw.,5(5):690-704,1997.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.649569.
[76]Dimitrios Stiliadis and Anujan Varma.Efficient fair queueing algorithms for packet-switched networks.IEEE/ACM Trans.Netw.,6(2):175-185,1998.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.664266.
[77]Subhash Suri,George Varghese,and Girish Chandranmenon.Leap forward virtual clock:a new fair queuing scheme with guaranteed delays and throughput fairness.In PODC '97:Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing,page 281,New York,NY,USA,1997.ACM.ISBN 0-89791-952-1.doi:http://doi.acm.org/10.1145/259380.259482.
[78]Jorge A.Cobb,Mohamed G.Gouda,and Amal El-Nahas.Time-shift scheduling fair scheduling of flows in high-speed networks.IEEE/ACM Trans.Netw.,6(3):274-285,1998.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.700891.
[79]R.L.Polyzos G.C.Sariowan,H.Cruz.Scheduling for quality of service guarantees via service curves.In Computer Communications and Networks,1995.Proceedings.,Fourth International Conference on,pages 512-520.
[80]Hanrijanto Sariowan,Rene L.Cruz,and George C.Polyzos.Sced:a generalized scheduling policy for guaranteeing quality-of-service.IEEE/ACM Trans.Netw.,7(5):669-684,1999.ISSN 1063-6692.doi:http://dx.doi.org/10.1109/90.803382.
[81]Ion Stoica,Hui Zhang,and T.S.Eugene Ng.A hierarchical fair service curve algorithm for link-sharing,real-time and priority services.In SIGCOMM '97:Proceedings of the ACM SIGCOMM '97 conference on Applications,technologies,architectures,and protocols for computer communication,pages 249-262,New York,NY,USA,1997.ACM.ISBN 0-89791-905-X.doi:http://doi.acm.org/10.1145/263105.263175.
[82]R.Guerin and V.Peris.Quality-of-service in packet networks:Basic mechanisms and direc-tions,1999.URL citeseer.ist.psu.edu/283222.html.
[83]A.Vahdat and D.Becker.Epidemic muting for partially connected ad hoc networks.Technical Report Technical Report CS-200006,Duke University,2000.
[84]K.Raghavendra C.S.Spyropoulos,T.Psounis.Single-copy routing in intermittently connected mobile networks.In Sensor and Ad Hoc Communications and Networks,2004.IEEE SECON 2004.2004 First Annual IEEE Communications Society Conference on,pages 235-244,2004.
[85]周晓波,张幸,彭敏,卢汉成,洪佩琳.Dtn中基于泛模板运算的运动模式发现机制.电子与信息学报,2008.3录用.