Pub Date : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063561
Jean-Baptiste Doré, V. Berg, D. Kténas
Relaxed synchronization and access to fragmented spectrum are considered essential for future generations of wireless networks in order to reduce physical channel signaling. Frequency Division Multiple Access for Filter Bank Multicarrier (FBMC) modulation provides promising performance without strict synchronization requirements contrary to conventional Orthogonal Frequency Division Multiplexing (OFDM). In this paper, the architecture of a FBMC receiver suitable for this scenario is considered and its performance is compared against OFDM. The maximum achievable capacity of an asynchronous uplink transmission is analyzed when limited amount of feedback information on timing misalignment and power control is available. The proposed receiver architecture based on frequency domain processing combined with the fair frequency localization of the FBMC prototype filter provides an architecture that allows for more efficient multiuser asynchronous reception compared to OFDM.
{"title":"Performance of FBMC Multiple Access for relaxed synchronization cellular networks","authors":"Jean-Baptiste Doré, V. Berg, D. Kténas","doi":"10.1109/GLOCOMW.2014.7063561","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063561","url":null,"abstract":"Relaxed synchronization and access to fragmented spectrum are considered essential for future generations of wireless networks in order to reduce physical channel signaling. Frequency Division Multiple Access for Filter Bank Multicarrier (FBMC) modulation provides promising performance without strict synchronization requirements contrary to conventional Orthogonal Frequency Division Multiplexing (OFDM). In this paper, the architecture of a FBMC receiver suitable for this scenario is considered and its performance is compared against OFDM. The maximum achievable capacity of an asynchronous uplink transmission is analyzed when limited amount of feedback information on timing misalignment and power control is available. The proposed receiver architecture based on frequency domain processing combined with the fair frequency localization of the FBMC prototype filter provides an architecture that allows for more efficient multiuser asynchronous reception compared to OFDM.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117195739","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063528
Shengchu Wang, Yunzhou Li, Jing Wang, Ming Zhao
In this paper, we research the multiuser detection (MUD) in a new massive Spatial Modulation Multiple Input Multiple Output (SM-MIMO) system, where the Base Station (BS) is equipped with massive antennas, and every User Equipment (UE) has multiple Transmit Antennas (TAs) but only one Radio-Frequency (RF) chain. In the uplink, UEs transmit data to the BS over frequency selective channels by the Cyclic-Prefix Single-Carrier (CP-SC) SM. We construct a new Generalized Approximate Message Passing Detector (GAMPD), and analyzes its mean square error performance theoretically by the State Evolution (SE) tool. By exploiting both the prior probability distribution and sparsity of the transmitted signal, GAMPD shows superior detection performances and works well even when the number of TAs at the UEs is larger than the number of BS antennas. GAMPD calls for parallelized matrix-vector multiplication as the most complex operation, so it has low computational complexity and is suitable for hardware implementation. Simulation results show that GAMPD outperforms the linear detectors significantly, and is analyzed by SE successfully. In addition, compared to the classical massive MIMO, massive SM-MIMO shows better detection performance and higher spectral efficiency.
{"title":"Low-complexity multiuser detection in massive spatial modulation MIMO","authors":"Shengchu Wang, Yunzhou Li, Jing Wang, Ming Zhao","doi":"10.1109/GLOCOMW.2014.7063528","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063528","url":null,"abstract":"In this paper, we research the multiuser detection (MUD) in a new massive Spatial Modulation Multiple Input Multiple Output (SM-MIMO) system, where the Base Station (BS) is equipped with massive antennas, and every User Equipment (UE) has multiple Transmit Antennas (TAs) but only one Radio-Frequency (RF) chain. In the uplink, UEs transmit data to the BS over frequency selective channels by the Cyclic-Prefix Single-Carrier (CP-SC) SM. We construct a new Generalized Approximate Message Passing Detector (GAMPD), and analyzes its mean square error performance theoretically by the State Evolution (SE) tool. By exploiting both the prior probability distribution and sparsity of the transmitted signal, GAMPD shows superior detection performances and works well even when the number of TAs at the UEs is larger than the number of BS antennas. GAMPD calls for parallelized matrix-vector multiplication as the most complex operation, so it has low computational complexity and is suitable for hardware implementation. Simulation results show that GAMPD outperforms the linear detectors significantly, and is analyzed by SE successfully. In addition, compared to the classical massive MIMO, massive SM-MIMO shows better detection performance and higher spectral efficiency.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115033166","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063603
Andra M. Voicu, L. Simić, M. Petrova
Due to the significant increase in mobile data traffic volume during the last few years, offloading techniques have been considered for alleviating the traffic load from cellular networks. Two principal small cell offloading solutions are LTE femtocells and Wi-Fi. Femtocells are low power user-deployed LTE base stations that overlay the macro-cellular network and share its licensed spectrum, whereas Wi-Fi devices operate in unlicensed bands using the distributed CSMA/CA MAC protocol to coordinate neighbouring transmissions. Given the fundamentally different spectrum use regulations, MAC, and PHY layer capabilities of these two technologies, the resulting interference environments of the respective small cell networks are significantly different. It is thus not trivially obvious which offloading solution realistically provides a better and future-proof capacity extension for service providers. In this paper we present a thorough system-level comparative study of IEEE 802.1 In Wi-Fi against LTE femtocell performance for a range of representative network densities and deployment scenarios, considering realistic propagation effects, multiple interference sources, and several resource allocation schemes. Our results show that in low density suburban and rural scenarios the high spectral efficiency of LTE femtocells yields a higher throughput than Wi-Fi, but that the CSMA/CA MAC protocol enables Wi-Fi to outperform LTE femtocells in dense urban scenarios, where the need for extra capacity is most urgent. We show that future high density heterogeneous networks may be best served by a new hybrid small cell offloading solution, combining the superior PHY of LTE and the distributed co-tier interference coordination afforded by the MAC of Wi-Fi.
由于移动数据流量在过去几年中显著增加，卸载技术已被考虑用于减轻来自蜂窝网络的流量负载。两个主要的小型基站卸载解决方案是LTE飞蜂窝和Wi-Fi。Femtocells是低功耗用户部署的LTE基站，覆盖宏蜂窝网络并共享其许可频谱，而Wi-Fi设备使用分布式CSMA/CA MAC协议在未经许可的频段上运行，以协调相邻的传输。考虑到这两种技术的频谱使用规则、MAC和物理层功能的根本不同，由此产生的各自小蜂窝网络的干扰环境也有很大不同。因此，卸载解决方案实际上为服务提供商提供了更好的、面向未来的容量扩展，这一点并不明显。在本文中，我们对IEEE 802.1 In Wi-Fi和LTE femtocell性能在一系列代表性网络密度和部署场景下进行了全面的系统级比较研究，考虑了现实的传播效应、多个干扰源和几种资源分配方案。我们的研究结果表明，在低密度的郊区和农村场景中，LTE飞蜂窝的高频谱效率产生比Wi-Fi更高的吞吐量，但CSMA/CA MAC协议使Wi-Fi在对额外容量需求最为迫切的密集城市场景中优于LTE飞蜂窝。我们表明，结合LTE的优越PHY和Wi-Fi的MAC提供的分布式协层干扰协调，一种新的混合小蜂窝卸载解决方案可以最好地服务于未来的高密度异构网络。
{"title":"Boosting capacity through small cell data offloading: A comparative performance study of LTE femtocells and Wi-Fi","authors":"Andra M. Voicu, L. Simić, M. Petrova","doi":"10.1109/GLOCOMW.2014.7063603","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063603","url":null,"abstract":"Due to the significant increase in mobile data traffic volume during the last few years, offloading techniques have been considered for alleviating the traffic load from cellular networks. Two principal small cell offloading solutions are LTE femtocells and Wi-Fi. Femtocells are low power user-deployed LTE base stations that overlay the macro-cellular network and share its licensed spectrum, whereas Wi-Fi devices operate in unlicensed bands using the distributed CSMA/CA MAC protocol to coordinate neighbouring transmissions. Given the fundamentally different spectrum use regulations, MAC, and PHY layer capabilities of these two technologies, the resulting interference environments of the respective small cell networks are significantly different. It is thus not trivially obvious which offloading solution realistically provides a better and future-proof capacity extension for service providers. In this paper we present a thorough system-level comparative study of IEEE 802.1 In Wi-Fi against LTE femtocell performance for a range of representative network densities and deployment scenarios, considering realistic propagation effects, multiple interference sources, and several resource allocation schemes. Our results show that in low density suburban and rural scenarios the high spectral efficiency of LTE femtocells yields a higher throughput than Wi-Fi, but that the CSMA/CA MAC protocol enables Wi-Fi to outperform LTE femtocells in dense urban scenarios, where the need for extra capacity is most urgent. We show that future high density heterogeneous networks may be best served by a new hybrid small cell offloading solution, combining the superior PHY of LTE and the distributed co-tier interference coordination afforded by the MAC of Wi-Fi.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123690414","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063599
Chun-Hung Liu
Coordinated multi-point (CoMP) transmission is an effective means of improving network throughput in heterogeneous cellular networks (HetNets). However, its performance is seriously weakened if imperfect coordination happens between base stations (BSs). Many prior CoMP works do not consider inter-cell overhead message delays such that a seemingly astonishing CoMP throughput gain is attained. In this paper, the quantization error and delay that actually exist in overhead messages was modeled and we developed a much tractable SIR model based on the stochastic geometry framework. We proposed adaptive CoMP that is applied to downlink zero-forcing beamforming (ZFBF) and it can mitigate the interference from the coordinated cells with delayed overhead messages. The bounds on the complementary cumulative distribution function (CCDF) of the SIR of a user are characterized such that the average throughput of a user is able to be analytically evaluated. Numerical results show that the proposed adaptive CoMP scheme can make the throughput gain very robust to the overhead delay and thus significantly increase the throughput even when BSs are not perfectly coordinated.
{"title":"Adaptive downlink CoMP in heterogeneous cellular networks with imperfect overhead messaging","authors":"Chun-Hung Liu","doi":"10.1109/GLOCOMW.2014.7063599","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063599","url":null,"abstract":"Coordinated multi-point (CoMP) transmission is an effective means of improving network throughput in heterogeneous cellular networks (HetNets). However, its performance is seriously weakened if imperfect coordination happens between base stations (BSs). Many prior CoMP works do not consider inter-cell overhead message delays such that a seemingly astonishing CoMP throughput gain is attained. In this paper, the quantization error and delay that actually exist in overhead messages was modeled and we developed a much tractable SIR model based on the stochastic geometry framework. We proposed adaptive CoMP that is applied to downlink zero-forcing beamforming (ZFBF) and it can mitigate the interference from the coordinated cells with delayed overhead messages. The bounds on the complementary cumulative distribution function (CCDF) of the SIR of a user are characterized such that the average throughput of a user is able to be analytically evaluated. Numerical results show that the proposed adaptive CoMP scheme can make the throughput gain very robust to the overhead delay and thus significantly increase the throughput even when BSs are not perfectly coordinated.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125356488","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063587
Xavier Pons Masbernat, A. Mesodiakaki, C. Gruet, L. Naviner, F. Adelantado, L. Alonso, C. Verikoukis
As wireless communications evolve towards heterogeneous networks, mobile terminals have been enabled to handover seamlessly from one network to another. At the same time, the continuous increase in the terminal power consumption has resulted in an ever-decreasing battery lifetime. To that end, the network selection is expected to play a key role on how to minimize the energy consumption, and thus to extend the terminal lifetime. Hitherto, terminals select the network that provides the highest received power. However, it has been proved that this solution does not provide the highest energy efficiency. Thus, this paper proposes an energy efficient vertical handover algorithm that selects the most energy efficient network that minimizes the uplink power consumption. The performance of the proposed algorithm is evaluated through extensive simulations and it is shown to achieve high energy efficiency gains compared to the conventional approach.
{"title":"An energy efficient vertical handover decision algorithm","authors":"Xavier Pons Masbernat, A. Mesodiakaki, C. Gruet, L. Naviner, F. Adelantado, L. Alonso, C. Verikoukis","doi":"10.1109/GLOCOMW.2014.7063587","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063587","url":null,"abstract":"As wireless communications evolve towards heterogeneous networks, mobile terminals have been enabled to handover seamlessly from one network to another. At the same time, the continuous increase in the terminal power consumption has resulted in an ever-decreasing battery lifetime. To that end, the network selection is expected to play a key role on how to minimize the energy consumption, and thus to extend the terminal lifetime. Hitherto, terminals select the network that provides the highest received power. However, it has been proved that this solution does not provide the highest energy efficiency. Thus, this paper proposes an energy efficient vertical handover algorithm that selects the most energy efficient network that minimizes the uplink power consumption. The performance of the proposed algorithm is evaluated through extensive simulations and it is shown to achieve high energy efficiency gains compared to the conventional approach.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"26 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120846011","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063595
D. Ciochina, M. Pesavento
We propose a computationally efficient approach to the problem of admission control and beamforming in a cognitive radio network scenario in which a secondary base station selects the largest set of users to be optimally served with required quality of service while minimizing the transmit power and respecting the interference thresholds imposed by a dense incumbent primary system. To reduce the complexity of the combinatorial user selection problem we propose an initial user clustering scheme in which the similarity between the long term spatial signatures of the users is assessed. Based on these clusters, the users to be simultaneously served, along with their optimal transmit powers and beamforming vectors, are selected according to their instantaneous spatial signatures using an iterative uplink-downlink algorithm. Numerical results show a significant reduction in complexity of our approach compared to previous techniques.
{"title":"A clustering approach for admission control and optimal beamforming in cognitive radio networks","authors":"D. Ciochina, M. Pesavento","doi":"10.1109/GLOCOMW.2014.7063595","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063595","url":null,"abstract":"We propose a computationally efficient approach to the problem of admission control and beamforming in a cognitive radio network scenario in which a secondary base station selects the largest set of users to be optimally served with required quality of service while minimizing the transmit power and respecting the interference thresholds imposed by a dense incumbent primary system. To reduce the complexity of the combinatorial user selection problem we propose an initial user clustering scheme in which the similarity between the long term spatial signatures of the users is assessed. Based on these clusters, the users to be simultaneously served, along with their optimal transmit powers and beamforming vectors, are selected according to their instantaneous spatial signatures using an iterative uplink-downlink algorithm. Numerical results show a significant reduction in complexity of our approach compared to previous techniques.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128805692","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063538
Zhihui Liu, Wenjun Xu, Shengyu Li, Xiao-han Lu, Jiaru Lin
It has become a research hotspot that the secondary user (SU) utilizes the frequency bands from primary users (PUs) while assisting PUs with data transmission in cognitive radio networks (CRNs). In this paper, a new cooperation paradigm is studied in cognitive multicast networks, in which one SU assists the data communication of two PUs simultaneously to harvest multiple spectrum access opportunities. Meanwhile, network coding is also employed to compress two PUs' transmission data and improve the resource utilization. Specially, the design of the network coding-based cooperation transmission is formulated as a joint power and spectrum allocation problem. The problem aims at maximizing SU's achievable transmission rate and guaranteeing the minimum transmission rate requirements of both PUs. To solve the problem efficiently, a finely-matched algorithm is proposed by exploiting the Karush-Kuhn-Tucker (KKT) conditions. Simulation results show the proposed network-coding-based primary-secondary cooperation can improve significantly the secondary transmission rate.
{"title":"Power and spectrum allocation for network coded primary-secondary cooperation in cognitive radio networks","authors":"Zhihui Liu, Wenjun Xu, Shengyu Li, Xiao-han Lu, Jiaru Lin","doi":"10.1109/GLOCOMW.2014.7063538","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063538","url":null,"abstract":"It has become a research hotspot that the secondary user (SU) utilizes the frequency bands from primary users (PUs) while assisting PUs with data transmission in cognitive radio networks (CRNs). In this paper, a new cooperation paradigm is studied in cognitive multicast networks, in which one SU assists the data communication of two PUs simultaneously to harvest multiple spectrum access opportunities. Meanwhile, network coding is also employed to compress two PUs' transmission data and improve the resource utilization. Specially, the design of the network coding-based cooperation transmission is formulated as a joint power and spectrum allocation problem. The problem aims at maximizing SU's achievable transmission rate and guaranteeing the minimum transmission rate requirements of both PUs. To solve the problem efficiently, a finely-matched algorithm is proposed by exploiting the Karush-Kuhn-Tucker (KKT) conditions. Simulation results show the proposed network-coding-based primary-secondary cooperation can improve significantly the secondary transmission rate.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129459472","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063544
A. Perotti, B. Popović
We propose a new overloaded multiple access scheme based on Turbo Trellis Coded Modulations (TTCM) which, thanks to the high gain provided by turbo coded schemes, exhibits improved performance with respect to other solutions based on Trellis Coded Modulation (TCM). Turbo Trellis Coded Multiple Access (TTCMA) performs simultaneous transmission of multiple turbo-encoded and modulated data streams intended for users experiencing similar Signal-to-Noise Ratios (SNR). Stream-specific permutations are employed in turbo code interleavers to enable stream identification and separation at the receiver. An efficient solution for the generation of sets of such permutations is also provided. TTCMA overcomes known limitations of previous TCM-based schemes, achieving a high aggregate spectral efficiency even at low SNR by exploiting the large coding gains provided by parallel concatenated schemes when the size of the transmitted information words is large.
{"title":"Turbo Trellis Coded multiple access","authors":"A. Perotti, B. Popović","doi":"10.1109/GLOCOMW.2014.7063544","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063544","url":null,"abstract":"We propose a new overloaded multiple access scheme based on Turbo Trellis Coded Modulations (TTCM) which, thanks to the high gain provided by turbo coded schemes, exhibits improved performance with respect to other solutions based on Trellis Coded Modulation (TCM). Turbo Trellis Coded Multiple Access (TTCMA) performs simultaneous transmission of multiple turbo-encoded and modulated data streams intended for users experiencing similar Signal-to-Noise Ratios (SNR). Stream-specific permutations are employed in turbo code interleavers to enable stream identification and separation at the receiver. An efficient solution for the generation of sets of such permutations is also provided. TTCMA overcomes known limitations of previous TCM-based schemes, achieving a high aggregate spectral efficiency even at low SNR by exploiting the large coding gains provided by parallel concatenated schemes when the size of the transmitted information words is large.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130853018","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063640
P. Charlesworth
Swarms of communications-equipped UAVs offer a new approach to the provision of temporary wide-area communications for mobile radio systems. It is clear that coverage depends on the location of the UAVs in relation to the mobiles. Dynamically planning the location of UAVs in response to the movement of the mobiles can optimize the coverage of the network. This paper introduces the use of non-cooperative games as a technique for optimizing the location of UAVs. The game-theoretic approach requires that each UAV attempts to maximize its support of the mobiles, mindful of the activities of the other UAVs. This is analogous to several companies competing for their share in a limited market. The use of game theory recasts an optimization problem as a decision problem. The method described in this paper allows the UAVs to independently reach identical decisions about their future locations without the need for a central planning agent. Exemplar results are presented for a network of three UAVs. These are used to illustrate the behaviours that the UAVs exhibit during a game.
{"title":"Using non-cooperative games to coordinate communications UAVs","authors":"P. Charlesworth","doi":"10.1109/GLOCOMW.2014.7063640","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063640","url":null,"abstract":"Swarms of communications-equipped UAVs offer a new approach to the provision of temporary wide-area communications for mobile radio systems. It is clear that coverage depends on the location of the UAVs in relation to the mobiles. Dynamically planning the location of UAVs in response to the movement of the mobiles can optimize the coverage of the network. This paper introduces the use of non-cooperative games as a technique for optimizing the location of UAVs. The game-theoretic approach requires that each UAV attempts to maximize its support of the mobiles, mindful of the activities of the other UAVs. This is analogous to several companies competing for their share in a limited market. The use of game theory recasts an optimization problem as a decision problem. The method described in this paper allows the UAVs to independently reach identical decisions about their future locations without the need for a central planning agent. Exemplar results are presented for a network of three UAVs. These are used to illustrate the behaviours that the UAVs exhibit during a game.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131202042","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063513
Xueying Song, Xiaohu Ge, Jing Zhang, T. Han
The IMT-A geometry-based stochastic modeling (GBSM) channel model provides an accuracy and flexibility method for wireless channels evaluations in the telecommunication standards. However, it is a problem for practical engineering application considering the high calculation complexity of IMT-A GBSM channel models. To satisfy requirements from practical engineering applications, we proposed an improved IMT-A GBSM channel model for Urban micro-cellular scenarios. The improved IMT-A GBSM channel model is traded off by the calculation complexity and accuracy. Performance analysis results indicate that the calculation complexity of improved IMT-A GBSM channel model has been obviously reduced and correlation metrics of the improved IMT-A GBSM channel model still kept consistency with the traditional IMT-A GBSM channel model. Therefore, the improved IMT-A GBSM can be used for practical telecommunication engineering applications in UMi scenarios.
{"title":"An improved IMT-A GBSM MIMO channel model","authors":"Xueying Song, Xiaohu Ge, Jing Zhang, T. Han","doi":"10.1109/GLOCOMW.2014.7063513","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063513","url":null,"abstract":"The IMT-A geometry-based stochastic modeling (GBSM) channel model provides an accuracy and flexibility method for wireless channels evaluations in the telecommunication standards. However, it is a problem for practical engineering application considering the high calculation complexity of IMT-A GBSM channel models. To satisfy requirements from practical engineering applications, we proposed an improved IMT-A GBSM channel model for Urban micro-cellular scenarios. The improved IMT-A GBSM channel model is traded off by the calculation complexity and accuracy. Performance analysis results indicate that the calculation complexity of improved IMT-A GBSM channel model has been obviously reduced and correlation metrics of the improved IMT-A GBSM channel model still kept consistency with the traditional IMT-A GBSM channel model. Therefore, the improved IMT-A GBSM can be used for practical telecommunication engineering applications in UMi scenarios.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128788561","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
扫码关注我们
求助内容：
应助结果提醒方式：