Efficient Resource Allocation for Wireless Multicast

In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet protocol (IP) multicast tree by adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group. Our mechanism enables more mobile hosts to cluster together and leads to the use of fewer cells to save the scarce wireless bandwidth. Besides, the paths in the multicast tree connecting to the selected cells share more common links to save the wireline bandwidth. Our mechanism supports the dynamic group membership and offers mobility of group members. Moreover, our mechanism requires no modification to the current IP multicast routing protocols. We formulate the selection of the cell and the wireless technology for each mobile host in the heterogeneous wireless networks as an optimization problem. We use integer linear programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on Lagrangean relaxation and a network protocol based on the algorithm. The simulation results show that our mechanism can effectively save the wireless and wireline bandwidth as compared to the traditional IP multicast.     

Resource Allocation in OFDMA Wireless Communications Systems Supporting Multimedia Services

We design a resource allocation algorithm for downlink of orthogonal frequency division multiple access (OFDMA) systems supporting real-time (RT) and best-effort (BE) services simultaneously over a time-varying wireless channel. The proposed algorithm aims at maximizing system throughput while satisfying quality of service (QoS) requirements of the RT and BE services. We take two kinds of QoS requirements into account. One is the required average transmission rate for both RT and BE services. The other is the tolerable average absolute deviation of transmission rate (AADTR) just for the RT services, which is used to control the fluctuation in transmission rates and to limit the RT packet delay to a moderate level. We formulate the optimization problem representing the resource allocation under consideration and solve it by using the dual optimization technique and the projection stochastic subgradient method. Simulation results show that the proposed algorithm well meets the QoS requirements with the high throughput and outperforms the modified largest weighted delay first (M-LWDF) algorithm that supports similar QoS requirements.     

无线供能反向散射通信中能耗最小化资源分配方法

针对无线供能反向散射通信网络,提出了一种满足传感设备通信需求及能量因果的专用能量站能耗最小化资源分配方法。在考虑非线性能量收集模型及不完美串行干扰消除基础上,通过联合优化专用能量站发射功率、传感设备反向散射通信时间、反向散射系数及其能量收集时间,构建了一个专用能量站能耗最小化的非凸多维资源分配问题。首先,构建辅助变量对反向散射系数与时间进行解耦,再利用目标函数是关于专用能量站发射功率的单调递减函数这一特性来设计一种基于二分法的迭代算法来获取原问题的最优解。仿真验证了所提算法的快速收敛性,同时,与同类算法相比,所提方法可为专用能量站节约更多的能量。     

Blind Carrier Frequency Tracking for Filterbank Multicarrier Wireless Communications

Filterbank multicarrier modulation (FBMCM) is an attractive technology for high-speed twisted-pair transmission, and for broadband wireless communications, as well. In wireline applications, signal transmission takes place at baseband, so the issue of carrier acquisition and tracking for coherent demodulation does not apply. On the contrary, in wireless communications, carrier-frequency recovery reveals the Achille's heel of multicarrier modulation, so that robust signal-processing algorithms are needed in this respect. In this paper, we derive a nondata-aided carrier-frequency-offset recovery method for wireless FBMCM modems. In particular, we illustrate how to derive a low-complexity closed-loop tracker starting from a maximum-likelihood approach. We then show that the proposed simplifications do not entail large performance losses. In this respect, we derive the standard performance metrics of a closed-loop tracker (S-curve, root mean square estimation error, acquisition time), both on the additive white Gaussian noise channel and on a typical static frequency-selective wireless channel. We also demonstrate by simulation good robustness of the frequency tracker with respect to FBMCM symbol-timing errors.     

Radio Resource Allocation for Scalable Video Services Over Wireless Cellular Networks

Good quality video services always require higher bandwidth. Hence, to provide the video services e.g., multicast/broadcast services (MBSs) and unicast services along with the existing voice, internet, and other background traffic services over the wireless cellular networks, it is required to efficiently manage the wireless resources in order to reduce the overall forced call termination probability, to maximize the overall service quality, and to maximize the revenue. Fixed bandwidth allocation for the MBS sessions either reduces the quality of the MBS videos and bandwidth utilization or increases the overall forced call termination probability and of course the handover call dropping probability as well. Scalable video coding (SVC) technique allows the variable bit rate allocation for the video services. In this paper, we propose a bandwidth allocation scheme that efficiently allocates bandwidth among the MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and other background traffic). The proposed scheme reduces the bandwidth allocation for the MBS sessions during the congested traffic condition only to accommodate more calls in the system. Instead of allocating fixed bandwidths for the MBS sessions and the non-MBS traffic, our scheme allocates variable bandwidths for them. However, the minimum quality of the videos is guaranteed by allocating minimum bandwidth for them. Using the mathematical and numerical analyses, we show that the proposed scheme maximizes the bandwidth utilization and significantly reduces the overall forced call termination probability as well as the handover call dropping probability.     

Auction-Based Resource Allocation for Cooperative Communications

Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper proposes two auction mechanisms, the SNR auction and the power auction, that determine relay selection and relay power allocation in a distributed fashion. A single-relay network is considered first, and the existence and uniqueness of the Nash Equilibrium (i.e., the auction?s outcome) are proved. It is shown that the power auction achieves the efficient allocation by maximizing the total rate increase, and the SNR auction is flexible in trading off fairness and efficiency. For both auctions, the distributed best response bid updates globally converge to the unique Nash Equilibrium in a completely asynchronous manner. The analysis is then generalized to networks with multiple relays, and the existence of the Nash Equilibrium is shown under appropriate conditions. Simulation results verify the effectiveness and robustness of the proposed algorithms.     

Resource Allocation with Limited Feedback and Joint Coding Scheme for Wireless Multi-antenna Multicast System

In conventional multicast scheme (CMS), the total throughput of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited throughput, we introduce a resource allocation algorithm by exploiting layered coding combined with erasure correction coding for multicast services in the downlink of OFDMA-based multi-antenna system. To reduce the feedback overhead of uplink, we design a novel transmission scheme with limited feedback. Then, we formulate the joint subcarrier and power allocation problem for the data of base layer and enhancement layers, which is shown to be NP hard. Hence, in order to reduce the computational complexity, we propose a three-phase suboptimal algorithm. The algorithm is designed to maximize the system throughput while at the same time guarantee the quality of services (QoS) requirements of all multicast groups. It is composed of precoding scheme, proportional fairness subcarrier allocation algorithm and modified water-filling power allocation algorithm with QoS guarantees (MWF-Q). To further decrease the complexity of MWF-Q, a power allocation algorithm with increased fixed power allocation algorithm with QoS guarantees is introduced. Simulation results show that the proposed algorithms based on limited feedback scheme significantly outperform CMS and any other existing algorithm with full feedback. Moreover, the proposed scheme can efficiently reduce 50 % of the full feedback overhead.     

Resource Allocation for Aggregate Multimedia and Healthcare Services over Heterogeneous Multi-Hop Wireless Networks

Nowadays, the pervasive wireless networks enable ubiquitous high-rate wireless access from everywhere. In this work, we discuss the integration of complementary wireless techniques to construct a personal moving network. The personal wireless devices (  smartphones, camcorders, and netbooks) and even medical monitoring sensors are interconnected with a wide-area backbone through a local multi-mode gateway. The mobile nodes in a personal moving network move in group and are provided seamless connectivity through a backhaul relay channel from the local gateway toward the backbone network. In some specific scenarios, the local gateway can be as simple as a multi-radio smartphone. In this study, we investigate the construction and resource allocation for a personal moving network. Aggregate multi-service traffic of interactive data, conversational video, and electrocardiography (ECG) monitoring are considered in the resource allocation. We develop a stochastic Petri net to model the access selection scheme, which is logically clear and easy to follow. The flow-level performance is evaluated in terms of new connection blocking probability and handoff dropping probability. We further analyze the packet-level performance of the heterogeneous two-hop network. Considering the urgency of medical services, a non-preemptive priority policy is applied to mitigate the impact of background traffic and prioritize the transmission of ECG data.     

Convergence of Price-Based Resource Allocation Algorithms in Multicellular Multicarrier Systems

Inter-cell interference mitigation is a key challenge in the heterogeneous wireless networks which are expected to use an aggressive frequency reuse factor and a high-density access point deployment to improve coverage and spectral efficiency. In this paper, the problem of resources allocation in multicell Orthogonal Frequency Division Multiple Access wireless system is considered with universal frequency reuse and target of Weighted Sum-Rate Maximization. We address multi cell modified iterative water filling as an iterative power allocation algorithm. Also, a new extension of fixed point implementation of Successive Convex Approximation for Low complExity (SCALE) algorithm to multicellular system [referred to as Multi Cell Fixed point SCALE (MCF-SCALE)] is presented and it has been shown both of them resulted to the same convergence point. It is also demonstrated that using Lagrangian multiplier instead of noise variance in Standard Yates framework (as has been used in some previous papers) is not a suitable method for proving convergence and all the previous results based on this pattern need to be revised. Finally, a new framework is presented for proving the convergence of MCF-SCALE algorithm based on Jacobi iterative algorithm. Moreover, some previous convergence criteria are shown to be interpreted as a special case of this condition.     

Cross-Layer Radio Resource Allocation for Multicarrier Air Interfaces in Multicell Multiuser Environments

Packet scheduling over shared channels is one of the most attractive issues for researchers dealing with radio resource allocation in wireless networks as modern systems' different traffic types, with different application requirements, need to coexist over the air interface. Recently, attention has been attracted to multicarrier techniques and the application of cross-layer approaches to the design of wireless systems. In this paper, a radio access network using a multicarrier air interface is considered in a multicell multiuser context. We propose a new cross-layer scheduling algorithm that manages channel, physical layer, and application-related information; we compare its performance with a previously published cross-layer strategy and with simpler well-known channel-aware or channel-unaware techniques and then discuss its optimization. We investigate the performance in terms of perceived user quality and fairness in the presence of mixed realistic traffic composed of H.264 video streaming with tight bounds on the delay jitter and file transfer protocol (FTP) data. To support video traffic, application-suited buffer-management techniques are also considered in conjunction with scheduling, and link adaptation is implemented at the physical layer to better exploit channel fluctuations. The role of scheduling and resource-allocation functionalities are discussed. It is shown that the cross-layer strategy proposed guarantees the same performance obtained by the previously published algorithm while reducing complexity. Moreover, under heavily loaded conditions, the cross-layer scheduling strategy provides a significant gain with respect to simple channel-aware or channel-unaware techniques.     

Fair Radio Resource Allocation for MIMO OFDM-based Multicast Systems

This paper investigates the problem of resource allocation in a multiple-input multiple-output (MIMO) OFDM-based system, wherein multiple multicast groups exist. Multicasting is a transmission technique which enables a transmitter to communicate via a single wireless link with multiple receivers simultaneously. Moreover, the presence of multiple antennas in both transmitter and receiver enhances significantly the system spectral efficiency. MIMO technology along with multicasting offers major advantages to wireless systems. However, optimum exploitation of these technologies adds significant complexity to the system which makes very difficult any possible practical implementation. Another important issue of such systems is their capacity to ensure to all users a certain level of QoS. To that end, we propose a low complexity fair resource allocation algorithm aiming at ensuring a certain amount of resources to all users when multicasting is applied. Validation of the proposed solution is achieved through extensive simulation and it is compared to other multicast schemes for MIMO systems which exist in literature. Numerical results and complexity analysis show the feasibility of the proposed algorithm.     

Index Policies for Resource Allocation in Wireless Networks

We consider the problem of resource allocation for data transfer between the base station and the users within a cell of a wireless telecommunication network with infinite data queues for each user. The aim is to study the tradeoff between the conflicting objectives of maximizing the system throughput and the quality of service (QoS) to an individual user. Using a policy improvement approach based on Markov decision processes, we develop an intuitive and easy-to-implement index policy. We also demonstrate its superior performance over the existing proportional fair metric algorithm through simulation experiments.     

Utility-Based Resource Allocation in Wireless Networks

In this paper, we study utility-based maximization for resource allocation in the downlink direction of centralized wireless networks. We consider two types of traffic, i.e., best effort and hard QoS, and develop some essential theorems for optimal wireless resource allocation. We then propose three allocation schemes. The performance of the proposed schemes is evaluated via simulations. The results show that optimal wireless resource allocation is dependent on traffic types, total available resource, and channel quality, rather than solely dependent on the channel quality or traffic types as assumed in most existing work.     

Resource Allocation for Fog Enhanced Vehicular Services

Wireless Personal Communications - Vehicular Ad hoc Networks mainly depends on the cloud computing for the services like storage, computing and networking. With the increase in the number of...     

Energy-Efficient Resource Allocation in Wireless Networks

This paper shows that game theory can be used as a unifying framework to study radio resource management in a variety of wireless networks. with different service criteria. It focuses on infrastructure networks where users transmit to a common concentration point such as a base station in a cellular network or an access point. Since most of the terminals in a wireless network are battery-powered, energy efficiency is crucial to prolonging the life of the terminals. Also, in most practical scenarios, distributed algorithms are preferred over centralized ones. Throughout this article it focuses on distributed algorithms with emphasis on energy efficiency. A family of power control games is presented for energy-efficient resource allocation in wireless code-division multiple-access (CDMA) networks and give discussions and conclusions     

Efficient Resource Allocation for OFDMA Multicast Systems With Spectrum-Sharing Control

This paper considers the important problem of efficient allocation of available resources (such as radio spectrum and power) in orthogonal frequency-division multiple-access (OFDMA)-based multicast wireless systems. Taking the maximization of system throughput as the design objective, three novel efficient resource-allocation schemes with reduced computational complexity are proposed under constraints on total bandwidth and transmitted power at the base station (BS). Distinct from existing approaches in the literature, our formulation and solution methods also provide an effective and flexible means to share the available radio spectrum among multicast groups by guaranteeing minimum numbers of subcarriers to be assigned to individual groups. The first two proposed schemes are based on the separate optimization of subcarriers and power, where subcarriers are assigned with the assumption of uniform power distribution, followed by water filling of the total available transmitted power over the determined subcarrier allocation. In the third scheme, which is essentially a modified genetic algorithm (GA), each individual of the entire population represents a subcarrier assignment, whose fitness value is the system sum rate computed on the basis of the power water-filling procedure. Numerical results show that with a flexible spectrum-sharing control mechanism, the proposed designs are able to more flexibly and fairly distribute the total available bandwidth among multicast groups and, at the same time, achieve a high system throughput.      

Resource Allocation Scheme for Minimizing Power Consumption in OFDM Multicast Systems

This letter introduces a resource allocation scheme in orthogonal frequency division multiplexing(OFDM) multicast systems which focuses on minimizing power consumption. By allocating the resource optimally, the number of OFDM symbols that each mobile station(MS) receives can be minimized, resulting in the reduced power consumption of MSs. A heuristic algorithm for allocating resources suboptimally with low complexity is also proposed, and is shown to achieve almost optimal performance.     

多播OFDM系统中基于调控因子的资源分配

多媒体多播系统中的动态资源分配技术以其有效利用系统资源,及满足具有差异性信道条件的多用户需求而受到业内广泛研究和重视。针对MRA_LCG算法和MRA_GAT算法存在的弊端,提出了MRA_FCF算法,利用灵活可控的速率均衡因子使得高速率多媒体信息向低速率上分流。仿真结果表明,所提MRA_FCF算法获得的吞吐量明显优于MRA_LCG算法的,且同时在保证组内用户公平性方面比MRA_GAT算法具有优势。     

基于QoS保证的广播/组播OFDM系统资源分配策略

该文提出了一种基于服务质量(QoS)保证的次优广播/组播OFDM系统资源分配算法。算法在最优分配原则的基础上采用不同广播/组播业务目标速率作为约束条件,并以业务组中最差接收用户传输速率作为搜索目标,使得业务组中全部用户达到QoS要求,算法的公平性及有效性得到提高;同时采用时频格作为分配算法中的基本资源单位,以降低分配算法的复杂度。仿真结果表明,改进分配策略的系统吞吐量性能接近最优广播/组播分配算法,提高了广播/组播系统资源分配的公平性。