Architectural framework for wireless mobile ad hoc networks (AF WMANETs)
Computer Communications
Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks
AINTEC '07 Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet
A flexible QoS-aware routing protocol for infrastructure-less B3G networks
Proceedings of the 2009 ACM symposium on Applied Computing
Implementation and performance evaluation of a quality of service support for OLSR in a real MANET
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
QoS-Aware Congestion Adaptive Routing for streaming multimedia in Mobile Ad hoc Networks
International Journal of Communication Networks and Distributed Systems
QoSRT: a quality of service routing tree for wireless ad hoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Complexity and design of QoS routing algorithms in wireless mesh networks
Computer Communications
Prediction based qos routing in MANETs
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Capacity Optimization in TDMA Ad-Hoc Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In an ad-hoc network, all communication is done overwireless media, without the help of wired base stations.While many routing protocols have been developed to findand maintain routes based on a best-effort service model,quality-of-service (QoS) routing in an ad-hoc network isdifficult because the network topology may changeconstantly and the available state information for routingis inherently imprecise.In this paper, we discuss how to support QoS routing inOLSR (Optimized Link State Routing Protocol, one of therouting protocols under study by the IETF MANETWorking Group). We develop heuristics that allow OLSRto find the maximum bandwidth path, show throughsimulation that these heuristics do improve OLSR in thestatic network case, and finally, we prove that for ourad-hoc network model, two of the heuristics are indeedoptimal (i.e., guarantee that the highest-bandwidth pathbetween any two nodes is found).