Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996399
R. Gerzaguet, David Demmer, Jean-Baptiste Doré, D. Kténas
5G will have to cope with a high degree of heterogeneity in terms of services and requirements. Among these latter, flexible and efficient use of all available non-contiguous spectrums for different network deployment scenarios is one challenge for the future 5G. To maximize spectrum efficiency, the 5G air interface technology will also need to be flexible and capable of mapping various services to the best suitable combinations of frequency and radio resources. Such requirements are not satisfied by legacy CP-OFDM and alternative multicarrier waveforms such as UFMC and FBMC partially meet them. In this article, we introduce a new quasi-orthogonal waveform called Block-Filtered OFDM (BF-OFDM) that combines most of the advantages of the aforementioned waveforms at the price of slight complexity increase. Spectral localization and performance in multi-user scenario will be enhanced w.r.t OFDM and simple equalization as well as all classical MIMO schemes can be straightforwardly considered. The proposed waveform offers the same performance in presence of multipath channel as CP-OFDM and is also scalable which paves the way for future multi-service scenarios.
{"title":"Block-filtered OFDM: A new promising waveform for multi-service scenarios","authors":"R. Gerzaguet, David Demmer, Jean-Baptiste Doré, D. Kténas","doi":"10.1109/ICC.2017.7996399","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996399","url":null,"abstract":"5G will have to cope with a high degree of heterogeneity in terms of services and requirements. Among these latter, flexible and efficient use of all available non-contiguous spectrums for different network deployment scenarios is one challenge for the future 5G. To maximize spectrum efficiency, the 5G air interface technology will also need to be flexible and capable of mapping various services to the best suitable combinations of frequency and radio resources. Such requirements are not satisfied by legacy CP-OFDM and alternative multicarrier waveforms such as UFMC and FBMC partially meet them. In this article, we introduce a new quasi-orthogonal waveform called Block-Filtered OFDM (BF-OFDM) that combines most of the advantages of the aforementioned waveforms at the price of slight complexity increase. Spectral localization and performance in multi-user scenario will be enhanced w.r.t OFDM and simple equalization as well as all classical MIMO schemes can be straightforwardly considered. The proposed waveform offers the same performance in presence of multipath channel as CP-OFDM and is also scalable which paves the way for future multi-service scenarios.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76295058","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-05-21DOI: 10.1109/ICC.2017.7997360
Ke Zhang, Y. Mao, S. Leng, Sabita Maharjan, Yan Zhang
The increasing number of smart vehicles and their resource hungry applications pose new challenges in terms of computation and processing for providing reliable and efficient vehicular services. Mobile Edge Computing (MEC) is a new paradigm with potential to improve vehicular services through computation offloading in close proximity to mobile vehicles. However, in the road with dense traffic flow, the computation limitation of these MEC servers may endanger the quality of offloading service. To address the problem, we propose a hierarchical cloud-based Vehicular Edge Computing (VEC) offloading framework, where a backup computing server in the neighborhood is introduced to make up for the deficit computing resources of MEC servers. Based on this framework, we adopt a Stackelberg game theoretic approach to design an optimal multilevel offloading scheme, which maximizes the utilities of both the vehicles and the computing servers. Furthermore, to obtain the optimal offloading strategies, we present an iterative distributed algorithm and prove its convergence. Numerical results indicate that our proposed scheme greatly enhances the utility of the offloading service providers.
{"title":"Optimal delay constrained offloading for vehicular edge computing networks","authors":"Ke Zhang, Y. Mao, S. Leng, Sabita Maharjan, Yan Zhang","doi":"10.1109/ICC.2017.7997360","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997360","url":null,"abstract":"The increasing number of smart vehicles and their resource hungry applications pose new challenges in terms of computation and processing for providing reliable and efficient vehicular services. Mobile Edge Computing (MEC) is a new paradigm with potential to improve vehicular services through computation offloading in close proximity to mobile vehicles. However, in the road with dense traffic flow, the computation limitation of these MEC servers may endanger the quality of offloading service. To address the problem, we propose a hierarchical cloud-based Vehicular Edge Computing (VEC) offloading framework, where a backup computing server in the neighborhood is introduced to make up for the deficit computing resources of MEC servers. Based on this framework, we adopt a Stackelberg game theoretic approach to design an optimal multilevel offloading scheme, which maximizes the utilities of both the vehicles and the computing servers. Furthermore, to obtain the optimal offloading strategies, we present an iterative distributed algorithm and prove its convergence. Numerical results indicate that our proposed scheme greatly enhances the utility of the offloading service providers.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84803217","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-05-21DOI: 10.1109/ICC.2017.7997212
Srinjoy Chattopadhyay, H. Dai
In this work, we focus on the problem of obtaining the optimal interlink structures, which maximizes the robustness of networks against random node failures, in a cost constrained setting. Using percolation theory based system equations, we have formulated our objective as a constrained optimization problem and designed algorithms serving two key purposes: i) obtaining the budget limits, Bl and Bu, defined as the minimum budget guaranteeing the existence of a feasible and optimal interlink structure, respectively; and ii) obtaining interlink structures for intermediate budgets. Through these algorithms and associated simulation results, we demonstrate the importance of cost in network design. Furthermore, the designed algorithms have close to optimal performance while being much cheaper than cost agnostic network designs.
{"title":"Designing optimal interlink structures for interdependent networks under budget constraints","authors":"Srinjoy Chattopadhyay, H. Dai","doi":"10.1109/ICC.2017.7997212","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997212","url":null,"abstract":"In this work, we focus on the problem of obtaining the optimal interlink structures, which maximizes the robustness of networks against random node failures, in a cost constrained setting. Using percolation theory based system equations, we have formulated our objective as a constrained optimization problem and designed algorithms serving two key purposes: i) obtaining the budget limits, Bl and Bu, defined as the minimum budget guaranteeing the existence of a feasible and optimal interlink structure, respectively; and ii) obtaining interlink structures for intermediate budgets. Through these algorithms and associated simulation results, we demonstrate the importance of cost in network design. Furthermore, the designed algorithms have close to optimal performance while being much cheaper than cost agnostic network designs.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"48 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82280089","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-05-21DOI: 10.1109/ICC.2017.7996536
Beixiong Zheng, Miaowen Wen, E. Başar, Fangjiong Chen
Multiple-input multiple-output orthogonal frequency division multiplexing with index modulation (MIMO-OFDM-IM), which provides a flexible trade-off between spectral efficiency and error performance, is recently proposed as a promising transmission technique for energy-efficient 5G wireless communication systems. However, due to the dependence of subcarrier symbols within each subblock and the strong interchannel interference, it is challenging to detect the transmitted data effectively while imposing low computational burden to the receiver. In this paper, we propose a low-complexity detector based on the sequential Monte Carlo (SMC) theory for the detection of MIMO-OFDM-IM signals. The proposed detector, which draws samples based on the importance weights at the subblock level, achieves near-optimal error performance with considerably reduced computational complexity. Simulation and numerical results in terms of bit error rate (BER) and number of complex multiplications (NCM) corroborate the superiority of the proposed detector.
{"title":"Low-complexity near-optimal detector for multiple-input multiple-output OFDM with index modulation","authors":"Beixiong Zheng, Miaowen Wen, E. Başar, Fangjiong Chen","doi":"10.1109/ICC.2017.7996536","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996536","url":null,"abstract":"Multiple-input multiple-output orthogonal frequency division multiplexing with index modulation (MIMO-OFDM-IM), which provides a flexible trade-off between spectral efficiency and error performance, is recently proposed as a promising transmission technique for energy-efficient 5G wireless communication systems. However, due to the dependence of subcarrier symbols within each subblock and the strong interchannel interference, it is challenging to detect the transmitted data effectively while imposing low computational burden to the receiver. In this paper, we propose a low-complexity detector based on the sequential Monte Carlo (SMC) theory for the detection of MIMO-OFDM-IM signals. The proposed detector, which draws samples based on the importance weights at the subblock level, achieves near-optimal error performance with considerably reduced computational complexity. Simulation and numerical results in terms of bit error rate (BER) and number of complex multiplications (NCM) corroborate the superiority of the proposed detector.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80511381","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-05-21DOI: 10.1109/ICC.2017.7996325
Jiagao Wu, Yue Ma, Linfeng Liu, Jianping Pan
Delay-tolerant networks (DTNs) are wireless mobile networks that exhibit frequent intermittent connectivity and large transmission delay among nodes. Research results have shown that quota-controlled routing protocols can strike a reasonable balance between routing performance and cost, where quota is a value to control the number of message copies. However, the question of how to set the optimal quota dynamically in order to achieve the lower bound of routing cost is still open. In this paper, we model the optimization of quota control as an extremal functional problem and analyze it by a classic mathematical method called Calculus of Variations (CoV) for the first time. The function of time-variant quota with minimal average number of message copies is obtained in closed form, and an optimal quota control algorithm is proposed under practical routing design considerations. Both the numerical and simulation results show that the proposed model and algorithm are effective and efficient.
容忍延迟网络(dtn)是一种无线移动网络，具有频繁的间歇连接和节点间的大传输延迟。研究结果表明，配额控制路由协议可以在路由性能和成本之间取得合理的平衡，其中配额是控制消息副本数量的值。然而，如何动态设置最优配额以达到路由开销的下界仍然是一个有待解决的问题。本文首次将配额控制的优化问题建模为一个极值泛函问题，并用变分法(Calculus of variation, CoV)对其进行了分析。以封闭形式得到了平均报文拷贝数最小的时变配额函数，并在考虑实际路由设计的情况下，提出了一种最优配额控制算法。数值和仿真结果表明，所提出的模型和算法是有效的。
{"title":"Optimizing time-variant quota-controlled routing in delay-tolerant networks","authors":"Jiagao Wu, Yue Ma, Linfeng Liu, Jianping Pan","doi":"10.1109/ICC.2017.7996325","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996325","url":null,"abstract":"Delay-tolerant networks (DTNs) are wireless mobile networks that exhibit frequent intermittent connectivity and large transmission delay among nodes. Research results have shown that quota-controlled routing protocols can strike a reasonable balance between routing performance and cost, where quota is a value to control the number of message copies. However, the question of how to set the optimal quota dynamically in order to achieve the lower bound of routing cost is still open. In this paper, we model the optimization of quota control as an extremal functional problem and analyze it by a classic mathematical method called Calculus of Variations (CoV) for the first time. The function of time-variant quota with minimal average number of message copies is obtained in closed form, and an optimal quota control algorithm is proposed under practical routing design considerations. Both the numerical and simulation results show that the proposed model and algorithm are effective and efficient.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80810808","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-05-21DOI: 10.1109/ICC.2017.7996598
Shuopeng Li, M. Saidi, Ken Chen
Network virtualization allows the co-existing of logical networks (virtual networks) on physical network (substrate networks). Virtual Network (VN) reliability is a critical problem for end-users and service providers. It aims to ensure service continuity even upon failure. As more and more VNs are created over substrate networks (SN), the failure of a single SN component may lead to the failure of many VNs. Thus, the VN reliability issue is becoming more and more critical. VN reliability can be enhanced in two ways: (1) by failure recovery (post-failure) with protection and/or restoration methods; (2) by failure avoidance with the selection of most reliable components at the network topology setting phase. Traditional virtual network embedding (VNE) methods have mainly focused on bandwidth optimization. In this paper, we focus on the reliability issue. We propose VNE methods which take into account the failure probability of SN components with a failure-avoidance approach, in order to minimize the VN failure probability. Our heuristics are based on the use of Steiner Minimal Tree (SMT). Simulations results confirm that our heuristics provide better reliability against traditional VNE with bandwidth as sole target, and, in case of failure of a SN component, reduce the number of affected VNs.
{"title":"A failure avoidance oriented approach for virtual network reliability enhancement","authors":"Shuopeng Li, M. Saidi, Ken Chen","doi":"10.1109/ICC.2017.7996598","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996598","url":null,"abstract":"Network virtualization allows the co-existing of logical networks (virtual networks) on physical network (substrate networks). Virtual Network (VN) reliability is a critical problem for end-users and service providers. It aims to ensure service continuity even upon failure. As more and more VNs are created over substrate networks (SN), the failure of a single SN component may lead to the failure of many VNs. Thus, the VN reliability issue is becoming more and more critical. VN reliability can be enhanced in two ways: (1) by failure recovery (post-failure) with protection and/or restoration methods; (2) by failure avoidance with the selection of most reliable components at the network topology setting phase. Traditional virtual network embedding (VNE) methods have mainly focused on bandwidth optimization. In this paper, we focus on the reliability issue. We propose VNE methods which take into account the failure probability of SN components with a failure-avoidance approach, in order to minimize the VN failure probability. Our heuristics are based on the use of Steiner Minimal Tree (SMT). Simulations results confirm that our heuristics provide better reliability against traditional VNE with bandwidth as sole target, and, in case of failure of a SN component, reduce the number of affected VNs.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"44 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86777242","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-05-21DOI: 10.1109/ICC.2017.7997034
W. Haselmayr, Andrea Biral, Andreas Grimmer, A. Zanella, A. Springer, R. Wille
On a droplet-based Labs-on-Chip (LoC) device, tiny volumes of fluids, so-called droplets, flow in channels of micrometer scale. The droplets contain chemical/biological samples that are processed by different modules on the LoC. In current solutions, an LoC is a single-purpose device that is designed for a specific application, which limits its flexibility. In order to realize a multi-purpose system, different modules are interconnected in a microfluidic network — yielding so-called Networked LoCs (NLoCs). In NLoCs, the droplets are routed to the desired modules by exploiting hydrodynamic forces. A well established topology for NLoCs are ring networks. However, the addressing schemes provided so far in the literature only allow to address multiple modules by re-injecting the droplet at the source every time, which is a very complex task and increases the risk of ruining the sample. In this work, we address this issue by revising the design of the network nodes, which include the modules. A novel configuration allows the droplet to undergo processing several times in cascade by different modules with a single injection. Simulating the trajectory of the droplets across the network confirmed the validity of our approach.
{"title":"Addressing multiple nodes in networked labs-on-chips without payload re-injection","authors":"W. Haselmayr, Andrea Biral, Andreas Grimmer, A. Zanella, A. Springer, R. Wille","doi":"10.1109/ICC.2017.7997034","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997034","url":null,"abstract":"On a droplet-based Labs-on-Chip (LoC) device, tiny volumes of fluids, so-called droplets, flow in channels of micrometer scale. The droplets contain chemical/biological samples that are processed by different modules on the LoC. In current solutions, an LoC is a single-purpose device that is designed for a specific application, which limits its flexibility. In order to realize a multi-purpose system, different modules are interconnected in a microfluidic network — yielding so-called Networked LoCs (NLoCs). In NLoCs, the droplets are routed to the desired modules by exploiting hydrodynamic forces. A well established topology for NLoCs are ring networks. However, the addressing schemes provided so far in the literature only allow to address multiple modules by re-injecting the droplet at the source every time, which is a very complex task and increases the risk of ruining the sample. In this work, we address this issue by revising the design of the network nodes, which include the modules. A novel configuration allows the droplet to undergo processing several times in cascade by different modules with a single injection. Simulating the trajectory of the droplets across the network confirmed the validity of our approach.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83456610","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-05-21DOI: 10.1109/ICC.2017.7997300
N. Lahbabi, Hao Lin, C. A. Nour, C. Douillard, P. Siohan
In this paper, we consider a transmission scheme combining precoded Faster-Than-Nyquist signaling (FTN) and Orthogonal Frequency Division Multiplexing Offset Quadrature Amplitude Modulation (OFDM/OQAM). The precoding method, named Sparse Interference Pre-Cancellation (SIPC), aims at reducing the interference introduced by FTN signaling at the transmitter side. In order to further improve the receiver performance, we propose additional enhancements to the channel encoder, notably, the bit-to-symbol mapping and symbol to time-frequency-positions mapping. Via simulations, we show that the proposed modifications improve the Bit-Error-Rate (BER) performance of the considered transceiver.
{"title":"An enhanced coding strategy for FTN-OFDM/OQAM transceiver design","authors":"N. Lahbabi, Hao Lin, C. A. Nour, C. Douillard, P. Siohan","doi":"10.1109/ICC.2017.7997300","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997300","url":null,"abstract":"In this paper, we consider a transmission scheme combining precoded Faster-Than-Nyquist signaling (FTN) and Orthogonal Frequency Division Multiplexing Offset Quadrature Amplitude Modulation (OFDM/OQAM). The precoding method, named Sparse Interference Pre-Cancellation (SIPC), aims at reducing the interference introduced by FTN signaling at the transmitter side. In order to further improve the receiver performance, we propose additional enhancements to the channel encoder, notably, the bit-to-symbol mapping and symbol to time-frequency-positions mapping. Via simulations, we show that the proposed modifications improve the Bit-Error-Rate (BER) performance of the considered transceiver.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81202265","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-05-21DOI: 10.1109/ICC.2017.7996526
Ali Bulut Üçüncü, A. O. Yılmaz
Low resolution analog-to-digital converters (ADC) attracted much attention lately for massive multiple-input multiple-output (MIMO) communication and systems with high bandwidth. Especially, 1-bit ADCs are suitable for such systems due to their low power consumption and cost. In this study, we illustrate the benefits of using faster than symbol rate (FTSR) sampling in an uplink massive MIMO system with 1-bit ADCs in terms of symbol error rate (SER). We show that FTSR sampling provides about 4 dB signal-to-noise ratio (SNR) advantage in terms of SER with a linear low complexity zero-forcing type receiver. We also obtain an analytical bound for the SER performance of uplink massive MIMO structures with 1-bit quantization for the FTSR sampling scenario for low, medium and high SNR regimes. The proposed analytical bound is also applicable to no FTSR sampling case and shown to yield more accurate results compared to some other analytical expressions in the literature. Our results establish a tradeoff between temporal oversampling and the number of receive antennas.
{"title":"Performance analysis of faster than symbol rate sampling in 1-bit massive MIMO systems","authors":"Ali Bulut Üçüncü, A. O. Yılmaz","doi":"10.1109/ICC.2017.7996526","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996526","url":null,"abstract":"Low resolution analog-to-digital converters (ADC) attracted much attention lately for massive multiple-input multiple-output (MIMO) communication and systems with high bandwidth. Especially, 1-bit ADCs are suitable for such systems due to their low power consumption and cost. In this study, we illustrate the benefits of using faster than symbol rate (FTSR) sampling in an uplink massive MIMO system with 1-bit ADCs in terms of symbol error rate (SER). We show that FTSR sampling provides about 4 dB signal-to-noise ratio (SNR) advantage in terms of SER with a linear low complexity zero-forcing type receiver. We also obtain an analytical bound for the SER performance of uplink massive MIMO structures with 1-bit quantization for the FTSR sampling scenario for low, medium and high SNR regimes. The proposed analytical bound is also applicable to no FTSR sampling case and shown to yield more accurate results compared to some other analytical expressions in the literature. Our results establish a tradeoff between temporal oversampling and the number of receive antennas.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87001714","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-05-21DOI: 10.1109/ICC.2017.7997121
Daniela Renga, Hussein Al Haj Hassan, M. Meo, L. Nuaymi
In the last years, Green Mobile Networks that are powered with renewable energy sources have been designed and deployed with the twofold objective of reducing operational costs and providing service in scenarios in which the power grid is not reliable. At the same time, the introduction of Smart Grids is deeply changing the energy market, by effect of the grid actively interacting with its customers. In this paper, we consider a scenario in which a green mobile network is integrated in a smart grid. The mobile network interacts with the smart grid, responding to its requests by adapting its load. Load adaptation is obtained by resource on demand strategies that operate on Base Stations, and by taking decisions about the use of the renewable energy that is locally produced and that can be used for powering the green mobile network, it can be stored or even returned to the grid. The results, derived through a Markovian model, show that the use of resource on demand strategies in the green mobile network improves the interaction between the network and the smart grid: significant cost gain can be achieved, the responsiveness to the smart grid requests increases, low storage probability decreases.
{"title":"Improving the interaction of a green mobile network with the smart grid","authors":"Daniela Renga, Hussein Al Haj Hassan, M. Meo, L. Nuaymi","doi":"10.1109/ICC.2017.7997121","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997121","url":null,"abstract":"In the last years, Green Mobile Networks that are powered with renewable energy sources have been designed and deployed with the twofold objective of reducing operational costs and providing service in scenarios in which the power grid is not reliable. At the same time, the introduction of Smart Grids is deeply changing the energy market, by effect of the grid actively interacting with its customers. In this paper, we consider a scenario in which a green mobile network is integrated in a smart grid. The mobile network interacts with the smart grid, responding to its requests by adapting its load. Load adaptation is obtained by resource on demand strategies that operate on Base Stations, and by taking decisions about the use of the renewable energy that is locally produced and that can be used for powering the green mobile network, it can be stored or even returned to the grid. The results, derived through a Markovian model, show that the use of resource on demand strategies in the green mobile network improves the interaction between the network and the smart grid: significant cost gain can be achieved, the responsiveness to the smart grid requests increases, low storage probability decreases.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"73 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91131525","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
扫码关注我们
求助内容：
应助结果提醒方式：