Utility maximization for MISO bursty interference channel under traffic uncertainties
| Autor: | Li Yu Wang, Chao Lin Chen, Che Lin |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Beamforming
Mathematical optimization Computer science Wireless network business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 020206 networking & telecommunications 02 engineering and technology Interference (wave propagation) Bottleneck Burstiness Channel state information 0202 electrical engineering electronic engineering information engineering Wireless business Computer Science::Information Theory Communication channel |
| Zdroj: | SPAWC |
| DOI: | 10.1109/spawc.2017.8227802 |
| Popis: | In order to mitigate interference, a major bottleneck in modern wireless networks, we consider coordinated beamforming design for a multiple-input single-output (MISO) bursty interference channel. In realistic scenarios, the distributed medium access control mechanisms or the decentralized networking protocols across different users contributes to the bursty nature of network traffic. Exploiting such burstiness judiciously can potentially provide significant performance gain. In practice, error may occur when transmitters attempt to determine whether the traffic is bursty or not from the interference state information received from the control center. Here, we model such traffic uncertainties via a hidden Markov model (HMM). Assuming that perfect channel state information (CSI) is available at transmitters, our goal is to maximize the average system utility subject to quality-of-service constraints and average power constraints under traffic uncertainties. The resulting problem is highly non-convex. We hence apply a series of convex approximation techniques (e.g., and semidefinite relaxation, first-order approximation) to handle the non-convex problem. We further improve the approximation accuracy by our proposed successive convex approximation (SCA) algorithm. Simulation results show that the performance of our proposed SCA algorithm is close to that achieved by the optimal beamforming when the interference state information is assumed to be perfectly known. Even under traffic uncertainties, our proposed SCA algorithm still performs better (9.5% improvement) compared with the case where the bursty nature of the interference is not exploited at all. It is hence essential to consider bursty traffic even for a practical wireless system. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|