Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655413
Ruixue Zhou, Tiejun Lv, Wei Long, Hui Gao, Yueming Lu, E. Liu
In this paper, we propose two kinds of interference alignment (IA) schemes with limited feedback for the two-cell interfering multi-user multiple-input multiple-output multiple access channel (MIMO-MAC). Since IA with limited feedback results in residual interference for the quantization error, more effective schemes are introduced to reduce the residual interference in this paper compared with the ever work. The first kind of schemes means that the precoding matrices at the transmitters are the quantization value after obtaining the IA close-form solution of the precoding and decoding matrices at the receivers. This kind of schemes has been generalized to K users in this paper, and decoding matrices design is considered to reduce the quantization error to improve the performance. For the second kind of schemes, the beamforming vectors are chosen in the codebooks directly which guarantee the inter-cell interference (ICI) are most aligned. Monte-Carlo simulations illustrate that the proposed schemes outperform the existing schemes.
{"title":"Limited feedback schemes based on inter-cell interference alignment in two-cell interfering MIMO-MAC","authors":"Ruixue Zhou, Tiejun Lv, Wei Long, Hui Gao, Yueming Lu, E. Liu","doi":"10.1109/ICC.2013.6655413","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655413","url":null,"abstract":"In this paper, we propose two kinds of interference alignment (IA) schemes with limited feedback for the two-cell interfering multi-user multiple-input multiple-output multiple access channel (MIMO-MAC). Since IA with limited feedback results in residual interference for the quantization error, more effective schemes are introduced to reduce the residual interference in this paper compared with the ever work. The first kind of schemes means that the precoding matrices at the transmitters are the quantization value after obtaining the IA close-form solution of the precoding and decoding matrices at the receivers. This kind of schemes has been generalized to K users in this paper, and decoding matrices design is considered to reduce the quantization error to improve the performance. For the second kind of schemes, the beamforming vectors are chosen in the codebooks directly which guarantee the inter-cell interference (ICI) are most aligned. Monte-Carlo simulations illustrate that the proposed schemes outperform the existing schemes.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"5214-5218"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86295157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655323
M. Hamidia, A. Amrouche
One of the major problems in voiced communication systems is the presence of acoustic echoes generated from the coupling between the loudspeaker and the microphone. In this paper, a new method of Double-Talk Detection (DTD) for Acoustic Echo Cancellation (AEC), based on the Singular Value Decomposition (SVD), is proposed. Usually, the performances of the AEC, which is based on adaptive filtering, degrade seriously in the presence of speech issued from the near-end speaker (double-talk). Then, Double Talk Detection system must be added to AEC, for controlling the adaptation of the adaptive filter coefficients. For this purpose, we introduce the SVD of the far-end signal for detecting the double-talk periods. The obtained results, using TIMIT database, show that the proposed method outperforms the classical Geigel algorithm and Normalized Cross-Correlation (NCC) algorithm.
{"title":"Double-talk detection using the singular value decomposition for acoustic echo cancellation","authors":"M. Hamidia, A. Amrouche","doi":"10.1109/ICC.2013.6655323","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655323","url":null,"abstract":"One of the major problems in voiced communication systems is the presence of acoustic echoes generated from the coupling between the loudspeaker and the microphone. In this paper, a new method of Double-Talk Detection (DTD) for Acoustic Echo Cancellation (AEC), based on the Singular Value Decomposition (SVD), is proposed. Usually, the performances of the AEC, which is based on adaptive filtering, degrade seriously in the presence of speech issued from the near-end speaker (double-talk). Then, Double Talk Detection system must be added to AEC, for controlling the adaptation of the adaptive filter coefficients. For this purpose, we introduce the SVD of the far-end signal for detecting the double-talk periods. The obtained results, using TIMIT database, show that the proposed method outperforms the classical Geigel algorithm and Normalized Cross-Correlation (NCC) algorithm.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"48 1","pages":"4745-4749"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73834316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655581
Bojiang Ma, M. H. Cheung, V. Wong
Recently, the multimedia content delivery has replaced the traditional voice communication as the major source of traffic in wireless networks. The deployment of femtocells is promising in satisfying the requirements of these multimedia applications if the interference among the femtocell access points (FAPs) is well-managed. In this paper, we study the interference management problem of the FAPs in a cooperative multimedia femtocell network. We consider the network setting where the players (i.e., the FAPs) can coordinate their transmissions to reduce the level of interference within a coalition. We first formulate the interference management problem as a coalition formation game in partition form with negative externalities, where the payoff of a player depends on actions of other players in the same coalition and in different coalitions. Based on the solution concept of recursive core in coalitional games, we propose an efficient coalition formation algorithm, RECORD, to achieve a final stable coalition structure. Simulation results show that the RECORD algorithm results in a substantially higher flow throughput and aggregate utility than some previously proposed scheduling algorithms.
{"title":"Interference management for multimedia femtocell networks with coalition formation game","authors":"Bojiang Ma, M. H. Cheung, V. Wong","doi":"10.1109/ICC.2013.6655581","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655581","url":null,"abstract":"Recently, the multimedia content delivery has replaced the traditional voice communication as the major source of traffic in wireless networks. The deployment of femtocells is promising in satisfying the requirements of these multimedia applications if the interference among the femtocell access points (FAPs) is well-managed. In this paper, we study the interference management problem of the FAPs in a cooperative multimedia femtocell network. We consider the network setting where the players (i.e., the FAPs) can coordinate their transmissions to reduce the level of interference within a coalition. We first formulate the interference management problem as a coalition formation game in partition form with negative externalities, where the payoff of a player depends on actions of other players in the same coalition and in different coalitions. Based on the solution concept of recursive core in coalitional games, we propose an efficient coalition formation algorithm, RECORD, to achieve a final stable coalition structure. Simulation results show that the RECORD algorithm results in a substantially higher flow throughput and aggregate utility than some previously proposed scheduling algorithms.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"54 12 1","pages":"6112-6117"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76587315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6654841
R. R. Oliveira, Daniel S. Marcon, L. Bays, M. Neves, L. Buriol, L. Gaspary, M. Barcellos
Although network virtualization can improve security by isolating traffic from different networks, routers and links are still vulnerable to attacks on the underlying network. High capacity physical links, in particular, constitute good targets since they may be important for a large number of virtual networks. Previous work protects virtual networks by setting aside backup resources. Although effective, this solution increases the cost to infrastructure providers. In this paper, we present a virtual network embedding approach which enables resilience to attacks and efficiency in resource utilization. Our approach is two-folded: while a preventive strategy embeds virtual links into multiple substrate paths, a reactive strategy attempts to reallocate any capacity affected by an underlying DoS attack. Since the embedding problem is NP-Hard, we devise a Simulated Annealing meta-heuristic to solve it efficiently. Results show our solution can provide resilience to attacks at a lower cost.
{"title":"No more backups: Toward efficient embedding of survivable virtual networks","authors":"R. R. Oliveira, Daniel S. Marcon, L. Bays, M. Neves, L. Buriol, L. Gaspary, M. Barcellos","doi":"10.1109/ICC.2013.6654841","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654841","url":null,"abstract":"Although network virtualization can improve security by isolating traffic from different networks, routers and links are still vulnerable to attacks on the underlying network. High capacity physical links, in particular, constitute good targets since they may be important for a large number of virtual networks. Previous work protects virtual networks by setting aside backup resources. Although effective, this solution increases the cost to infrastructure providers. In this paper, we present a virtual network embedding approach which enables resilience to attacks and efficiency in resource utilization. Our approach is two-folded: while a preventive strategy embeds virtual links into multiple substrate paths, a reactive strategy attempts to reallocate any capacity affected by an underlying DoS attack. Since the embedding problem is NP-Hard, we devise a Simulated Annealing meta-heuristic to solve it efficiently. Results show our solution can provide resilience to attacks at a lower cost.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"126 1","pages":"2128-2132"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78644964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655042
Zhuo Wu, M. Vu
The Causal Cognitive Interference Channel (CCIC) models realistic causal cognitive communication between two sender-and-receiver pairs, in which the cognitive sender causally obtains a message from the primary sender and helps forward it to the primary receiver while also sending its own message to the cognitive receiver. We propose a new coding scheme combining the Han-Kobayashi scheme, partial decode-forward relaying and modified dirty-paper coding (DPC) for the Gaussian CCIC in the half-duplex mode. The proposed scheme induces correlation between the transmit signal and the state to allow traditional DPC as well as state forwarding. An achievable rate region with joint decoding is derived. Numerical results show that the rate region for the proposed scheme is better than the Han-Kobayashi scheme and several other existing schemes. We also analyze the maximum rate for the cognitive user while keeping the primary user's rate as interference-free. Results show that, by decode-and-forward relaying, the cognitive user can achieve significant rates while not affecting the primary user's rate even in the half-duplex causal case.
{"title":"A half-duplex transmission scheme for the Gaussian causal cognitive interference channel","authors":"Zhuo Wu, M. Vu","doi":"10.1109/ICC.2013.6655042","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655042","url":null,"abstract":"The Causal Cognitive Interference Channel (CCIC) models realistic causal cognitive communication between two sender-and-receiver pairs, in which the cognitive sender causally obtains a message from the primary sender and helps forward it to the primary receiver while also sending its own message to the cognitive receiver. We propose a new coding scheme combining the Han-Kobayashi scheme, partial decode-forward relaying and modified dirty-paper coding (DPC) for the Gaussian CCIC in the half-duplex mode. The proposed scheme induces correlation between the transmit signal and the state to allow traditional DPC as well as state forwarding. An achievable rate region with joint decoding is derived. Numerical results show that the rate region for the proposed scheme is better than the Han-Kobayashi scheme and several other existing schemes. We also analyze the maximum rate for the cognitive user while keeping the primary user's rate as interference-free. Results show that, by decode-and-forward relaying, the cognitive user can achieve significant rates while not affecting the primary user's rate even in the half-duplex causal case.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"3230-3235"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81042669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6654936
Liping Wang, V. Fodor
We consider a spectrum sharing network consisting of a primary and a cognitive secondary transmitter-receiver pair, where the secondary transmitter can cooperatively relay primary traffic. If the secondary user chooses not to cooperate, it can transmit only when the channel is sensed idle. Otherwise, it relays the primary packet and transmits its own packet in the same time slot while guaranteeing the performance of the primary transmission. Choosing cooperation, the secondary user can transmit a packet immediately even if the primary queue is not empty, but it has to bear the additional cost of relaying. We consider a cognitive system, where, to solve this dilemma, the secondary user decides dynamically on when to cooperate. We derive the bounds of the stable-throughput region of the system, and formulate the problem as a Markov decision process (MDP). We prove the existence of a stationary policy that is average cost optimal. Numerical results show that the optimal dynamic secondary access can trade off between the gain and the cost of cooperation, and the average cost can be decreased significantly.
{"title":"Cooperate or not: The secondary user's dilemma in hierarchical spectrum sharing networks","authors":"Liping Wang, V. Fodor","doi":"10.1109/ICC.2013.6654936","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654936","url":null,"abstract":"We consider a spectrum sharing network consisting of a primary and a cognitive secondary transmitter-receiver pair, where the secondary transmitter can cooperatively relay primary traffic. If the secondary user chooses not to cooperate, it can transmit only when the channel is sensed idle. Otherwise, it relays the primary packet and transmits its own packet in the same time slot while guaranteeing the performance of the primary transmission. Choosing cooperation, the secondary user can transmit a packet immediately even if the primary queue is not empty, but it has to bear the additional cost of relaying. We consider a cognitive system, where, to solve this dilemma, the secondary user decides dynamically on when to cooperate. We derive the bounds of the stable-throughput region of the system, and formulate the problem as a Markov decision process (MDP). We prove the existence of a stationary policy that is average cost optimal. Numerical results show that the optimal dynamic secondary access can trade off between the gain and the cost of cooperation, and the average cost can be decreased significantly.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"2650-2655"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90335948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655343
M. Harada, K. Fukawa, H. Suzuki, S. Suyama
This paper proposes an approximate block diagonalization (BD) method that does not require feedback of channel state information (CSI) by using the second-order statistics of channels for multiuser MIMO mobile communications. On the assumption that an incidence angle (angle-of-arrival) distribution in the uplink channel is the same as an angle-of-departure distribution in the downlink channel, the proposed scheme estimates the autocorrelation matrix of the downlink channel from the average and variance of incidence angles in the uplink. Since the proposed scheme uses the estimate of the autocorrelation matrix of the downlink channel, it performs eigenvalue decomposition of the estimated autocorrelation matrix whereas the conventional BD precoding performs singular value decomposition of the channel matrix. To verify the effectiveness of the proposed scheme, computer simulations are conducted. It is shown that the proposed scheme, which does not need CSI feedback, is little inferior in the channel capacity to the conventional BD precoding that requires CSI feedback.
{"title":"Approximate channel block diagonalization for open-loop Multiuser MIMO communications","authors":"M. Harada, K. Fukawa, H. Suzuki, S. Suyama","doi":"10.1109/ICC.2013.6655343","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655343","url":null,"abstract":"This paper proposes an approximate block diagonalization (BD) method that does not require feedback of channel state information (CSI) by using the second-order statistics of channels for multiuser MIMO mobile communications. On the assumption that an incidence angle (angle-of-arrival) distribution in the uplink channel is the same as an angle-of-departure distribution in the downlink channel, the proposed scheme estimates the autocorrelation matrix of the downlink channel from the average and variance of incidence angles in the uplink. Since the proposed scheme uses the estimate of the autocorrelation matrix of the downlink channel, it performs eigenvalue decomposition of the estimated autocorrelation matrix whereas the conventional BD precoding performs singular value decomposition of the channel matrix. To verify the effectiveness of the proposed scheme, computer simulations are conducted. It is shown that the proposed scheme, which does not need CSI feedback, is little inferior in the channel capacity to the conventional BD precoding that requires CSI feedback.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"92 1","pages":"4849-4853"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74628401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655219
Imtiaz Ahmed, A. Ikhlef, D. W. K. Ng, R. Schober
In this work, we consider a point-to-point link where the transmitter has a hybrid supply of energy, i.e., the energy is supplied by a constant energy source and an energy harvester, which harvests energy from its surrounding environment. Our goal is to jointly minimize the power consumed by the constant energy source and any possible waste of the harvested energy to ensure their optimum utilization for transmission of a given amount of data in a given number of time intervals. Two scenarios are considered for packet arrival. In the first scenario, we assume that all data packets have arrived before the transmission begins, whereas in the second scenario, we assume that data packets are arriving during the course of data transmission. For both scenarios, we propose optimal offline transmit power allocation schemes which provide insight on how to efficiently consume the energy supplied by the constant energy source and the energy harvester.
{"title":"Optimal power allocation for a hybrid energy harvesting transmitter","authors":"Imtiaz Ahmed, A. Ikhlef, D. W. K. Ng, R. Schober","doi":"10.1109/ICC.2013.6655219","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655219","url":null,"abstract":"In this work, we consider a point-to-point link where the transmitter has a hybrid supply of energy, i.e., the energy is supplied by a constant energy source and an energy harvester, which harvests energy from its surrounding environment. Our goal is to jointly minimize the power consumed by the constant energy source and any possible waste of the harvested energy to ensure their optimum utilization for transmission of a given amount of data in a given number of time intervals. Two scenarios are considered for packet arrival. In the first scenario, we assume that all data packets have arrived before the transmission begins, whereas in the second scenario, we assume that data packets are arriving during the course of data transmission. For both scenarios, we propose optimal offline transmit power allocation schemes which provide insight on how to efficiently consume the energy supplied by the constant energy source and the energy harvester.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"25 1 1","pages":"4185-4190"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88867277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655510
Kilbom Lee, Joonsuk Kim, Minki Ahn, Inkyu Lee
A signature identification algorithm is a method to obtain the cell identification information for wireless cellular systems or determine the intended user for wireless local area network. In this paper, we propose a simple and efficient signature identification algorithm using Zadoff-Chu sequence in orthogonal frequency division multiplexing systems. To demonstrate efficacy of the proposed algorithm, we derive the probability of signature identification failures for different power delay profiles. From the derived probability, it is shown that the proposed algorithm fully exploits frequency selective fadings. Especially, we reveal that the slope of the failure probability curves is determined by the channel length for equal power fading channels. Simulation results show that the proposed algorithm outperforms conventional signature algorithms in frequency selective fading channels. Also, we confirm that our analysis matches well with the empirical results of the proposed signature identification algorithm.
{"title":"Signature identification techniques with Zadoff-Chu sequence for OFDM systems","authors":"Kilbom Lee, Joonsuk Kim, Minki Ahn, Inkyu Lee","doi":"10.1109/ICC.2013.6655510","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655510","url":null,"abstract":"A signature identification algorithm is a method to obtain the cell identification information for wireless cellular systems or determine the intended user for wireless local area network. In this paper, we propose a simple and efficient signature identification algorithm using Zadoff-Chu sequence in orthogonal frequency division multiplexing systems. To demonstrate efficacy of the proposed algorithm, we derive the probability of signature identification failures for different power delay profiles. From the derived probability, it is shown that the proposed algorithm fully exploits frequency selective fadings. Especially, we reveal that the slope of the failure probability curves is determined by the channel length for equal power fading channels. Simulation results show that the proposed algorithm outperforms conventional signature algorithms in frequency selective fading channels. Also, we confirm that our analysis matches well with the empirical results of the proposed signature identification algorithm.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"85 1","pages":"5737-5741"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72760721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655407
Haining Wang, Z. Ding, M. Cierny, R. Wichman
We develop and analyze a time-domain bi-level power control scheme using Almost Blank Subframe (ABS) for downlink cross-tier interference mitigation. Even for only one femto cell and macro cell, the optimization problem given rate constraint is nonconvex. We prove that by relaxing the integer requirement for subframe division, the optimal strategy is using either power control or ABS individually, and a joint scheme is not needed in the optimal solution. Imposing the integer subframe number requirement, this conclusion is no longer true. However, we show that the optimal solution also assumes simple structure by choosing from one of three feasible solutions. Simulation results show that the joint power control and ABS scheme outperforms traditional single-level power control scheme for downlink cross-tier interference mitigation with low computational complexity.
{"title":"Time domain bi-level downlink power control for cross-tier interference mitigation in HetNet","authors":"Haining Wang, Z. Ding, M. Cierny, R. Wichman","doi":"10.1109/ICC.2013.6655407","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655407","url":null,"abstract":"We develop and analyze a time-domain bi-level power control scheme using Almost Blank Subframe (ABS) for downlink cross-tier interference mitigation. Even for only one femto cell and macro cell, the optimization problem given rate constraint is nonconvex. We prove that by relaxing the integer requirement for subframe division, the optimal strategy is using either power control or ABS individually, and a joint scheme is not needed in the optimal solution. Imposing the integer subframe number requirement, this conclusion is no longer true. However, we show that the optimal solution also assumes simple structure by choosing from one of three feasible solutions. Simulation results show that the joint power control and ABS scheme outperforms traditional single-level power control scheme for downlink cross-tier interference mitigation with low computational complexity.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"31 4 1","pages":"5183-5187"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82905207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：