Pub Date : 2015-04-27DOI: 10.1109/ICT.2015.7124675
Philipp Schläfer, N. Wehn, M. Alles, T. Lehnigk-Emden, E. Boutillon
Non-binary low-density parity-check codes have superior communications performance compared to their binary counterparts. However, to be an option for future standards, efficient hardware architectures must be developed. State-of-the-art decoding algorithms lead to architectures suffering from low throughput and high latency. The check node function accounts for the largest part of the decoders overall complexity. In this paper a new, hardware aware check node algorithm is proposed. It has state-of-the-art communications performance while reducing the decoding complexity. Moreover the presented algorithm allows for partially or even fully parallel processing of the check node operations which is not applicable with currently used algorithms. It is therefore an excellent candidate for future high throughput hardware implementations.
{"title":"Syndrome based check node processing of high order NB-LDPC decoders","authors":"Philipp Schläfer, N. Wehn, M. Alles, T. Lehnigk-Emden, E. Boutillon","doi":"10.1109/ICT.2015.7124675","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124675","url":null,"abstract":"Non-binary low-density parity-check codes have superior communications performance compared to their binary counterparts. However, to be an option for future standards, efficient hardware architectures must be developed. State-of-the-art decoding algorithms lead to architectures suffering from low throughput and high latency. The check node function accounts for the largest part of the decoders overall complexity. In this paper a new, hardware aware check node algorithm is proposed. It has state-of-the-art communications performance while reducing the decoding complexity. Moreover the presented algorithm allows for partially or even fully parallel processing of the check node operations which is not applicable with currently used algorithms. It is therefore an excellent candidate for future high throughput hardware implementations.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"26 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116214459","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124686
Udaya Wijesinghe, U. Tupakula, V. Varadharajan
Software Defined Networking (SDN) is considered as a new approach promising simplified network management by providing a programmable interface. The idea of SDN is based on the separation of control plane from the data plane in networking devices. This is achieved by having the network intelligence centralised in what is called as SDN controller. In this paper we propose techniques for botnet detection in networks using SDN. The SDN controller makes use of generic templates for capturing the traffic flow information from the OpenFlow switches and makes use of this information for detecting bots. We will show that our model can detect a range of bots including IRC, HTTP and peer-to-peer bots.
{"title":"Botnet detection using software defined networking","authors":"Udaya Wijesinghe, U. Tupakula, V. Varadharajan","doi":"10.1109/ICT.2015.7124686","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124686","url":null,"abstract":"Software Defined Networking (SDN) is considered as a new approach promising simplified network management by providing a programmable interface. The idea of SDN is based on the separation of control plane from the data plane in networking devices. This is achieved by having the network intelligence centralised in what is called as SDN controller. In this paper we propose techniques for botnet detection in networks using SDN. The SDN controller makes use of generic templates for capturing the traffic flow information from the OpenFlow switches and makes use of this information for detecting bots. We will show that our model can detect a range of bots including IRC, HTTP and peer-to-peer bots.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128347023","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124714
Panca Dewi Pamungkasari, Y. Sanada
The cyclic-SLM which implements delayed correlation with a matched filter (DC-MF) is proposed in this paper. The cyclic-SLM reduces a peak-to-average power ratio (PAPR) on an orthogonal frequency division multiplexing (OFDM) signal. This scheme combines the original OFDM signal and its cyclic shifted ones. However, it needs side information (SI) of the cyclic shifts to recover the original signal that decreases the throughput of a wireless OFDM system. The DC-MF estimates the amount of a shift in a receiver side by multipling a recieved signal with its conjugates of the guard interval (GI) sequence in the time domain. Numerical results obtained through computer simulation show that the cyclic-SLM with the DC-MF significantly reduces the PAPR by around 2.5 dB as compared to the original signal. It also achieves the accuracy rate of the amount of the shift close to 100 % and the BER of 10-4 at Eb/N0 = 8.8 dB that is close to the perfect shift estimation.
{"title":"Time domain cyclic-selective mapping for PAPR reduction using delayed correlation with matched filter in OFDM system","authors":"Panca Dewi Pamungkasari, Y. Sanada","doi":"10.1109/ICT.2015.7124714","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124714","url":null,"abstract":"The cyclic-SLM which implements delayed correlation with a matched filter (DC-MF) is proposed in this paper. The cyclic-SLM reduces a peak-to-average power ratio (PAPR) on an orthogonal frequency division multiplexing (OFDM) signal. This scheme combines the original OFDM signal and its cyclic shifted ones. However, it needs side information (SI) of the cyclic shifts to recover the original signal that decreases the throughput of a wireless OFDM system. The DC-MF estimates the amount of a shift in a receiver side by multipling a recieved signal with its conjugates of the guard interval (GI) sequence in the time domain. Numerical results obtained through computer simulation show that the cyclic-SLM with the DC-MF significantly reduces the PAPR by around 2.5 dB as compared to the original signal. It also achieves the accuracy rate of the amount of the shift close to 100 % and the BER of 10-4 at Eb/N0 = 8.8 dB that is close to the perfect shift estimation.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357796","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124689
Huiming Dai, Hao Yan, Xin Zhang, Dacheng Yang
In this paper, a novel receiver design is proposed which combines two different approaches: decision feedback equalization (DFE) and equal gain combining (EGC). To make these two approaches work efficiently, the system is implemented in the frequency domain which can make full use of the advantages of both approaches. Simulation results demonstrate that our proposed design achieves greatly improved performance compared with conventional schemes.
{"title":"Performance improvement of DSRC system using a novel receiver design","authors":"Huiming Dai, Hao Yan, Xin Zhang, Dacheng Yang","doi":"10.1109/ICT.2015.7124689","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124689","url":null,"abstract":"In this paper, a novel receiver design is proposed which combines two different approaches: decision feedback equalization (DFE) and equal gain combining (EGC). To make these two approaches work efficiently, the system is implemented in the frequency domain which can make full use of the advantages of both approaches. Simulation results demonstrate that our proposed design achieves greatly improved performance compared with conventional schemes.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553940","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124706
Ghassan Alnwaimi, S. Vahid, K. Moessner
This work investigates enabling technology for spectrum sharing in heterogeneous networks (HetNets) deployment, particularly, when a layer of femtocells (FCs) overlaid upon a mobile cellular network. We propose a fully distributed strategic learning based model that enables Femtocells to autonomously identify spectrum use pattern, and accordingly select available resources, such as to operate under restrictions of avoiding interference and satisfy a certain QoS requirements. The simulation results show that the proposed model can identify unused spectral resources of underlying macrocells network, and FCs can autonomously adjust their spectrum resources and converge to a solution concept that satisfy both networks conditions. We show that intra/inter-tier interference can be reduced significantly, thus resulting in higher cell throughputs. Such a distributed intelligent scheme can provide a practical solution to the main challenges in opportunistic spectrum use and interference management in HetNets.
{"title":"Distributed learning game based spectrum sharing and resource selection for femtocells","authors":"Ghassan Alnwaimi, S. Vahid, K. Moessner","doi":"10.1109/ICT.2015.7124706","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124706","url":null,"abstract":"This work investigates enabling technology for spectrum sharing in heterogeneous networks (HetNets) deployment, particularly, when a layer of femtocells (FCs) overlaid upon a mobile cellular network. We propose a fully distributed strategic learning based model that enables Femtocells to autonomously identify spectrum use pattern, and accordingly select available resources, such as to operate under restrictions of avoiding interference and satisfy a certain QoS requirements. The simulation results show that the proposed model can identify unused spectral resources of underlying macrocells network, and FCs can autonomously adjust their spectrum resources and converge to a solution concept that satisfy both networks conditions. We show that intra/inter-tier interference can be reduced significantly, thus resulting in higher cell throughputs. Such a distributed intelligent scheme can provide a practical solution to the main challenges in opportunistic spectrum use and interference management in HetNets.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804368","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124658
Chengcheng Li, Tao Huang, Renchao Xie, Hengyang Zhang, Jiang Liu, Yun-jie Liu
Named Data Networking (NDN) as a promising future network architecture has been attracted a lot of attention. In NDN, to keep fairness between flows and avoid congestion, one of the most important issues is the traffic control. Although some works have been done to solve the traffic control problem by controlling the sending/forwarding of Interest, to the best of our knowledge, the cooperation between traffic control and forwarding strategy is largely ignored. Therefore, to fill this gap, we propose an effective traffic control mechanism named Multi-path Flow Control(MFC) in this paper. Our proposal is the first to combine traffic control with multi-path forwarding strategy. In contrast with other traffic control mechanisms, MFC performs better in supplying different flows with fair service rates, enhancing network throughput and avoiding “Waiting Interest”, which is a unique problem in NDN. Finally, numerical simulation results based on ndnSIM platform are illustrated to show the performance of the proposed scheme.
{"title":"A novel multi-path traffic control mechanism in named data networking","authors":"Chengcheng Li, Tao Huang, Renchao Xie, Hengyang Zhang, Jiang Liu, Yun-jie Liu","doi":"10.1109/ICT.2015.7124658","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124658","url":null,"abstract":"Named Data Networking (NDN) as a promising future network architecture has been attracted a lot of attention. In NDN, to keep fairness between flows and avoid congestion, one of the most important issues is the traffic control. Although some works have been done to solve the traffic control problem by controlling the sending/forwarding of Interest, to the best of our knowledge, the cooperation between traffic control and forwarding strategy is largely ignored. Therefore, to fill this gap, we propose an effective traffic control mechanism named Multi-path Flow Control(MFC) in this paper. Our proposal is the first to combine traffic control with multi-path forwarding strategy. In contrast with other traffic control mechanisms, MFC performs better in supplying different flows with fair service rates, enhancing network throughput and avoiding “Waiting Interest”, which is a unique problem in NDN. Finally, numerical simulation results based on ndnSIM platform are illustrated to show the performance of the proposed scheme.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126197914","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124715
Bing Lin, Hongyan Li, Yan Long
Satellite network has played an important role in the future global network, due to its advantages of global coverage and short round-trip time (RTT). Its characteristic of intermittent connection causes no-existence of end-to-end path in general in Disruption Tolerant Network (DTN), and thus the store-carry-forward mechanism is adopted. However, the store-carry-forward routing does not consider the buffer constraint on nodes, and thus a novel routing scheme should be designed for such scenario. In this paper, a novel model based on time-varying graph (TVG) is devised, which keeps the richness of the original DTN information. Based on early-connect-early-select path mechanism, we design the labeling algorithm for DTN (LAD) under buffer constraint to maximize the network throughput. Numerical simulation shows that the proposed mechanism can effectively achieve better throughput performance than the algorithm which selects path randomly.
{"title":"A buffer-limited maximum throughput routing algorithm for satellite network","authors":"Bing Lin, Hongyan Li, Yan Long","doi":"10.1109/ICT.2015.7124715","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124715","url":null,"abstract":"Satellite network has played an important role in the future global network, due to its advantages of global coverage and short round-trip time (RTT). Its characteristic of intermittent connection causes no-existence of end-to-end path in general in Disruption Tolerant Network (DTN), and thus the store-carry-forward mechanism is adopted. However, the store-carry-forward routing does not consider the buffer constraint on nodes, and thus a novel routing scheme should be designed for such scenario. In this paper, a novel model based on time-varying graph (TVG) is devised, which keeps the richness of the original DTN information. Based on early-connect-early-select path mechanism, we design the labeling algorithm for DTN (LAD) under buffer constraint to maximize the network throughput. Numerical simulation shows that the proposed mechanism can effectively achieve better throughput performance than the algorithm which selects path randomly.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115239292","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124672
Y. Wang, Yong-mei Wang, Weihua Zhou, Daoben Li
Performance analysis of a bandlimited nonorthogonal waveform transmission (NOWT) scheme for high data rate wireless communications is presented. The technique is a potential alternative to classic orthogonal multiplexing techniques such as OFDM and QAM. It shows faster data transmission rate than Nyquist rate, and considerable performance gain compared with orthogonal techniques, as well as much lower peak to average power ratio (PAPR). The error probability in AWGN channel is derived, and the free squared Euclidean distance of NOWT signal is no more than the minimum squared distance of its modulation constellation. Analysis and numerical results demonstrate that the bandwidth efficiency and capacity of cod-ed/uncoded NOWT technique is higher than Nyquist signalling and orthogonal techniques.
{"title":"Performance analysis of A NOWT scheme for high spectral efficiency communications","authors":"Y. Wang, Yong-mei Wang, Weihua Zhou, Daoben Li","doi":"10.1109/ICT.2015.7124672","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124672","url":null,"abstract":"Performance analysis of a bandlimited nonorthogonal waveform transmission (NOWT) scheme for high data rate wireless communications is presented. The technique is a potential alternative to classic orthogonal multiplexing techniques such as OFDM and QAM. It shows faster data transmission rate than Nyquist rate, and considerable performance gain compared with orthogonal techniques, as well as much lower peak to average power ratio (PAPR). The error probability in AWGN channel is derived, and the free squared Euclidean distance of NOWT signal is no more than the minimum squared distance of its modulation constellation. Analysis and numerical results demonstrate that the bandwidth efficiency and capacity of cod-ed/uncoded NOWT technique is higher than Nyquist signalling and orthogonal techniques.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284238","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124698
Lenin Gopal, Y. Rong, Z. Zang
In this paper, we propose a robust transceiver design for nonregenerative multicasting multiple-input multiple-output (MIMO) relay systems where a transmitter broadcasts common message to multiple receivers with aid of a relay node and the transmitter, relay and receivers are all equipped with multiple antennas. In the proposed design, the actual channel state information (CSI) is assumed as a Gaussian random matrix with the estimated CSI as the mean value, and the channel estimation errors are derived from the well-known Kronecker model. In the proposed design scheme, the transmitter and relay precoding matrices are jointly optimized to minimize the maximal mean squared-error (MSE) of the estimated signal at all receivers. The optimization problem is highly nonconvex in nature. Hence, we propose a low complexity solution by exploiting the optimal structure of the relay precoding matrix. Numerical simulations demonstrate the improved robustness of the proposed transceiver design algorithm against the CSI mismatch.
{"title":"Simplified robust design for nonregenerativemm multicasting MIMO relay systems","authors":"Lenin Gopal, Y. Rong, Z. Zang","doi":"10.1109/ICT.2015.7124698","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124698","url":null,"abstract":"In this paper, we propose a robust transceiver design for nonregenerative multicasting multiple-input multiple-output (MIMO) relay systems where a transmitter broadcasts common message to multiple receivers with aid of a relay node and the transmitter, relay and receivers are all equipped with multiple antennas. In the proposed design, the actual channel state information (CSI) is assumed as a Gaussian random matrix with the estimated CSI as the mean value, and the channel estimation errors are derived from the well-known Kronecker model. In the proposed design scheme, the transmitter and relay precoding matrices are jointly optimized to minimize the maximal mean squared-error (MSE) of the estimated signal at all receivers. The optimization problem is highly nonconvex in nature. Hence, we propose a low complexity solution by exploiting the optimal structure of the relay precoding matrix. Numerical simulations demonstrate the improved robustness of the proposed transceiver design algorithm against the CSI mismatch.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776274","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124678
A. Nasir, D. T. Ngo, S. Durrani
We consider a multicell network where an amplify-and-forward relay is deployed in each cell to help the base station (BS) serve its cell-edge user. We assume that each relay scavenges energy from all received radio signals to process and forward the information data from the BS to the corresponding user. For this, a power splitter and a wireless energy harvester are implemented in the relay. Our aim is to minimize the total power consumption in the network while guaranteeing minimum data throughput for each user. To this end, we develop a resource management scheme that jointly optimizes three parameters, namely, BS transmit powers, power splitting factors for energy harvesting and information processing at the relays, and relay transmit powers. As the formulated problem is highly nonconvex, we devise a successive convex approximation algorithm based on difference-of-convex-functions (DC) programming. The proposed iterative algorithm transforms the nonconvex problem into a sequence of convex problems, each of which is solved efficiently in each iteration. We prove that this path-following algorithm converges to an optimal solution that satisfies the Karush-Kuhn-Tucker (KKT) conditions of the original nonconvex problem. Simulation results demonstrate that the proposed joint optimization solution substantially improves the network performance.
{"title":"DC programming for power minimization in a multicell network with RF-powered relays","authors":"A. Nasir, D. T. Ngo, S. Durrani","doi":"10.1109/ICT.2015.7124678","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124678","url":null,"abstract":"We consider a multicell network where an amplify-and-forward relay is deployed in each cell to help the base station (BS) serve its cell-edge user. We assume that each relay scavenges energy from all received radio signals to process and forward the information data from the BS to the corresponding user. For this, a power splitter and a wireless energy harvester are implemented in the relay. Our aim is to minimize the total power consumption in the network while guaranteeing minimum data throughput for each user. To this end, we develop a resource management scheme that jointly optimizes three parameters, namely, BS transmit powers, power splitting factors for energy harvesting and information processing at the relays, and relay transmit powers. As the formulated problem is highly nonconvex, we devise a successive convex approximation algorithm based on difference-of-convex-functions (DC) programming. The proposed iterative algorithm transforms the nonconvex problem into a sequence of convex problems, each of which is solved efficiently in each iteration. We prove that this path-following algorithm converges to an optimal solution that satisfies the Karush-Kuhn-Tucker (KKT) conditions of the original nonconvex problem. Simulation results demonstrate that the proposed joint optimization solution substantially improves the network performance.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130141920","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
扫码关注我们
求助内容：
应助结果提醒方式：