Pub Date : 2017-10-01DOI: 10.1109/PIMRC.2017.8292427
Huiyang Wang, E. Dutkiewicz, Diep N. Nguyen, M. Mueck
Motivated by recent efforts in enabling economic models for spectrum sharing systems, in particular, for the Spectrum Access System in the US, we propose a game theoretic analysis of sublicensing between two types of access methods in such system — PAL and GAA. The aim of this paper is to illustrate how the operators' strategies affect their own payoffs and the overall utility in the Sublicenseing Game in a spectrum sharing system. We consider the problem of spectrum sharing among multiple operators who have to pay for a temporary PAL sublicense with the exclusive right to the PAL band or stay in the GAA band and share the spectrum for free with other GAA users. We first formulate this scenario as a noncooperative game, and then study the existence of a Nash equilibrium. Finally, to reduce the overall utility loss we let the spectrum sharing platform to coordinate individual operators by forming pair coalitions for them. According to our findings, when an operator has a large number of subscribers GAA band is the best response and a high PAL sublicense price holds back operators to access the PAL band. Additionally, making equal coalitions among operators can avoid overall utility loss.
{"title":"Game theoretic analysis of sublicensing for PAL and GAA bands in spectrum access system","authors":"Huiyang Wang, E. Dutkiewicz, Diep N. Nguyen, M. Mueck","doi":"10.1109/PIMRC.2017.8292427","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292427","url":null,"abstract":"Motivated by recent efforts in enabling economic models for spectrum sharing systems, in particular, for the Spectrum Access System in the US, we propose a game theoretic analysis of sublicensing between two types of access methods in such system — PAL and GAA. The aim of this paper is to illustrate how the operators' strategies affect their own payoffs and the overall utility in the Sublicenseing Game in a spectrum sharing system. We consider the problem of spectrum sharing among multiple operators who have to pay for a temporary PAL sublicense with the exclusive right to the PAL band or stay in the GAA band and share the spectrum for free with other GAA users. We first formulate this scenario as a noncooperative game, and then study the existence of a Nash equilibrium. Finally, to reduce the overall utility loss we let the spectrum sharing platform to coordinate individual operators by forming pair coalitions for them. According to our findings, when an operator has a large number of subscribers GAA band is the best response and a high PAL sublicense price holds back operators to access the PAL band. Additionally, making equal coalitions among operators can avoid overall utility loss.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129484222","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292250
Xingwang Mao, Biling Zhang, Yuyang Chen, Jung-Lang Yu, Zhu Han
Device-to-Device (D2D) communication is a promising technology component towards the fifth generation mobile communication. However, when D2D communication is incorporated into heterogeneous cloud radio access network (H-CRAN), the interference management between the D2D users and current users is a challenge. In this paper, we study how to assign the sub-channels of different bandwidth to multiple D2D pairs and the RRH users (RUEs). In such a case, the sub-channel that has been pre-allocated to a macrocell user (MUE) can be reused, the system performance that accounts for both the overall throughput and the number of admitted users can be maximized and all the users quality of service (QoS) can be guaranteed. Such a resource allocation problem is formulated as a mixed integer nonlinear programming (MINLP) problem which is NP-hard. To obtain the optimal solution, the proposed problem is transformed into a many-to-one matching game with externalizes, and a constrained-DA algorithm is proposed. We prove theoretically that with the constrained-DA algorithm, the matching game can reach the stable matching with a low computational complexity. Numerical results demonstrate that our proposed scheme can significantly improve the system performance in terms of overall throughput and the total number of admitted users compared with existing resource allocation schemes.
设备到设备(D2D)通信是第五代移动通信中一个很有前途的技术组成部分。然而，当D2D通信被纳入异构云无线接入网(H-CRAN)时，D2D用户与现有用户之间的干扰管理是一个挑战。本文研究了如何将不同带宽的子信道分配给多个D2D对和RRH用户。在这种情况下，预先分配给MUE (macrocell user)用户的子信道可以被重用，可以最大限度地提高系统性能，同时兼顾整体吞吐量和允许的用户数，并保证所有用户的QoS (quality of service)。将资源分配问题表述为np困难的混合整数非线性规划问题。为了获得最优解，将该问题转化为具有外部性的多对一匹配博弈，并提出了一种约束数据挖掘算法。从理论上证明了约束数据挖掘算法可以在较低的计算复杂度下达到稳定的匹配。数值结果表明，与现有的资源分配方案相比，我们提出的方案在总体吞吐量和允许用户总数方面都能显著提高系统性能。
{"title":"Matching game based resource allocation for 5G H-CRAN networks with device-to-device communication","authors":"Xingwang Mao, Biling Zhang, Yuyang Chen, Jung-Lang Yu, Zhu Han","doi":"10.1109/PIMRC.2017.8292250","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292250","url":null,"abstract":"Device-to-Device (D2D) communication is a promising technology component towards the fifth generation mobile communication. However, when D2D communication is incorporated into heterogeneous cloud radio access network (H-CRAN), the interference management between the D2D users and current users is a challenge. In this paper, we study how to assign the sub-channels of different bandwidth to multiple D2D pairs and the RRH users (RUEs). In such a case, the sub-channel that has been pre-allocated to a macrocell user (MUE) can be reused, the system performance that accounts for both the overall throughput and the number of admitted users can be maximized and all the users quality of service (QoS) can be guaranteed. Such a resource allocation problem is formulated as a mixed integer nonlinear programming (MINLP) problem which is NP-hard. To obtain the optimal solution, the proposed problem is transformed into a many-to-one matching game with externalizes, and a constrained-DA algorithm is proposed. We prove theoretically that with the constrained-DA algorithm, the matching game can reach the stable matching with a low computational complexity. Numerical results demonstrate that our proposed scheme can significantly improve the system performance in terms of overall throughput and the total number of admitted users compared with existing resource allocation schemes.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129685189","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292623
Jihen Bennaceur, Sami Souihi, H. Idoudi, L. Saïdane, A. Mellouk
Spectrum sensing security in cooperative cognitive radio networks with continuously mobile secondary users becomes a critical challenge. Thus, we propose a trust game-based model to ensure the spectrum detection while the mobility of the SUs is taken into account. Our proposal ensures both the attacks detection and the punishment of mobile malicious users launching the Spectrum Sensing Data Falsification (SSDF) attacks. Extensive simulations prove that the proposed model outperforms the AND-rule, OR-rule and Game-Based Secure Sensing (GSS) models in terms of correct decision probability, throughput and error probability with the random and linear mobility models and under four types of SSDF attacks.
{"title":"Game-based secure sensing for the mobile cognitive radio network","authors":"Jihen Bennaceur, Sami Souihi, H. Idoudi, L. Saïdane, A. Mellouk","doi":"10.1109/PIMRC.2017.8292623","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292623","url":null,"abstract":"Spectrum sensing security in cooperative cognitive radio networks with continuously mobile secondary users becomes a critical challenge. Thus, we propose a trust game-based model to ensure the spectrum detection while the mobility of the SUs is taken into account. Our proposal ensures both the attacks detection and the punishment of mobile malicious users launching the Spectrum Sensing Data Falsification (SSDF) attacks. Extensive simulations prove that the proposed model outperforms the AND-rule, OR-rule and Game-Based Secure Sensing (GSS) models in terms of correct decision probability, throughput and error probability with the random and linear mobility models and under four types of SSDF attacks.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126993839","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292563
Daoud Burghal, A. Tehrani, A. Molisch
Neighbor discovery is an essential prerequisite for any device-to-device (D2D) communication. Unlike ad-hoc networks, the base station (BS) in D2D networks may facilitate the neighbor discovery process. However, device-to-BS channel states or device locations are not enough to provide BS with information on the channel quality between the devices. Thus, due to the inherent uncertainty of link quality between devices, the BS-assisted neighbor discovery cannot be treated as typical scheduling problem. In this paper, we investigate the assisted directional neighbor discovery in D2D networks. We first formulate the scheduling problem as an integer optimization problem that captures the uncertainty. Then we propose a greedy based centralized scheduling to determine directional pilot transmission instances. We also propose a one-way randomized discovery, where we choose the directional transmission probabilities based on two techniques, an intuitive and an optimized methods. Finally, we provide simulation results that assess the performance the schemes.
{"title":"Base station assisted neighbor discovery in device to device systems","authors":"Daoud Burghal, A. Tehrani, A. Molisch","doi":"10.1109/PIMRC.2017.8292563","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292563","url":null,"abstract":"Neighbor discovery is an essential prerequisite for any device-to-device (D2D) communication. Unlike ad-hoc networks, the base station (BS) in D2D networks may facilitate the neighbor discovery process. However, device-to-BS channel states or device locations are not enough to provide BS with information on the channel quality between the devices. Thus, due to the inherent uncertainty of link quality between devices, the BS-assisted neighbor discovery cannot be treated as typical scheduling problem. In this paper, we investigate the assisted directional neighbor discovery in D2D networks. We first formulate the scheduling problem as an integer optimization problem that captures the uncertainty. Then we propose a greedy based centralized scheduling to determine directional pilot transmission instances. We also propose a one-way randomized discovery, where we choose the directional transmission probabilities based on two techniques, an intuitive and an optimized methods. Finally, we provide simulation results that assess the performance the schemes.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"163 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129283233","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292383
S. Lembo, Junquan Deng, Ragnar Freij, O. Tirkkonen, Tao Chen
We consider a user-centric network-level coordination architecture for 5G heterogeneous Radio Access Networks (RANs), based on RAN softwarization and a centralized coordination framework. We describe the RAN as a set of logical RAN entities, related to cells in a Heterogeneous Network (HetNet), under the control of a central coordination entity. This description allows the creation of Network Functions (NFs) with an abstracted view of the network. We describe a centralized coordination framework, and then develop a NF for InterCell Interference Coordination (ICIC) in a 5G HetNet, optimizing the radio resource usage at network-level. We construct a Network Graph to abstract the problem of resource allocation and cell offloading, with the NF seeking for an optimal solution based on this abstraction. Simulations are performed in a HetNet scenario with a Tabu Search algorithm. Results show the feasibility of performing network-level coordination through a modular NF, with an abstracted view of the network.
{"title":"Hierarchical network abstraction for HetNet coordination","authors":"S. Lembo, Junquan Deng, Ragnar Freij, O. Tirkkonen, Tao Chen","doi":"10.1109/PIMRC.2017.8292383","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292383","url":null,"abstract":"We consider a user-centric network-level coordination architecture for 5G heterogeneous Radio Access Networks (RANs), based on RAN softwarization and a centralized coordination framework. We describe the RAN as a set of logical RAN entities, related to cells in a Heterogeneous Network (HetNet), under the control of a central coordination entity. This description allows the creation of Network Functions (NFs) with an abstracted view of the network. We describe a centralized coordination framework, and then develop a NF for InterCell Interference Coordination (ICIC) in a 5G HetNet, optimizing the radio resource usage at network-level. We construct a Network Graph to abstract the problem of resource allocation and cell offloading, with the NF seeking for an optimal solution based on this abstraction. Simulations are performed in a HetNet scenario with a Tabu Search algorithm. Results show the feasibility of performing network-level coordination through a modular NF, with an abstracted view of the network.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124224119","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292694
Shahin Vakilinia, Iman Vakilinia, M. Cheriet
Smart home applications are becoming increasingly popular due to the explosive growth of intelligent devices in recent years. However, such applications require extra computing resources. In this paper, the task offloading management in the smart home scenarios are investigated in micro and macro scales. First, the optimal process of different applications is determined to be offloaded from the smart home controller to the cloud system. Second, a policy in the home gateway is proposed to select the best server in the cloud to dynamically offloading the computing tasks considering energy saving while satisfying the applications QoS metrics. Using queuing theoretical approach, we model the smart home application execution time at macro level considering the applications QoS constraints. Then, we apply duality theory to find the optimal offloading ratio. Moreover, an optimal interface/server selection is investigated to minimize the energy consumption. On the other hand, Lyapunov drift optimization is applied at micro level to find the optimal performance point of the smart home applications in real time. The effectiveness and optimality of our proposed algorithms are evaluated by experiments over realistic smart home scenarios.
{"title":"Green process offloading in smart home","authors":"Shahin Vakilinia, Iman Vakilinia, M. Cheriet","doi":"10.1109/PIMRC.2017.8292694","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292694","url":null,"abstract":"Smart home applications are becoming increasingly popular due to the explosive growth of intelligent devices in recent years. However, such applications require extra computing resources. In this paper, the task offloading management in the smart home scenarios are investigated in micro and macro scales. First, the optimal process of different applications is determined to be offloaded from the smart home controller to the cloud system. Second, a policy in the home gateway is proposed to select the best server in the cloud to dynamically offloading the computing tasks considering energy saving while satisfying the applications QoS metrics. Using queuing theoretical approach, we model the smart home application execution time at macro level considering the applications QoS constraints. Then, we apply duality theory to find the optimal offloading ratio. Moreover, an optimal interface/server selection is investigated to minimize the energy consumption. On the other hand, Lyapunov drift optimization is applied at micro level to find the optimal performance point of the smart home applications in real time. The effectiveness and optimality of our proposed algorithms are evaluated by experiments over realistic smart home scenarios.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121384724","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292221
Jean-Alain Lucciardi, N. Thomas, M. Boucheret, C. Poulliat, G. Mesnager
In order to increase the capacity of future satellite communication systems, faster-than-Nyquist (FTN) signaling is increasingly considered. The gain in terms of transmission rate is obtained at the price of significant intersymbol interference (ISI) introduction. To benefit from an improved spectral efficiency (SE), many iterative detectors have already been investigated, demonstrating the interest of such a waveform in linear and non linear channels. A thorny point in FTN signaling remains its synchronization since the usual algorithms considered in the DVB-S2X standard cannot be applied on this waveform without significant loss on the performance. This paper proposes a synchronization scheme for FTN signaling in a satellite context. It is based on a Volterra decomposition of the received signal in order to fit both with linearized and non-linearized amplifiers which can be found in the satellite payload. Two steps, initialization and tracking are considered, based on training sequences fulfilling the DVB-S2Xs frames requirements. After start of sequence detection and frequency offset correction, the channel estimation is used for time offset issue in the two proposed schemes. Their performance are compared to the performance of a perfect synchronized detection.
{"title":"Receiver for FTN signaling in non-linear channel: Joint channel estimation and synchronization","authors":"Jean-Alain Lucciardi, N. Thomas, M. Boucheret, C. Poulliat, G. Mesnager","doi":"10.1109/PIMRC.2017.8292221","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292221","url":null,"abstract":"In order to increase the capacity of future satellite communication systems, faster-than-Nyquist (FTN) signaling is increasingly considered. The gain in terms of transmission rate is obtained at the price of significant intersymbol interference (ISI) introduction. To benefit from an improved spectral efficiency (SE), many iterative detectors have already been investigated, demonstrating the interest of such a waveform in linear and non linear channels. A thorny point in FTN signaling remains its synchronization since the usual algorithms considered in the DVB-S2X standard cannot be applied on this waveform without significant loss on the performance. This paper proposes a synchronization scheme for FTN signaling in a satellite context. It is based on a Volterra decomposition of the received signal in order to fit both with linearized and non-linearized amplifiers which can be found in the satellite payload. Two steps, initialization and tracking are considered, based on training sequences fulfilling the DVB-S2Xs frames requirements. After start of sequence detection and frequency offset correction, the channel estimation is used for time offset issue in the two proposed schemes. Their performance are compared to the performance of a perfect synchronized detection.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116139872","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292538
S. Sharma, Xianbin Wang
Dynamic Spectrum Access (DSA) is considered as a promising solution to address the problem of spectrum scarcity in future wireless networks. However, the main challenges associated with this approach are to acquire accurate spectrum usage information in a timely manner and to deal with the dynamicity of channel occupancy. Although Cooperative Sensing (CS) can provide significant advantages over individual device-level sensing in terms of sensing efficiency and the achievable throughput, the acquired channel occupancy information may become outdated in dynamic channel conditions due to the involved latency. In this regard, we propose to utilize a collaborative cloud-edge processing framework to minimize the CS delay in DSA networks. In this framework, the cloud-center can estimate channel occupancy parameters such as duty cycle based on the available historical sensing data by using a suitable spectrum prediction technique, and subsequently this prior knowledge can be utilized to adapt the sensing mechanism employed at the edge-side of a DSA network. Motivated by this, we formulate and solve the problem of minimizing CS delay in cloud-assisted DSA networks. A two-stage bisection search method is employed to solve this CS delay minimization problem. Our results show that the proposed cloud-assisted CS scheme can significantly reduce the CS delay in DSA networks.
{"title":"Cooperative sensing delay minimization in cloud-assisted DSA networks","authors":"S. Sharma, Xianbin Wang","doi":"10.1109/PIMRC.2017.8292538","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292538","url":null,"abstract":"Dynamic Spectrum Access (DSA) is considered as a promising solution to address the problem of spectrum scarcity in future wireless networks. However, the main challenges associated with this approach are to acquire accurate spectrum usage information in a timely manner and to deal with the dynamicity of channel occupancy. Although Cooperative Sensing (CS) can provide significant advantages over individual device-level sensing in terms of sensing efficiency and the achievable throughput, the acquired channel occupancy information may become outdated in dynamic channel conditions due to the involved latency. In this regard, we propose to utilize a collaborative cloud-edge processing framework to minimize the CS delay in DSA networks. In this framework, the cloud-center can estimate channel occupancy parameters such as duty cycle based on the available historical sensing data by using a suitable spectrum prediction technique, and subsequently this prior knowledge can be utilized to adapt the sensing mechanism employed at the edge-side of a DSA network. Motivated by this, we formulate and solve the problem of minimizing CS delay in cloud-assisted DSA networks. A two-stage bisection search method is employed to solve this CS delay minimization problem. Our results show that the proposed cloud-assisted CS scheme can significantly reduce the CS delay in DSA networks.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752615","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292293
S. Buzzi, A. Zappone
Recently, the so-called cell-free Massive MIMO architecture has been introduced, wherein a very large number of distributed access points (APs) simultaneously and jointly serve a much smaller number of mobile stations (MSs). A variant of the cell-free technique is the user-centric approach, wherein each AP just decodes the MSs that it receives with the largest power. This paper considers both the cell-free and user-centric approaches, and, using an interplay of sequential optimization and alternating optimization, derives downlink power-control algorithms aimed at maximizing either the minimum users' SINR (to ensure fairness), or the system sum-rate. Numerical results show the effectiveness of the proposed algorithms, as well as that the user-centric approach generally outperforms the CF one.
{"title":"Downlink power control in user-centric and cell-free massive MIMO wireless networks","authors":"S. Buzzi, A. Zappone","doi":"10.1109/PIMRC.2017.8292293","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292293","url":null,"abstract":"Recently, the so-called cell-free Massive MIMO architecture has been introduced, wherein a very large number of distributed access points (APs) simultaneously and jointly serve a much smaller number of mobile stations (MSs). A variant of the cell-free technique is the user-centric approach, wherein each AP just decodes the MSs that it receives with the largest power. This paper considers both the cell-free and user-centric approaches, and, using an interplay of sequential optimization and alternating optimization, derives downlink power-control algorithms aimed at maximizing either the minimum users' SINR (to ensure fairness), or the system sum-rate. Numerical results show the effectiveness of the proposed algorithms, as well as that the user-centric approach generally outperforms the CF one.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114842254","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 : 2017-10-01DOI: 10.1109/PIMRC.2017.8292310
Jinyi Huang, Liang Sun, Chenyang Yang, Shengqian Han
Inter-cell interference (ICI) limits the throughput of multicell massive MIMO systems. Considering the large-scale array at base stations, high array gain can be obtained by analog beamforming based on statistical channel information. In this paper, we propose an interference coordination strategy based on both statistical and instantaneous channel information to mitigate ICI in multicell massive MIMO systems. We propose an enhanced Joint Spatial Division and Multiplexing (JSDM) precoding to mitigate ICI by cooperative beamforming implemented by the two-stage precoding based on channel covariance matrices and global effective channel state information (CSI). We also present the way to implement the precoding in practical systems without perfect effective CSI. Simulation results show that the proposed precoding can effectively mitigate ICI, thus provide remarkable gain in the downlink throughput and improve the fairness among users over the traditional one.
{"title":"Multiceli interference coordination strategy based on hybrid channel information","authors":"Jinyi Huang, Liang Sun, Chenyang Yang, Shengqian Han","doi":"10.1109/PIMRC.2017.8292310","DOIUrl":"https://doi.org/10.1109/PIMRC.2017.8292310","url":null,"abstract":"Inter-cell interference (ICI) limits the throughput of multicell massive MIMO systems. Considering the large-scale array at base stations, high array gain can be obtained by analog beamforming based on statistical channel information. In this paper, we propose an interference coordination strategy based on both statistical and instantaneous channel information to mitigate ICI in multicell massive MIMO systems. We propose an enhanced Joint Spatial Division and Multiplexing (JSDM) precoding to mitigate ICI by cooperative beamforming implemented by the two-stage precoding based on channel covariance matrices and global effective channel state information (CSI). We also present the way to implement the precoding in practical systems without perfect effective CSI. Simulation results show that the proposed precoding can effectively mitigate ICI, thus provide remarkable gain in the downlink throughput and improve the fairness among users over the traditional one.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114850595","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
扫码关注我们
求助内容：
应助结果提醒方式：