Pub Date : 2015-12-03DOI: 10.1109/PIMRC.2015.7343441
K. Magowe, K. Sithamparanathan, A. Giorgetti, Xinghuo Yu
Blind localization of primary user (PU) is a geo-location spectrum awareness feature that can be very useful in enhancing the functionality of cognitive radios (CRs) in terms of minimizing the interference to the PU. However, the estimation of the PU position within the region is made difficult because cooperation between the PU and the secondary user (SU) does not exist and therefore the PU signal parameters remain unknown to the SU. The centroid-based localization techniques have significantly been adopted as suitable candidates that do not require knowledge of such parameters. In this paper we investigate the localization performance of such techniques by imposing constraints to the selection of the SU nodes, termed as SU cluster, to estimate the PU location. In particular, we impose a minimum distance constraint between any two SU nodes and group the qualifying nodes into a cluster. Only the SU nodes from the constrained cluster can take part in localizing the PU. We simulate the proposed method for a shadow fading wireless environment and compare the results with the centroid and the weighted centroid based blind localization methods. Our results show that the mean squared error in the estimation of the position of the PU is significantly improved for the proposed method compared to the two standard centroid localization techniques especially when the true PU location is away from the center of the region.
{"title":"Constrained cluster based blind localization of primary user for cognitive radio networks","authors":"K. Magowe, K. Sithamparanathan, A. Giorgetti, Xinghuo Yu","doi":"10.1109/PIMRC.2015.7343441","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343441","url":null,"abstract":"Blind localization of primary user (PU) is a geo-location spectrum awareness feature that can be very useful in enhancing the functionality of cognitive radios (CRs) in terms of minimizing the interference to the PU. However, the estimation of the PU position within the region is made difficult because cooperation between the PU and the secondary user (SU) does not exist and therefore the PU signal parameters remain unknown to the SU. The centroid-based localization techniques have significantly been adopted as suitable candidates that do not require knowledge of such parameters. In this paper we investigate the localization performance of such techniques by imposing constraints to the selection of the SU nodes, termed as SU cluster, to estimate the PU location. In particular, we impose a minimum distance constraint between any two SU nodes and group the qualifying nodes into a cluster. Only the SU nodes from the constrained cluster can take part in localizing the PU. We simulate the proposed method for a shadow fading wireless environment and compare the results with the centroid and the weighted centroid based blind localization methods. Our results show that the mean squared error in the estimation of the position of the PU is significantly improved for the proposed method compared to the two standard centroid localization techniques especially when the true PU location is away from the center of the region.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115794009","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-12-03DOI: 10.1109/PIMRC.2015.7343281
Junyang Ma, Zhongwei Si, Zhiqiang He, K. Niu
Spatially coupled LDPC codes have attracted much attention due to the promising performance. Recursive encoding with low delay and low complexity has been proposed in the literature for selected node degrees. To realize the recursive encoding of spatially coupled LDPC codes with arbitrary rates, we propose in this paper a modified structure of the parity-check matrix and implement the encoding using a shift-register regardless of the node degrees. By rearranging the edge connections, the parity bits at each coupling position can be jointly determined by the information bits at the current position and the encoded bits at former positions. Performance analysis in terms of design rate and density evolution has been provided. It can be observed that the modified code structure leads to a better belief-propagation threshold. Finite-length simulation results are provided, which verify the theoretical analysis.
{"title":"Recursive encoding of spatially coupled LDPC codes with arbitrary rates","authors":"Junyang Ma, Zhongwei Si, Zhiqiang He, K. Niu","doi":"10.1109/PIMRC.2015.7343281","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343281","url":null,"abstract":"Spatially coupled LDPC codes have attracted much attention due to the promising performance. Recursive encoding with low delay and low complexity has been proposed in the literature for selected node degrees. To realize the recursive encoding of spatially coupled LDPC codes with arbitrary rates, we propose in this paper a modified structure of the parity-check matrix and implement the encoding using a shift-register regardless of the node degrees. By rearranging the edge connections, the parity bits at each coupling position can be jointly determined by the information bits at the current position and the encoded bits at former positions. Performance analysis in terms of design rate and density evolution has been provided. It can be observed that the modified code structure leads to a better belief-propagation threshold. Finite-length simulation results are provided, which verify the theoretical analysis.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115894492","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-12-03DOI: 10.1109/PIMRC.2015.7343451
Lukai Xu, Guanding Yu, Yuhuan Jiang, Qimei Chen
This paper investigates joint bandwidth and power allocation for energy-efficient uplink communication in cellular networks. Instead of overall system energy efficiency (EE), we focus on maximizing the EE for each individual user while guaranteeing the quality-of-service. Therefore, a multi-objective optimization problem is formulated. To find its optimal solutions, we first utilize two different methods to convert the multi-objective optimization problem into single objective optimization problems. They are the scalarization method to maximize the weighted summation of users' EE and the max-min method to maximize the minimum EE among users. Then, we develop an effective algorithm based on the sum-of-ratios optimization to solve the scalarization problem, and an algorithm based on the generalized fractional programming to solve the max-min optimization. We also discuss a simple scenario with equivalent bandwidth allocation as a benchmark. Numerical results are provided to validate the effectiveness of the proposed algorithms.
{"title":"Multi-objective bandwidth and power allocation for energy-efficient uplink communications","authors":"Lukai Xu, Guanding Yu, Yuhuan Jiang, Qimei Chen","doi":"10.1109/PIMRC.2015.7343451","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343451","url":null,"abstract":"This paper investigates joint bandwidth and power allocation for energy-efficient uplink communication in cellular networks. Instead of overall system energy efficiency (EE), we focus on maximizing the EE for each individual user while guaranteeing the quality-of-service. Therefore, a multi-objective optimization problem is formulated. To find its optimal solutions, we first utilize two different methods to convert the multi-objective optimization problem into single objective optimization problems. They are the scalarization method to maximize the weighted summation of users' EE and the max-min method to maximize the minimum EE among users. Then, we develop an effective algorithm based on the sum-of-ratios optimization to solve the scalarization problem, and an algorithm based on the generalized fractional programming to solve the max-min optimization. We also discuss a simple scenario with equivalent bandwidth allocation as a benchmark. Numerical results are provided to validate the effectiveness of the proposed algorithms.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131345026","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-12-03DOI: 10.1109/PIMRC.2015.7343350
S. Narieda
This paper presents dual stage analog cancellation architectures of a linear and nonlinear self interference signal. The presented architecture has two cancelers which are placed at an RF and baseband stage on an analog domain. The replica signal for the analog baseband canceler is regenerated in a digital domain, and the signal outputs a DAC. The purpose of the presented architecture is to mitigate the effect of the AGC and ADC on the receiver performance. Numerical examples are provided to validate the effectiveness of the presented technique. From these results, it can be seen that 1) the performance of the presented can improve by increasing the bit resolution at the DAC, 2) the presented architecture can improve the bit resolution at the ADC.
{"title":"Dual stage analog cancellation of linear and nonlinear self interference for full duplex radio","authors":"S. Narieda","doi":"10.1109/PIMRC.2015.7343350","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343350","url":null,"abstract":"This paper presents dual stage analog cancellation architectures of a linear and nonlinear self interference signal. The presented architecture has two cancelers which are placed at an RF and baseband stage on an analog domain. The replica signal for the analog baseband canceler is regenerated in a digital domain, and the signal outputs a DAC. The purpose of the presented architecture is to mitigate the effect of the AGC and ADC on the receiver performance. Numerical examples are provided to validate the effectiveness of the presented technique. From these results, it can be seen that 1) the performance of the presented can improve by increasing the bit resolution at the DAC, 2) the presented architecture can improve the bit resolution at the ADC.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131970918","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}
One major concern of concurrent multipath transfer (CMT) in multi-homed Stream Control Transport Protocol (SCTP)-based heterogeneous wireless networks is that the utilization of different paths with diverse QoS-related networking parameters may cause packet reordering and buffer blocking. Although many efforts have been devoted to addressing the packet reordering issue, their sender-dependent-only scheduler does not consider balancing overhead and sharing load between the SCTP sender and receiver. This paper proposes a novel Receiver-driven Multipath Data Scheduling strategy for CMT (CMT-RMDS) necessitating the following aims: (1) alleviating the packet reordering problem, (2) improving the CMT performance, and (3) balancing overhead and sharing load between the sender and receiver. Simulation results show that the proposed CMT-RMDS solution outperforms the existing CMT solutions in terms of data delivery performance in heterogeneous wireless networks.
{"title":"Receiver-driven multipath data scheduling strategy for in-order arriving in SCTP-based heterogeneous wireless networks","authors":"Yuanlong Cao, Qinghua Liu, Guoliang Luo, Minghe Huang","doi":"10.1109/PIMRC.2015.7343597","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343597","url":null,"abstract":"One major concern of concurrent multipath transfer (CMT) in multi-homed Stream Control Transport Protocol (SCTP)-based heterogeneous wireless networks is that the utilization of different paths with diverse QoS-related networking parameters may cause packet reordering and buffer blocking. Although many efforts have been devoted to addressing the packet reordering issue, their sender-dependent-only scheduler does not consider balancing overhead and sharing load between the SCTP sender and receiver. This paper proposes a novel Receiver-driven Multipath Data Scheduling strategy for CMT (CMT-RMDS) necessitating the following aims: (1) alleviating the packet reordering problem, (2) improving the CMT performance, and (3) balancing overhead and sharing load between the sender and receiver. Simulation results show that the proposed CMT-RMDS solution outperforms the existing CMT solutions in terms of data delivery performance in heterogeneous wireless networks.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"341 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216200","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-12-03DOI: 10.1109/PIMRC.2015.7343591
Yue Zhao, Lei Xie, Hui-fang Chen, Kuang Wang
In this paper, the ergodic channel capacity is analyzed for a hybrid satellite-terrestrial single frequency network (SFN), which consists of a satellite (the source node), a mobile terminal (the destination node), and several gap fillers (the relay nodes) on the ground. The satellite-relay (S-R) link and the satellite-destination (S-D) link experience independent Rician fading, and the relay-destination (R-D) link experiences Nakagami-m fading. Based on the classical conclusions in multipath fading channels, the exact closed-form expression of the ergodic channel capacity for a hybrid satellite-terrestrial SFN with the decode-and-forward cooperative protocol is derived. The numerical results agree well with the simulation results. As the total transmit power of all nodes is assumed to be limited, the performance of hybrid satellite-terrestrial SFN is better than that of the no-relay system when the S-D link is in heavy-fading.
{"title":"Ergodic channel capacity analysis of the hybrid satellite-terrestrial single frequency network","authors":"Yue Zhao, Lei Xie, Hui-fang Chen, Kuang Wang","doi":"10.1109/PIMRC.2015.7343591","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343591","url":null,"abstract":"In this paper, the ergodic channel capacity is analyzed for a hybrid satellite-terrestrial single frequency network (SFN), which consists of a satellite (the source node), a mobile terminal (the destination node), and several gap fillers (the relay nodes) on the ground. The satellite-relay (S-R) link and the satellite-destination (S-D) link experience independent Rician fading, and the relay-destination (R-D) link experiences Nakagami-m fading. Based on the classical conclusions in multipath fading channels, the exact closed-form expression of the ergodic channel capacity for a hybrid satellite-terrestrial SFN with the decode-and-forward cooperative protocol is derived. The numerical results agree well with the simulation results. As the total transmit power of all nodes is assumed to be limited, the performance of hybrid satellite-terrestrial SFN is better than that of the no-relay system when the S-D link is in heavy-fading.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132381750","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-12-03DOI: 10.1109/PIMRC.2015.7343612
Yuan Li, Juan Zheng, Qiang Li
Licensed-Assisted Access (LAA) using Long Term Evolution (LTE) is a promising solution to alleviate the problem of scarce spectrum resources by extending to the unlicensed band. However, co-existence mechanisms should be carefully taken into consideration to provide fair co-existence to other LAA and 802.11 based Wi-Fi networks that operate on the same unlicensed carrier. In this paper, we focus on the design of listen-before-talk (LBT) for the LAA system and provide insights into the impact of LAA clear channel assessment (CCA) threshold on the trade-off between frequency reuse and interference avoidance. Moreover, an enhanced LBT scheme is proposed by adaptively adjusting the LAA CCA threshold to exploit the benefits of frequency reuse for LAA while guaranteeing the fair co-existence with Wi-Fi at the same time. System-level simulation is performed to analyze the CCA threshold among LAA networks and evaluate the effectiveness of the proposed LBT scheme compared to that with fixed CCA threshold. It is shown that significant performance gains can be achieved for LAA by using the proposed LBT scheme under efficient protection of Wi-Fi performance.
{"title":"Enhanced listen-before-talk scheme for frequency reuse of licensed-assisted access using LTE","authors":"Yuan Li, Juan Zheng, Qiang Li","doi":"10.1109/PIMRC.2015.7343612","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343612","url":null,"abstract":"Licensed-Assisted Access (LAA) using Long Term Evolution (LTE) is a promising solution to alleviate the problem of scarce spectrum resources by extending to the unlicensed band. However, co-existence mechanisms should be carefully taken into consideration to provide fair co-existence to other LAA and 802.11 based Wi-Fi networks that operate on the same unlicensed carrier. In this paper, we focus on the design of listen-before-talk (LBT) for the LAA system and provide insights into the impact of LAA clear channel assessment (CCA) threshold on the trade-off between frequency reuse and interference avoidance. Moreover, an enhanced LBT scheme is proposed by adaptively adjusting the LAA CCA threshold to exploit the benefits of frequency reuse for LAA while guaranteeing the fair co-existence with Wi-Fi at the same time. System-level simulation is performed to analyze the CCA threshold among LAA networks and evaluate the effectiveness of the proposed LBT scheme compared to that with fixed CCA threshold. It is shown that significant performance gains can be achieved for LAA by using the proposed LBT scheme under efficient protection of Wi-Fi performance.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402771","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-12-03DOI: 10.1109/PIMRC.2015.7343463
S. Rostami, K. Arshad, P. Rapajic
Carrier Aggregation (CA) is a key functionality for next generation wireless communication systems that enables operators to create larger virtual carrier bandwidths for data hungry applications by aggregating available Component Carriers (CCs). In this paper, the Resource Allocation (RA) optimisation problem in Orthogonal Frequency Division Multiplexing (OFDM) based wireless systems is studied with CA. We show that RA with CA can be formulated as a complex mixed integer programming optimisation problem under the practical constraints of transmit power and limited number of CCs available for each user. A two-step solution is proposed, Step 1: CC allocation is performed to satisfy users CA constraints and remove the intractable integer constraints of the optimisation problem, Step 2: power and SubCarrier (SC) allocation algorithm assigns resources among users sub-optimally. We propose two efficient methods based on our two-step solution with reasonably low complexity refer as Two-Step RA Algorithm (TSRAA) and Efficient RA Algorithm (ERAA). The performance of TSRAA and ERAA are compared with the highly complex Combinatorial Algorithm (COA) introduced as an optimal solution. Simulation results verify that TSRAA reaches to optimum solution and exploits the multi-CC diversity of wireless systems. Furthermore, numerical results show that ERAA achieves satisfying performance with very low complexity.
载波聚合(CA)是下一代无线通信系统的一项关键功能，它使运营商能够通过聚合可用的组件载波(cc)为数据饥渴型应用创建更大的虚拟载波带宽。本文研究了基于正交频分复用(OFDM)的无线系统中的资源分配(RA)优化问题。我们表明，在发射功率和每个用户可用的cc数量有限的实际约束下，具有CA的资源分配可以表述为复杂的混合整数规划优化问题。提出了一种分两步解决方案，第一步:CC分配以满足用户CA约束并消除优化问题中难以处理的整数约束，第二步:功率和子载波(SC)分配算法以次优方式在用户之间分配资源。在此基础上，我们提出了两种复杂度较低的高效RA算法，即两步RA算法(two-step RA Algorithm, TSRAA)和高效RA算法(efficient RA Algorithm, ERAA)。将TSRAA和ERAA的性能与作为最优解的高度复杂组合算法(COA)进行了比较。仿真结果验证了TSRAA达到了最优解，并充分利用了无线系统的多cc分集。此外，数值结果表明，ERAA以极低的复杂度获得了令人满意的性能。
{"title":"Resource allocation algorithms for OFDM based wireless systems","authors":"S. Rostami, K. Arshad, P. Rapajic","doi":"10.1109/PIMRC.2015.7343463","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343463","url":null,"abstract":"Carrier Aggregation (CA) is a key functionality for next generation wireless communication systems that enables operators to create larger virtual carrier bandwidths for data hungry applications by aggregating available Component Carriers (CCs). In this paper, the Resource Allocation (RA) optimisation problem in Orthogonal Frequency Division Multiplexing (OFDM) based wireless systems is studied with CA. We show that RA with CA can be formulated as a complex mixed integer programming optimisation problem under the practical constraints of transmit power and limited number of CCs available for each user. A two-step solution is proposed, Step 1: CC allocation is performed to satisfy users CA constraints and remove the intractable integer constraints of the optimisation problem, Step 2: power and SubCarrier (SC) allocation algorithm assigns resources among users sub-optimally. We propose two efficient methods based on our two-step solution with reasonably low complexity refer as Two-Step RA Algorithm (TSRAA) and Efficient RA Algorithm (ERAA). The performance of TSRAA and ERAA are compared with the highly complex Combinatorial Algorithm (COA) introduced as an optimal solution. Simulation results verify that TSRAA reaches to optimum solution and exploits the multi-CC diversity of wireless systems. Furthermore, numerical results show that ERAA achieves satisfying performance with very low complexity.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"43 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824193","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-12-03DOI: 10.1109/PIMRC.2015.7343370
Sanya Anees, M. Bhatnagar
The information theoretic study of decode-and-forward based mixed radio frequency-free space optical (RF-FSO) cooperative communication system is performed in this paper. The RF link is assumed to be Nakagami-m distributed and the FSO link is modeled by the Gamma-Gamma distributed turbulence, pointing error, and path loss. Novel closed-form analytical expressions of the average channel capacity are derived for the considered asymmetric system under various adaptive transmission policies, i.e., optimal rate adaptation (ORA), simultaneous optimal power and rate adaptation (OPRA), and truncated channel inversion with fixed rate (TCIFR) in terms of Meijer G-function and Extended Bivariate Generalized Meijer-G function. Simulation results validate the proposed analysis. The effect of atmospheric conditions and pointing errors is analyzed by using the average channel capacity expressions. It is observed that the capacity under OPRA scheme outperforms capacity under other schemes.
{"title":"Information theoretic analysis of DF based dual-hop mixed RF-FSO communication systems","authors":"Sanya Anees, M. Bhatnagar","doi":"10.1109/PIMRC.2015.7343370","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343370","url":null,"abstract":"The information theoretic study of decode-and-forward based mixed radio frequency-free space optical (RF-FSO) cooperative communication system is performed in this paper. The RF link is assumed to be Nakagami-m distributed and the FSO link is modeled by the Gamma-Gamma distributed turbulence, pointing error, and path loss. Novel closed-form analytical expressions of the average channel capacity are derived for the considered asymmetric system under various adaptive transmission policies, i.e., optimal rate adaptation (ORA), simultaneous optimal power and rate adaptation (OPRA), and truncated channel inversion with fixed rate (TCIFR) in terms of Meijer G-function and Extended Bivariate Generalized Meijer-G function. Simulation results validate the proposed analysis. The effect of atmospheric conditions and pointing errors is analyzed by using the average channel capacity expressions. It is observed that the capacity under OPRA scheme outperforms capacity under other schemes.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060321","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-12-03DOI: 10.1109/PIMRC.2015.7343556
X. Ni, Deyu Yuan, Yinglei Teng, Mei Song
The renewable energy is expected as one of the promising option to reduce the CO2 emissions for the future wireless communication. This paper considers the power allocation of a multi-cell network where the base station powered by hybrid energy source, i.e., the energy is supplied by a constant energy source and an energy harvester. Due to the features of the renewable energy and multi-cell network, we need to develop an efficient power allocation scheme to utilize the renewable and constant energy efficiently. In order to make full use of hybrid energy, we formulate the power allocation to minimize the energy drawn from the constant source and to maximize the amount of transmitted data per energy consumption, which is shown to be a non-convex optimization problem. It is transformed into an equivalent convex optimization problem by exploiting the properties of fractional programming. Finally an optimal offline iterative algorithm is proposed to solve this problem. Simulation results show that the proposed algorithm can make full use of the harvested renewable energy and all the energy can be utilized in a more efficient mode, which can help to provide some valuable insights for more practical efficient online schemes.
{"title":"Energy efficient power allocation scheme for multi-cell with hybrid energy sources","authors":"X. Ni, Deyu Yuan, Yinglei Teng, Mei Song","doi":"10.1109/PIMRC.2015.7343556","DOIUrl":"https://doi.org/10.1109/PIMRC.2015.7343556","url":null,"abstract":"The renewable energy is expected as one of the promising option to reduce the CO2 emissions for the future wireless communication. This paper considers the power allocation of a multi-cell network where the base station powered by hybrid energy source, i.e., the energy is supplied by a constant energy source and an energy harvester. Due to the features of the renewable energy and multi-cell network, we need to develop an efficient power allocation scheme to utilize the renewable and constant energy efficiently. In order to make full use of hybrid energy, we formulate the power allocation to minimize the energy drawn from the constant source and to maximize the amount of transmitted data per energy consumption, which is shown to be a non-convex optimization problem. It is transformed into an equivalent convex optimization problem by exploiting the properties of fractional programming. Finally an optimal offline iterative algorithm is proposed to solve this problem. Simulation results show that the proposed algorithm can make full use of the harvested renewable energy and all the energy can be utilized in a more efficient mode, which can help to provide some valuable insights for more practical efficient online schemes.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133398310","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
扫码关注我们
求助内容：
应助结果提醒方式：