Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655441
S. Boddu, A. Mukhopadhyay, P. Chandhar, Bigi Varghese Philip, Suvra Shekhar Das
To achieve high capacity in cellular networks, frequency reuse factor of unity is used. However, it suffers from heavy co-channel interference at cell edge regions. This leads to poor Signal to Interference plus Noise Ratio (SINR) and hence poor performance. Fractional Frequency Reuse (FFR) is one of the methods being considered to improve cell edge performance. In this work we present the impact of SINR threshold and bandwidth partitioning on the successful deployment of FFR scheme. We have considered both Real Time and Best Effort traffic.
{"title":"Analysis of fractional frequency reuse in OFDMA networks for real time and best effort traffic","authors":"S. Boddu, A. Mukhopadhyay, P. Chandhar, Bigi Varghese Philip, Suvra Shekhar Das","doi":"10.1109/ICC.2013.6655441","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655441","url":null,"abstract":"To achieve high capacity in cellular networks, frequency reuse factor of unity is used. However, it suffers from heavy co-channel interference at cell edge regions. This leads to poor Signal to Interference plus Noise Ratio (SINR) and hence poor performance. Fractional Frequency Reuse (FFR) is one of the methods being considered to improve cell edge performance. In this work we present the impact of SINR threshold and bandwidth partitioning on the successful deployment of FFR scheme. We have considered both Real Time and Best Effort traffic.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"5366-5370"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79875117","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-06-09DOI: 10.1109/ICC.2013.6655212
R. Bolla, R. Bruschi, P. Lago
This paper deeply and experimentally analyzes the efficiency of low power idle techniques when applied to packet processing engines of network devices. To this purpose, we set up a complex testbed that allowed us to perform several measurements on energy- and network-performance indexes. The reference device platforms that we selected for this evaluation are new generation software routers based on component-off-the-shelf hardware, since they already include advanced power management capabilities, and can be considered as a significant example for next-generation green network devices. The results collected in the measurement campaign allowed us not only (i) to provide an in-depth energy consumption profiling of SR data-plane, but also (ii) to clearly outline energy costs due to the use of low power idle techniques. Among other interesting aspects, we completely characterized the energy consumption due to wakeup transitions, which may cause instantaneous consumption spikes higher than 4 times the power energy requirement when active.
{"title":"The hidden cost of network low power idle","authors":"R. Bolla, R. Bruschi, P. Lago","doi":"10.1109/ICC.2013.6655212","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655212","url":null,"abstract":"This paper deeply and experimentally analyzes the efficiency of low power idle techniques when applied to packet processing engines of network devices. To this purpose, we set up a complex testbed that allowed us to perform several measurements on energy- and network-performance indexes. The reference device platforms that we selected for this evaluation are new generation software routers based on component-off-the-shelf hardware, since they already include advanced power management capabilities, and can be considered as a significant example for next-generation green network devices. The results collected in the measurement campaign allowed us not only (i) to provide an in-depth energy consumption profiling of SR data-plane, but also (ii) to clearly outline energy costs due to the use of low power idle techniques. Among other interesting aspects, we completely characterized the energy consumption due to wakeup transitions, which may cause instantaneous consumption spikes higher than 4 times the power energy requirement when active.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"11 1","pages":"4148-4153"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79937886","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-06-09DOI: 10.1109/ICC.2013.6655093
S. Shah, Jannet Faiz, Maham Farooq, A. Shafi, Syed Akbar Mehdi
With the recent interest in Software Defined Networking, many OpenFlow controllers have been released for research and commercial use. However, little public knowledge exists about the architectural choices that allow one controller to outperform another in production environments. In this paper, we aim to identify key performance bottlenecks and good architectural choices for designing OpenFlow-based SDN controllers. With this aim in mind, we evaluate the performances of four prominent open-source OpenFlow controllers: NOX [1], Beacon [2], Maestro [3] and Floodlight [4]. Since these controllers support multi-threading, we deploy them on shared memory multicore machines and benchmark their key architectural components under different metrics including thread scalability, switch scalability and latency in a custom cluster testbed. Our results lead to important architectural guidelines that can be used to improve the scalability of existing controllers or to design new ones. We follow these guidelines to implement an OpenFlow controller which outperforms existing controllers on assorted scalability metrics.
{"title":"An architectural evaluation of SDN controllers","authors":"S. Shah, Jannet Faiz, Maham Farooq, A. Shafi, Syed Akbar Mehdi","doi":"10.1109/ICC.2013.6655093","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655093","url":null,"abstract":"With the recent interest in Software Defined Networking, many OpenFlow controllers have been released for research and commercial use. However, little public knowledge exists about the architectural choices that allow one controller to outperform another in production environments. In this paper, we aim to identify key performance bottlenecks and good architectural choices for designing OpenFlow-based SDN controllers. With this aim in mind, we evaluate the performances of four prominent open-source OpenFlow controllers: NOX [1], Beacon [2], Maestro [3] and Floodlight [4]. Since these controllers support multi-threading, we deploy them on shared memory multicore machines and benchmark their key architectural components under different metrics including thread scalability, switch scalability and latency in a custom cluster testbed. Our results lead to important architectural guidelines that can be used to improve the scalability of existing controllers or to design new ones. We follow these guidelines to implement an OpenFlow controller which outperforms existing controllers on assorted scalability metrics.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"3504-3508"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80268328","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-06-09DOI: 10.1109/ICC.2013.6655192
F. Kojima, H. Harada
This paper proposes a low-power multi-hop data frame transmission scheme to create a long-lived smart utility network (SUN), as standardized by IEEE 802.15 TG4g/4e. In the proposed scheme, low energy superframe structure with turned-off beacons are employed to reduce power wastage, thereby providing effective sleep periods for each device. Moreover, multi-hop frame transmission is easily realized by constructing a tree-shaped topology with incoming and outgoing superframes. Furthermore, in the proposed system, effective frame aggregation technology exploiting such low energy superframe structure is employed in order to solve the bottle neck problems that seriously degrade utility data collection performance in SUN. The results of computer simulations confirm that the proposed scheme enables a greater than 90% frame success rate without error control while holding a less than 0.4% active period ratio in feasible SUN usage situations.
{"title":"A study on IEEE 802.15.4e compliant low-power multi-hop SUN with frame aggregation","authors":"F. Kojima, H. Harada","doi":"10.1109/ICC.2013.6655192","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655192","url":null,"abstract":"This paper proposes a low-power multi-hop data frame transmission scheme to create a long-lived smart utility network (SUN), as standardized by IEEE 802.15 TG4g/4e. In the proposed scheme, low energy superframe structure with turned-off beacons are employed to reduce power wastage, thereby providing effective sleep periods for each device. Moreover, multi-hop frame transmission is easily realized by constructing a tree-shaped topology with incoming and outgoing superframes. Furthermore, in the proposed system, effective frame aggregation technology exploiting such low energy superframe structure is employed in order to solve the bottle neck problems that seriously degrade utility data collection performance in SUN. The results of computer simulations confirm that the proposed scheme enables a greater than 90% frame success rate without error control while holding a less than 0.4% active period ratio in feasible SUN usage situations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"99 1","pages":"4041-4045"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80283786","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-06-09DOI: 10.1109/ICC.2013.6655582
Ran Zhang, Zhongming Zheng, Miao Wang, Xuemin Shen, Liang-Liang Xie
The Long Term Evolution - Advanced (LTE-A) standard is widely accepted for the 4th generation mobile systems to satisfy the explosive growth of high-data-rate demand. Carrier Aggregation (CA) is considered as one of the most momentous techniques adopted in LTE-A standard. Many studies have been done to analyze the performance of LTE-A systems with CA in terms of average user throughput. However, the system-level capacity analysis of LTE-A systems has not been well studied. In this paper, we explore the downlink admission control process in LTE-A systems with CA to compare the capacities between LTE users and LTE-A users, based on the metric - equivalent capacity. Specifically, taking into account the user heterogeneity, the system evolution is modeled as a birth-death process for each user class based on an effective user traffic generation model. A closed-form relationship between the equivalent capacity and system bandwidth is then derived for a single-carrier LTE-A system with the help of binomial-normal approximation. The relationship is further extended to multi-carrier case for both LTE users and LTE-A users. Finally, simulation results are provided to verify our analytical ones, and demonstrate that the equivalent capacity of LTE-A users surpasses that of LTE users significantly.
{"title":"Equivalent capacity analysis of LTE-Advanced systems with carrier aggregation","authors":"Ran Zhang, Zhongming Zheng, Miao Wang, Xuemin Shen, Liang-Liang Xie","doi":"10.1109/ICC.2013.6655582","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655582","url":null,"abstract":"The Long Term Evolution - Advanced (LTE-A) standard is widely accepted for the 4th generation mobile systems to satisfy the explosive growth of high-data-rate demand. Carrier Aggregation (CA) is considered as one of the most momentous techniques adopted in LTE-A standard. Many studies have been done to analyze the performance of LTE-A systems with CA in terms of average user throughput. However, the system-level capacity analysis of LTE-A systems has not been well studied. In this paper, we explore the downlink admission control process in LTE-A systems with CA to compare the capacities between LTE users and LTE-A users, based on the metric - equivalent capacity. Specifically, taking into account the user heterogeneity, the system evolution is modeled as a birth-death process for each user class based on an effective user traffic generation model. A closed-form relationship between the equivalent capacity and system bandwidth is then derived for a single-carrier LTE-A system with the help of binomial-normal approximation. The relationship is further extended to multi-carrier case for both LTE users and LTE-A users. Finally, simulation results are provided to verify our analytical ones, and demonstrate that the equivalent capacity of LTE-A users surpasses that of LTE users significantly.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"23 1","pages":"6118-6122"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79252054","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-06-09DOI: 10.1109/ICC.2013.6655339
Q. Ahmed, Kihong Park, Mohamed-Slim Alouini, S. Aïssa
In this paper, we propose optimal linear detectors for non-orthogonal amplify-and-forward cooperative protocol when considering a single-relay scenario. Two types of detectors are proposed based on the principles of minimum mean square error (MMSE) and minimum bit error rate (MBER). The MMSE detector minimizes the mean square error, while the MBER minimizes the system bit error rate (BER). Both detectors exhibit excellent BER performance with relatively low complexity as compared to the maximal likelihood (ML) detector. The BER performance of both detectors is superior to the channel inversion, the maximal ratio combining, and the biased ML detectors.
{"title":"Optimal linear detectors for nonorthogonal amplify-and-forward protocol","authors":"Q. Ahmed, Kihong Park, Mohamed-Slim Alouini, S. Aïssa","doi":"10.1109/ICC.2013.6655339","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655339","url":null,"abstract":"In this paper, we propose optimal linear detectors for non-orthogonal amplify-and-forward cooperative protocol when considering a single-relay scenario. Two types of detectors are proposed based on the principles of minimum mean square error (MMSE) and minimum bit error rate (MBER). The MMSE detector minimizes the mean square error, while the MBER minimizes the system bit error rate (BER). Both detectors exhibit excellent BER performance with relatively low complexity as compared to the maximal likelihood (ML) detector. The BER performance of both detectors is superior to the channel inversion, the maximal ratio combining, and the biased ML detectors.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"48 1","pages":"4829-4833"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79329593","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-06-09DOI: 10.1109/ICC.2013.6654876
Sudheer Poojary, V. Sharma
We study a system of multiple routers traversed by multiple TCP connections using TCP New Reno, CUBIC and Compound. More than one router may be congested. To analyze this system we will use earlier theoretical models of TCP New Reno and CUBIC but develop a new model of TCP Compound experiencing random packet losses and queuing delays. We model the router queues as M/GI/1 queues with arrival rates controlled by TCP window flow control. We also look at an alternate approach assuming proportional fairness of TCP to find the throughputs of the multiple TCP connections. These approximations are validated through comparison with ns-2 simulations.
我们研究了一个由多个TCP连接穿越多个路由器的系统，使用了TCP New Reno、CUBIC和Compound。可能有多个路由器拥塞。为了分析这个系统，我们将使用TCP New Reno和CUBIC的早期理论模型，但开发一个新的TCP复合模型，经历随机数据包丢失和排队延迟。我们将路由器队列建模为M/GI/1队列，到达率由TCP窗口流控制。我们还研究了另一种假设TCP按比例公平的方法，以找到多个TCP连接的吞吐量。通过与ns-2模拟的比较，验证了这些近似的正确性。
{"title":"Theoretical analysis of high-speed multiple TCP connections through multiple routers","authors":"Sudheer Poojary, V. Sharma","doi":"10.1109/ICC.2013.6654876","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654876","url":null,"abstract":"We study a system of multiple routers traversed by multiple TCP connections using TCP New Reno, CUBIC and Compound. More than one router may be congested. To analyze this system we will use earlier theoretical models of TCP New Reno and CUBIC but develop a new model of TCP Compound experiencing random packet losses and queuing delays. We model the router queues as M/GI/1 queues with arrival rates controlled by TCP window flow control. We also look at an alternate approach assuming proportional fairness of TCP to find the throughputs of the multiple TCP connections. These approximations are validated through comparison with ns-2 simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"23 1","pages":"2320-2325"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79423294","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-06-09DOI: 10.1109/ICC.2013.6655029
Khodr A. Saaifan, W. Henkel
A Middleton Class-A (MCA) model is one of the most accurate statistical-physical models for narrowband impulse noise. The previous studies show that time diversity can efficiently be used to reduce the impact of MCA noise. The optimum combiner in such noise consists of a nonlinear preprocessor followed by a conventional combiner. Since an MCA noise process consists of an infinite number of noise states, there is no closed-form solution of the optimum nonlinearity. In this paper, we adopt a two-term model for the MCA process, which is further approximated to a simpler noise model. Therefore, we introduce a closed-form approximation of the optimum nonlinearity in the presence of real-valued MCA noise. In fading channels, we use a complex extension of an MCA model. We show how the nonlinearity operation maintains the diversity advantage in such a noise model.
{"title":"A nonlinear diversity combiner of binary signals in the presence of impulsive interference","authors":"Khodr A. Saaifan, W. Henkel","doi":"10.1109/ICC.2013.6655029","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655029","url":null,"abstract":"A Middleton Class-A (MCA) model is one of the most accurate statistical-physical models for narrowband impulse noise. The previous studies show that time diversity can efficiently be used to reduce the impact of MCA noise. The optimum combiner in such noise consists of a nonlinear preprocessor followed by a conventional combiner. Since an MCA noise process consists of an infinite number of noise states, there is no closed-form solution of the optimum nonlinearity. In this paper, we adopt a two-term model for the MCA process, which is further approximated to a simpler noise model. Therefore, we introduce a closed-form approximation of the optimum nonlinearity in the presence of real-valued MCA noise. In fading channels, we use a complex extension of an MCA model. We show how the nonlinearity operation maintains the diversity advantage in such a noise model.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"8 1","pages":"3159-3164"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79483738","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-06-09DOI: 10.1109/ICC.2013.6655197
S. Chatzinotas
Distributed storage systems have been receiving increasing attention lately due to the developments in cloud and grid computing. Furthermore, a major part of the stored information comprises of multimedia, whose content can be communicated even with a lossy reconstruction. In this context, Multiple Description Quantizers (MDQ) can be employed to encode such sources for distributed storage. However, a question which naturally arises is how to repair lost descriptions which are due to node failures. In this paper, we employ MDQs based on translated lattices and a common decoding method through averaging over the available descriptions. The descriptions of failed nodes are repaired by quantizing the estimate of common decoding and then by reusing the same side codebook. Based on simulations, we study the effect of system size and number of failures on the distortion of the reconstructed source. As expected, the distortion deteriorates with the number of failures but the degradation is graceful especially for large systems.
{"title":"Repairing multiple description quantizers in distributed storage systems","authors":"S. Chatzinotas","doi":"10.1109/ICC.2013.6655197","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655197","url":null,"abstract":"Distributed storage systems have been receiving increasing attention lately due to the developments in cloud and grid computing. Furthermore, a major part of the stored information comprises of multimedia, whose content can be communicated even with a lossy reconstruction. In this context, Multiple Description Quantizers (MDQ) can be employed to encode such sources for distributed storage. However, a question which naturally arises is how to repair lost descriptions which are due to node failures. In this paper, we employ MDQs based on translated lattices and a common decoding method through averaging over the available descriptions. The descriptions of failed nodes are repaired by quantizing the estimate of common decoding and then by reusing the same side codebook. Based on simulations, we study the effect of system size and number of failures on the distortion of the reconstructed source. As expected, the distortion deteriorates with the number of failures but the degradation is graceful especially for large systems.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"46 1","pages":"4068-4072"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81262648","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-06-09DOI: 10.1109/ICC.2013.6655491
Zhiyu Zhang, K. C. Teh, K. H. Li
In this paper, we propose a novel coordinated downlink beamforming strategy based on the semidefinite relaxation (SDR) approach for a clustered multicell cellular system. As base station (BS) cooperation can provide significant performance improvement for the system capacity and interference suppression, we divide the whole network into a number of clusters. In each cluster, several BSs share the common user data and cooperatively design their signaling strategies. In this system, maximizing the sum-rate requires solving a global nonconvex optimization problem. We apply the semidefinite programming (SDP) relaxation to convert the original problem into distributed convex SDP which can be solved efficiently and optimally with convex optimization techniques. Numerical results show that the proposed beamforming algorithm provides a remarkable sum-rate enhancement and outperforms some existing schemes.
{"title":"Semidefinite relaxation based beamforming in clustered cooperative multicell MISO systems","authors":"Zhiyu Zhang, K. C. Teh, K. H. Li","doi":"10.1109/ICC.2013.6655491","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655491","url":null,"abstract":"In this paper, we propose a novel coordinated downlink beamforming strategy based on the semidefinite relaxation (SDR) approach for a clustered multicell cellular system. As base station (BS) cooperation can provide significant performance improvement for the system capacity and interference suppression, we divide the whole network into a number of clusters. In each cluster, several BSs share the common user data and cooperatively design their signaling strategies. In this system, maximizing the sum-rate requires solving a global nonconvex optimization problem. We apply the semidefinite programming (SDP) relaxation to convert the original problem into distributed convex SDP which can be solved efficiently and optimally with convex optimization techniques. Numerical results show that the proposed beamforming algorithm provides a remarkable sum-rate enhancement and outperforms some existing schemes.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"107 1","pages":"5635-5639"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81568544","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
扫码关注我们
求助内容：
应助结果提醒方式：