Call-Level and Packet-Level Quality of Service and User Utility in Rate-Adaptive Cellular CDMA Networks: A Queuing Analysis

A queuing analytical model is presented to evaluate call-level and packet-level quality of service (QoS) metrics in the uplink of a voice/data cellular code division multiple access (CDMA) network. In this model, a threshold-based call admission control (CAC) is used to limit the number of admitted calls in a cell and also to prioritize handoff calls over new calls. The transmission rates for data calls can be adjusted to accommodate more voice and/or data calls while satisfying the minimum signal-to-interference ratio (SIR)/ transmission rate requirement. Also, automatic repeat request (ARQ)-based error control is used for improved reliability of data packets. Call-level performance measures for both voice and data calls and packet-level performance measures specifically for data calls can be obtained from the analytical model. The interdependencies among call-level and packet-level QoS metrics are investigated under different CAC, rate adaptation, and error control parameter settings. To this end, the level of users' satisfaction (or user utility) is formulated as a function of the QoS metrics and an optimization formulation is presented to obtain the local-optimal system parameters     

Dynamic spectrum access in IEEE 802.22- based cognitive wireless networks: a game theoretic model for competitive spectrum bidding and pricing [accepted from open call]

The emerging IEEE 802.22-based wireless regional area network technology will use the same radio spectrum currently allocated for TV service. This standard will use the concept of cognitive radio based on dynamic spectrum access to provide wireless access services in a large coverage area. A brief overview of the current state of the IEEE 802.22 standard is provided with a particular emphasis on the spectrum management (i.e., spectrum sensing and dynamic spectrum access) in this standard. Key research issues related to spectrum trading among TV broadcasters, WRAN service providers, and IEEE 802.22-based cognitive radio users are identified. To this end, a hierarchical spectrum trading model is presented to analyze the interaction among WRAN service providers, TV broadcasters, and WRAN users. In this model a double auction is established among multiple TV broadcasters and WRAN service providers who sell and buy the radio spectrum (i.e., TV bands), respectively. Again, multiple WRAN service providers compete with each other by adjusting the service price charged to WRAN users. We propose a joint spectrum bidding and service pricing model for WRAN service providers to maximize their profits. A non-cooperative game is formulated to obtain the solution in terms of the number of TV bands and the service price of a service provider. Numerical results are presented on the performance of this joint spectrum bidding and pricing model.     

Coverage and Area Spectral Efficiency Analysis of Dense Terahertz Networks in Finite Region

This paper develops a general and tractable framework for the finite-sized downlink terahertz (THz) network.Specifically,the molecular absorption loss,receiver ...     

Evolution and future trends of research in cognitive radio: a contemporary survey

The cognitive radio (CR) paradigm for designing next‐generation wireless communications systems is becoming increasingly popular, and different aspects of it are being implemented in currently available wireless systems. In the last decade, a significant amount of research efforts has been made to solve CR challenges, and several standards related to CR and dynamic spectrum access have been developed. Also, there have been advances in software‐defined radio platforms to implement the CR systems. In this article, we provide a comprehensive survey on the evolution of CR research covering aspects such as spectrum sensing, measurements and statistical modeling of spectrum usage, physical layer aspects such as waveform and modulation design, multiple access, resource allocation and power control, cognitive learning, adaptation and self‐configuration, multihop transmission and routing, and robustness and security in CR networks. Also, state‐of‐the‐art research on the economics of CR networks, CR simulation tools, testbeds and hardware prototypes, CR applications, and CR standardization efforts is summarized. Emerging trends on CR research and open research challenges related to the cost‐effective and large‐scale deployment of CR systems are outlined. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

Radio resource management games in wireless networks: an approach to bandwidth allocation and admission control for polling service in IEEE 802.16 [Radio Resource Management and Protocol Engineering for IEEE 802.16]

Game theory is a mathematical tool developed to understand competitive situations in which rational decision makers interact to achieve their objectives. Game theory techniques have recently been applied to various engineering design problems in which the action of one component impacts (and perhaps conflicts with) that of any other component. In particular, game theory techniques have been successfully used for protocol design and optimization (e.g., radio resource management, power control) in wireless networks. In this article we present an overview of different game theory formulations. Then a survey on the game-theory-based resource management and admission control schemes in different wireless networks is presented, and several open research issues are outlined. To this end, we propose an adaptive bandwidth allocation and admission control scheme for polling service in an IEEE 802.16-based wireless metropolitan area network. A noncooperative game is formulated, and the solution of this game is determined by the Nash equilibrium for the amount of bandwidth offered to a new connection. The admission control policy ensures QoS for all connections in the system     

A Noncooperative Game-Theoretic Framework for Radio Resource Management in 4G Heterogeneous Wireless Access Networks

Fourth generation (4G) wireless networks will provide high-bandwidth connectivity with quality-of-service (QoS) support to mobile users in a seamless manner. In such a scenario, a mobile user will be able to connect to different wireless access networks such as a wireless metropolitan area network (WMAN), a cellular network, and a wireless local area network (WLAN) simultaneously. We present a game-theoretic framework for radio resource management (that is, bandwidth allocation and admission control) in such a heterogeneous wireless access environment. First, a noncooperative game is used to obtain the bandwidth allocations to a service area from the different access networks available in that service area (on a long-term basis). The Nash equilibrium for this game gives the optimal allocation which maximizes the utilities of all the connections in the network (that is, in all of the service areas). Second, based on the obtained bandwidth allocation, to prioritize vertical and horizontal handoff connections over new connections, a bargaining game is formulated to obtain the capacity reservation thresholds so that the connection-level QoS requirements can be satisfied for the different types of connections (on a long-term basis). Third, we formulate a noncooperative game to obtain the amount of bandwidth allocated to an arriving connection (in a service area) by the different access networks (on a short-term basis). Based on the allocated bandwidth and the capacity reservation thresholds, an admission control is used to limit the number of ongoing connections so that the QoS performances are maintained at the target level for the different types of connections.     

Radio Resource Management in MIMO-OFDM- Mesh Networks: Issues and Approaches

We present a survey on the radio resource management issues in MIMO-OFDM-based infrastructure wireless mesh networks. The major components in radio resource management (i.e., scheduling and admission control) and related research issues are discussed. We review related work in the literature. We propose a game-theoretic model for admission control in IEEE 802.11n-based WMNs using the MIMO-OFDM technology. The proposed scheme uses Q-learning, which is a reinforcement learning algorithm, to gain knowledge on system performance. Then this knowledge is used to determine payoff for the game formulation to obtain the Nash equilibrium for the decision on admitting or rejecting a new connection at a mesh router.     

Wireless sensor networks with energy harvesting technologies: a game-theoretic approach to optimal energy management

Energy harvesting technologies are required for autonomous sensor networks for which using a power source from a fixed utility or manual battery recharging is infeasible. An energy harvesting device (e.g., a solar cell) converts different forms of environmental energy into electricity to be supplied to a sensor node. However, since it can produce energy only at a limited rate, energy saving mechanisms play an important role to reduce energy consumption in a sensor node. In this article we present an overview of the different energy harvesting technologies and the energy saving mechanisms for wireless sensor networks. The related research issues on energy efficiency for sensor networks using energy harvesting technology are then discussed. To this end, we present an optimal energy management policy for a solar-powered sensor node that uses a sleep and wakeup strategy for energy conservation. The problem of determining the sleep and wakeup probabilities is formulated as a bargaining game. The Nash equilibrium is used as the solution of this game.     

Medium Access Control for dynamic spectrum access in cognitive radio networks: analysis under uncertainty

Medium Access Control is an important component in cognitive radio that allow secondary users to identify and access spectrum opportunity without interfering with primary users. In this paper, a queueing model to analyze the performances of the secondary users in a cognitive radio network is presented. The queueing model considers the transmissions of a secondary system where a Medium Access Control algorithm is used to enable the secondary users to sense and access the channels. Also, a simple scheduler is employed to assign transmission time slots to the secondary users. Because the value of the system parameters can be perturbed and cannot be determined precisely, the analysis is extended to take uncertainty into account. In this case, a robust optimization method to study the Markov chain with uncertainty is applied to obtain the stationary probabilities of the queueing model under uncertainty. The lower and upper bounds of performance measures are obtained and compared with the nominal value. Copyright © 2012 John Wiley & Sons, Ltd.