摘要
在由以公共交通系统中的车辆为节点构成的无线网络中,由于其中节点的高速移动造成拓扑的快速变化,网络连接也多以瞬时的短暂连接为主.这构成了时延容忍网络(delay tolerant networks,DTN)的一个典型应用场景.公交节点的特性决定了其移动方式(时间、路线)带有一定的规律性.基于这一特性,构建了一种抽象的网络拓扑模型,并基于该模型提出了一种基于索引的多级分组路由算法.实验证明,基于预先的分组信息,该路由算法应用于高速移动的公交时延容忍网络中将比其他DTN路由更加的高效.
In the wireless networks which consist of vehicles of the public transportation system,the topology changes rapidly and the links between nodes connect intermittently due to the high mobility.It is a classic application scenario of delay tolerant networks（DTN）.The characteristic of node in the public transportation system determines that its mobility（such as time and path）follows a special rule.Based on this characteristic,an abstract topology of DTN is presented and a new communication efficiency weight is defined.It can provide more accurate evaluation standard for describing the communication capability between nodes pair than before.By computing the communication efficiency weight of nodes,the nodes which have similar mobility model can be recognized.An indexing-based multi-level clustering algorithm is proposed to cluster the nodes which have stronger communication capability with each other.A novel DTN routing algorithm is designed on this cluster construction,in which the cluster information of each node can provide reference for the routing algorithm to forward packets when two nodes encounter.Experiments based on the pre-cluster information prove that the proposed routing algorithm is more efficient than other DTN routings used in the high speed public transportation system.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2011年第3期407-414,共8页
Journal of Computer Research and Development
基金
通信部"十一五"重点基金项目
国家自然科学基金项目(60903027)
江苏省自然科学基金项目(10KJB520014)
