Call admission control in wireless mesh networks

• Main Author: Naghavi, Nika
• Other Authors: Friderikos, Vasilis ; Aghvami, Abdol-Hamid
• Published: King's College London (University of London) 2017
• Subjects: 621.384
• Online Access: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.718593

Efficiency in managing scarce wireless resources has been a major design obstacle in wireless mobile networks since its advent. A large body of work has been published on the subject in relation to the first two generation and third generation (3G) of wireless networks. However, these solutions are not readily applicable to the future IP based multi-hop wireless networks. Increased trend in the number of users accessing multimedia rich traffic, and the impacts of mobility management support mechanisms alongside the shared nature of backhaul nodes demand exploration of new avenues of resource management policies. In this thesis a set of schemes are proposed to address the issue of Call Admission Control (CAC) in future multi-hop IP based mobile networks. The first scheme is based on a joint CAC and route assignment design mechanism in Wireless Mesh Networks (WMNs) environment, addressing issues such as pricing policies, wireless resource constraints of the access and backhaul links as well as maximising network provider's revenue. Study's focus is then shifted towards CAC design in Mobility Agent (MA) based Proxy Mobile IPv6 (PMIPv6) networks. A novel class-based CAC mechanism was proposed with the aim of eliminating bottleneck effect at the MAs. To further improve the overall capacity of the network, in conjunction with the proposed CAC mechanism, a modified version of a previously proposed Route Optimisation (RO) scheme is implemented. The performance of the proposed schemes is investigated and analysed through extensive simulations. Comparative studies are then carried out to examine the network provider's total revenue gain in WMNs environment, total blocking probability and per class blocking probability in PMIPv6 networks.