Document Type
Conference Proceeding
Publisher
IEEE
Faculty
Faculty of Computing, Health and Science
School
School of Engineering / Centre for Communications Engineering Research
RAS ID
10962
Abstract
An admission control Algorithm must organize among flows and should afford assurance of how the medium is shared between nodes. In a wired network, nodes can keep an eye on the medium to see how much bandwidth is being used by the network. On the other hand, in an Ad-Hoc network, during communication nodes possibly will use the bandwidth of neighbouring nodes. Consequently, the bandwidth consumption of flows and the accessible resources to a node are not local concepts, other than it being linked to the neighbouring nodes in carrier-sensing range. Current solutions do not address how to perform admission control in such an environment so that the admitted flows in the network do not exceed network capacity. Here I present an application to demonstrate how the bandwidth is shared between nodes and the effectiveness of admission control framework to support QoS in Ad-Hoc networks.
DOI
10.1109/FSKD.2010.5569081
Access Rights
free_to_read
Comments
This is an Author's Accepted Manuscript of: Ramraj, R. K. (2010). Bandwidth Allocation and Routing Information for Wireless Mobile Ad-hoc Networks. Proceedings of International Conference on Fuzzy Systems and Knowledge Discovery. (pp. 2968-2972). . Yantai, China. IEEE. Available here
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.