Coordinated Resource Assignment in a Fixed Wireless System

In this paper, we study the interferencemanagement and resource allocation problem in apacket-switched, fixed, broadband, Time DivisionMultiple Access (TDMA) wireless system. These systemshave the potential to provide high-speed data access to the homeand therefore are of current interest. The systemcapacity is limited by the co-channel interference,which arises from both intercell and intracelltransmissions. The intracell interference management andresource allocation, which significantly impacts thesystem performance, is the focus of this study. The goalis to design efficient resource allocation schemes to combat intracell interference so as toimprove the system capacity and service quality. Weaddress the following issues: (1) estimating the optimalcapacity of the system; (2) proposing resourceallocation schemes with reasonable complexity that areclose to optimal; and (3) proposing a new class of powercontrol schemes that are suited to intracellinterference management. Two resource allocation schemes are proposed: Max-Min Scheduling Protocol(MMSP) and Revisited Max-Min Scheduling Protocol(RMMSP). We show via simulations that these schemescombined with the new power control provide close tooptimal performance.     

Utility Optimization Based on MSE for Parallel Broadcast Channels: The Square Root Law

In order to design efficient online resource allocation algorithms, convexity of the underlying optimization problem is an important prerequisite. This paper covers two resource allocation problems: the sum-power constrained utility maximization and the sum-power minimization for minimum utility requirements for parallel broadcast channels. We derive a new class of utility functions for which both optimization problems can be transformed into convex representations and give necessary and sufficient conditions for the optimum solution of the original non-convex problems with regard to power. We thereby extend the known log-convexity class for which convex representations can be found and, by introducing the square-root criteria, present a straight forward test to check whether arbitrary utility functions belong to our class. For the new class of utility functions we present simple algorithms which operate in the non-convex domain, prove convergence to the global optimum and evaluate their performance by simulations. Besides, the paper reveals some insights on the general structure of the mean square error region and thereby disproves a former result.     

CELL LOSS QUALITY OF SERVICE IN AN INTEGRATED TRAFFIC ATM NETWORK

This paper explores and evaluates several aspects of quality of service (QOS) in an integrated traffic ATM network. Specifically, we consider the relationships between service class definitions, usage parameter control (UPC) or policing of customer traffic, network resource allocation mechanisms, and specific network conditions under which realistic QOS limits on cell loss ratio (CLR) can be met. Traffic consists of a mixture of voice, video, image and data divided into two service classes for UPC and network resource allocation. The block oriented network simulator (BONeS) tool is used for performance evaluations. Limitations associated with evaluating very low CLR values (e.g. 10⁻⁸ and 10⁻⁶) via simulation are overcome by a hybrid simulation and extrapolation technique. It is found that these stringent QOS limits on CLR can be met for most traffic with the techniques used here, reasonable backbone trunk loads (75 per cent) and reasonable buffer sizes (200–250 cell buffers per queue). However, meeting similar limits for extremely bursty traffic (such as our image traffic model) would require extra care in network design and operation, including judicious segregation of traffic.     

Queue-aware uplink bandwidth allocation and rate control for polling service in IEEE 802.16 broadband wireless networks

IEEE 802.16 standard defines the air interface specifications for broadband access in wireless metropolitan area networks. Although the medium access control signaling has been well-defined in the IEEE 802.16 specifications, resource management and scheduling, which are crucial components to guarantee quality of service performances, still remain as open issues. In this paper, we propose adaptive queue-aware uplink bandwidth allocation and rate control mechanisms in a subscriber station for polling service in IEEE 802.16 broadband wireless networks. While the bandwidth allocation mechanism adaptively allocates bandwidth for polling service in the presence of higher priority unsolicited grant service, the rate control mechanism dynamically limits the transmission rate for the connections under polling service. Both of these schemes exploit the queue status information to guarantee the desired quality of service (QoS) performance for polling service. We present a queuing analytical framework to analyze the proposed resource management model from which various performance measures for polling service in both steady and transient states can be obtained. We also analyze the performance of best-effort service in the presence of unsolicited grant service and polling service. The proposed analytical model would be useful for performance evaluation and engineering of radio resource management alternatives in a subscriber station so that the desired quality of service performances for polling service can be achieved. Analytical results are validated by simulations and typical numerical results are presented.     

Fair and Efficient Spectrum Resource Allocation and Admission Control for Multi-user and Multi-relay Cellular Networks

This paper studies the joint relay selection and spectrum allocation problem for multi-user and multi-relay cellular networks, and per-user fairness and system efficiency are both emphasized. First, we propose a new data-frame structure for relaying resource allocation. Considering each relay can support multiple users, a \(K\) -person Nash bargaining game is formulated to distribute the relaying resource among the users in a fair and efficient manner. To solve the Nash bargaining solution (NBS) of the game, an iterative algorithm is developed based on the dual decomposition method. Then, in view of the selection cooperation (SC) rule could help users achieve cooperation diversity with minimum network overhead, the SC rule is applied for the user-relay association which restricts relaying for a user to only one relay. By using the Langrangian relaxation and the Karush–Kuhn–Tucker condition, we prove that the NBS result of the proposed game just complies with the SC rule. Finally, to guarantee the minimum rate requirements of the users, an admission control scheme is proposed and is integrated with the proposed game. By comparing with other resource allocation schemes, the theoretical analysis and the simulation results testify the effectiveness of the proposed game scheme for efficient and fair relaying resource allocation.     

On the fairness of resource allocation in wireless mesh networks: a survey

This article presents a comprehensive survey of resource allocation techniques in Wireless Mesh Networks (WMNs). Wireless mesh networks have emerged as a key technology for next generation application specific multi-hop wireless networks. We analyze the state-of-the-art resource allocation schemes for WMNs, providing comprehensive taxonomy of the latest work and the future research trends in this field. In general, the resources that are available for WMNs include time, frequency, space, relays, and power. An efficient utilization of these resources can make the network more robust, reliable, and fair. We categorize the resource allocation into “radio” resource allocation, “physical” resource allocation, “utility” based resource optimization, and “cross layer” resource optimization. An ample review of resource allocation schemes within these categories is provided.     

Joint relay assignment and rate–power allocation for multiple paths in cooperative networks

Multi-path transmission is an efficient way to balance the power consumption from a source to a destination. The previous works have studied rate–power allocation to prolong the network lifetime of multiple paths. As at least one relay node is required to participate into cooperative transmission, its assignment will greatly impact the power consumption of cooperative communication. Thus, this paper addresses the joint resource allocation problem which aims to prolong the lifetime of multi-path cooperative transmission. Given a path set from a source to a destination, we first define the lifetime-optimal relay assignment and rate–power allocation problem (LRRP) for multiple paths with cooperative communications. This paper then presents two heuristic algorithms, called BS-RRP and PS-RRP, to implement efficient resource allocation for multiple paths. The BS-RRP algorithm uses the binary search method to solve the LRRP problem on node-disjoint paths, and reaches the approximate performance 1 ? ?, where ? is an arbitrarily small positive constant. PS-RRP adopts the pattern search method for joint resource allocation on link-disjoint paths, and terminates after finite iterations. The simulation results show that the BS-RRP and PS-RRP algorithms can improve the network lifetimes about 26 and 30 % compared with the resource allocation methods under the non-cooperative communication scheme.     

A scalable network resource allocation mechanism with bounded efficiency loss

The design of pricing mechanisms for network resource allocation has two important objectives: 1) a simple and scalable end-to-end implementation and 2) efficiency of the resulting equilibria. Both objectives are met by certain recently proposed mechanisms when users are price taking, but not when users can anticipate the effects of their actions on the resulting prices. In this paper, we partially close this gap, by demonstrating an alternative resource allocation mechanism which is scalable and guarantees a fully efficient allocation when users are price taking. In addition, when links have affine marginal cost, this mechanism has efficiency loss bounded by 1/3 when users are price anticipating. These results are derived by studying Cournot games, and in the process we derive the first nontrivial constant factor bounds on efficiency loss in these well-studied economic models.     

Proportional-fair power allocation with CDF-based scheduling for fair and efficient multiuser OFDM systems

In this paper we investigate adaptive resource allocation schemes in multiuser OFDM systems for fair share of resources and efficient operation. We employ the CDF-based scheduling (CS) algorithm for the subcarrier allocation, taking advantage of its distinctive feature of analyzability and multiuser diversity. Noting that conventional power allocation schemes do not exhibit efficient and fair operations in heterogeneous user channel environment, we present a new algorithm called proportional-fair power allocation (PFPA). This algorithm is designed to allocate transmission power in such a way that the resulting relative throughput-increment is identical for all subcarriers. The PFPA algorithm is shown to be equivalent to the power allocation of the asymptotically optimal algorithm, which exhibits the largest achievable region in the asymptotic case. Numerical results reveal that the combined CS-PFPA algorithm improves the overall system capacity in terms of time-average throughput and provides efficient estimation of user performances. Further, the CS-PFPA algorithm can meet each user's requirements using a minimum amount of resources, so it renders an efficient and fair means for resource allocation in multiuser OFDM systems.     

Efficient Resource Allocation for Policy-Based Wireless/Wireline Interworking

This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning and resource allocation is driven by the service level agreement (SLA). For end-to-end IP QoS delivery, each wireless access domain can independently choose its internal resource management policies to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a core network following policy rules to meet the transit domain SLA (TRSLA). Particularly, we propose an engineered priority resource sharing scheme for a voice/data integrated wireless domain, where the policy rules allow cellular-only access or cellular/WLAN interworked access. By such a resource sharing scheme, the CASLA for each service class is met with efficient resource utilization, and the interdomain TRSLA bandwidth requirement can be easily determined. In the transit domain, the traffic load fluctuation from upstream access domains is tackled by an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization. Advantages of the inter-SLA resource sharing technique are that the core network service provider can freely design the policy rules that define underload and overload status, determine the bandwidth reservation, and distribute the spare resources among bandwidth borrowers, while all the policies are supported by a common set of resource allocation techniques.     

Resource allocation based on cross-layer QoS-guaranteed scheduling for multi-service multi-user MIMO–OFDMA systems

Cross-layer strategies for resource allocation in wireless networks are essential to guaranty an efficient utilization of the scarce resource. In this paper, we present an efficient radio resource allocation scheme based on PHY/MAC cross layer design and QoS-guaranteed scheduling for multi-user (MU), multi-service (MS), multi-input multi-output (MIMO) concept, orthogonal frequency division multiple access (OFDMA) systems. It is about a downlink multimedia transmission chain in which the available resources as power and bandwidth, are dynamically allocated according to the system parameters. Among these parameters, we can mention the physical link elements such as channel state information, spectral efficiency and error code corrector rate, and MAC link variables, which correspond to the users QoS requirements and the queue status. Primarily, we use a jointly method which parametrizes these system parameters, according to the total power, and the bit error rate constraints. Secondly, we propose a QoS-guaranteed scheduling that shares the sub-carriers to the users. These users request several type of traffic under throughput threshold constraints. The main objective in this work is to adjust the average throughput per service of each user, according to their needs and likewise to satisfy a great number of connexions. Subsequently, we consider a model of moderated compartmentalization between various classes of services by partitioning the total bandwidth into several parts. Each class of service will occupy a part of the bandwidth and will be transmitted over a maximum number of sub-carriers. The simulation results show that the proposed strategy provides a more interesting performance improvement (in terms of average data rate and user satisfaction) than other existing resource allocation schemes, such as nonadaptive resource allocation strategy. The performances are also analyzed and compared for the two multi-service multi-user MIMO–OFDMA systems; with sub-carriers partitioning and without sub-carriers partitioning.     

QoE and energy efficiency aware resource allocation for OFDM systems in group mobility environments

The global information and communication technology industry is a fast growing contributor to the electrical energy consumption, especially for the base stations, accounting for a substantial amount of the energy use. Inherently, a resource allocation strategy including subchannels blackout would reduce energy consumption. In this paper, energy efficient resource allocation algorithms are addressed for the OFDM system in group mobility environments, suffering from high intercarrier interference. We first propose the subchannels blackout scheme to save energy implicitly without performance degradation by turning off certain subchannels when transmitting signals. Then, resource allocation scheme in combination with subchannels blackout scheme is developed, consisting of intergroup subchannels allocation and inner‐group subchannels blackout. Its advantage is twofold. (i) Energy consumption is reduced obviously; (ii) intercarrier interference is decreased and channel quality is enhanced simultaneously. However, the original transmit rate decreases with the decrease of active resources. We also prove under subchannels blackout scheme, achieved throughput and perceptual quality of experience (QoE) are quasiconcave in energy saving percentage, which reflects the number of blackout subchannels. We then present two energy efficient resource allocation algorithms. Both algorithms focus on the optimal solution by using an iteration method. The difference lies in the objective. One tries for energy consumption minimization above the satisfactory QoE level, but the other aims to maximize QoE perceived by users. Numerical results confirm the theoretical findings and demonstrate the promising energy‐saving capability with satisfying QoE of the proposed resource allocation schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Utility-Based Rate-Controlled Parallel Wireless Transmission of Multimedia Streams with Multiple Importance Levels

Multimedia data often have different levels of importance such that more important bits are less error-tolerant. A new rate control method for transporting such multimedia data over parallel wireless links with heterogeneous reliability is proposed. Rate-controlled parallel transmissions (RCPT) of different layers of a multimedia stream with different levels of importance over a wireless channel that support multiple links with heterogeneous reliability can improve the efficiency in resource allocation while satisfying the quality of service requirement of the multimedia connection. To exploit RCPT, we present and evaluate a novel dynamic resource allocation method that decomposes the available radio resources into multiple sets of links with different levels of reliability. We mathematically formulate a rate control problem for the flexible RCPT scheme and develop an efficient real-time resource allocation algorithm with a remarkably fast rate of convergence. Simulation results show that the proposed method improves the utility and reduces the power consumed for delivery of a multimedia stream at the required quality of service, in comparison with a previous scheme, where different layers of each multimedia class are scheduled with dependency, and two schemes that provide homogeneous high or low reliability over all parallel links.     

Asymmetric radio resource allocation scheme for OFDMA wireless networks with collaborative relays

This work addresses the radio resource allocation problem for cooperative relay assisted OFDMA wireless network. The relays adopt the decode-and-forward protocol and can cooperatively assist the transmission from source to destination. Recent works on the subject have mainly considered symmetric source-to-relay and relay-to-destination resource allocations, which limits the achievable gains through relaying. In this paper we consider the problem of asymmetric radio resource allocation, where the objective is to maximize the system throughput of the source-to-destination link under various constraints. In particular, we consider optimization of the set of cooperative relays and link asymmetries together with subcarrier and power allocation. We derive theoretical expressions for the solutions and illustrate them through simulations. The results show clear additional performance gains through asymmetric cooperative scheme compared to the other recently proposed resource allocation schemes.     

Double auction mechanisms for resource allocation in autonomous networks

Auction mechanisms are used for allocating a resource among multiple agents with the objective to maximize social welfare. What makes auctions attractive is that they are agnostic to utility functions of agents. Auctions involve a bidding method by agents-buyers, which is then mapped by a central controller to an allocation and a payment for each agent. In autonomic networks comprising self-interested nodes with different needs and utility functions, each entity possesses some resource and can engage in transactions with others to achieve its needs. In fact, efficient network operation relies on node synergy and multi-lateral resource trading. Nodes face the dilemma of devoting their limited resource to their own benefit versus acting altruistically and anticipating to be aided in the future. Wireless ad-hoc networks, peer-to-peer networks and disruption-tolerant networks are instances of autonomic networks where the challenges above arise and the traded resource is energy, bandwidth and storage space respectively. Clearly, the decentralized complex node interactions and the double node role as resource provider and consumer amidst resource constraints cannot be addressed by single-sided auctions and even more by mechanisms with a central controller. We introduce a double-sided auction market framework to address the challenges above. Each node announces one bid for buying and one for selling the resource.We prove that there exist bidding and charging strategies that maximize social welfare and we explicitly compute them. We generalize our result to a generic network objective. Nodes are induced to follow these strategies, otherwise they are isolated by the network. Furthermore, we propose a decentralized realization of the double-sided auction with lightweight network feedback. Finally, we introduce a pricing method which does not need a charging infrastructure. Simulation results verify the desirable properties of our approach.     

A game-theoretic approach to decentralized optimal power allocation for cellular networks

The rapidly growing demand for wireless communication makes efficient power allocation a critical factor in the network??s efficient operation. Power allocation in cellular networks with interference, where users are selfish, has been recently studied by pricing methods. However, pricing methods do not result in efficient/optimal power allocations for such systems for the following reason. Because of interference, the communication between the Base Station (BS) and a given user is affected by that between the BS and all other users. Thus, the power vector consisting of the transmission power in each BS-user link can be viewed as a public good which simultaneously affects the utilities of all the users in the network. It is well known (Mas-Colell et al., Microeconomic Theory, Oxford University Press, London, 2002, Chap. 11.C) that in public good economies, standard efficiency theorems on market equilibrium do not apply and pricing mechanisms do not result in globally optimal allocations. In this paper we study power allocation in the presence of interference for a single cell wireless Code Division Multiple Access (CDMA) network from a game theoretic perspective. We consider a network where each user knows only its own utility and the channel gain from the base station to itself. We formulate the uplink power allocation problem as a public good allocation problem. We present a game form the Nash Equilibria of which yield power allocations that are optimal solutions of the corresponding centralized uplink network.     

Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing

We study a sequential auction for sharing a wireless resource (bandwidth or power) among competing transmitters. The resource is assumed to be managed by a spectrum broker (auctioneer), who collects bids and allocates discrete units of the resource via a sequential second-price auction. It is well known that a second price auction for a single indivisible good has an efficient dominant strategy equilibrium; this is no longer the case when multiple units of a homogeneous good are sold in repeated iterations. For two users with full information, we show that such an auction has a unique equilibrium allocation. The worst-case efficiency of this allocation is characterized under the following cases: (i) both bidders have a concave valuation for the spectrum resource, and (ii) one bidder has a concave valuation and the other bidder has a convex valuation (e.g., for the other user?s power). Although the worst-case efficiency loss can be significant, numerical results are presented, which show that for randomly placed transmitter-receiver pairs with rate utility functions, the sequential second-price auction typically achieves the efficient allocation. For more than two users it is shown that this mechanism always has a pure strategy equilibrium, but in general there may be multiple equilibria. We give a constructive procedure for finding one equilibrium; numerical results show that when all users have concave valuations the efficiency loss decreases with an increase in the number of users.     

Simultaneous routing and resource allocation via dual decomposition

In wireless data networks, the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of communications resources (such as transmit powers and bandwidths) to the links. The optimal performance of the network can only be achieved by simultaneous optimization of routing and resource allocation. In this paper, we formulate the simultaneous routing and resource allocation (SRRA) problem, and exploit problem structure to derive efficient solution methods. We use a capacitated multicommodity flow model to describe the data flows in the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. These assumptions allow us to formulate the SRRA problem as a convex optimization problem over the network flow variables and the communications variables. These two sets of variables are coupled only through the link capacity constraints. We exploit this separable structure by dual decomposition. The resulting solution method attains the optimal coordination of data routing in the network layer and resource allocation in the radio control layer via pricing on the link capacities.     

Energy-efficient resource allocation model for device-to-device communication in 5G wireless personal area networks

In general, there are several many devices that can overload the network and reduce performance. Devices can minimize interference and optimize bandwidth usage by using directional antennas and by avoiding overlapping communication ranges. In addition, devices need to carefully manage their use of resources, such as bandwidth and energy. Bandwidth is limited in wireless personal area networks (WPANs), so devices need to carefully select which data to send and receive. In this paper, an intelligent performance analysis of energy-efficient resource optimization model has been proposed for device-to-device (D2D) communication in fifth-generation (5G) WPAN. The proposed energy-efficient resource allocation in D2D communication is important because it helps reduce energy consumption and extend the lifespan of devices that are communicating with each other. By allocating resources in an efficient manner, communication between two devices can be optimized for maximum efficiency. This helps reduce the amount of energy needed to power the communication, as well as the amount of energy needed to power the device that is communicating with another device. Additionally, efficient resource allocation helps reduce the overall cost of communication, as the use of fewer resources results in a lower overall cost. The proposed efficient resource allocation helps reduce the environmental impact of communication, as less energy is used for communication. The proposed energy-efficient resource allocation model (EERAM) has reached 92.97% of energy allocation, 88.72% of power allocation, 87.79% of bandwidth allocation, 87.93% of spectrum allocation, 88.43% of channel allocation, 25.47% of end-to-end delay, 94.33% of network data speed, and 90.99% of network throughput.     

The designer's perspective to atomic noncooperative networks

In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. Traditional design methods tend to perform poorly in such networks, as they do not take into account the inherent noncooperative nature of the network users. Such networks require specialized design techniques in order to achieve efficient utilization of resources. We consider the generic and practically important class of atomic resource sharing networks, in which traffic bifurcation is not implemented, hence each user allocates its whole traffic to one of the network resources. We investigate topologies of parallel resources within a game-theoretic framework and establish the foundations of a design and management methodology that enables operation of such networks efficiently, despite both the lack of cooperation among users and the restrictions imposed by atomic resource sharing. We study various problems pertaining to capacity allocation, pricing, and admission control, and show that their solutions are substantially different from those corresponding to traditional networks