A Non-Cooperative Game Approach for Bandwidth Allocation in Heterogeneous Wireless Networks

This paper presents a dynamic bandwidth allocation scheme for multiple services in heterogeneous networks. A utility function is introduced first, whose parameters are determined by the modified multi-state Analytic Hierarchy Process (AHP) which adapts to different load levels according to dynamic thresholds. Based on this, a bandwidth allocation algorithm is proposed for Constant Bit Rate (CBR) and Variable Bit Rate (VBR) services depending on not only utility fairness among different networks, but also the fairness between new arrival and ongoing services. Simulation results show that the proposed algorithm is effective in guaranteeing both the fairness of the edge users and the network system performance, i.e. keeping low block probability in the wireless network system.

SummaryWe investigate the problem of joint downlink wireless backhaul bandwidth (WBB) and power allocation in heterogeneous cellular networks (HCNs). A WBB partitioning scheme is considered, which allocates the whole bandwidth between the macrocell and small cells for data transmission and backhauling. We formulate an optimization problem to maximize the weighted sum logarithmic utility function by jointly optimizing WBB portion and fronthaul power allocation of each base station with consideration of the backhaul capacity limitation on each small cell. In order to solve this joint optimization problem, we propose a hierarchical two‐level approach and decompose the original problem into two independent subproblems: the WBB allocation at the macrocell base station (MBS) and the power allocation at both the MBS and small cell base stations (SBSs). Accordingly, the optimal WBB portion and power allocation solutions are obtained, respectively. Furthermore, we develop a distributed algorithm to implement the joint WBB and power allocation. Numerical results verify the effectiveness of the proposed approach and analyze the impact of the weighted coefficient and backhaul capacity limitation on the network performance. In addition, significant performance gains can be achieved by the proposed approach over the benchmark.

In this paper, a priority-based bandwidth allocation in the context of heterogeneous wireless network is studied. By utilizing the mobile terminals with multi-homing capability, which simultaneously accesses bandwidth from different wireless network, a novel utility-based bandwidth allocation approach is introduced. An essential factor is the priority mechanism considering the services priority classification, which means the higher-priority service request can be guaranteed on bandwidth allocation prior to the lower-priority service request. The utility function is used to distinguish both the service priority and the network subscribers compared to other users. The bandwidth allocation problem is formulated as an optimization problem and solved by Lagrangian duality. Numerical results reveal that the optimal bandwidth allocation algorithm can differentiates the priority-based service and utilize all available resources within the network capacity.

Resource allocation and admission control algorithm based on non-cooperation game in wireless mesh networks

Many studies have shown that Vegas TCP has a better throughput and stability than Reno TCP in homogeneous networks with a single TCP flavor, but performs less well in heterogeneous networks in which two TCP flavors coexist. The progressive behavior of Reno TCP and the conservative behavior of Vegas TCP cause a bias when they are used simultaneously, and thus Vegas TCP fails to obtain a fair share of the bandwidth. This paper examines the origins of this bias and proposes a threshold-based congestion control mechanism designed to alleviate the resulting unfairness problem. The simulation results show that the proposed scheme achieves a higher throughput than the conventional Vegas TCP scheme and preserves the stability of the conventional scheme when used in heterogeneous wired and wireless networks.

As many access technologies develop, more and more heterogeneous wireless networks appear around us. In this case, when whole mobile networks move from the visiting network to another, the handoff attracts the attentions especially. The exited handoff methods with network mobility merely extended the scheme of handoff in MIPv6 or integrated the exited methods into the uniform scheme but it can not make the good effect to really and truly solve the fast and smooth (packet lossless) handoff in heterogeneous wireless networks. In this paper, the fast handoff scheme is given and it provides Multi-Mobile Router (MMR) with a vicinage table to keep information about their vicinages access router. Using this method, it performs the Fast Handoff with network mobility effectively in heterogeneous wireless networks. In addition, we introduce the new entity TCS (temporary control server) to manage MMR procedure in order to complete fast handoff and reduce the power consumption of MMR. By analysis and simulations, we demonstrate that fast handoff scheme has the better performance than Basic NEMO.

The rapid growth of mobile video traffic and user demand poses a more stringent requirement for efficient bandwidth allocation in mobile networks where multiple users may share a bottleneck link. This provides content providers an opportunity to jointly optimize multiple users’ experiences but users often suffer short connection durations and frequent handoffs because of their high mobility. In this paper, we propose an end-to-end scheme, VSiM, for supporting mobile video streaming applications in heterogeneous wireless networks. The key idea is allocating bottleneck bandwidth among multiple users based on their mobility profiles and Quality of Experience (QoE)-related knowledge to achieve max-min QoE fairness. Besides, the QoE of buffer-sensitive clients is further improved by the novel server push strategy based on HTTP/3 protocol without affecting the existing bandwidth allocation approach or sacrificing other clients’ view quality. VSiM is lightweight and easy to deploy in the real world without touching the underlying network infrastructure. We evaluated VSiM experimentally in both simulations and a lab testbed on top of the HTTP/3 protocol. We find that the clients’ QoE fairness of VSiM achieves more than 40% improvement compared with state-of-the-art solutions, i.e., the viewing quality of clients in VSiM can be improved from 720p to 1080p in resolution. Meanwhile, VSiM provides about 20% improvement of average QoE.

Quality of experience (QoE) has been a user-centric performance metric for multimedia communications. Existing communication protocols over heterogeneous networks are mostly based on quality of service, which ignores the user satisfaction and subjective evaluation. In this paper, the authors propose a novel QoE-aware multimedia communication framework for heterogeneous wireless networks. Specifically, the authors make three main contributions in this paper: (i) a general QoE model has been established by jointly characterising the multimedia applications and heterogeneous networks, (ii) the issue of multimedia communications over heterogeneous networks has been transformed as a stochastic optimisation problem, and (iii) the optimal solution is provided by designing a QoE-aware multimedia scheduling scheme. Importantly, the proposed scheme is simply enough for online implementation. Numerical simulations have demonstrated the efficiency and robustness of the proposed scheme.

Content caching at edge of the network has been considered as an effective way to reduce latency and alleviate burden on backhaul. In this paper, cache placement and bandwidth allocation strategies are jointly investigated in a multi-user system of a heterogenous network consisting of one macro base station and multiple small base stations. With the goal of minimizing outage probability, a simulated annealing algorithm-aided cache placement scheme along with an optimized bandwidth allocation via a dual decomposition method is proposed while taking into account the constraints of total available bandwidth, storage capacity of caching nodes, and fairness among users. Unlike previous works, the optimizations of the cache placement and bandwidth allocation are jointly considered in this paper. Meanwhile, in order to guarantee performance of each individual user while optimizing outage probability of the entire system, user fairness is taken into account as well. Simulation results show that, compared with other cache placement and bandwidth allocation schemes, the proposed method can obtain lower outage probability and maintain user fairness.

SummaryNetwork selection mechanisms have a significant role in guaranteeing the QoS for users in a heterogeneous wireless networks environment. These mechanisms allow the selection of an optimal wireless network to satisfy the needs of users. Users are provided with the opportunity to select from multiple connectivity opportunities available all over various wireless networks. Furthermore, the network operators themselves can execute active selection strategies that facilitate proper decision making, in which user preferences are considered. This study proposes a new noncooperative competing game‐theoretic model and strategy space based on user preference. This model can solve network selection problems and capture the inter‐linkages of decisions taken by various networks. A generalized simple additive weighting method is incorporated into the framework of noncooperative game theory. In addition, the utility function is employed to assess the usefulness of the system. Simulation results and analysis illustrate the efficacy of the suggested model in attaining optimum network utility for heterogeneous wireless networks while optimizing user satisfaction. Copyright © 2014 John Wiley & Sons, Ltd.

Due to lack of resources such as transmission power and bandwidth in satellite systems, resource allocation problem is a very important challenge. Nowadays, new heterogeneous network includes one or more satellites besides terrestrial infrastructure, so that it is considered that each satellite has multi-beam to increase capacity. This type of structure is suitable for a new generation of communications, which leads to a specific benefit of using the available resource in wireless communication systems. The multi-beam technology is one of the multiple access methods for new satellite systems that are similar to very high throughput satellites systems. Therefore, in this paper, our proposed algorithm is mainly the jointly power and bandwidth allocation of satellite systems to each beam and it is simulated considering the limitation of the total transmission power and bandwidth constraints for any beams. Furthermore, a bandwidth sharing algorithm is provided to dedicate extra bandwidth among beams. Finally, the total capacity of our proposed system model, which is heterogeneous network is obtained based on some parameters such as frequency reuse, modulation rate and total number of users for each beam. This comparison shows that the proposed algorithm allows maintaining the optimal capacity allocation to use a new satellite network.

Network reliability analyses have received much attention in heterogeneous wireless network performance evaluation during the last few years. In this paper, a method for heterogeneous wireless network reliability evaluation to meet the required levels of heterogeneous wireless network differences of various graph-theoretic connectivity measures is proposed. A concept of heterogeneous wireless network reliability degree is proposed and a heterogeneous wireless network reliability entropy-based method for analyzing the proposed reliability measure is discussed. This method is based on heterogeneous wireless network survivability and stability analyses. Its core is the computation of some heterogeneous wireless network combinatorial invariants. These invariants, once computed, directly provide pure and simple framework for computation of heterogeneous wireless network reliability. We illustrate how a new approach to assessing the performance of in heterogeneous wireless networks. Our results also illustrate how the characteristics of the heterogeneous wireless networks may affect the performance of the different measures. We also present some simulation results.

A new economic generalized particle model for flow control

How many small cell (SC) access points (APs) are required to guarantee a chosen quality of service in a heterogeneous network? In this chapter, we answer this question considering two different network models. The first is the downlink of a finite-area SC network where the locations of APs within the chosen area are uniformly distributed. A key step in obtaining the closed-form expressions is to generalize the well-accepted moment matching approximation for the linear combination of lognormal random variables. For the second model, we focus on a two-layer downlink heterogeneous network with frequency reuse-1 hexagonal macro cells (MCs), and SC APs that are placed at locations that do not meet a chosen quality of service from macro base stations (BSs). An important property of this model is that the SC AP locations are coupled with the MC coverage. Here, simple bounds for the average total interference within an MC makes the formulation possible for the percentage of MC area in outage, as well as the required average number of SCs (per MC) to overcome outage, assuming isolated SCs. Introduction Heterogeneous cellular networks (HCNs) are being considered as an efficient way to improve system capacity as well as effectively enhance network coverage [1, 2]. Comprising multiple layers of access points (APs), HCNs encompass a conventional macro cellular network (first layer) overlaid with a diverse set of small cells (SCs) (higher layers). Cell deployment is an important problem in heterogeneous networks, both in terms of the number and positioning of the SCs. Traditional network models are either impractically simple (such as the Wyner model [3]) or excessively complex (e.g., the general case of random user locations in a hexagonal lattice network [4]) to accurately model SC networks. A useful mathematical model that accounts for the randomness in SC locations and irregularity in the cells uses spatial point processes, such as Poisson point process (PPP), to model the location of SCs in the network [5–10]. The independent placement of SCs from the MC layer, has the advantage of analytical tractability and leads to many useful SINR and/or rate expressions. However, even assuming that wireless providers would deploy SCs to support mobile broadband services, the dominant assumption remains that SCs are deployed randomly and independent of the MC layer [11].

In this paper, we investigate the bandwidth and power allocation problem in remote radio head cluster (RRHC)-based millimeter wave (mm-wave) massive MIMO heterogeneous cloud radio access networks with limited fronthaul capacity. The coordinated multipoint transmission is applied in each RRHC for cancelling the intra-cluster interference. To avoid the inter-tier interference, distinct bandwidths are allocated to macro base station and RRHs. Following this, we formulate a bandwidth and power allocation optimization problem to maximize the downlink weighted sum rate of the system subject to per-RRHC power and fronthaul capacity constraints, which is a non-convex optimization problem and is difficult to directly solve. Next, we fix the bandwidth allocation and the original problem can be divided into two independent optimization problems, i.e., the weighted sum rate maximization problems of MUs and RRH users, respectively. For the former, the convex optimization technique can be used to solve it. As for the latter, a two-loop iterative algorithm is proposed to deal with it. Specifically, we propose the price-based outer iteration to control the fronthaul capacity and the weighted minimum mean square error-based inner iteration to obtain the power allocation. To this end, a 1-D search method is adopted to find the optimal bandwidth allocation. Finally, numerical results are conducted to verify the effectiveness of the proposed algorithms under different parameters.