A Joint Allocation, Assignment and Admission Control (AAA) Framework for Next Generation Networks

In this paper, we propose a framework for performing allocation, assignment and admission control (AAA) in next generation cellular networks. A novel heuristic method for resource allocation is proposed. The allocation is done in a semi-distributed manner consisting of central allocation and local allocation. The role of the assignment module is to estimate the amount of resources needed by a user in order to satisfy the quality of service (QoS) requirements of the application. To that end, a Markov based approach which calculates the dropping probability of packets by considering the effects of queuing in the medium access control layer and the adaptive modulation and coding in the physical layer is presented. In order to estimate the required resources, the predicted throughput and delay are calculated based on the dropping probability and the predicted values are mapped to the required ones. The admission control module is responsible for admitting or rejecting a new or handoff user and is based on a mean resource calculation. The calculation takes into account the mean number of resources used by existing users as well as the buffer conditions of the individual users. By combining the three novel contributions on AAA into the AAA framework the overall network as well as the cell-edge throughput have been improved and the number of admitted users have been increased while still guaranteeing QoS for new users as well as existing users.     

On co-channel and adjacent channel interference mitigation in cognitive radio networks

Cognitive radio (CR) is an emerging wireless communications paradigm of sharing spectrum among licensed (or, primary) and unlicensed (or, CR) users. In CR networks, interference mitigation is crucial not only for primary user protection, but also for the quality of service of CR user themselves. In this paper, we consider the problem of interference mitigation via channel assignment and power allocation for CR users. A cross-layer optimization framework for minimizing both co-channel and adjacent channel interference is developed; the latter has been shown to have considerable impact in practical systems. Cooperative spectrum sensing, opportunistic spectrum access, channel assignment, and power allocation are considered in the problem formulation. We propose a reformulation–linearization technique (RLT) based centralized algorithm, as well as a distributed greedy algorithm that uses local information for near-optimal solutions. Both algorithms are evaluated with simulations and are shown quite effective for mitigating both types of interference and achieving high CR network capacity.     

Protocols for very high-speed optical fiber local area networks using a passive star topology

This paper deals with the problem of interconnection of many high-speed bursty traffic users via an optical passive star coupler. Each user can tune its laser over a range of wavelengths, thus resulting in a wavelength division multiplexed communication. The total number of wavelengths over which user tunability exists could be much smaller than the number of users. Therefore, some form of random access sharing and packet switching may be necessary. We propose several protocols that require each user to have a tunable receiver. The information on "where" and "when" to tune the laser is confined to a control (setup) channel that users tune to when in idle mode. An interconnection between two users lasting for the length of a data packet is set up on the control channel by the transmitting user who informs the receiving user where to tune in order to receive the data packet. No centralized control or coordination is required among the users. After analyzing each protocol, we present the throughput/ delay versus the offered traffic and the delay versus throughput in a sequence of plots. We show that in typical applications an average throughput of up to 0.95 can be achieved at a reasonable average delay using one of these protocols. In our benchmark examples we present an optical local area network (LAN) with a total throughput of 100- Gbit/s in which every user has access to a 1-Gbit/s data rate and the network can support over 1000 users. The protocols can be used in a) large LAN's that do not require a large capacity, b) small LAN's (1 kin) that require a large capacity and c) large LAN's (tens of kilometers) that require a rather large capacity.     

Joint power and bandwidth allocation in downlink transmission

We formulate and analyze the problem of optimal downlink scheduling with instantaneous channel and queue size information when both power and bandwidth may be adaptively split among multiple users. We derive optimal solutions of low computational complexity, as well as faster and simpler approximations, to various versions of this problem when the power, rate, and bandwidth allocations to the users can all take continuous values. For this case, we show that the optimal scheme requires transmission to no more than two users during each time slot when users can receive at arbitrary rates, even when the user rate per unit of bandwidth is upper bounded by the best available modulation scheme. Our methods also extend easily to incorporate other intuitive constraints such as upper limits on user rates to improve frame fill efficiency. Simulation results suggest that the simple approximations work nearly as well as the throughput optimal schemes when continuous bandwidth and power partitions are allowed. In practice, the rate and bandwidth assignments to users take discrete values, and we present heuristic methods motivated by the continuous optimum to this discrete case.     

Priority-based learning automata in Q-learning random access scheme for cellular M2M communications

This paper applies learning automata to improve the performance of a Q-learning based random access channel (QL-RACH) scheme in a cellular machine-to-machine (M2M) communication system. A prioritized learning automata QL-RACH (PLA-QL-RACH) access scheme is proposed. The scheme employs a prioritized learning automata technique to improve the throughput performance by minimizing the level of interaction and collision of M2M devices with human-to-human devices sharing the RACH of a cellular system. In addition, this scheme eliminates the excessive punishment suffered by the M2M devices by controlling the administration of a penalty. Simulation results show that the proposed PLA-QL-RACH scheme improves the RACH throughput by approximately 82% and reduces access delay by 79% with faster learning convergence when compared with QL-RACH.     

Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation

In this paper, we propose a cognitive radio based multi-user resource allocation framework for mobile ad hoc networks using multi-carrier DS CDMA modulation over a frequency-selective fading channel. In particular, given preexisting communications in the spectrum where the system is operating, in addition to potential narrow-band interference, a channel sensing and estimation mechanism is provided to obtain information such as subcarrier availability, noise power and channel gain. Given this information, both frequency spectrum and power are allocated to emerging new users (i.e., cognitive radio users), based on a distributed multi-user resource allocation framework, in order to satisfy a target data rate and a power constraint of each cognitive radio user, while attempting to avoid interference to the existing communications as well as to minimize total power consumption of the cognitive radio users.     

Practical Multiuser Diversity With Outdated Channel Feedback

Inspired by the information theoretic results concerning multiuser diversity, we address practical issues in implementing multiuser diversity in a multiple access wireless setting. Considering a channel-assigning strategy that assigns the channel only to the user with the best instantaneous SNR [3], our emphasis is on the effects of channel feedback delay in downlink transmissions. A finite set of M-ary quadrature amplitude modulation (M-QAM) constellations is adopted and a constant transmit power is assumed in this practical multiuser adaptive modulation scheme. Based on the closed-form expressions for average bit error rate (BER) and average data rate, we illustrate the impact of channel feedback delay on the achievable multiuser diversity gain with the number of users. Simple and accurate asymptotic approximations are also provided in the limit of large numbers of users. Focusing on different applications, we propose two optimization criteria for the switching thresholds, based on either an average BER, or an outage probability constraint. Two novel constant power, variable rate M-QAM schemes that are less sensitive to feedback delay are proposed using the optimal switching thresholds, which are derived to maximize the average data rate subject to these two constraints, respectively. To obtain a certain degree of fairness among the users, we also consider a fair channel-assigning strategy that assigns the channel to only the user with the greatest normalized SNR.     

Low complexity resource allocation and scheduling algorithms for downlink SDMA systems

The downlink zero-forcing beamforming strategy in the case of random packet arrivals is investigated. Under this setting, the relevant fairness criterion is the stabilization of all buffer queues which guarantees a bounded average delay for all users. It has been shown that allocating resources to maximize a queue-length-weighted sum of the rates is a stabilizing policy. However, the high complexity of user selection and the feasible rates determination for optimal scheme may prevent the real-time scheduling operation. Two low complexity algorithms are provided taking the channel state, queue state and orthogonality into account. In particular, the authors pick the first user with the largest product between channel gain and queuing length, and select the remaining users to construct candidate user set based on the greedy user selection method or channel orthogonal user selection method. Then, the power and rate allocation for the selected users are implemented based on the modified water-filling method. The complexity of the proposed algorithms is analyzed. The average delay and average throughput are studied in homogeneous scenarios and heterogeneous scenarios, respectively. Simulation results show that the proposed algorithms can take full advantage of the multi-user diversity gain and provide average delay (or throughput) and fairness improvement compared with channel-aware-only schemes.     

OFDMA系统中基于伪贝叶斯算法的动态分配随机接入信道策略

Random Access Channel (RACH) is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless communication system. In this paper, a dynamical RACH allocation scheme is proposed for Orthogonal Frequency-Division Multiple Access (OFDMA) systems. Based on the Pseudo-Bayesian algorithm, this mechanism predicts the number of RACHs for the next frame according to the current load. A new dynamic RACH assignment algorithm and an adaptive access probability method are adopted by the proposed scheme to improve the utilization ratio of RACH resources and increase the successful access rate. Numerical simulation shows that the proposed strategy achieves both improvement in the utilization ratio of RACHs and reduction in the access delay compared with other RACH allocation schemes.     

Distributed autonomous wireless channel assignment algorithm withpower control

Local autonomous dynamic channel allocation (LADCA) including power control is essential to accommodating the anticipated explosion of demand for wireless. The authors simulate call performance for users accessing channels in a regular cellular array with a base located at the center of each hexagon. The computer model includes stochastic channel demand and a propagation environment characterized by attenuation with distance as well as shadow fading. The study of LADCA shows that distributed power control and channel access can be combined in an access management policy that achieves satisfactory system capacity and provides desired call performance. The authors report: LADCA/power control is observed to be stable alleviating a major concern about users unaware of the signal to interference problems their presence on a channel might cause to others. There can be substantial inadvertent dropping of calls in progress caused by originating calls. Modeling user time dynamics is essential. LADCA contrasts very favorably with fixed channel allocation (FCA) in a comparative example     

Rate-Based Equilibria in Collision Channels with Fading

We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or power investment), subject to minimum throughput demand. The channel quality between each user and the base station is randomly time-varying, and partially observed by the user through Channel State Information (CSI) signals. Assuming that all users employ stationary, CSI-dependent transmission policies, we investigate the properties of the Nash equilibrium of the resulting game between users. We characterize the feasible region of user?s throughput demands, and provide lower bounds on the channel capacity that hold both for symmetric and non-symmetric users. Our equilibrium analysis reveals that, when the throughput demands are feasible, there exist exactly two Nash equilibrium points, with one strictly better than the other (in terms of power investment) for each user. We further demonstrate that the performance gap between the two equilibria may be arbitrarily large. This motivates the need for distributed mechanisms that lead to the better equilibrium. To that end, we suggest a simple greedy (best-response) mechanism, and prove convergence to the better equilibrium. Some important stability properties of this mechanism in face of changing user population are derived as well.     

A utility-based power-control scheme in wireless cellular systems

Distributed power-control algorithms for systems with hard signal-to-interference ratio (SIR) constraints may diverge when infeasibility arises. We present a power-control framework called utility-based power control (UBPC) by reformulating the problem using a softened SIR requirement (utility) and adding a penalty on power consumption (cost). Under this framework, the goal is to maximize the net utility, defined as utility minus cost. Although UBPC is still noncooperative and distributed in nature, some degree of cooperation emerges: a user will automatically decrease its target SIR (and may even turn off transmission) when it senses that traffic congestion is building up. This framework enables us to improve system convergence and to satisfy heterogeneous service requirements (such as delay and bit error rate) for integrated networks with both voice users and data users. Fairness, adaptiveness, and a high degree of flexibility can be achieved by properly tuning parameters in UBPC.     

Performance analysis of the adaptive EXP/PF channel scheduler in an AMC/TDM system

The adaptive EXP/PF AU; PL. DEFINE "EXP" ALSO channel scheduler proposed in Rhee et al. (2003) is an enhancement to the proportional fairness (PF) channel scheduler in that it guarantees delay sensitive services having the desired service delay outage probability as well as best-effort services in the forward link of an adaptive modulation and coding when used with time-division multiplexing (AMC/TDM) system. In this letter, assuming that there are many best-effort service users and one streaming service user requiring maximum delay constraints of 3 s, the system throughput of the adaptive EXP/PF scheduler is evaluated for different channel conditions of the streaming service user and is also compared with PF scheduler and its upper bound of throughput. The results show that the adaptive EXP/PF algorithm offers high system throughput as well as fairness among best-effort service users and guarantees streaming services of a desired delay constraint and outage probability.     

Multiuser OFDM with adaptive subcarrier, bit, and power allocation

Multiuser orthogonal frequency division multiplexing (OFDM) with adaptive multiuser subcarrier allocation and adaptive modulation is considered. Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDM subcarrier, bit, and power allocation algorithm to minimize the total transmit power. This is done by assigning each user a set of subcarriers and by determining the number of bits and the transmit power level for each subcarrier. We obtain the performance of our proposed algorithm in a multiuser frequency selective fading environment for various time delay spread values and various numbers of users. The results show that our proposed algorithm outperforms multiuser OFDM systems with static time-division multiple access (TDMA) or frequency-division multiple access (FDMA) techniques which employ fixed and predetermined time-slot or subcarrier allocation schemes. We have also quantified the improvement in terms of the overall required transmit power, the bit-error rate (BER), or the area of coverage for a given outage probability     

Rapid Access Protocols for Discontinuous Transmission in DS-CDMA Systems

In this paper, three reverse link access protocols (AP) enabling discontinuous transmission (DTX) in DS-CDMA personal communication systems are introduced and discussed. The first protocol is synchronous (SDTX-AP), and it uses a so-called synchronous reservation channel to accommodate access requests in a time slotted frame structure. The second uses an asynchronous approach (ADTX-AP) with a spread slotted ALOHA protocol for access requests; access request messages consist of a synchronizing preamble and a user identifier appendix. The third one employs a synchronous structure of overlapping slots, offset in time by a minimum interval (mini-slot) necessary to enable resolution of overlapping access probes sent by different mobile users (MSDTX-AP). Instead of using different spreading codes for different mobile transmitters, all transmitters are assigned the same spreading code to send their access request messages on the access reservation channel. Analysis considers the mean access delay and throughput of the protocols in a multipath fading channel. Numerical results indicate that at high values of offered traffic of access requests mean access delays of ADTX-AP and SDTX-AP are comparable. The mean access delay for the MSDTX-AP depends on the number of minislots or users within each frame, but its throughput is much higher than that of either SDTX-AP or ADTX-AP.     

认知型飞蜂窝网络中的子信道分配与功率控制

为了解决宏蜂窝与飞蜂窝构成的两层异构网络上行干扰与资源分配问题,提出了一种在认知型飞蜂窝的双层异构网中结合子信道分配和功率控制进行资源分配的框架。通过对异构网中跨层干扰问题进行分析与建模,将求解最优子信道分配矩阵和用户发射功率矩阵作为干扰管理问题的解决方法。模型中认知型飞蜂窝网络子信道和飞蜂窝网络用户构成非合作博弈,双方利用效用函数最优值进行匹配,构成初始信道分配矩阵;再由接入控制器根据接入条件从初始信道分配矩阵中筛选用户,并优化接入用户的发射功率矩阵,得到最优子信道分配矩阵和功率矩阵。仿真结果表明,优化框架提高了双层异构网络中飞蜂窝网络用户的吞吐量和接入率,降低了异构网中跨层干扰。     

Optimal Channel Sensing Order for Various Applications in Cognitive Radio Networks

In cognitive radio (CR) networks, the channel sensing order is crucial for the CR users to find an available channel as fast as possible. In this paper, besides the primary user activities, the statistics of Signal-to-Noise Ratio for each channel are explored using pilot signals. Based on the fluctuating nature of heterogeneous channels as well as the QoS requirements of various applications, two channel sensing order methods are proposed. For real-time applications, a minimum delay-based channel sensing order is proposed to find an idle channel which meets the sustainable rate constraint as fast as possible. For best-effort applications, a maximum capacity-based channel sensing order is proposed to maximize the transmission rates for the CR users, and two different stopping rules are considered. One is that a CR user should stop and transmit at the first free channel, while for the other one, a q-stage look-ahead stopping problem is considered. The simulation results show that the opportunity-discovery delay is reduced for real-time applications. For best-effort applications, the second stopping method is better than the first one when the time cost of the pilot signal is small.     

基于合约制的认知网络协作频谱共享模型

为了提高认知无线电网络中主用户的能效和谱效,提出了一种基于合约制的协作频谱共享新模型。在该模型中,当主用户信道质量差时,次用户为其提供中继服务;作为回报,在主用户信道质量好时,次用户可以在一定的干扰约束下以underlay的模式和主用户共享频谱。在此框架下引入经济学中的合约理论,将主次用户间的协作问题建模为合约设计问题,并建立了主次用户评价合约收益的效用函数,将提高主用户的能效和谱效问题转变为设计合约使主用户获得最大效用的优化问题,并利用差分进化算法对该问题求解。最后,在不同的环境下,将主用户协作与不协作获得的效用进行对比,结果表明,主用户在没有额外投入频谱资源的条件下,不仅节省了发送功率,而且有效地提高了数据传输速率,进而提高了能效和谱效。     

Joint power control and user scheduling for backbone-assisted industrial wireless networks with successive interference cancellation

In a backbone-assisted industrial wireless network (BAIWN), the technology of successive interference cancellation (SIC) based non-orthogonal multiple access (NOMA) provides potential solutions for improving the delay performance. Previous work emphasizes minimizing the transmission delay by user scheduling without considering power control. However, power control is beneficial for SIC-based NOMA to exploit the power domain and manage co-channel interference to simultaneously serve multiple user nodes with the high spectral and time resource utilization characteristics. In this paper, we consider joint power control and user scheduling to study the scheduling time minimization problem (STMP) with given traffic demands in BAIWNs. Specifically, STMP is formulated as an integer programming problem, which is NP-hard. To tackle the NP-hard problem, we propose a conflict graph-based greedy algorithm, to obtain a sub-optimal solution with low complexity. As a good feature, the decisions of power control and user scheduling can be made by the proposed algorithm only according to the channel state information and traffic demands. The experimental results show that compared with the other methods, the proposed method effectively improves the delay performance regardless of the channel states or the network scales.

     

Analysis of random access channel in UTRA‐TDD on AWGN channel

The random access channel (RACH) in UTRA‐TDD systems is an uplink contention‐based transport channel that is mainly used to carry control information from mobile stations to base stations. In this paper, we study the performance of RACH on an additive white Gaussian noise (AWGN) channel whereby successful transmission of a burst requires the spreading code chosen to be collision‐free and the burst is error‐free after convolutional decoding. Based on this model, the code‐collision probability, the data bit error probability and the RACH channel capacity are derived. The random retransmission delay mechanism is not specified in UTRA‐TDD. We therefore choose an access mechanism with binary exponential backoff delay procedure similar to that in IEEE 802.11. Based on that mechanism, the blocking probability and the first two moments of the delay are also derived. Compared with the mean, the standard deviation is found to be very high. Copyright © 2004 John Wiley & Sons, Ltd.