摘要
捷径冲突是Ad Hoc网络中QoS路由特有的一种现象,它由Wenjian Shao在[2]中首次提出.本文进一步研究了捷径冲突现象,给出了一个更加准确的定义,且给出了一个基于时分的分布式QoS路由算法成功地避免了捷径冲突现象.本算法是基于TDMA的分布式算法,每个节点只需了解网络的局部信息即可.数据分析表明本算法预留的最大带宽比较接近Ad Hoc网络中所能用的最大带宽.
Shortcut collision is a special phenomena in the QoS routing of Ad Hoc networks. It is first proposed by Wenjian Shao in [2]. This paper further researches it, and gives out a more precise definition. Also a distributed bandwidth reservation algorithm for QoS routing protocol is proposed to solve it. This algorithm is based on TDMA, and every node just need to konw the local information. The data analysis show that the largest saving bandwidth of our algorithm is very close to the largest bandwidth in Ad Hoc network.
出处
《应用数学与计算数学学报》
2008年第2期28-34,共7页
Communication on Applied Mathematics and Computation
基金
国家自然科学基金(批准号:60572066)资助项目
上海市教委重点课题(批准号:06ZZ84)
上海市优秀青年基金(批准号:SLX07022)
关键词
AD
HOC网络
分布式算法
QoS
资源预留
捷径冲突
Ad hoc networks
distributed algorithm
QoS
bandwidth reservation
shortcut collision
