Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024465
Xiaojin Ding, Gengxin Zhang, Dexin Qu, Tiecheng Song
In this paper, we investigate the physical-layer security of a spectrum-sharing aided satellite-terrestrial integrated network comprised of a pair of satellite system and terrestrial system, which can utilize the shared spectrum in the presence of an eavesdropper. We propose a specifically designed satellite scheduling scheme to guarantee wireless transmission of the satellite system against eavesdropping attacks in the face of co-channel interference generated by the terrestrial communication system, where the specifically designed satellite scheduling scheme is represented by multi-satellite scheduling (MSS). We analyze the security-reliability tradeoff (SRT) of the MSS scheme, where the security and the reliability are characterized by the intercept probability and the outage probability, respectively. For comparison purposes, we also provide the SRT analysis of the round-robin satellite scheduling (RSS) scheme. In addition, numerical SRT results demonstrate that the proposed MSS scheme significantly outperform the RSS scheme in terms of their SRT.
{"title":"Security-Reliability Tradeoff Analysis of Spectrum-Sharing Aided Satellite-Terrestrial Networks","authors":"Xiaojin Ding, Gengxin Zhang, Dexin Qu, Tiecheng Song","doi":"10.1109/GCWkshps45667.2019.9024465","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024465","url":null,"abstract":"In this paper, we investigate the physical-layer security of a spectrum-sharing aided satellite-terrestrial integrated network comprised of a pair of satellite system and terrestrial system, which can utilize the shared spectrum in the presence of an eavesdropper. We propose a specifically designed satellite scheduling scheme to guarantee wireless transmission of the satellite system against eavesdropping attacks in the face of co-channel interference generated by the terrestrial communication system, where the specifically designed satellite scheduling scheme is represented by multi-satellite scheduling (MSS). We analyze the security-reliability tradeoff (SRT) of the MSS scheme, where the security and the reliability are characterized by the intercept probability and the outage probability, respectively. For comparison purposes, we also provide the SRT analysis of the round-robin satellite scheduling (RSS) scheme. In addition, numerical SRT results demonstrate that the proposed MSS scheme significantly outperform the RSS scheme in terms of their SRT.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125408088","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024421
Zhichao Zou, Shunqing Zhang, Shugong Xu, Shan Cao
Nowadays real-time traffic occupies lots of network resources, thus identification and analysis for this network traffic becomes urgent for operator and commercial company. With the identified traffic types, quality of experience (QoE) monitoring and optimization, user behavior analysis and network resource allocation are more beneficial for open 5G/Beyond 5G (5G/B5G) networks. Exiting studies usually adopt transport or application layer information to identify traffic, while we jointly consider them simultaneously to achieve general purpose identifier. Besides, we also analyze the flow-based features to reduce the corresponding complexity for low-complexity implementation. Based on anatomy of network traffic identification, we propose a traffic type identification framework for real-time traffic. In mainstream voice over Internet protocol (VoIP) call and video streaming services, the proposed method can achieve as much as 30% identification accuracy improvement and have more than 20% reduction in terms of the identification delay if compared with other conventional schemes.
当前，实时流量占用了大量的网络资源，因此对实时流量的识别和分析成为运营商和商业公司迫切需要解决的问题。通过对流量类型的识别，对体验质量(QoE)的监控和优化、用户行为分析以及网络资源的分配，更有利于开放的5G/超5G (5G/B5G)网络。现有的研究通常采用传输层或应用层信息来识别流量，而我们将两者同时考虑，以实现通用标识。此外，我们还分析了基于流的特征，以降低相应的复杂度，实现低复杂度。在分析网络流量识别的基础上，提出了一种实时流量类型识别框架。在主流的VoIP (voice over Internet protocol)呼叫和视频流业务中，与其他传统方案相比，该方法的识别精度提高了30%以上，识别延迟降低了20%以上。
{"title":"A Real-Time Network Traffic Identifier for Open 5G/B5G Networks via Prototype Analysis","authors":"Zhichao Zou, Shunqing Zhang, Shugong Xu, Shan Cao","doi":"10.1109/GCWkshps45667.2019.9024421","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024421","url":null,"abstract":"Nowadays real-time traffic occupies lots of network resources, thus identification and analysis for this network traffic becomes urgent for operator and commercial company. With the identified traffic types, quality of experience (QoE) monitoring and optimization, user behavior analysis and network resource allocation are more beneficial for open 5G/Beyond 5G (5G/B5G) networks. Exiting studies usually adopt transport or application layer information to identify traffic, while we jointly consider them simultaneously to achieve general purpose identifier. Besides, we also analyze the flow-based features to reduce the corresponding complexity for low-complexity implementation. Based on anatomy of network traffic identification, we propose a traffic type identification framework for real-time traffic. In mainstream voice over Internet protocol (VoIP) call and video streaming services, the proposed method can achieve as much as 30% identification accuracy improvement and have more than 20% reduction in terms of the identification delay if compared with other conventional schemes.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125421300","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024698
Y. Kokar, D. P. Huy, Romain Fara, K. Rachedi, A. Ourir, J. Rosny, M. D. Renzo, Jean-Christophe Prévotet, M. Hélard
Ambient backscatter communications have emerged as a promising technology for a sustainable development of the Internet of Things (IoT). In such system, a radio frequency (RF) tag can transmit data to a receiver without battery and without generating any new RF wave, just by backscattering the incident RF wave originated by an ambient RF source. The simplest tag is a dipole that is either in an absorbing mode or in reflecting mode to send "0" or "1", and thus leads to a modulation order of 2. Previous solutions to reach higher modulation order, so as to achieve higher data rate, are based on antenna arrays. However, such solutions are not suitable for connected objects, due to their sizes. In this paper, for the first time, we propose a new tag that uses a compact antenna with reconfigurable radiation patterns to provide a high modulation order. We present experimental bit error rate measurements obtained with an experimental test-bed and two tag antennas, both providing 4 states and thus being able to convey 2 bits per symbol. These measurements show that the performance improves with increasing number of receive antennas, and lead to the conclusion that a tag antenna with low cross-correlations between reconfigurable radiation patterns is suitable for backscattering applications in IoT.
{"title":"First Experimental Ambient Backscatter Communication Using a Compact Reconfigurable Tag Antenna","authors":"Y. Kokar, D. P. Huy, Romain Fara, K. Rachedi, A. Ourir, J. Rosny, M. D. Renzo, Jean-Christophe Prévotet, M. Hélard","doi":"10.1109/GCWkshps45667.2019.9024698","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024698","url":null,"abstract":"Ambient backscatter communications have emerged as a promising technology for a sustainable development of the Internet of Things (IoT). In such system, a radio frequency (RF) tag can transmit data to a receiver without battery and without generating any new RF wave, just by backscattering the incident RF wave originated by an ambient RF source. The simplest tag is a dipole that is either in an absorbing mode or in reflecting mode to send \"0\" or \"1\", and thus leads to a modulation order of 2. Previous solutions to reach higher modulation order, so as to achieve higher data rate, are based on antenna arrays. However, such solutions are not suitable for connected objects, due to their sizes. In this paper, for the first time, we propose a new tag that uses a compact antenna with reconfigurable radiation patterns to provide a high modulation order. We present experimental bit error rate measurements obtained with an experimental test-bed and two tag antennas, both providing 4 states and thus being able to convey 2 bits per symbol. These measurements show that the performance improves with increasing number of receive antennas, and lead to the conclusion that a tag antenna with low cross-correlations between reconfigurable radiation patterns is suitable for backscattering applications in IoT.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126599082","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024432
P. Pedrosa, R. Dinis, D. Castanheira, Adão Silva, A. Gameiro
In this paper we consider the use of a single- carrier with frequency-domain equalization (SC-FDE) scheme for vehicle-to-everything (V2X) communications. To cope with the doubly-selective nature of the V2X channel we propose a receiver structure for the joint channel equalization and tracking. We use a low-complexity iterative frequency-domain equalizer based on the iterative block decision-feedback equalization (IB-DFE) concept for the channel equalization and an extended Kalman filter (EKF) for the channel tracking. The tracking procedure works by, first, observing (estimating) the channel state using training symbols and then predicting the channel state using a state-transition model during the transmission of the data symbols. Alternatively, decision-directed channel estimation also can be used, resulting in improved performance.
{"title":"Joint Channel Equalization and Tracking for V2X Communications Using SC-FDE Schemes","authors":"P. Pedrosa, R. Dinis, D. Castanheira, Adão Silva, A. Gameiro","doi":"10.1109/GCWkshps45667.2019.9024432","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024432","url":null,"abstract":"In this paper we consider the use of a single- carrier with frequency-domain equalization (SC-FDE) scheme for vehicle-to-everything (V2X) communications. To cope with the doubly-selective nature of the V2X channel we propose a receiver structure for the joint channel equalization and tracking. We use a low-complexity iterative frequency-domain equalizer based on the iterative block decision-feedback equalization (IB-DFE) concept for the channel equalization and an extended Kalman filter (EKF) for the channel tracking. The tracking procedure works by, first, observing (estimating) the channel state using training symbols and then predicting the channel state using a state-transition model during the transmission of the data symbols. Alternatively, decision-directed channel estimation also can be used, resulting in improved performance.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127347301","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024540
Xuqi Wang, Yu Xie, Xiangguo Cheng, Zhengtao Jiang
One key focus of cloud storage is keyword search on encrypted data. In a cloud-based secure data sharing system, users need to search keywords on encrypted data in order to data confidentiality and query privacy. Moreover, a large number of trapdoors should be generated by users with his/her keys and submitted to the cloud. Some researches on searchable encryption with key-aggregate have been conducted in recent years, which shortened the number of keys and trapdoors to a constant. However, the computational overhead and communication costs are largely neglected in the literature. In this paper, we propose an efficient key-aggregate keyword searchable encryption (eKAKSE) scheme. Generally, this scheme does not need to generate substantial parameters when the system is established. It dramatically reduces the computational overhead in the case of resisting the eavesdropping problem. We formulate the security definitions for eKAKSE and prove its security. The simulation results show that the computational overhead of the proposed scheme is more efficient than that of other schemes.
{"title":"An Efficient Key-Aggregate Keyword Searchable Encryption for Data Sharing in Cloud Storage","authors":"Xuqi Wang, Yu Xie, Xiangguo Cheng, Zhengtao Jiang","doi":"10.1109/GCWkshps45667.2019.9024540","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024540","url":null,"abstract":"One key focus of cloud storage is keyword search on encrypted data. In a cloud-based secure data sharing system, users need to search keywords on encrypted data in order to data confidentiality and query privacy. Moreover, a large number of trapdoors should be generated by users with his/her keys and submitted to the cloud. Some researches on searchable encryption with key-aggregate have been conducted in recent years, which shortened the number of keys and trapdoors to a constant. However, the computational overhead and communication costs are largely neglected in the literature. In this paper, we propose an efficient key-aggregate keyword searchable encryption (eKAKSE) scheme. Generally, this scheme does not need to generate substantial parameters when the system is established. It dramatically reduces the computational overhead in the case of resisting the eavesdropping problem. We formulate the security definitions for eKAKSE and prove its security. The simulation results show that the computational overhead of the proposed scheme is more efficient than that of other schemes.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125236485","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024376
Woong Son, Howon Lee, B. Jung
In this paper, we investigate a multi-pair orbital angular momentum (OAM) interference network adopting mode- division multiplexing (MDM) at each transmitter, where multiple transmitter-receiver pairs exploit the same multiple OAM modes. Even though many previous studies on the OAM-MDM exist in literature, they only focused on a single transmitter-receiver pair and did not consider the inter-pair interference. In practice, wireless fronthaul and backhaul links reuse the same frequency band and they may interfere with each other. We first mathematically characterize the Laguerre-Gaussian (LG) beam-based OAM wireless channel and then analyze the channel capacity of the multi-pair OAM interference channel. It is worth noting that this is the first theoretical result in literature. Through extensive computer simulations, we validate the channel capacity of the multi-pair OAM-MDM interference channel by considering the interference among different OAM beams according to various system parameters such as the number of OAM modes, the distance between the transmitter and receiver, the distance between adjacent transmit antennas, the waist of the OAM beams, etc.
{"title":"Capacity Analysis of Multi-Pair Orbital Angular Momentum Interference Networks","authors":"Woong Son, Howon Lee, B. Jung","doi":"10.1109/GCWkshps45667.2019.9024376","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024376","url":null,"abstract":"In this paper, we investigate a multi-pair orbital angular momentum (OAM) interference network adopting mode- division multiplexing (MDM) at each transmitter, where multiple transmitter-receiver pairs exploit the same multiple OAM modes. Even though many previous studies on the OAM-MDM exist in literature, they only focused on a single transmitter-receiver pair and did not consider the inter-pair interference. In practice, wireless fronthaul and backhaul links reuse the same frequency band and they may interfere with each other. We first mathematically characterize the Laguerre-Gaussian (LG) beam-based OAM wireless channel and then analyze the channel capacity of the multi-pair OAM interference channel. It is worth noting that this is the first theoretical result in literature. Through extensive computer simulations, we validate the channel capacity of the multi-pair OAM-MDM interference channel by considering the interference among different OAM beams according to various system parameters such as the number of OAM modes, the distance between the transmitter and receiver, the distance between adjacent transmit antennas, the waist of the OAM beams, etc.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124494878","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024609
P. Aswathylakshmi, R. Ganti
Massive MIMO's immense potential to expand the capacity of base stations also comes with the caveat of requiring tremendous processing power. This favours a centralized radio access network (C-RAN) architecture that concentrates the processing power at a common baseband unit (BBU) connected to multiple remote radio heads (RRH) via fronthaul links. The large bandwidths of 5G make the fronthaul data rate a major bottleneck. Since the number of active users in a massive MIMO system is much smaller than the number of antennas, we propose a dimension reduction scheme based on QR approximation for fronthaul data compression. Link level simulations show that the proposed method achieves more than 17Ã- compression while also improving the error performance of the system through denoising.
{"title":"QR Approximation for Fronthaul Compression in Uplink Massive MIMO","authors":"P. Aswathylakshmi, R. Ganti","doi":"10.1109/GCWkshps45667.2019.9024609","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024609","url":null,"abstract":"Massive MIMO's immense potential to expand the capacity of base stations also comes with the caveat of requiring tremendous processing power. This favours a centralized radio access network (C-RAN) architecture that concentrates the processing power at a common baseband unit (BBU) connected to multiple remote radio heads (RRH) via fronthaul links. The large bandwidths of 5G make the fronthaul data rate a major bottleneck. Since the number of active users in a massive MIMO system is much smaller than the number of antennas, we propose a dimension reduction scheme based on QR approximation for fronthaul data compression. Link level simulations show that the proposed method achieves more than 17Ã- compression while also improving the error performance of the system through denoising.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"47 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122806450","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024325
V. Danilchenko, Matthew S. Theobald, Daniel Cohen
In the modern security-conscious world, Deep Packet Inspection (DPI) proxies are increasingly often used on industrial and enterprise networks to perform TLS unwrapping on all outbound connections. However, enabling TLS unwrapping requires local devices to have the DPI proxy Certificate Authority certificates installed. While for conventional computing devices this is addressed via enterprise management, it's a difficult problem for Internet of Things ("IoT") devices which are generally not under enterprise management, and may not even be capable of it due to their resource-constrained nature. Thus, for typical IoT devices, being installed on a network with DPI requires either manual device configuration or custom DPI proxy configuration, both of which solutions have significant shortcomings. This poses a serious challenge to the deployment of IoT devices on DPI-enabled intranets. The authors propose a solution to this problem: a method of installing on IoT devices the CA certificates for DPI proxy CAs, as well as other security configuration ("security bootstrapping"). The proposed solution respects the DPI policies, while allowing the commissioning of IoT and IIoT devices without the need for additional manual configuration either at device scope or at network scope. This is accomplished by performing the bootstrap operation over unsecured connection, and downloading certificates using TLS validation at application level. The resulting solution is light-weight and secure, yet does not require validation of the DPI proxy's CA certificates in order to perform the security bootstrapping, thus avoiding the chicken-and-egg problem inherent in using TLS on DPI-enabled intranets.
{"title":"Bootstrapping Security Configuration for IoT Devices on Networks with TLS Inspection","authors":"V. Danilchenko, Matthew S. Theobald, Daniel Cohen","doi":"10.1109/GCWkshps45667.2019.9024325","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024325","url":null,"abstract":"In the modern security-conscious world, Deep Packet Inspection (DPI) proxies are increasingly often used on industrial and enterprise networks to perform TLS unwrapping on all outbound connections. However, enabling TLS unwrapping requires local devices to have the DPI proxy Certificate Authority certificates installed. While for conventional computing devices this is addressed via enterprise management, it's a difficult problem for Internet of Things (\"IoT\") devices which are generally not under enterprise management, and may not even be capable of it due to their resource-constrained nature. Thus, for typical IoT devices, being installed on a network with DPI requires either manual device configuration or custom DPI proxy configuration, both of which solutions have significant shortcomings. This poses a serious challenge to the deployment of IoT devices on DPI-enabled intranets. The authors propose a solution to this problem: a method of installing on IoT devices the CA certificates for DPI proxy CAs, as well as other security configuration (\"security bootstrapping\"). The proposed solution respects the DPI policies, while allowing the commissioning of IoT and IIoT devices without the need for additional manual configuration either at device scope or at network scope. This is accomplished by performing the bootstrap operation over unsecured connection, and downloading certificates using TLS validation at application level. The resulting solution is light-weight and secure, yet does not require validation of the DPI proxy's CA certificates in order to perform the security bootstrapping, thus avoiding the chicken-and-egg problem inherent in using TLS on DPI-enabled intranets.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122182276","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024620
J. Felix, João Guerreiro, R. Dinis, P. Montezuma
MIMO-OFDM (Multi-Input, Multi-Output Orthogonal Frequency Division Multiplexing) signals are very prone to nonlinear distortion effects, which can lead to high irreducible error floors. This can be particularly serious when low-resolution quantizers are employed. In this paper we consider MIMO-OFDM schemes with low- resolution quantizers. It is shown that, although this leads to strong nonlinear distortion effects and very poor performance when conventional receivers are employed, this is not necessarily the case when optimum receivers are considered. Since the complexity of the optimum receiver for MIMO-OFDM is prohibitively high, we develop sub- optimum receivers with moderate complexity. It is shown that these receivers can have huge performance gains when the nonlinear distortion levels are high, eliminating irreducible error floors and even outperforming linear MIMO-OFDM schemes in some scenarios.
{"title":"Reduced-Complexity Quasi-Optimum Detection for MIMO-OFDM Signals with Strong Nonlinear Distortion","authors":"J. Felix, João Guerreiro, R. Dinis, P. Montezuma","doi":"10.1109/GCWkshps45667.2019.9024620","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024620","url":null,"abstract":"MIMO-OFDM (Multi-Input, Multi-Output Orthogonal Frequency Division Multiplexing) signals are very prone to nonlinear distortion effects, which can lead to high irreducible error floors. This can be particularly serious when low-resolution quantizers are employed. In this paper we consider MIMO-OFDM schemes with low- resolution quantizers. It is shown that, although this leads to strong nonlinear distortion effects and very poor performance when conventional receivers are employed, this is not necessarily the case when optimum receivers are considered. Since the complexity of the optimum receiver for MIMO-OFDM is prohibitively high, we develop sub- optimum receivers with moderate complexity. It is shown that these receivers can have huge performance gains when the nonlinear distortion levels are high, eliminating irreducible error floors and even outperforming linear MIMO-OFDM schemes in some scenarios.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131818706","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 : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024372
K. Yang, Bangning Zhang, D. Guo, Min Lin, Tomaso de Cola
The separation of the control plane from the data plane has made the novel paradigm, Software-Defined Networking (SDN), available in both small-scale and large-scale networks. Unlike small-scale networks with merely one controller for deployment, employing multiple controllers is essential to meet the requirements of reliability and scalability in Software- Defined WANs (SDWANs). However, the occurrence of the node or link failures in the control plane may severely deteriorate the system performance. Therefore, how to determine the number and locations of the distributed controllers in SDWANs for enhancing network reliability with propagation latency constraints worth in-depth study. In this paper, we formulate the controller placement problem in SDWANs mathematically and propose a heuristic algorithm with low computational complexity to address it. By incorporating the centroid-based network partition scheme, we further ameliorate the CPP for maximizing reliability with latency constraints. Experiments are performed on real network topologies to validate the effectiveness of our approach for controller placement problem in SDWANs.
{"title":"Partitioned Controller Placement in SDWANs for Reliability Maximization with Latency Constraints","authors":"K. Yang, Bangning Zhang, D. Guo, Min Lin, Tomaso de Cola","doi":"10.1109/GCWkshps45667.2019.9024372","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024372","url":null,"abstract":"The separation of the control plane from the data plane has made the novel paradigm, Software-Defined Networking (SDN), available in both small-scale and large-scale networks. Unlike small-scale networks with merely one controller for deployment, employing multiple controllers is essential to meet the requirements of reliability and scalability in Software- Defined WANs (SDWANs). However, the occurrence of the node or link failures in the control plane may severely deteriorate the system performance. Therefore, how to determine the number and locations of the distributed controllers in SDWANs for enhancing network reliability with propagation latency constraints worth in-depth study. In this paper, we formulate the controller placement problem in SDWANs mathematically and propose a heuristic algorithm with low computational complexity to address it. By incorporating the centroid-based network partition scheme, we further ameliorate the CPP for maximizing reliability with latency constraints. Experiments are performed on real network topologies to validate the effectiveness of our approach for controller placement problem in SDWANs.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131855199","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
扫码关注我们
求助内容：
应助结果提醒方式：