Pub Date : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683131
Zhuo Sun, M. Karimi, Deng Pan, Zhenyu Yang, N. Pissinou
A parallel packet switch (PPS) provides huge aggregate bandwidth by combining the capacities of multiple switching fabrics. Most existing PPSs use output queued switches as the switching fabrics, which require speedup and result in high implementation cost. In this paper, we present a buffered crossbar based parallel packet switch (BCB- PPS), whose switching fabrics need no speedup. We propose the Batch-WF2Q algorithm to dispatch packets to the parallel switching fabrics, and leverage the sMUX algorithm in to schedule packet transmission for the switching fabrics. Such a design enables a simple round-robin algorithm to efficiently collect packets from the switching fabrics. In addition, our design requires no packet resequencing, and thus needs no buffers at either external or internal outputs. We show that BCB-PPS has tight delay guarantees and bounded buffer sizes. Finally, we present simulation data to verify the analytical results and to evaluate the performance of our design.
{"title":"Buffered Crossbar Based Parallel Packet Switch","authors":"Zhuo Sun, M. Karimi, Deng Pan, Zhenyu Yang, N. Pissinou","doi":"10.1109/GLOCOM.2010.5683131","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683131","url":null,"abstract":"A parallel packet switch (PPS) provides huge aggregate bandwidth by combining the capacities of multiple switching fabrics. Most existing PPSs use output queued switches as the switching fabrics, which require speedup and result in high implementation cost. In this paper, we present a buffered crossbar based parallel packet switch (BCB- PPS), whose switching fabrics need no speedup. We propose the Batch-WF2Q algorithm to dispatch packets to the parallel switching fabrics, and leverage the sMUX algorithm in to schedule packet transmission for the switching fabrics. Such a design enables a simple round-robin algorithm to efficiently collect packets from the switching fabrics. In addition, our design requires no packet resequencing, and thus needs no buffers at either external or internal outputs. We show that BCB-PPS has tight delay guarantees and bounded buffer sizes. Finally, we present simulation data to verify the analytical results and to evaluate the performance of our design.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"169 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80123639","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683609
L. Le
In recent years, multi-channel MACs have attracted considerable attention in wireless networking research. Motivation for research into multi-channel MACs is their potential to increase the capacity of wireless ad hoc networks by exploiting multiple orthogonal frequency bands. This potential has been confirmed by several simulation studies that reported promising results for multi-channel MACs. However, the analytical performance of these protocols is not well understood. In this work, we present an analytical framework for modeling the performance multi-channel MACs in multi-hop networks. We employ our framework to investigate the performance of three representative multi channel MACs: Asynchronous Multichannel Coordination Protocol (AMCP), Multi-Channel MAC (MMAC), and Slotted Seeded Channel Hopping (SSCH). The important findings of our analysis are: (1) SSCH outperforms AMCP and MMAC in both 802.11b and 802.11a scenario, (2) AMCP performs worse than MMAC in 802.11b because the overhead of AMCP's control channel is higher than that of MMAC's control interval, and (3) the overhead of AMCP's control channel becomes negligible in an 802.11a scenario and is outweighed by that of MMAC's control interval. For this reason, AMCP delivers better performance than MMAC in 802.11a scenario.
{"title":"Performance Analysis of Multi-Channel MAC Protocols in Multi-Hop Ad Hoc Networks","authors":"L. Le","doi":"10.1109/GLOCOM.2010.5683609","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683609","url":null,"abstract":"In recent years, multi-channel MACs have attracted considerable attention in wireless networking research. Motivation for research into multi-channel MACs is their potential to increase the capacity of wireless ad hoc networks by exploiting multiple orthogonal frequency bands. This potential has been confirmed by several simulation studies that reported promising results for multi-channel MACs. However, the analytical performance of these protocols is not well understood. In this work, we present an analytical framework for modeling the performance multi-channel MACs in multi-hop networks. We employ our framework to investigate the performance of three representative multi channel MACs: Asynchronous Multichannel Coordination Protocol (AMCP), Multi-Channel MAC (MMAC), and Slotted Seeded Channel Hopping (SSCH). The important findings of our analysis are: (1) SSCH outperforms AMCP and MMAC in both 802.11b and 802.11a scenario, (2) AMCP performs worse than MMAC in 802.11b because the overhead of AMCP's control channel is higher than that of MMAC's control interval, and (3) the overhead of AMCP's control channel becomes negligible in an 802.11a scenario and is outweighed by that of MMAC's control interval. For this reason, AMCP delivers better performance than MMAC in 802.11a scenario.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"41 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80408742","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5684154
Hyungjoo Lee, Jeongcheol Lee, Sang-Ha Kim, Sungkee Noh
In many applications of Wireless Sensor Networks (WSNs), the sensing data are disseminated from a source to multiple mobile sinks. Since WSNs consists of a number of sensor nodes with limited capabilities, previous studies mainly discuss on how to send the data efficiently and do not consider the group mobility of mobile sinks that move together staying closely and randomly move within a geographically restricted region. Although the existing multicasting protocols could be applied, they suffer from high congestion and control overhead due to location updates by individual mobile sinks. Geocasting protocols are effective for data delivery to a sink group within a restricted region, but do not guarantee since they only focus on transmitting data to all nodes within a stationary region. Therefore, we propose Region Based Data Dissemination (RBDD) scheme to address these problems. RBDD provides efficient data dissemination scheme for mobile sink groups, so it guarantees data transmission when a sink group does not only move as a whole, but its member sinks also move inside of the region or outside of it. Simulation results show that RBDD guarantees data delivery to a mobile sink group.
{"title":"Region Based Data Dissemination Scheme for Mobile Sink Groups in Wireless Sensor Networks","authors":"Hyungjoo Lee, Jeongcheol Lee, Sang-Ha Kim, Sungkee Noh","doi":"10.1109/GLOCOM.2010.5684154","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684154","url":null,"abstract":"In many applications of Wireless Sensor Networks (WSNs), the sensing data are disseminated from a source to multiple mobile sinks. Since WSNs consists of a number of sensor nodes with limited capabilities, previous studies mainly discuss on how to send the data efficiently and do not consider the group mobility of mobile sinks that move together staying closely and randomly move within a geographically restricted region. Although the existing multicasting protocols could be applied, they suffer from high congestion and control overhead due to location updates by individual mobile sinks. Geocasting protocols are effective for data delivery to a sink group within a restricted region, but do not guarantee since they only focus on transmitting data to all nodes within a stationary region. Therefore, we propose Region Based Data Dissemination (RBDD) scheme to address these problems. RBDD provides efficient data dissemination scheme for mobile sink groups, so it guarantees data transmission when a sink group does not only move as a whole, but its member sinks also move inside of the region or outside of it. Simulation results show that RBDD guarantees data delivery to a mobile sink group.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"63 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80500394","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5685219
Abhishek Bhattacharya, Zhenyu Yang, Deng Pan
Various distributed multi-source applications such as 3D Virtual Immersive Systems (3DVIS), 2D/3D Videoconferencing, Multi-party games, etc. require the construction of a multicast overlay through which the video blocks are streamed from source to receiver. The most general multicast model involves a single source and a set of receiver nodes also known as multicast set with a single stream to each receiver. In this paper, we are interested to investigate a different multicast model consisting of multiple sources and receivers which is quite common in 3DVIS/video conferencing applications where each node serves both as a source and a receiver. The problem of constructing a multicast overlay for multi-source is hard and we are interested to guarantee certain QoS constraints such as end-to-end latency and latency variations. Latency variation constraints are very important in collaborative applications for maintaining realtime interactivity and multi-stream synchronization. We present an efficient heuristic solution for the muti-source multicast construction problem with an economical time-complexity.
{"title":"Multi-Source Latency Variation Synchronization for Collaborative Applications","authors":"Abhishek Bhattacharya, Zhenyu Yang, Deng Pan","doi":"10.1109/GLOCOM.2010.5685219","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5685219","url":null,"abstract":"Various distributed multi-source applications such as 3D Virtual Immersive Systems (3DVIS), 2D/3D Videoconferencing, Multi-party games, etc. require the construction of a multicast overlay through which the video blocks are streamed from source to receiver. The most general multicast model involves a single source and a set of receiver nodes also known as multicast set with a single stream to each receiver. In this paper, we are interested to investigate a different multicast model consisting of multiple sources and receivers which is quite common in 3DVIS/video conferencing applications where each node serves both as a source and a receiver. The problem of constructing a multicast overlay for multi-source is hard and we are interested to guarantee certain QoS constraints such as end-to-end latency and latency variations. Latency variation constraints are very important in collaborative applications for maintaining realtime interactivity and multi-stream synchronization. We present an efficient heuristic solution for the muti-source multicast construction problem with an economical time-complexity.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79069256","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683256
I. Koutsopoulos, S. Stańczak, A. Feistel
We study the impact of physical layer (PHY) transmit rate control on energy efficient estimation in wireless sensor networks. A sensor network collects measurements and transmits them to a Fusion Center (FC) with controllable PHY transmission rates. The FC performs estimation of an unknown parameter process based on sensor measurements, and it needs to adhere to an estimation error constraint. The objective is to maximize network lifetime. High transmission rates consume more energy per transmitted bit, however they convey larger amount of data per unit time and thus can aid in satisfying the estimation error constraint. We identify basic structural properties of the optimal solution, and we propose an iterative algorithm for reaching a solution based on light-weight feedback from the FC.
{"title":"Transmit Rate Control for Energy-Efficient Estimation in Wireless Sensor Networks","authors":"I. Koutsopoulos, S. Stańczak, A. Feistel","doi":"10.1109/GLOCOM.2010.5683256","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683256","url":null,"abstract":"We study the impact of physical layer (PHY) transmit rate control on energy efficient estimation in wireless sensor networks. A sensor network collects measurements and transmits them to a Fusion Center (FC) with controllable PHY transmission rates. The FC performs estimation of an unknown parameter process based on sensor measurements, and it needs to adhere to an estimation error constraint. The objective is to maximize network lifetime. High transmission rates consume more energy per transmitted bit, however they convey larger amount of data per unit time and thus can aid in satisfying the estimation error constraint. We identify basic structural properties of the optimal solution, and we propose an iterative algorithm for reaching a solution based on light-weight feedback from the FC.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79289128","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683607
Yongpeng Wu, Shi Jin, Xiqi Gao
This paper investigates the performance of Rayleigh-product multiple-input multiple-output (MIMO) channels in the presence of both co-channel interference (CCI) and thermal noise. We obtain closed form expressions for the cumulative distribution function and probability density function of the output signal-to interference-plus-noise ratio (SINR) when optimum combining is employed. In contrast to prior results, our expressions apply for arbitrary numbers of interferers with arbitrary powers. Furthermore, the impact of noise is firstly addressed in our expressions. These are made possible based on the recent random matrix theory tools from which the new statistical properties of maximum eigenvalue of the resultant channel matrix can be derived. The new statistical results permit a general analysis for outage probability of the optimum combining system in Rayleigh-product MIMO channels. Simulation results are also provided to validate the analysis and to examine the effect of CCI and thermal noise on performance.
{"title":"Analytical Performance of Rayleigh-Product MIMO Channels with Arbitrary-Power Co-Channel Interference and Noise","authors":"Yongpeng Wu, Shi Jin, Xiqi Gao","doi":"10.1109/GLOCOM.2010.5683607","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683607","url":null,"abstract":"This paper investigates the performance of Rayleigh-product multiple-input multiple-output (MIMO) channels in the presence of both co-channel interference (CCI) and thermal noise. We obtain closed form expressions for the cumulative distribution function and probability density function of the output signal-to interference-plus-noise ratio (SINR) when optimum combining is employed. In contrast to prior results, our expressions apply for arbitrary numbers of interferers with arbitrary powers. Furthermore, the impact of noise is firstly addressed in our expressions. These are made possible based on the recent random matrix theory tools from which the new statistical properties of maximum eigenvalue of the resultant channel matrix can be derived. The new statistical results permit a general analysis for outage probability of the optimum combining system in Rayleigh-product MIMO channels. Simulation results are also provided to validate the analysis and to examine the effect of CCI and thermal noise on performance.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"99 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81441680","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5684222
N. Beaulieu, Ramin Babaee
The performance in fading of two dual signal-plus-noise (S+N) selection combining (SC) diversity structures employing different filtering is examined. The proposed structure includes either a minimum mean square error filter or a lowpass filter designed to reduce the noise in the signal used for determining the antenna switching times. The switching rate and the bit error rate of the proposed structures are compared to a receiver in which no filtering is used for switching rate reduction.
{"title":"Novel Switching Schemes for Dual S+N Selection Diversity Combining","authors":"N. Beaulieu, Ramin Babaee","doi":"10.1109/GLOCOM.2010.5684222","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684222","url":null,"abstract":"The performance in fading of two dual signal-plus-noise (S+N) selection combining (SC) diversity structures employing different filtering is examined. The proposed structure includes either a minimum mean square error filter or a lowpass filter designed to reduce the noise in the signal used for determining the antenna switching times. The switching rate and the bit error rate of the proposed structures are compared to a receiver in which no filtering is used for switching rate reduction.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81878875","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683210
Shengli Fu, Zhang Tao, M. Colef
Due to the broadcast nature of wireless channels, the two-way system can be eavesdropped on when a confidential message is transmitted, which is one of the motivations of this paper. While most of existing work focuses on the discussion of secrecy rate with information theoretical approach, this paper discusses the probability of successful detection for the system experiencing exponential path loss. By investigating the symbol-error-rate at the legitimate nodes and eavesdropper, we find the optimal power allocation among the two-way communication systems. We also investigate the impact factor on the secrecy capacity including the location of eavesdropper, path loss exponent, and decoding strategies.
{"title":"Secrecy in Two-Way Relay Systems","authors":"Shengli Fu, Zhang Tao, M. Colef","doi":"10.1109/GLOCOM.2010.5683210","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683210","url":null,"abstract":"Due to the broadcast nature of wireless channels, the two-way system can be eavesdropped on when a confidential message is transmitted, which is one of the motivations of this paper. While most of existing work focuses on the discussion of secrecy rate with information theoretical approach, this paper discusses the probability of successful detection for the system experiencing exponential path loss. By investigating the symbol-error-rate at the legitimate nodes and eavesdropper, we find the optimal power allocation among the two-way communication systems. We also investigate the impact factor on the secrecy capacity including the location of eavesdropper, path loss exponent, and decoding strategies.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"25 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84510140","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683660
Suyang Ju, Joseph B. Evans
This paper introduces a novel scalable cognitive routing protocol (SCRP) for mobile ad-hoc networks. It is an on-demand cognitive routing protocol. It employs an intelligent flooding protocol, a novel approach for scalable flooding. A neural network machine learning method is adopted to make nodes aware of history. The intelligent flooding protocol saves routing overhead because nodes selectively flood RREQ packets along predicted strong links and over predicted good frequencies. The intelligent flooding protocol can be divided into two parts, the space flooding protocol and the spectrum flooding protocol. Simulation results show that SCRP scales well by network size, network dynamics and network spectrum.
{"title":"Scalable Cognitive Routing Protocol for Mobile Ad-Hoc Networks","authors":"Suyang Ju, Joseph B. Evans","doi":"10.1109/GLOCOM.2010.5683660","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683660","url":null,"abstract":"This paper introduces a novel scalable cognitive routing protocol (SCRP) for mobile ad-hoc networks. It is an on-demand cognitive routing protocol. It employs an intelligent flooding protocol, a novel approach for scalable flooding. A neural network machine learning method is adopted to make nodes aware of history. The intelligent flooding protocol saves routing overhead because nodes selectively flood RREQ packets along predicted strong links and over predicted good frequencies. The intelligent flooding protocol can be divided into two parts, the space flooding protocol and the spectrum flooding protocol. Simulation results show that SCRP scales well by network size, network dynamics and network spectrum.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"11 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84930931","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683376
Jinfeng Tian, Haiyou Guo, Honglin Hu, Yang Yang
Cyclostationarity based sensing methods are appealing for OFDM signals under low SNR areas. However, such methods are sensitive to doubly-selective fading channels. In this paper we develop a new sensing method by exploiting the cyclostationarity incurred by the spread of autocorrelation due to the Doppler effect in doubly-selective fading channels. First, we model the doubly-selective fading channel with basis expansion model (BEM). Then we analyze the relationship between cyclostationary statistics of transmitted and received OFDM signals, hence derive the cyclostationary statistics of the received signal. Based on the new cyclostationary signatures of the received OFDM signal spread by the Doppler effect, more suitable cyclic frequencies can be chosen to detect cyclostationary features when signal experiences doubly-selective fading. Simulation results demonstrate that the proposed sensing method provides substantial improvement on detection performance.
{"title":"OFDM Signal Sensing over Doubly-Selective Fading Channels","authors":"Jinfeng Tian, Haiyou Guo, Honglin Hu, Yang Yang","doi":"10.1109/GLOCOM.2010.5683376","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683376","url":null,"abstract":"Cyclostationarity based sensing methods are appealing for OFDM signals under low SNR areas. However, such methods are sensitive to doubly-selective fading channels. In this paper we develop a new sensing method by exploiting the cyclostationarity incurred by the spread of autocorrelation due to the Doppler effect in doubly-selective fading channels. First, we model the doubly-selective fading channel with basis expansion model (BEM). Then we analyze the relationship between cyclostationary statistics of transmitted and received OFDM signals, hence derive the cyclostationary statistics of the received signal. Based on the new cyclostationary signatures of the received OFDM signal spread by the Doppler effect, more suitable cyclic frequencies can be chosen to detect cyclostationary features when signal experiences doubly-selective fading. Simulation results demonstrate that the proposed sensing method provides substantial improvement on detection performance.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"24 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84985692","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
扫码关注我们
求助内容：
应助结果提醒方式：