Pub Date : 2017-12-19DOI: 10.1109/SPAWC.2017.8227645
Ban-Sok Shin, H. Paul, M. Yukawa, A. Dekorsy
In this paper, we propose the use of multiple Gaussian kernels for distributed nonlinear regression or system identification tasks by a network of nodes. By employing multiple kernels in the estimation process we increase the degree of freedom and thus, the ability to reconstruct nonlinear functions. For this, we extend the so-called KDiCE algorithm, which allows a distributed regression of nonlinear functions but uses a single kernel only, to multiple kernels. We corroborate our proposed scheme by numerical evaluations for the reconstruction of nonlinear functions both static and time-varying. We achieve performance gains for both cases, in particular for the tracking of a time-varying nonlinear function.
{"title":"Distributed nonlinear regression using in-network processing with multiple Gaussian kernels","authors":"Ban-Sok Shin, H. Paul, M. Yukawa, A. Dekorsy","doi":"10.1109/SPAWC.2017.8227645","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227645","url":null,"abstract":"In this paper, we propose the use of multiple Gaussian kernels for distributed nonlinear regression or system identification tasks by a network of nodes. By employing multiple kernels in the estimation process we increase the degree of freedom and thus, the ability to reconstruct nonlinear functions. For this, we extend the so-called KDiCE algorithm, which allows a distributed regression of nonlinear functions but uses a single kernel only, to multiple kernels. We corroborate our proposed scheme by numerical evaluations for the reconstruction of nonlinear functions both static and time-varying. We achieve performance gains for both cases, in particular for the tracking of a time-varying nonlinear function.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134065415","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-07-06DOI: 10.1109/SPAWC.2017.8227770
Junyeong Seo, Y. Sung
In this paper, a new transceiver architecture for K-user multiple-input single-output (MISO) broadcast channels (BCs) based on linear and non-linear mixture reception is proposed as an alternative to conventional fully linear zero-forcing (ZF) downlink beamforming. In the new transceiver architecture, two closely-aligned users are paired as a group, and superposition coding and non-linear successive cancellation (SIC) reception based on Pareto-optimal design is applied to each closely-aligned two-user group, while ZF beamforming is maintained across roughly-orthogonal groups. Numerical results show that the proposed new architecture yields non-trivial gain over conventional full ZF beamforming by mitigating the performance degradation of full ZF beamforming caused by closely-aligned channel vectors.
{"title":"A new transceiver architecture for multi-user MIMO communication based on mixture of linear and non-linear reception","authors":"Junyeong Seo, Y. Sung","doi":"10.1109/SPAWC.2017.8227770","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227770","url":null,"abstract":"In this paper, a new transceiver architecture for K-user multiple-input single-output (MISO) broadcast channels (BCs) based on linear and non-linear mixture reception is proposed as an alternative to conventional fully linear zero-forcing (ZF) downlink beamforming. In the new transceiver architecture, two closely-aligned users are paired as a group, and superposition coding and non-linear successive cancellation (SIC) reception based on Pareto-optimal design is applied to each closely-aligned two-user group, while ZF beamforming is maintained across roughly-orthogonal groups. Numerical results show that the proposed new architecture yields non-trivial gain over conventional full ZF beamforming by mitigating the performance degradation of full ZF beamforming caused by closely-aligned channel vectors.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127096059","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-07-06DOI: 10.1109/SPAWC.2017.8227805
Heesu Kim, Hyungsik Han, Hyuncheol Park
Due to its spectral efficiency and well-localized spectrum, a quadrature amplitude modulation based filter-bank multi-carrier (QAM-FBMC) is considered as one of the candidate for 5G mobile communications. In this paper, we propose a novel waveform design for the QAM-FBMC system considering time dispersion parameter. The utilization of the proposed filter with the real number filter coefficients enables simpler implement than the conventional multiple prototype filters with complex coefficients. Simulation results show that the proposed QAM-FBMC systems has superior spectral efficiency as compared to CP-OFDM. Moreover, a new designed filter shows the improvement in the performance compared with the conventional QAM-FBMC systems on multipath fading channel.
{"title":"Waveform design for QAM-FBMC systems","authors":"Heesu Kim, Hyungsik Han, Hyuncheol Park","doi":"10.1109/SPAWC.2017.8227805","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227805","url":null,"abstract":"Due to its spectral efficiency and well-localized spectrum, a quadrature amplitude modulation based filter-bank multi-carrier (QAM-FBMC) is considered as one of the candidate for 5G mobile communications. In this paper, we propose a novel waveform design for the QAM-FBMC system considering time dispersion parameter. The utilization of the proposed filter with the real number filter coefficients enables simpler implement than the conventional multiple prototype filters with complex coefficients. Simulation results show that the proposed QAM-FBMC systems has superior spectral efficiency as compared to CP-OFDM. Moreover, a new designed filter shows the improvement in the performance compared with the conventional QAM-FBMC systems on multipath fading channel.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127359793","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-07-03DOI: 10.1109/SPAWC.2017.8227639
Qiliang Zhang, F. Gao, Qing Sun, Xiaobo Wang
Target detection in the presence of mainlobe jamming (MLJ) is a challenging task for radar signal processing. Spatial filtering techniques for MLJ cancellation on uniform linear array (ULA) have been proposed recently. However, the performance of these techniques degrades greatly when MLJ is located close to target. To solve this problem, we propose a sparse detection method on uniform distributed subarrays, which can achieve higher detection performance by arranging large subarray spacing. The detection result from a single time measurement will be ambiguous, which can be solved by Chinese reminder theory on the measurements under multiple co-prime carrier frequencies. Simulations are provided to corroborate the theoretical studies.
{"title":"Target detection with uniformly distributed subarrays in the presence of mainlobe jamming","authors":"Qiliang Zhang, F. Gao, Qing Sun, Xiaobo Wang","doi":"10.1109/SPAWC.2017.8227639","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227639","url":null,"abstract":"Target detection in the presence of mainlobe jamming (MLJ) is a challenging task for radar signal processing. Spatial filtering techniques for MLJ cancellation on uniform linear array (ULA) have been proposed recently. However, the performance of these techniques degrades greatly when MLJ is located close to target. To solve this problem, we propose a sparse detection method on uniform distributed subarrays, which can achieve higher detection performance by arranging large subarray spacing. The detection result from a single time measurement will be ambiguous, which can be solved by Chinese reminder theory on the measurements under multiple co-prime carrier frequencies. Simulations are provided to corroborate the theoretical studies.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127361835","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-07-03DOI: 10.1109/SPAWC.2017.8227637
Billy Kihei, J. Copeland, Yusun Chang
In this work, we present the fundamentals of a new sensing technique in Vehicle-to-Vehicle networks (V2V) called: Automotive Doppler Sensing (ADS), for providing road safety to connected drivers and connected autonomous vehicles by observing the Doppler profile. The Doppler profile displays the Doppler energy in the form of a high-resolution spectrogram which captures the non-line-of-sight (NLOS) reflections between stations. The Doppler profile can be analyzed in real-time for identifying vehicle dynamics as vehicles maneuver relative to each other. When machine learning is employed, the Doppler profile becomes a powerful new 360° “sensor” to provide both context awareness of the driving scenario and collision avoidance services. Experimental captures using real devices showcase the ADS capability to provide reliable awareness with high accuracy and few misclassifications in both line-of-sight (highways and surface streets) and NLOS (intersections) conditions.
{"title":"Automotive Doppler sensing: The Doppler profile with machine learning in vehicle-to-vehicle networks for road safety","authors":"Billy Kihei, J. Copeland, Yusun Chang","doi":"10.1109/SPAWC.2017.8227637","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227637","url":null,"abstract":"In this work, we present the fundamentals of a new sensing technique in Vehicle-to-Vehicle networks (V2V) called: Automotive Doppler Sensing (ADS), for providing road safety to connected drivers and connected autonomous vehicles by observing the Doppler profile. The Doppler profile displays the Doppler energy in the form of a high-resolution spectrogram which captures the non-line-of-sight (NLOS) reflections between stations. The Doppler profile can be analyzed in real-time for identifying vehicle dynamics as vehicles maneuver relative to each other. When machine learning is employed, the Doppler profile becomes a powerful new 360° “sensor” to provide both context awareness of the driving scenario and collision avoidance services. Experimental captures using real devices showcase the ADS capability to provide reliable awareness with high accuracy and few misclassifications in both line-of-sight (highways and surface streets) and NLOS (intersections) conditions.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126032767","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-07-03DOI: 10.1109/SPAWC.2017.8227704
Xiping Wu, H. Haas
As a promising complement to the increasingly congested wireless fidelity (WiFi) system, light fidelity (LiFi) has recently drawn massive attention due to the wide and unregulated visible light spectrum. Also, the light waves cannot penetrate walls which enables interference avoidance between compartments. Meanwhile, LiFi access points (APs) have a much shorter range, relative to WiFi APs. A hybrid network can combine the high-speed transmission of LiFi and the ubiquitous coverage of WiFi. For such a network, access point assignment (APA) becomes challenging because of the completely overlaying coverage of different networks. In addition, LiFi is susceptible to channel blockage due to opaque obstacles, adding difficulties to the APA issue. In this paper, a novel APA method is proposed for hybrid LiFi and WiFi networks in consideration of LiFi channel blockage for the first time. By exploiting users' statistical information of channel blockage, the proposed method formulates the issue as an optimisation problem that maximises the system throughput over a period of time. Results show that the proposed method can improve throughput by up to 90% over the conventional load balancing method.
{"title":"Access point assignment in hybrid LiFi and WiFi networks in consideration of LiFi channel blockage","authors":"Xiping Wu, H. Haas","doi":"10.1109/SPAWC.2017.8227704","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227704","url":null,"abstract":"As a promising complement to the increasingly congested wireless fidelity (WiFi) system, light fidelity (LiFi) has recently drawn massive attention due to the wide and unregulated visible light spectrum. Also, the light waves cannot penetrate walls which enables interference avoidance between compartments. Meanwhile, LiFi access points (APs) have a much shorter range, relative to WiFi APs. A hybrid network can combine the high-speed transmission of LiFi and the ubiquitous coverage of WiFi. For such a network, access point assignment (APA) becomes challenging because of the completely overlaying coverage of different networks. In addition, LiFi is susceptible to channel blockage due to opaque obstacles, adding difficulties to the APA issue. In this paper, a novel APA method is proposed for hybrid LiFi and WiFi networks in consideration of LiFi channel blockage for the first time. By exploiting users' statistical information of channel blockage, the proposed method formulates the issue as an optimisation problem that maximises the system throughput over a period of time. Results show that the proposed method can improve throughput by up to 90% over the conventional load balancing method.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114069868","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-07-03DOI: 10.1109/SPAWC.2017.8227654
K. Takeuchi, Chao-Kai Wen
This paper investigates iterative detection based on expectation propagation (EP) in overloaded multiple-input multiple-output systems. The conjugate gradient (CG) method is utilized to reduce the per-iteration complexity of EP detection. Under the assumption of unitarily invariant channel matrices, the dynamics of EP detection based on the CG method (EP-CG) is analyzed in the large system limit, where the transmit and receive dimensions tend to infinity at an identical rate. The main result is a rigorous derivation of state evolution for EP-CG.
{"title":"Rigorous dynamics of expectation-propagation signal detection via the conjugate gradient method","authors":"K. Takeuchi, Chao-Kai Wen","doi":"10.1109/SPAWC.2017.8227654","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227654","url":null,"abstract":"This paper investigates iterative detection based on expectation propagation (EP) in overloaded multiple-input multiple-output systems. The conjugate gradient (CG) method is utilized to reduce the per-iteration complexity of EP detection. Under the assumption of unitarily invariant channel matrices, the dynamics of EP detection based on the CG method (EP-CG) is analyzed in the large system limit, where the transmit and receive dimensions tend to infinity at an identical rate. The main result is a rigorous derivation of state evolution for EP-CG.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127389251","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-07-03DOI: 10.1109/SPAWC.2017.8227754
Malcolm Egan, J. Gorce, L. Cardoso
Fast initialization of cognitive radio systems is a key problem in a variety of wireless communication systems, particularly for public safety organizations in emergency crises. In the initialization problem, the goal is to rapidly identify an unoccupied frequency band. In this paper, we formalize the initialization problem within the framework of active hypothesis testing. We characterize the optimal scanning policy in the case of at most one free band and show that the policy is computationally challenging. Motivated by this challenge for the implementation of the optimal policy and the need to cope with an unknown number of interferers larger than one, we propose the constrained DGF algorithm. We show that for strict constraints on the maximum number of observations, the constrained DGF algorithm can outperform the error probability of the state-of-the-art C-SPRT algorithm by an order of magnitude, for comparable average delays.
{"title":"Fast initialization of cognitive radio systems","authors":"Malcolm Egan, J. Gorce, L. Cardoso","doi":"10.1109/SPAWC.2017.8227754","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227754","url":null,"abstract":"Fast initialization of cognitive radio systems is a key problem in a variety of wireless communication systems, particularly for public safety organizations in emergency crises. In the initialization problem, the goal is to rapidly identify an unoccupied frequency band. In this paper, we formalize the initialization problem within the framework of active hypothesis testing. We characterize the optimal scanning policy in the case of at most one free band and show that the policy is computationally challenging. Motivated by this challenge for the implementation of the optimal policy and the need to cope with an unknown number of interferers larger than one, we propose the constrained DGF algorithm. We show that for strict constraints on the maximum number of observations, the constrained DGF algorithm can outperform the error probability of the state-of-the-art C-SPRT algorithm by an order of magnitude, for comparable average delays.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117109498","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-07-03DOI: 10.1109/SPAWC.2017.8227677
Wei Huang, Wei Chen, H. Poor
Proactively pushing content to users has emerged as a promising way of coping with the explosively growing traffic demand of next-generation mobile networks. However, it is still unclear whether content pushing can improve the energy efficiency of hard delay-constrained communications over additive white Gaussian noise (AWGN) channels. With pushing, the energy consumption can be reduced by increasing the available transmission time. But if the user never needs the pushed content, pushing may result in wasted energy. Based on the random content request delay, this paper derives the content request probability threshold that determines whether a content file should be pushed under the hard delay constraint. Moreover, an optimal strategy to allocate transmission power in content pushing and on-demand delivery phases is also proposed. It is shown that the energy efficiency of systems with pushing can be significantly improved as the content request probability increases. Numerical results validate the effectiveness of the proposed power allocation strategy, compared with the on-demand scheme.
{"title":"User request prediction increases energy efficiency in AWGN channels : (Invited paper)","authors":"Wei Huang, Wei Chen, H. Poor","doi":"10.1109/SPAWC.2017.8227677","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227677","url":null,"abstract":"Proactively pushing content to users has emerged as a promising way of coping with the explosively growing traffic demand of next-generation mobile networks. However, it is still unclear whether content pushing can improve the energy efficiency of hard delay-constrained communications over additive white Gaussian noise (AWGN) channels. With pushing, the energy consumption can be reduced by increasing the available transmission time. But if the user never needs the pushed content, pushing may result in wasted energy. Based on the random content request delay, this paper derives the content request probability threshold that determines whether a content file should be pushed under the hard delay constraint. Moreover, an optimal strategy to allocate transmission power in content pushing and on-demand delivery phases is also proposed. It is shown that the energy efficiency of systems with pushing can be significantly improved as the content request probability increases. Numerical results validate the effectiveness of the proposed power allocation strategy, compared with the on-demand scheme.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116912593","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-07-03DOI: 10.1109/SPAWC.2017.8227649
A. Munari, Federico Clazzer, P. Mähönen
Graph-based random access protocols have emerged as an efficient solution to tackle the medium sharing problem for machine type communications. Their remarkable performance is well-understood for scenarios in which devices communicate with a one-hop receiver devoted to collecting packets. Many practical applications, however, foresee the receiver to also act as sender towards a second-hop terminal. Under a half-duplex operation constraint, the two tasks would typically be fulfilled by means of time sharing, triggering a tradeoff between the amount of collected and transmitted traffic at the intermediate node. In this perspective, the recent rise of effective self-interference cancellation techniques poses the intriguing question of whether and how much a full-duplex receiver could improve performance in such a setting. To cast light on the issue, we refine the asymptotic analysis of successive interference cancellation procedures at the receiver of a graph-based random access scheme. In doing so, we account for the degradation in decoding probability due to residual self-interference when operating in full-duplex mode, and derive a tight lower bound to the achievable packet loss rate. We then analyse the throughput as a function of some key parameters that drive the system, identifying relevant tradeoffs and design hints.
{"title":"On the performance of a full-duplex receiver for graph-based random access schemes","authors":"A. Munari, Federico Clazzer, P. Mähönen","doi":"10.1109/SPAWC.2017.8227649","DOIUrl":"https://doi.org/10.1109/SPAWC.2017.8227649","url":null,"abstract":"Graph-based random access protocols have emerged as an efficient solution to tackle the medium sharing problem for machine type communications. Their remarkable performance is well-understood for scenarios in which devices communicate with a one-hop receiver devoted to collecting packets. Many practical applications, however, foresee the receiver to also act as sender towards a second-hop terminal. Under a half-duplex operation constraint, the two tasks would typically be fulfilled by means of time sharing, triggering a tradeoff between the amount of collected and transmitted traffic at the intermediate node. In this perspective, the recent rise of effective self-interference cancellation techniques poses the intriguing question of whether and how much a full-duplex receiver could improve performance in such a setting. To cast light on the issue, we refine the asymptotic analysis of successive interference cancellation procedures at the receiver of a graph-based random access scheme. In doing so, we account for the degradation in decoding probability due to residual self-interference when operating in full-duplex mode, and derive a tight lower bound to the achievable packet loss rate. We then analyse the throughput as a function of some key parameters that drive the system, identifying relevant tradeoffs and design hints.","PeriodicalId":295488,"journal":{"name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123511151","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
扫码关注我们
求助内容：
应助结果提醒方式：