Real time data, Quality of Service, Resource Management, M/M/1 Queuing
Wireless ad hoc network consists of inexpensive nodes that form a mobile communication network. Due to limitations of the transmission range, the nodes rely on each other to forward packets such that messages can be delivered across the network. The selection of the path along which a packet is forwarded from the source node to the destination node is done by the routing algorithm. Most commonly used routing algorithms, though effective for non-real time applications, cannot handle real-time applications that require strict delay bounds on packet delivery. In this thesis, we propose a routing protocol that ensures timely delivery of real time data packets. The idea is to route packets in such a way that irrespective of factors like traffic load and node density, the average delay remains within acceptable bounds. This is done by carefully accessing the resources available to a route before a session is admitted along that route. Each link in the route is checked for sufficient bandwidth not only for the new session to be admitted but also for the sessions that are already using that link. The new session is admitted only if the admission does not violate the delay bounds of any on-going sessions. This method of route selection coupled with per-hop link reservations allows us to provide bounds on the delay performance. Extensive simulation experiments have been conducted that demonstrate the performance of the proposed routing protocol in terms of throughput, session blocking probability, packet drop probability, average path length, and delay.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Master of Science (M.S.)
College of Engineering and Computer Science
Electrical Engineering and Computer Science
Length of Campus-only Access
Masters Thesis (Open Access)
Darshana, Dipika, "Delay Sensitive Routing For Real Time Traffic Over Ad-hoc Networks" (2008). Electronic Theses and Dissertations. 3496.