Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933495
J. Coon
We present an analysis of the probability that a set of devices capable of communicating wirelessly can form a fully connected, trusted network. The network model that is used accounts for the geometric properties of the physical network boundaries, the statistical nature of the propagation environment, and the notion that both trustworthy and untrustworthy devices may occupy the network domain. Two local (pairwise) trust models are explored in the context of this model: proximity-based trust, where trust between two devices is a function of the distance between them, and experience-based trust, where trust is dependent upon the outcomes from prior inter-device interactions. Both models are probabilistic, a condition that is motivated by our interest in the steady state or average behaviour of the network as well as several practical applications, including sensor and device-to-device (D2D) networks for disaster relief, public safety, and peer-to-peer file sharing in 5G cellular systems. Our analysis illustrates a clear and simple mathematical relationship between the local trust probabilities and the underlying physics of the system, thus pointing to a need for trust protocols that are tailored to specific deployments.
{"title":"Modelling trust in random wireless networks","authors":"J. Coon","doi":"10.1109/ISWCS.2014.6933495","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933495","url":null,"abstract":"We present an analysis of the probability that a set of devices capable of communicating wirelessly can form a fully connected, trusted network. The network model that is used accounts for the geometric properties of the physical network boundaries, the statistical nature of the propagation environment, and the notion that both trustworthy and untrustworthy devices may occupy the network domain. Two local (pairwise) trust models are explored in the context of this model: proximity-based trust, where trust between two devices is a function of the distance between them, and experience-based trust, where trust is dependent upon the outcomes from prior inter-device interactions. Both models are probabilistic, a condition that is motivated by our interest in the steady state or average behaviour of the network as well as several practical applications, including sensor and device-to-device (D2D) networks for disaster relief, public safety, and peer-to-peer file sharing in 5G cellular systems. Our analysis illustrates a clear and simple mathematical relationship between the local trust probabilities and the underlying physics of the system, thus pointing to a need for trust protocols that are tailored to specific deployments.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116957634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933317
A. Kühne, Adrian Loch, Thomas Nitsche, J. Widmer, M. Hollick, A. Klein
The K user interference alignment scheme with symbol extensions proposed by Cadambe and Jafar achieves K/2 degree of freedom in theory for high signal-to-noise ratios (SNRs). However, lower SNR ranges appear in many practical scenarios. Thus, further improvements of the Cadambe-Jafar scheme are demanded to enable interference alignment in more realistic settings. In this work, we propose a new precoding vector optimization that improves bit error rates (BER) using zero-forcing at the receivers. Furthermore, we compare and combine our approach with existing performance enhancement techniques for interference alignment such as orthonormalizing the precoding matrices or using lattice decoding instead of zero-forcing at the receiver. Finally, we implement interference alignment with symbol extension in the frequency domain along with the presented BER enhancement techniques on a software defined radio platform to validate our approaches. Both simulation results and testbed measurements show significant BER improvements for different M-QAM schemes compared to the original interference alignment mechanism. Moreover, our precoding optimization scheme based on zero-forcing outperforms lattice decoding in practical systems due to its lower sensitivity to real-world effects.
{"title":"BER enhancements for practical interference alignment in the frequency domain","authors":"A. Kühne, Adrian Loch, Thomas Nitsche, J. Widmer, M. Hollick, A. Klein","doi":"10.1109/ISWCS.2014.6933317","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933317","url":null,"abstract":"The K user interference alignment scheme with symbol extensions proposed by Cadambe and Jafar achieves K/2 degree of freedom in theory for high signal-to-noise ratios (SNRs). However, lower SNR ranges appear in many practical scenarios. Thus, further improvements of the Cadambe-Jafar scheme are demanded to enable interference alignment in more realistic settings. In this work, we propose a new precoding vector optimization that improves bit error rates (BER) using zero-forcing at the receivers. Furthermore, we compare and combine our approach with existing performance enhancement techniques for interference alignment such as orthonormalizing the precoding matrices or using lattice decoding instead of zero-forcing at the receiver. Finally, we implement interference alignment with symbol extension in the frequency domain along with the presented BER enhancement techniques on a software defined radio platform to validate our approaches. Both simulation results and testbed measurements show significant BER improvements for different M-QAM schemes compared to the original interference alignment mechanism. Moreover, our precoding optimization scheme based on zero-forcing outperforms lattice decoding in practical systems due to its lower sensitivity to real-world effects.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122510056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933369
Wassim Alexan, A. El-Mahdy
In this paper, we propose a relay selection method for cooperative communication systems (CCS) employing the QPSK modulation scheme. The relay nodes forward their reliability to the destination node, utilizing a quantized reliability-relaying (QRR) scheme. The reliability is divided into five different levels by the relay nodes, according to the log-likelihood ratio (LLR) value of the received signal from the source node. Then, a suitable symbol is forwarded to the destination node if the relay node is set as active. A relay node is set as active if the reliability of the received signal is beyond a certain threshold. We provide analysis of the LLR for QPSK and carry out numerical simulations comparing the bit error rate (BER) of the QRR method against regular decode-and-forward (DF) and the best relay selection algorithms. A channel estimation algorithm is utilized to evaluate the performance of the system, as well as calculations of the normalized mean squared error (NMSE) of the channels. The special case of a system employing BPSK is also investigated.
{"title":"A quantized reliability-relay selection method for wireless cooperative communications","authors":"Wassim Alexan, A. El-Mahdy","doi":"10.1109/ISWCS.2014.6933369","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933369","url":null,"abstract":"In this paper, we propose a relay selection method for cooperative communication systems (CCS) employing the QPSK modulation scheme. The relay nodes forward their reliability to the destination node, utilizing a quantized reliability-relaying (QRR) scheme. The reliability is divided into five different levels by the relay nodes, according to the log-likelihood ratio (LLR) value of the received signal from the source node. Then, a suitable symbol is forwarded to the destination node if the relay node is set as active. A relay node is set as active if the reliability of the received signal is beyond a certain threshold. We provide analysis of the LLR for QPSK and carry out numerical simulations comparing the bit error rate (BER) of the QRR method against regular decode-and-forward (DF) and the best relay selection algorithms. A channel estimation algorithm is utilized to evaluate the performance of the system, as well as calculations of the normalized mean squared error (NMSE) of the channels. The special case of a system employing BPSK is also investigated.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123851929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933484
A. Sengupta, Saidhiraj Amuru, R. Tandon, R. Buehrer, T. Clancy
Caching has emerged as a vital tool in modern communication systems for reducing peak data rates by allowing popular files to be pre-fetched and stored locally at end users' devices. With the shift in paradigm from homogeneous cellular networks to the heterogeneous ones, the concept of data offloading to small cell base stations (sBS) has garnered significant attention. Caching at these small cell base stations has recently been proposed, where popular files are pre-fetched and stored locally in order to avoid bottlenecks in the limited capacity backhaul connection link to the core network. In this paper, we study distributed caching strategies in such a heterogeneous small cell wireless network from a reinforcement learning perspective. Using state of the art results, it can be shown that the optimal joint cache content placement in the sBSs turns out to be a NP-hard problem even when the sBS's are aware of the popularity profile of the files that are to be cached. To address this problem, we propose a coded caching framework, where the sBSs learn the popularity profile of the files (based on their demand history) via a combinatorial multi-armed bandit framework. The sBSs then pre-fetch segments of the Fountain-encoded versions of the popular files at regular intervals to serve users' requests. We show that the proposed coded caching framework can be modeled as a linear program that takes into account the network connectivity and thereby jointly designs the caching strategies. Numerical results are presented to show the benefits of the joint coded caching technique over naive decentralized cache placement strategies.
{"title":"Learning distributed caching strategies in small cell networks","authors":"A. Sengupta, Saidhiraj Amuru, R. Tandon, R. Buehrer, T. Clancy","doi":"10.1109/ISWCS.2014.6933484","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933484","url":null,"abstract":"Caching has emerged as a vital tool in modern communication systems for reducing peak data rates by allowing popular files to be pre-fetched and stored locally at end users' devices. With the shift in paradigm from homogeneous cellular networks to the heterogeneous ones, the concept of data offloading to small cell base stations (sBS) has garnered significant attention. Caching at these small cell base stations has recently been proposed, where popular files are pre-fetched and stored locally in order to avoid bottlenecks in the limited capacity backhaul connection link to the core network. In this paper, we study distributed caching strategies in such a heterogeneous small cell wireless network from a reinforcement learning perspective. Using state of the art results, it can be shown that the optimal joint cache content placement in the sBSs turns out to be a NP-hard problem even when the sBS's are aware of the popularity profile of the files that are to be cached. To address this problem, we propose a coded caching framework, where the sBSs learn the popularity profile of the files (based on their demand history) via a combinatorial multi-armed bandit framework. The sBSs then pre-fetch segments of the Fountain-encoded versions of the popular files at regular intervals to serve users' requests. We show that the proposed coded caching framework can be modeled as a linear program that takes into account the network connectivity and thereby jointly designs the caching strategies. Numerical results are presented to show the benefits of the joint coded caching technique over naive decentralized cache placement strategies.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129537292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933309
S. Schedler, V. Kühn
In wireless communications, beamforming can be exploited to reduce the power consumption considerably. If multiple relay terminals are available, distributed beamforming might be an appropriate transmission scheme. However, due to individual power constraints for all of the relays, the classical beamforming solution can no longer be used to allocate transmit power. Within this paper, closed form expressions for the optimal Power Allocation (PA) at source and regenerative relays are provided as well as an iterative algorithm to identify relay nodes that have to transmit at full power. Furthermore, numerical results will be presented for comparison to alternative relaying strategies, such as single Relay Selection (RS) and distributed Space Time Block Code (STBC). The proposed solution outperforms all the alternative approaches in terms of power consumption as well as outage probability.
{"title":"Resource allocation for distributed beamforming with multiple relays and individual power constraints","authors":"S. Schedler, V. Kühn","doi":"10.1109/ISWCS.2014.6933309","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933309","url":null,"abstract":"In wireless communications, beamforming can be exploited to reduce the power consumption considerably. If multiple relay terminals are available, distributed beamforming might be an appropriate transmission scheme. However, due to individual power constraints for all of the relays, the classical beamforming solution can no longer be used to allocate transmit power. Within this paper, closed form expressions for the optimal Power Allocation (PA) at source and regenerative relays are provided as well as an iterative algorithm to identify relay nodes that have to transmit at full power. Furthermore, numerical results will be presented for comparison to alternative relaying strategies, such as single Relay Selection (RS) and distributed Space Time Block Code (STBC). The proposed solution outperforms all the alternative approaches in terms of power consumption as well as outage probability.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129580680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933330
A. M. Ghaleb, E. Yaacoub, A. Abdulkafi
Efficient resource utilization is of a high importance for LTE/LTE-A network performance and provisioning of user quality of experience. The eNodeB (LTE base station) is responsible for controlling the radio resources between the user and LTE /LTE-A network. The resources can be scheduled in two schemes; either independently or jointly by considering both uplink (UL) and downlink (DL) together. Joint scheduling is an attractive approach for resource utilization and for providing better Quality of Service (QoS), but it adds some computational complexity to the system. This paper aims to provide QoS-aware joint UL-DL scheduling for LTE-A utilizing the functionality of carrier aggregation. The scheme presented enforces the fair sharing of the resources between the UL and DL channels while maintaining good QoS. The work is based on simulation using the MATLAB-based IS-Wireless system level simulator. The key contributions of this work lie in addressing both the joint scheduling and the carrier aggregations while considering the QoS and traffic conditions of the users.
{"title":"QoS-aware joint uplink-downlink scheduling in FDD LTE-Advanced with carrier aggregation","authors":"A. M. Ghaleb, E. Yaacoub, A. Abdulkafi","doi":"10.1109/ISWCS.2014.6933330","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933330","url":null,"abstract":"Efficient resource utilization is of a high importance for LTE/LTE-A network performance and provisioning of user quality of experience. The eNodeB (LTE base station) is responsible for controlling the radio resources between the user and LTE /LTE-A network. The resources can be scheduled in two schemes; either independently or jointly by considering both uplink (UL) and downlink (DL) together. Joint scheduling is an attractive approach for resource utilization and for providing better Quality of Service (QoS), but it adds some computational complexity to the system. This paper aims to provide QoS-aware joint UL-DL scheduling for LTE-A utilizing the functionality of carrier aggregation. The scheme presented enforces the fair sharing of the resources between the UL and DL channels while maintaining good QoS. The work is based on simulation using the MATLAB-based IS-Wireless system level simulator. The key contributions of this work lie in addressing both the joint scheduling and the carrier aggregations while considering the QoS and traffic conditions of the users.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121919255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933347
F. Schaich, T. Wild
5G wireless systems may benefit by waveforms supporting relaxed synchronization, as this enables reduced energy consumption, better support of low-end devices and reduction of signaling overhead. In this paper we evaluate UFMC (Universal Filtered Multi-Carrier), also known as UF-OFDM (universal filtered OFDM) - the recently appeared waveform option for 5G - with respect to its performance in scenarios with relaxed synchronization. Both carrier frequency offset, e.g. due to low-cost oscillators used in low-end devices, and relative fractional delay, e.g. due to the absence of an energy consuming closed-loop ranging mechanism, is considered. We introduce a concept called autonomous timing advance (ATA) improving the overall system performance. With ATA the system can operate purely based on open-loop synchronization. For comparing UFMC with CP-OFDM, we evaluate the mean squared error (MSE) in the receiver after frequency conversion. With applying a limit regarding the tolerable amount of distortion, we calculate the supported link distance for a system applying either UFMC or CP-OFDM for LTE-like settings. With applying UFMC, higher link distances are supported than with CP-OFDM, if the system applies open-loop synchronization.
{"title":"Relaxed synchronization support of universal filtered multi-carrier including autonomous timing advance","authors":"F. Schaich, T. Wild","doi":"10.1109/ISWCS.2014.6933347","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933347","url":null,"abstract":"5G wireless systems may benefit by waveforms supporting relaxed synchronization, as this enables reduced energy consumption, better support of low-end devices and reduction of signaling overhead. In this paper we evaluate UFMC (Universal Filtered Multi-Carrier), also known as UF-OFDM (universal filtered OFDM) - the recently appeared waveform option for 5G - with respect to its performance in scenarios with relaxed synchronization. Both carrier frequency offset, e.g. due to low-cost oscillators used in low-end devices, and relative fractional delay, e.g. due to the absence of an energy consuming closed-loop ranging mechanism, is considered. We introduce a concept called autonomous timing advance (ATA) improving the overall system performance. With ATA the system can operate purely based on open-loop synchronization. For comparing UFMC with CP-OFDM, we evaluate the mean squared error (MSE) in the receiver after frequency conversion. With applying a limit regarding the tolerable amount of distortion, we calculate the supported link distance for a system applying either UFMC or CP-OFDM for LTE-like settings. With applying UFMC, higher link distances are supported than with CP-OFDM, if the system applies open-loop synchronization.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121971615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933449
F. D. Rosa, T. Paakki, J. Nurmi, M. Pelosi, Gianluca Della Rosa
In this paper we present experimental evaluations of cooperative ranging-based approaches in mobile positioning. Our main contribution is represented by experimental investigations of the errors introduced by the hand-grip effect on cooperative schemes among peer devices, demonstrating that by knowing in real-time the particular orientation of the MS in a controlled experimental environment, it is possible to mitigate and filter out the effect of the hand-grip on RSS measurements and consequently to maintain the beneficial effect of the cooperation in the final position estimation.
{"title":"Hand-grip impact on range-based cooperative positioning","authors":"F. D. Rosa, T. Paakki, J. Nurmi, M. Pelosi, Gianluca Della Rosa","doi":"10.1109/ISWCS.2014.6933449","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933449","url":null,"abstract":"In this paper we present experimental evaluations of cooperative ranging-based approaches in mobile positioning. Our main contribution is represented by experimental investigations of the errors introduced by the hand-grip effect on cooperative schemes among peer devices, demonstrating that by knowing in real-time the particular orientation of the MS in a controlled experimental environment, it is possible to mitigate and filter out the effect of the hand-grip on RSS measurements and consequently to maintain the beneficial effect of the cooperation in the final position estimation.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933432
Y. Medjahdi, M. Terré, D. L. Ruyet, D. Roviras
The performances of multicarrier techniques in a spectrum coexistence context are commonly investigated using the power spectral density (PSD) of the coexisting systems' signals. However due to many factors, the PSD approach does not lead to accurate results. Recently, a useful tool called "instantaneous interference tables" has been proposed as an alternative to the PSD-based method leading to more accurate evaluation. This paper investigates the accuracy of the performance evaluation when the interference modeling is based on the PSD of the transmitted signals. With this aim in mind, two multicarrier schemes are examined: cyclic prefix based orthogonal frequency division multiplexing (CP-OFDM) with a rectangular pulse shape and filter bank based multicarrier (FBMC) with PHYDYAS and IOTA waveforms.
{"title":"On the accuracy of PSD-based interference modeling of asynchronous OFDM/FBMC in spectrum coexistence context","authors":"Y. Medjahdi, M. Terré, D. L. Ruyet, D. Roviras","doi":"10.1109/ISWCS.2014.6933432","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933432","url":null,"abstract":"The performances of multicarrier techniques in a spectrum coexistence context are commonly investigated using the power spectral density (PSD) of the coexisting systems' signals. However due to many factors, the PSD approach does not lead to accurate results. Recently, a useful tool called \"instantaneous interference tables\" has been proposed as an alternative to the PSD-based method leading to more accurate evaluation. This paper investigates the accuracy of the performance evaluation when the interference modeling is based on the PSD of the transmitted signals. With this aim in mind, two multicarrier schemes are examined: cyclic prefix based orthogonal frequency division multiplexing (CP-OFDM) with a rectangular pulse shape and filter bank based multicarrier (FBMC) with PHYDYAS and IOTA waveforms.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114918083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933453
Hadi Noureddine, Honggang Zhang, J. Palicot
Received signal strength (RSS) metric has been attracting a lot of interest in localization in wireless systems since it is available by default. However, this metric is affected by a shadowing phenomenon that highly degrades the localization accuracy. In this paper, we show that the RSS can be exploited for performing a clustering operation and finding the groups of geographically nearby mobile terminals. We propose a localization solution that does not directly estimate the position from the RSS, but instead performs clustering, and then computes the position of a mobile terminal as a function of the available positions of other mobile terminals belonging to its cluster. We solve the clustering problem by means of a non-parametric technique. We also treat the problems of removing the clutter that corresponds to spatially isolated mobile terminals and filling the missingness in the RSS vectors. Simulations illustrate the performance of the proposed solution in a macro cellular deployment scenario.
{"title":"RSS-based clustering of mobile terminals for localization in wireless networks","authors":"Hadi Noureddine, Honggang Zhang, J. Palicot","doi":"10.1109/ISWCS.2014.6933453","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933453","url":null,"abstract":"Received signal strength (RSS) metric has been attracting a lot of interest in localization in wireless systems since it is available by default. However, this metric is affected by a shadowing phenomenon that highly degrades the localization accuracy. In this paper, we show that the RSS can be exploited for performing a clustering operation and finding the groups of geographically nearby mobile terminals. We propose a localization solution that does not directly estimate the position from the RSS, but instead performs clustering, and then computes the position of a mobile terminal as a function of the available positions of other mobile terminals belonging to its cluster. We solve the clustering problem by means of a non-parametric technique. We also treat the problems of removing the clutter that corresponds to spatially isolated mobile terminals and filling the missingness in the RSS vectors. Simulations illustrate the performance of the proposed solution in a macro cellular deployment scenario.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133579013","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
扫码关注我们
求助内容：
应助结果提醒方式：