Bandwidth guaranteed routing protocol in ad hoc networks
Wei Ding · Journal of China Institute of Communications · 2005
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.