Delay-aware Link Scheduling and Routing in Wireless Mesh Networks

Resource allocation is a critical task in computer networks because of their capital-intensive nature. In this thesis we apply operations research tools and technologies to model, solve and analyze resource allocation problems in computer networks with real-time traffic. We first study Wireless Mesh Networks, addressing the problem of link scheduling with end-to-end delay constraints. Exploiting results obtained with the Network Calculus framework, we formulate the problem as an integer non-linear optimization problem. We show that the feasibility of a link schedule does depend on the aggregation framework. We also address the problem of jointly solving the routing and link scheduling problem optimally, taking into account end-to-end delay guarantees. We provide guidelines and heuristics. As a second contribution, we propose a time division approach in CSMA MAC protocols in the context of 802.11 WLANs. By grouping wireless clients and scheduling time slots to these groups, not only the delay of packet transmission can be decreased, but also the goodput of multiple WLANs can be largely increased. Finally, we address a resource allocation problem in wired networks for guaranteed-delay traffic engineering. We formulate and solve the problem under different latency models. Global optimization let feasible schedules to be computed with instances where local resource allocation schemes would fail. We show that this is the case even with a case-study network, and at surprisingly low average loads

Channel assignment and routing in cooperative and competitive wireless mesh networks

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.In this thesis, the channel assignment and routing problems have been investigated for both cooperative and competitive Wireless Mesh networks (WMNs). A dynamic and distributed channel assignment scheme has been proposed which generates the network topologies ensuring less interference and better connectivity. The proposed channel assignment scheme is capable of detecting the node failures and mobility in an efficient manner. The channel monitoring module precisely records the quality of bi-directional links in terms of link delays. In addition, a Quality of Service based Multi-Radio Ad-hoc On Demand Distance Vector (QMR-AODV) routing protocol has been devised. QMR-AODV is multi-radio compatible and provides delay guarantees on end-to-end paths. The inherited problem of AODV’s network wide flooding has been solved by selectively forwarding the routing queries on specified interfaces. The QoS based delay routing metric, combined with the selective route request forwarding, reduces the routing overhead from 24% up to 36% and produces 40.4% to 55.89% less network delays for traffic profiles of 10 to 60 flows, respectively. A distributed channel assignment scheme has been proposed for competitive WMNs, where the problem has been investigated by applying the concepts from non-cooperative bargaining Game Theory in two stages. In the first stage of the game, individual nodes of the non-cooperative setup is considered as the unit of analysis, where sufficient and necessary conditions for the existence of Nash Equilibrium (NE) and Negotiation-Proof Nash Equilibrium (N-PNE) have been derived. A distributed algorithm has been presented with perfect information available to the nodes of the network. In the presence of perfect information, each node has the knowledge of interference experience by the channels in its collision domain. The game converges to N-PNE in finite time and the average fairness achieved by all the nodes is greater than 0.79 (79%) as measured through Jain Fairness Index. Since N-PNE and NE are not always a system optimal solutions when considered from the end-nodes prospective, the model is further extended to incorporate non-cooperative end-users bargaining between two end user’s Mesh Access Points (MAPs), where an increase of 10% to 27% in end-to-end throughput is achieved. Furthermore, a non-cooperative game theoretical model is proposed for end-users flow routing in a multi-radio multi-channel WMNs. The end user nodes are selfish and compete for the channel resources across the WMNs backbone, aiming to maximize their own benefit without taking care for the overall system optimization. The end-to-end throughputs achieved by the flows of an end node and interference experienced across the WMNs backbone are considered as the performance parameters in the utility function. Theoretical foundation has been drawn based on the concepts from the Game Theory and necessary conditions for the existence of NE have been extensively derived. A distributed algorithm running on each end node with imperfect information has been implemented to assess the usefulness of the proposed mechanism. The analytical results have proven that a pure strategy Nash Equilibrium exists with the proposed necessary conditions in a game of imperfect information. Based on a distributed algorithm, the game converges to a stable state in finite time. The proposed game theoretical model provides a more reasonable solution with a standard deviation of 2.19Mbps as compared to 3.74Mbps of the random flow routing. Finally, the Price of Anarchy (PoA) of the system is close to one which shows the efficiency of the proposed scheme.The Higher Education Commission of Pakistan and the University of Engineering and Technology, Peshawar

Mathematical modelling of end-to-end packet delay in multi-hop wireless networks and their applications to qos provisioning

This thesis addresses the mathematical modelling of end-to-end packet delay for Quality of Service (QoS) provisioning in multi-hop wireless networks. The multi-hop wireless technology increases capacity and coverage in a cost-effective way and it has been standardised in the Fourth-Generation (4G) standards. The effective capacity model approximates end-to-end delay performances, including Complementary Cumulative Density Function (CCDF) of delay, average delay and jitter. This model is first tested using Internet traffic trace from a real gigabit Ethernet gateway. The effective capacity model is developed based on single-hop and continuous-time communication systems but a multi-hop wireless system is better described to be multi-hop and time-slotted. The thesis extends the effective capacity model by taking multi-hop and time-slotted concepts into account, resulting in two new mathematical models: the multi-hop effective capacity model for multi-hop networks and the mixed continuous/discrete-time effective capacity model for time-slotted networks. Two scenarios are considered to validate these two effective capacity-based models based on ideal wireless communications (the physical-layer instantaneous transmission rate is the Shannon channel capacity): 1) packets traverse multiple wireless network devices and 2) packets are transmitted to or received from a wireless network device every Transmission Time Interval (TTI). The results from these two scenarios consistently show that the new mathematical models developed in the thesis characterise end-to-end delay performances accurately. Accurate and efficient estimators for end-to-end packet delay play a key role in QoS provisioning in modern communication systems. The estimators from the new effective capacity-based models are directly tested in two systems, faithfully created using realistic simulation techniques: 1) the IEEE 802.16-2004 networks and 2) wireless tele-ultrasonography medical systems. The results show that the estimation and simulation results are in good agreement in terms of end-to-end delay performances

Channel assignment and routing in cooperative and competitive wireless mesh networks

In this thesis, the channel assignment and routing problems have been investigated for both cooperative and competitive Wireless Mesh networks (WMNs). A dynamic and distributed channel assignment scheme has been proposed which generates the network topologies ensuring less interference and better connectivity. The proposed channel assignment scheme is capable of detecting the node failures and mobility in an efficient manner. The channel monitoring module precisely records the quality of bi-directional links in terms of link delays. In addition, a Quality of Service based Multi-Radio Ad-hoc On Demand Distance Vector (QMR-AODV) routing protocol has been devised. QMR-AODV is multi-radio compatible and provides delay guarantees on end-to-end paths. The inherited problem of AODV’s network wide flooding has been solved by selectively forwarding the routing queries on specified interfaces. The QoS based delay routing metric, combined with the selective route request forwarding, reduces the routing overhead from 24% up to 36% and produces 40.4% to 55.89% less network delays for traffic profiles of 10 to 60 flows, respectively. A distributed channel assignment scheme has been proposed for competitive WMNs, where the problem has been investigated by applying the concepts from non-cooperative bargaining Game Theory in two stages. In the first stage of the game, individual nodes of the non-cooperative setup is considered as the unit of analysis, where sufficient and necessary conditions for the existence of Nash Equilibrium (NE) and Negotiation-Proof Nash Equilibrium (N-PNE) have been derived. A distributed algorithm has been presented with perfect information available to the nodes of the network. In the presence of perfect information, each node has the knowledge of interference experience by the channels in its collision domain. The game converges to N-PNE in finite time and the average fairness achieved by all the nodes is greater than 0.79 (79%) as measured through Jain Fairness Index. Since N-PNE and NE are not always a system optimal solutions when considered from the end-nodes prospective, the model is further extended to incorporate non-cooperative end-users bargaining between two end user’s Mesh Access Points (MAPs), where an increase of 10% to 27% in end-to-end throughput is achieved. Furthermore, a non-cooperative game theoretical model is proposed for end-users flow routing in a multi-radio multi-channel WMNs. The end user nodes are selfish and compete for the channel resources across the WMNs backbone, aiming to maximize their own benefit without taking care for the overall system optimization. The end-to-end throughputs achieved by the flows of an end node and interference experienced across the WMNs backbone are considered as the performance parameters in the utility function. Theoretical foundation has been drawn based on the concepts from the Game Theory and necessary conditions for the existence of NE have been extensively derived. A distributed algorithm running on each end node with imperfect information has been implemented to assess the usefulness of the proposed mechanism. The analytical results have proven that a pure strategy Nash Equilibrium exists with the proposed necessary conditions in a game of imperfect information. Based on a distributed algorithm, the game converges to a stable state in finite time. The proposed game theoretical model provides a more reasonable solution with a standard deviation of 2.19Mbps as compared to 3.74Mbps of the random flow routing. Finally, the Price of Anarchy (PoA) of the system is close to one which shows the efficiency of the proposed scheme.EThOS - Electronic Theses Online ServiceHigher Education Commission of PakistanUniversity of Engineering and Technology, PeshawarGBUnited Kingdo

Resource allocation methods for quality-of-service provisioning in heterogeneous wireless networks

The increased use of mobile wireless devices that we have recently been witnessing, such as smartphones, tablets, e-readers, and WiFi enabled devices in general, is driving an unprecedented increase in the amount of data traffic. This fast market adoption of the wireless technology along with the tremendous success of multimedia applications brought about higher capacity, connectivity, and Quality of Service (QoS) requirements that can no longer be met with traditional networking paradigms. As a result, heterogeneous wireless networks have recently emerged as a potential solution for meeting such new requirements. Hybrid wireless mesh networks and femtocell/macrocell networks are examples of these newly emerging heterogeneous networks. While mesh networks are viewed as the backbone/core network, femtocell and cellular networks are viewed as the access networks linking end-users with the backbone networks. In this dissertation, we address the problem of resource allocation in heterogeneous networks. We investigate both types of networks/architectures: next-generation wireless backbone networks or simply wireless mesh networks (WMNs) and next-generation wireless access networks or simply femtocell (FC) networks. WMNs were first introduced to foster the availability of Internet services anywhere and at anytime. However, capacity limitation has been a fundamental challenge to WMNs, mainly due to the interference arising from the wireless nature of the environment as well as to the scarcity of the radio/channel resources. To overcome this problem, we propose in this dissertation an efficient scheduling scheme that reduces interference among active links via wise time and frequency assignments to the wireless mesh routers. The developed scheme is traffic aware in that it maximizes the capacity of wireless links but while accounting for their traffic loads, thus meeting the end-to-end bandwidth requirements as much as possible. In the second part of this thesis, we focus on developing power allocation techniques for FC networks. FCs have recently emerged as a key networking solution that has great potential for improving the capacity and coverage of traditional macrocell (MC) networks through high-speed indoor coverage. Their deployment, however, has given rise to new interference challenges which are mainly due to the FCs' autonomous nature and to the unreliability of the wireless medium. Driven by this fact, in the second part of this thesis, we first design a fully-distributed estimation-based power allocation scheme that aims at fairly maximizing the capacity of FC networks. Second, we propose a novel distributed stochastic power control scheme that aims at maintaining the users' minimum= required QoS. Finally, we provide cross-layer performance analysis of two-tier FC networks, in which we characterize the uplink interference and study its impact on the data-link layer QoS performance in FC networks

Design and optimisation of a low cost Cognitive Mesh Network

Wireless Mesh Networks (WMNs) have been touted as the most promising wireless technology in providing high-bandwidth Internet access to rural, remote and under-served areas, with relatively lower investment cost as compared to traditional access networks. WMNs structurally comprise of mesh routers and mesh clients. Furthermore, WMNs have an envisaged ability to provide a heterogeneous network system that integrates wireless technologies such as IEEE 802.22 WRAN, IEEE 802.16 WiMAX, IEEE 802.11 Wi-Fi, Blue-tooth etc. The recent proliferation of new devices on the market such as smart phones and, tablets, and the growing number of resource hungry applications has placed a serious strain on spectrum availability which gives rise to the spectrum scarcity problem. The spectrum scarcity problem essentially results in increased spectrum prices that hamper the growth and efficient performance of WMNs as well as subsequent transformation of WMN into the envisaged next generation networks. Recent developments in TV white space communications technology and the emergence of Cognitive radio devices that facilitate Dynamic Spectrum Access (DSA) have provided an opportunity to mitigate the spectrum scarcity problem. To solve the scarcity problem, this thesis reconsiders the classical Network Engineering (NE) and Traffic Engineering (TE) problems to objectively design a low cost Cognitive Mesh network that promotes efficient resources utilization and thereby achieve better Quality of Service (QoS) levels