Faculty of Computing, Health and Science
School of Engineering / Centre for Communications Engineering Research
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.