QoS preemptive routing with bandwidth estimation for improved performance in ad hoc networks

Downloads

Downloads per month over past year

Thriveni, J. and Alekhya, V.L. and Deepa, N. and Uma, B. and Alice, A. and Prakash, G.L and Venugopal, K.R and Patnaik, L.M. (2008) QoS preemptive routing with bandwidth estimation for improved performance in ad hoc networks. In: QoS preemptive routing with bandwidth estimation for improved performance in ad hoc networks, 12-14 Dec. 2008, Colombo.

[img] Text
QoS Preemptive Routing with Bandwidth Estimation.pdf
Restricted to Registered users only

Download (153kB)
Official URL: https://doi.org/10.1109/ICIAFS.2008.4784005

Abstract

Ad hoc networks are collection of mobile nodes which communicate using wireless media without any fixed infrastructure. Each mobile host acts both as a network router and an end point as packets are forwarded over multiple hops. Node mobility being the distinguishing feature of the mobile ad hoc network, makes routing an important challenge. Hence, Quality of Service (QoS) is not easily achieved in ad hoc networks. To provide QoS routing in Ad hoc networks, it is not just sufficient to provide a basic routing functionality where only a feasible route is found, other aspects like the bandwidth constraints due to shared media, dynamic topology due to continuously changing topology and the power consumption due to limited battery powers must also be considered. The nodes in the Ad hoc network move randomly, hence, the topology changes continuously resulting in route breakage. Thus, the route breakage must first be detected and a new route should be found to the destination in advance. This paper proposes a QoS Preemptive Routing protocol with Bandwidth estimation (QPRB) that computes the available bandwidth in the route and then sets up the route based on the network traffic and maintains the route using preemptive routing procedure. This protocol provides QoS support to the real time applications by providing a feedback about the network status. The algorithm improves network performance and performs well in route breakage conditions as better routes are found in advance to route breakage. The cost incurred to detect the route breakage and to find a new route is avoided. Simulation results show that the protocol significantly improves the packet delivery ratio and reduces the end-to-end delay in the route breakage conditions. © 2008 IEEE.

Item Type: Conference or Workshop Item (Paper)
Additional Information: cited By 1; Conference of 2008 4th International Conference on Information and Automation for Sustainability, ICIAFS 2008 ; Conference Date: 12 December 2008 Through 14 December 2008; Conference Code:75796
Uncontrolled Keywords: Available bandwidths; Bandwidth constraints; Bandwidth estimation; Dynamic topologies; End points; End-to-end delay; Mobile Ad-hoc networks; Mobile hosts; Mobile nodes; Multiple hops; Network routers; Network status; Network traffics; Node mobilities; Packet delivery ratio; Power consumption; Preemptive routing; Qos routing; Qos supports; Real-time applications; Routing functionalities; Simulation results; Wireless medias, Bandwidth; Estimation; Internet; Mobile telecommunication systems; Quality of service; Routers; Routing algorithms; Routing protocols; Sustainable development; Systems engineering; Topology; Wireless telecommunication systems, Ad hoc networks
Subjects: Faculty of Engineering > Computer Science & Information Science Engineering
Divisions: University Visvesvarayya College of Engineering > Department of Computer Science and Information Science Engineering
Depositing User: Mr. Kirana Kumar D
Date Deposited: 27 Feb 2016 09:55
Last Modified: 27 Feb 2016 09:55
URI: http://eprints-bangaloreuniversity.in/id/eprint/1708

Actions (login required)

View Item View Item