摘要
研究adhoc网络中无线链路存在邻近链路干扰及隐藏终端和暴露终端问题,提出新的带宽预留模型及带宽保证路由协议(BGRP),旨在按需探测符合带宽需要的路由路径并预留可靠的带宽资源。理论分析证明,BGRP探测的路由路径能满足带宽需要,而且预留的带宽资源准确有效。仿真结果表明,就有效带宽而言,BGRP较INSIGNIA和BGSR算法有效,而且消息复杂性较小,具有良好的网络扩展性。
Based on the researching of disturbing on radio, hidden and exposed terminal problem, a bandwidth guaranteed routing protocol in ad hoc networks was proposed to find a bandwidth guaranteed routing path on demand and reserve enough bandwidth resources to support communication. Theoretic analysis showed that routing path found by BGRP could guaranteed in bandwidth and reserve bandwidth was exact. Simulation result shows that, in terms of available bandwidth, BGRP outperforms INSIGNIA and BGSR algorithm. Furthermore, BGRP can scale well in large networks for low message overhead.
出处
《通信学报》
EI
CSCD
北大核心
2005年第6期42-48,56,共8页
Journal on Communications
基金
国家自然科学基金资助项目(60372101)
