8 August 2003 Quality of service routing in wireless ad hoc networks
Author Affiliations +
Proceedings Volume 5245, Internet Quality of Service; (2003) https://doi.org/10.1117/12.510923
Event: ITCom 2003, 2003, Orlando, Florida, United States
An efficient routing protocol is essential to guarantee application level quality of service running on wireless ad hoc networks. In this paper we propose a novel routing algorithm that computes a path between a source and a destination by considering several important constraints such as path-life, availability of sufficient energy as well as buffer space in each of the nodes on the path between the source and destination. The algorithm chooses the best path from among the multiples paths that it computes between two endpoints. We consider the use of control packets that run at a priority higher than the data packets in determining the multiple paths. The paper also examines the impact of different schedulers such as weighted fair queuing, and weighted random early detection among others in preserving the QoS level guarantees. Our extensive simulation results indicate that the algorithm improves the overall lifetime of a network, reduces the number of dropped packets, and decreases the end-to-end delay for real-time voice application.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sachin J. Sane, Sachin J. Sane, Animesh Patcha, Animesh Patcha, Amitabh Mishra, Amitabh Mishra, } "Quality of service routing in wireless ad hoc networks", Proc. SPIE 5245, Internet Quality of Service, (8 August 2003); doi: 10.1117/12.510923; https://doi.org/10.1117/12.510923


Back to Top