Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917563
Yan Li, P. Kam, Chee-Cheon Chui
In [1], we developed a Viterbi algorithm for efficient detection of M-ary phase-shift keyed (MPSK) sequences received over the additive, white, Gaussian noise (AWGN) channel with an unknown carrier phase. Its performance approaches that of coherent detection, but the observation interval for forming the decision metric is fixed and chosen based on prior statistical knowledge of the carrier phase characteristics. Thus, the metric is non-adaptive, and cannot be optimized when a priori statistical knowledge of the carrier phase is not available. The work here renders it adaptive by developing a recursive metric that is adapted on-line based on the received signal, without prior knowledge of the carrier phase characteristics. An adaptive filter is used to generate the phasor reference on-line, by extending that in [2] to sequence detection for general M-ary quadrature amplitude modulation (MQAM). Comparison between the proposed adaptive, recursive metric and those in the literature is provided. Simulation results using a random-walk carrier phase model show the superior performance of the adaptive sequence detector over the original nonadaptive sequence detector of [1].
{"title":"Adaptive Sequence Detection for MPSK/MQAM with Unknown Carrier Phase Characteristics","authors":"Yan Li, P. Kam, Chee-Cheon Chui","doi":"10.1109/WCNC.2009.4917563","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917563","url":null,"abstract":"In [1], we developed a Viterbi algorithm for efficient detection of M-ary phase-shift keyed (MPSK) sequences received over the additive, white, Gaussian noise (AWGN) channel with an unknown carrier phase. Its performance approaches that of coherent detection, but the observation interval for forming the decision metric is fixed and chosen based on prior statistical knowledge of the carrier phase characteristics. Thus, the metric is non-adaptive, and cannot be optimized when a priori statistical knowledge of the carrier phase is not available. The work here renders it adaptive by developing a recursive metric that is adapted on-line based on the received signal, without prior knowledge of the carrier phase characteristics. An adaptive filter is used to generate the phasor reference on-line, by extending that in [2] to sequence detection for general M-ary quadrature amplitude modulation (MQAM). Comparison between the proposed adaptive, recursive metric and those in the literature is provided. Simulation results using a random-walk carrier phase model show the superior performance of the adaptive sequence detector over the original nonadaptive sequence detector of [1].","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"123 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125960672","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917920
Xiaoyu Wang, A. Wong, P. Ho
In this paper, a novel statistics-driven spectrum sensing algorithm is developed for improving spectrum sensing efficiency in the media access control (MAC) layer of cognitive radio (CR) systems. The proposed algorithm aims to achieve higher spectrum sensing efficiency and spectrum access opportunity by prioritizing channels for fine sensing based on the statistical likelihood of channel availability. The sensing priority is obtained by jointly exploiting the long-term spatiotemporal statistics recorded from the historical result of fine sensing, the short-term statistical information of channel condition obtained from a small-scale observation window, and the instantaneous statistical information obtained from fast sensing. Simulation results show that the proposed prioritization algorithm can achieve improved data transmission rates and reduced missed spectrum access opportunities when compared to the conventional nonprioritization spectrum sensing approach for situations where cooperative spectrum sensing is not suitable.
{"title":"Prioritized Spectrum Sensing in Cognitive Radio Based on Spatiotemporal Statistical Fusion","authors":"Xiaoyu Wang, A. Wong, P. Ho","doi":"10.1109/WCNC.2009.4917920","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917920","url":null,"abstract":"In this paper, a novel statistics-driven spectrum sensing algorithm is developed for improving spectrum sensing efficiency in the media access control (MAC) layer of cognitive radio (CR) systems. The proposed algorithm aims to achieve higher spectrum sensing efficiency and spectrum access opportunity by prioritizing channels for fine sensing based on the statistical likelihood of channel availability. The sensing priority is obtained by jointly exploiting the long-term spatiotemporal statistics recorded from the historical result of fine sensing, the short-term statistical information of channel condition obtained from a small-scale observation window, and the instantaneous statistical information obtained from fast sensing. Simulation results show that the proposed prioritization algorithm can achieve improved data transmission rates and reduced missed spectrum access opportunities when compared to the conventional nonprioritization spectrum sensing approach for situations where cooperative spectrum sensing is not suitable.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988842","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917497
Debraj De
In near future, wireless sensors networks (WSN) are expected to be deployed for a vast variety of applications. For many of these applications, sensed data individually have no meaning without proper knowledge of position where the data was sensed. Although there have been proposed algorithms for localization, many of them fall short with respect to complexity, cost, security and accuracy. Some issues that still hinder the efficiency of available localization techniques are multi-path propagation, security attack (internal and external attack by faulty or malicious nodes), and sometimes specific network topologies. For example, the Long-Thin (LT) topology of WSN is highly prone to localization error due to its special distribution pattern. In many real world WSN applications, the localization is also needed to be Global Positioning Systems (GPS) free. Apart from efficient localization, another important operation in WSN application is the need to have in-network detection of faulty sensor readings, without compromising detection of important events. Looking at these critically important operations of WSN, our first contribution is proposing a self-organized distributed GPS free localization error detection and correction algorithm. Our next contribution is utilizing reliability gained in the proposed localization to construct an improved algorithm for in-network detection of faulty readings. We have also proposed a fault tolerant structure for Long-Thin (LT) WSN topology, that can well utilize both of the proposed algorithms.
{"title":"A Distributed Algorithm for Localization Error Detection-Correction, Use in In-Network Faulty Reading Detection: Applicability in Long-Thin Wireless Sensor Networks","authors":"Debraj De","doi":"10.1109/WCNC.2009.4917497","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917497","url":null,"abstract":"In near future, wireless sensors networks (WSN) are expected to be deployed for a vast variety of applications. For many of these applications, sensed data individually have no meaning without proper knowledge of position where the data was sensed. Although there have been proposed algorithms for localization, many of them fall short with respect to complexity, cost, security and accuracy. Some issues that still hinder the efficiency of available localization techniques are multi-path propagation, security attack (internal and external attack by faulty or malicious nodes), and sometimes specific network topologies. For example, the Long-Thin (LT) topology of WSN is highly prone to localization error due to its special distribution pattern. In many real world WSN applications, the localization is also needed to be Global Positioning Systems (GPS) free. Apart from efficient localization, another important operation in WSN application is the need to have in-network detection of faulty sensor readings, without compromising detection of important events. Looking at these critically important operations of WSN, our first contribution is proposing a self-organized distributed GPS free localization error detection and correction algorithm. Our next contribution is utilizing reliability gained in the proposed localization to construct an improved algorithm for in-network detection of faulty readings. We have also proposed a fault tolerant structure for Long-Thin (LT) WSN topology, that can well utilize both of the proposed algorithms.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129684014","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917595
C. R. Guo
In order to secure RFID transactions, an authentication scheme has originally been included as part of the "EPC Gen2" industrial standard. This scheme, however, has been found to have some weaknesses. To overcome such weaknesses, some authors have proposed new schemes to improve its security. Two of the latest proposals are the Lim-Li protocol and the Konidala-Kim-Kim protocol presented in 2007. We propose an attack that can be applied to both these protocols. In both cases, the Search Space for the password(s) used have been drastically reduced, which effectively breaks the security of these protocols.
{"title":"Analysis of RFID Mutual Authentication Protocols","authors":"C. R. Guo","doi":"10.1109/WCNC.2009.4917595","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917595","url":null,"abstract":"In order to secure RFID transactions, an authentication scheme has originally been included as part of the \"EPC Gen2\" industrial standard. This scheme, however, has been found to have some weaknesses. To overcome such weaknesses, some authors have proposed new schemes to improve its security. Two of the latest proposals are the Lim-Li protocol and the Konidala-Kim-Kim protocol presented in 2007. We propose an attack that can be applied to both these protocols. In both cases, the Search Space for the password(s) used have been drastically reduced, which effectively breaks the security of these protocols.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128631457","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}
This paper proposes a power management mechanism, via cross-layer design over application/presentation, data-link, and physical layers, for power-limited receivers in a multimedia streaming system such as the digital audio/video broadcasting system. In the transmitter, fine grain scalable source coding is utilized in the application/presentation layer to produce a bitstream of video frames that are further processed to form several partition streams in the data-link layer. Then, the partition streams are transmitted in bursts through time-slicing based modulation over the physical layer. Accordingly, depending on acceptance of various multimedia quality which is in proportion to the amount of data to be processed, power consumption can be autonomously managed by the receivers with great flexibility and wide dynamic range.
{"title":"Time-Sliced Scalable Source Partition Streaming for Flexible Power Management in Digital Audio/Video Broadcasting","authors":"Ching-Yung Chen, Fang-Chu Chen, Ce-Min Fang, Yi-Ting Wang, Chih-Chun Feng","doi":"10.1109/WCNC.2009.4917993","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917993","url":null,"abstract":"This paper proposes a power management mechanism, via cross-layer design over application/presentation, data-link, and physical layers, for power-limited receivers in a multimedia streaming system such as the digital audio/video broadcasting system. In the transmitter, fine grain scalable source coding is utilized in the application/presentation layer to produce a bitstream of video frames that are further processed to form several partition streams in the data-link layer. Then, the partition streams are transmitted in bursts through time-slicing based modulation over the physical layer. Accordingly, depending on acceptance of various multimedia quality which is in proportion to the amount of data to be processed, power consumption can be autonomously managed by the receivers with great flexibility and wide dynamic range.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127115164","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917546
Yu Yang, Yongjun Xu, Xiaowei Li
Wireless sensor networks need energy-efficient mechanisms of performance measurement for various aspects of network design, optimization and management. In this paper, we take into account the unique data aggregation communication paradigm of wireless sensor networks: the network performance can be measured by exploiting whether application data from various sensor nodes reach the sink, without incurring any additional overhead of active probes or performance reports. Then we present a novel algorithm, which can infer sensor network topology and link loss performance simultaneously. Finally, we validate the algorithm through simulations and it exhibit ts good performance and scalability.
{"title":"A Sensor Network Performance Inference Algorithm Based on Passive Measurement","authors":"Yu Yang, Yongjun Xu, Xiaowei Li","doi":"10.1109/WCNC.2009.4917546","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917546","url":null,"abstract":"Wireless sensor networks need energy-efficient mechanisms of performance measurement for various aspects of network design, optimization and management. In this paper, we take into account the unique data aggregation communication paradigm of wireless sensor networks: the network performance can be measured by exploiting whether application data from various sensor nodes reach the sink, without incurring any additional overhead of active probes or performance reports. Then we present a novel algorithm, which can infer sensor network topology and link loss performance simultaneously. Finally, we validate the algorithm through simulations and it exhibit ts good performance and scalability.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127409599","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917725
Xiaoguang Niu, Yanmin Zhu, Li Cui, L. Ni
Recently, System-on-Chip (SoC) technology has been adopted to design smaller, lower-power and cheaper tamper- resistant sensor nodes. In these nodes, we find that there exists a lifetime-secure memory fraction which stores the anterior part of the application executable binary code, namely "fingerprint". We propose a key management protocol based on this secure fingerprint-- FKM. In this protocol, any pair of nodes can build a secret key by combining two raw key elements randomly selected by both nodes from their fingerprints respectively. To further strengthen the security, we also present two multi-dimension grid key reinforcement schemes. To the best of our knowledge, this paper is the first attempt at the use of application executable binary code itself to develop a key management protocol. A thorough analysis shows that FKM supports higher security and superior operational properties while consuming less memory resource compared to the existing key establishment schemes.
{"title":"FKM: A Fingerprint-Based Key Management Protocol for SoC-Based Sensor Networks","authors":"Xiaoguang Niu, Yanmin Zhu, Li Cui, L. Ni","doi":"10.1109/WCNC.2009.4917725","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917725","url":null,"abstract":"Recently, System-on-Chip (SoC) technology has been adopted to design smaller, lower-power and cheaper tamper- resistant sensor nodes. In these nodes, we find that there exists a lifetime-secure memory fraction which stores the anterior part of the application executable binary code, namely \"fingerprint\". We propose a key management protocol based on this secure fingerprint-- FKM. In this protocol, any pair of nodes can build a secret key by combining two raw key elements randomly selected by both nodes from their fingerprints respectively. To further strengthen the security, we also present two multi-dimension grid key reinforcement schemes. To the best of our knowledge, this paper is the first attempt at the use of application executable binary code itself to develop a key management protocol. A thorough analysis shows that FKM supports higher security and superior operational properties while consuming less memory resource compared to the existing key establishment schemes.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129998959","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917919
Jing Han, Haiming Wang
Limited transmission power and short TTI length impose a bottleneck on LTE UL performance in a coverage-limited scenario. This paper presents an effective coverage enhancement mechanism called TTI bundling to boost uplink VoIP performance in LTE FDD mode. Performance evaluation for TTI bundling with VoIP traffic is carried out by semi-static system simulation, and the impact from different bundling options with different bundle size and packet delay budget is investigated. The simulation analysis proves that with proper bundle size, TTI bundling can enhance the coverage performance for LTE FDD effectively.
{"title":"Principle and Performance of TTI Bundling For VoIP in LTE FDD Mode","authors":"Jing Han, Haiming Wang","doi":"10.1109/WCNC.2009.4917919","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917919","url":null,"abstract":"Limited transmission power and short TTI length impose a bottleneck on LTE UL performance in a coverage-limited scenario. This paper presents an effective coverage enhancement mechanism called TTI bundling to boost uplink VoIP performance in LTE FDD mode. Performance evaluation for TTI bundling with VoIP traffic is carried out by semi-static system simulation, and the impact from different bundling options with different bundle size and packet delay budget is investigated. The simulation analysis proves that with proper bundle size, TTI bundling can enhance the coverage performance for LTE FDD effectively.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"500 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132491101","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917529
A. ElKalagy, E. Alsusa
This paper introduces and analyses a novel uplink CDMA pairing diversity technique. In particular, this paper considers the use of orthogonal polyphase (OPP) sequences on the synchronous and asynchronous uplink to benefit from the codes' good cross-correlation properties. A code allocation algorithm is also presented in this paper that aims to exploit the cross-correlation properties to achieve the best possible system performance. For the sake of comprehensiveness, the paper compares the performance of this new diversity technique with a conventional pairing diversity technique and with the well known maximum gain combined (MGC) time diversity. The results show that the proposed algorithm outperforms the conventional pairing technique, in terms of BER, and with proper code allocation, is also able to outperform time diversity systems. The new algorithm is able to accommodate up to 200% system loading even under severe asynchronous and multipath conditions.
{"title":"A Novel Pairing Diversity Technique with Dynamic Code Allocation for CDMA Systems Employing Polyphase Sequences","authors":"A. ElKalagy, E. Alsusa","doi":"10.1109/WCNC.2009.4917529","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917529","url":null,"abstract":"This paper introduces and analyses a novel uplink CDMA pairing diversity technique. In particular, this paper considers the use of orthogonal polyphase (OPP) sequences on the synchronous and asynchronous uplink to benefit from the codes' good cross-correlation properties. A code allocation algorithm is also presented in this paper that aims to exploit the cross-correlation properties to achieve the best possible system performance. For the sake of comprehensiveness, the paper compares the performance of this new diversity technique with a conventional pairing diversity technique and with the well known maximum gain combined (MGC) time diversity. The results show that the proposed algorithm outperforms the conventional pairing technique, in terms of BER, and with proper code allocation, is also able to outperform time diversity systems. The new algorithm is able to accommodate up to 200% system loading even under severe asynchronous and multipath conditions.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132523661","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917985
M. Yamanaka, M. Enomoto, R. Pirkl, G. Durgin, S. Sampei, N. Morinaga
This paper investigates the minimum number of antenna elements of an adaptive array antenna (AAA) required to suppress unnecessary radiation to a single location in an indoor ubiquitous communication environment. In the investigation the relationship between the number of antenna elements of an AAA and its digitally-created antenna null width is demonstrated using antenna directivity control technique that has been proposed by the authors. Also, the angular spread around a terminal to a single location in an indoor communication environment is demonstrated with propagation measurements. Based on the computer simulation results and the angular spread obtained by propagation measurements, the authors specify that at least 6 antenna elements are required to suppress radiation to a single location in an indoor communication environment up to -60 dB.
{"title":"The Minimum Number of Adaptive Array Antenna Elements for Interference Suppression in Ubiquitous Communication Environments","authors":"M. Yamanaka, M. Enomoto, R. Pirkl, G. Durgin, S. Sampei, N. Morinaga","doi":"10.1109/WCNC.2009.4917985","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917985","url":null,"abstract":"This paper investigates the minimum number of antenna elements of an adaptive array antenna (AAA) required to suppress unnecessary radiation to a single location in an indoor ubiquitous communication environment. In the investigation the relationship between the number of antenna elements of an AAA and its digitally-created antenna null width is demonstrated using antenna directivity control technique that has been proposed by the authors. Also, the angular spread around a terminal to a single location in an indoor communication environment is demonstrated with propagation measurements. Based on the computer simulation results and the angular spread obtained by propagation measurements, the authors specify that at least 6 antenna elements are required to suppress radiation to a single location in an indoor communication environment up to -60 dB.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132859907","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
扫码关注我们
求助内容：
应助结果提醒方式：