Pub Date : 2008-12-08DOI: 10.1109/PIMRC.2008.4699903
Dong Chen, Jiandong Li, Jing Ma
We discuss the spectrum sensing problem which is crucial in opportunistic spectrum access. An In-band spectrum sensing method based on linear self-signal elimination is proposed. In this method, quiet period is not needed so that transmission performance can be improved without the interruption of on-going transmission. According to the AR model of the wireless fading channel, the adjacent symbols are linear weighted to eliminate the self-signal. Further the optimal detector under Neyman-Pearson criterion is used on the residual signal after self-signal elimination to provide better detection performance. Finally, performance is evaluated with simulations which show that our method can provide better performance in the IEEE802.22 environment.
{"title":"Spectrum sensing based on linear self-signal elimination for opportunistic spectrum access","authors":"Dong Chen, Jiandong Li, Jing Ma","doi":"10.1109/PIMRC.2008.4699903","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699903","url":null,"abstract":"We discuss the spectrum sensing problem which is crucial in opportunistic spectrum access. An In-band spectrum sensing method based on linear self-signal elimination is proposed. In this method, quiet period is not needed so that transmission performance can be improved without the interruption of on-going transmission. According to the AR model of the wireless fading channel, the adjacent symbols are linear weighted to eliminate the self-signal. Further the optimal detector under Neyman-Pearson criterion is used on the residual signal after self-signal elimination to provide better detection performance. Finally, performance is evaluated with simulations which show that our method can provide better performance in the IEEE802.22 environment.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049866","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699688
K. Kusume
We propose a new differential recursive update algorithm, which significantly reduces the complexity of iterative minimum mean square error (MMSE) detection and decoding techniques for spread spectrum communication systems. Although the MMSE detector is a less complex suboptimum solution comparing to the optimum one, it is still complex for iterative systems because a large number of matrix inversions need to be computed over different users, symbols, and iterations. The new algorithm enables a smooth transition from the MMSE detection with full complexity to the simple matched filter solution over iterations, thereby achieving complexity reduction. We show by means of computer simulations that the complexity is drastically reduced by the newly proposed algorithm at the expense of increased memory requirements.
{"title":"Complexity reduction of iterative minimum mean square error detection and decoding techniques","authors":"K. Kusume","doi":"10.1109/PIMRC.2008.4699688","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699688","url":null,"abstract":"We propose a new differential recursive update algorithm, which significantly reduces the complexity of iterative minimum mean square error (MMSE) detection and decoding techniques for spread spectrum communication systems. Although the MMSE detector is a less complex suboptimum solution comparing to the optimum one, it is still complex for iterative systems because a large number of matrix inversions need to be computed over different users, symbols, and iterations. The new algorithm enables a smooth transition from the MMSE detection with full complexity to the simple matched filter solution over iterations, thereby achieving complexity reduction. We show by means of computer simulations that the complexity is drastically reduced by the newly proposed algorithm at the expense of increased memory requirements.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125863488","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699665
M. Ciurana, F. Barceló
TOA-based technology represents an alternative to overcome the current limitations of the indoor positioning systems using IEEE 802.11 networks infrastructures. The authors propose a new TOA-based ranging technique, which is the essential step towards the pursued positioning system, but tests have confirmed that its accuracy drastically decreases when a severe material obstruction exists between the involved nodes. This contribution describes an approach to overcome this problem and proposes a ranging algorithm specifically designed for such situations. Tests performed with a developed ranging prototype demonstrate the validity of the proposed solution.
{"title":"Facing the obstructed path problem in indoor TOA-based ranging between IEEE 802.11 nodes","authors":"M. Ciurana, F. Barceló","doi":"10.1109/PIMRC.2008.4699665","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699665","url":null,"abstract":"TOA-based technology represents an alternative to overcome the current limitations of the indoor positioning systems using IEEE 802.11 networks infrastructures. The authors propose a new TOA-based ranging technique, which is the essential step towards the pursued positioning system, but tests have confirmed that its accuracy drastically decreases when a severe material obstruction exists between the involved nodes. This contribution describes an approach to overcome this problem and proposes a ranging algorithm specifically designed for such situations. Tests performed with a developed ranging prototype demonstrate the validity of the proposed solution.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427928","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699870
Yuwen Pan, A. Nix, M. Beach
In this paper, algorithms on distributed resource (spectrum and power) sharing for relay stations are investigated for downlink transmissions in an OFDMA-based relay-aided cell. Both system capacity and user fairness are considered. By grouping the relay stations into coalitions according to the set of users they are relaying, the optimal resource allocation can be solved by considering resource allocation within and among the coalitions. The algorithm for intra-coalition resource allocation is proposed by utilizing the key observation: for each data symbol transmitted from the base station to a user (in a subcarrier), only one among all the available relay stations is required to relay the symbol. The inter-coalition resource allocation is modeled by both a non-cooperative and a cooperative game, where the cooperative game is solved by a nonsymmetric Nash bargaining solution. Simulation results show that the non-cooperative algorithm outperforms random allocation by approximately 50% in system capacity with 3 relay stations in each coalition. The cooperative algorithm has approximately 5% loss in system capacity comparing with the non-cooperative algorithm, but achieves a significant gain in terms of fairness performance.
{"title":"A game theoretic approach to distributed resource allocation for OFDMA-based relaying networks","authors":"Yuwen Pan, A. Nix, M. Beach","doi":"10.1109/PIMRC.2008.4699870","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699870","url":null,"abstract":"In this paper, algorithms on distributed resource (spectrum and power) sharing for relay stations are investigated for downlink transmissions in an OFDMA-based relay-aided cell. Both system capacity and user fairness are considered. By grouping the relay stations into coalitions according to the set of users they are relaying, the optimal resource allocation can be solved by considering resource allocation within and among the coalitions. The algorithm for intra-coalition resource allocation is proposed by utilizing the key observation: for each data symbol transmitted from the base station to a user (in a subcarrier), only one among all the available relay stations is required to relay the symbol. The inter-coalition resource allocation is modeled by both a non-cooperative and a cooperative game, where the cooperative game is solved by a nonsymmetric Nash bargaining solution. Simulation results show that the non-cooperative algorithm outperforms random allocation by approximately 50% in system capacity with 3 relay stations in each coalition. The cooperative algorithm has approximately 5% loss in system capacity comparing with the non-cooperative algorithm, but achieves a significant gain in terms of fairness performance.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123445374","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699412
D. Liu, M. Fitz
Orthogonal frequency division multiplexing (OFDM) systems suffer performance degradation in fast fading channels due to intercarrier interference (ICI). Combining frequency domain equalization and bit-interleaved coded modulation (BICM), the iterative receiver is able to harvest both temporal and frequency diversity. In order to perform coherent detection and estimation, channel state information (CSI) is critical. Conventional frequency domain channel estimation (CE) methods have an irreducible error floor at high normalized Doppler frequency fdTs, since ICI corrupts the orthogonality among subcarriers. Considering that the fast time-varying channel is also a source of temporal diversity, CE ought to take place in the pre-FFT time domain. With soft a priori information about the data symbols becomes available, this paper proposes a turbo channel estimator (TCE) structure which provides a way to consistently improve the bit error rate (BER). The complexity of TCE is further reduced by completely avoiding matrix inversion. Simulation results demonstrate that the PSAM system with TCE achieves no ICI with normalized Doppler frequency fdTs up to 20.46% with realistic mobile WiMAX channel environment.
{"title":"Joint turbo channel estimation and data recovery in fast fading mobile coded OFDM","authors":"D. Liu, M. Fitz","doi":"10.1109/PIMRC.2008.4699412","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699412","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) systems suffer performance degradation in fast fading channels due to intercarrier interference (ICI). Combining frequency domain equalization and bit-interleaved coded modulation (BICM), the iterative receiver is able to harvest both temporal and frequency diversity. In order to perform coherent detection and estimation, channel state information (CSI) is critical. Conventional frequency domain channel estimation (CE) methods have an irreducible error floor at high normalized Doppler frequency fdTs, since ICI corrupts the orthogonality among subcarriers. Considering that the fast time-varying channel is also a source of temporal diversity, CE ought to take place in the pre-FFT time domain. With soft a priori information about the data symbols becomes available, this paper proposes a turbo channel estimator (TCE) structure which provides a way to consistently improve the bit error rate (BER). The complexity of TCE is further reduced by completely avoiding matrix inversion. Simulation results demonstrate that the PSAM system with TCE achieves no ICI with normalized Doppler frequency fdTs up to 20.46% with realistic mobile WiMAX channel environment.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123775770","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}
Nowadays, almost everyone has a mobile telephone. This requires GSM localization systems to have greater applicability all of the time. The ldquokiller issuerdquo in this field is the well-known non-line-of-sight (NLOS) error, which hinders localization robustness and accuracy in real scenarios. Many techniques have been developed to deal with this problem, but they usually require prior statistical information or error modeling, or are computationally expensive. In this paper, we present a simple method based on the least median of squares technique to mitigate the NLOS effect. The method we propose is widely used in artificial vision applications and manages to overcome NLOS error effects, yielding higher location accuracy and robustness than other techniques. It can successfully deal with more than half of the available corrupted measurements- no matter how severely-without any previous statistical knowledge-corrupted measurements are not identifiable-and with reduced computation load.
{"title":"Least Median of Squares for non-line-of-sight error mitigation in GSM localization","authors":"Á. Marco, Roberto Casas, Ángel Asensio, Victorián Coarasa, Rubén Blasco Marín, Alejandro Ibarz","doi":"10.1109/PIMRC.2008.4699757","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699757","url":null,"abstract":"Nowadays, almost everyone has a mobile telephone. This requires GSM localization systems to have greater applicability all of the time. The ldquokiller issuerdquo in this field is the well-known non-line-of-sight (NLOS) error, which hinders localization robustness and accuracy in real scenarios. Many techniques have been developed to deal with this problem, but they usually require prior statistical information or error modeling, or are computationally expensive. In this paper, we present a simple method based on the least median of squares technique to mitigate the NLOS effect. The method we propose is widely used in artificial vision applications and manages to overcome NLOS error effects, yielding higher location accuracy and robustness than other techniques. It can successfully deal with more than half of the available corrupted measurements- no matter how severely-without any previous statistical knowledge-corrupted measurements are not identifiable-and with reduced computation load.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125569064","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699536
M. Krasicki, P. Szulakiewicz
This paper focuses on the applicability of bit-interleaved space-time coded modulation with iterative decoding (BI-STCM-ID) to wireless local area networks (WLAN). A new intuitive space-time diversity scheme, which ensures a low error rate for small signal-to-noise ratios (SNR) and good asymptotic performance, is provided. The presented technique can ensure compatibility with todaypsilas WLAN specifications. The EXtrinsic Information Transfer Chart (EXIT) and the bit error rate (BER) simulations confirm its usefulness.
{"title":"A new space-time diversity scheme for WLAN systems","authors":"M. Krasicki, P. Szulakiewicz","doi":"10.1109/PIMRC.2008.4699536","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699536","url":null,"abstract":"This paper focuses on the applicability of bit-interleaved space-time coded modulation with iterative decoding (BI-STCM-ID) to wireless local area networks (WLAN). A new intuitive space-time diversity scheme, which ensures a low error rate for small signal-to-noise ratios (SNR) and good asymptotic performance, is provided. The presented technique can ensure compatibility with todaypsilas WLAN specifications. The EXtrinsic Information Transfer Chart (EXIT) and the bit error rate (BER) simulations confirm its usefulness.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1996 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125571088","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699582
V. Toubiana, H. Labiod, L. Reynaud, Y. Gourhant
The recent proliferation of wireless devices extends the scope of mobile ad hoc networks (MANETs) applications beyond the military domain to include civil and commercial application scenarios. Since MANETs are composed of mobile terminals with limited resources, guaranteeing their security remains an unsolved and motivating challenge. Due to advantageous features like infrastructureless and spontaneous deployment, MANETs offer an opportunity to set up temporary, dynamic and local networks for low cost. However, some of their characteristics like unreliability of wireless links, dynamic topology, and absence of underlying infrastructure raise serious problems which become critical when security is also considered. Multipath routing scheme enhances the robustness of routing protocols and offers a mean to mitigate networks mobility impact and node misbehaviors. In this paper we compare the performances of five multipath routing protocols: three node-disjoint multipath routing protocols and two routing protocols based on a Untrusted Node Disjoint (UND) path scheme. Comparisons between these protocols highlight the improvements raised by the UND scheme under different attack configurations.
{"title":"Performance comparison of multipath reactive Ad hoc routing protocols","authors":"V. Toubiana, H. Labiod, L. Reynaud, Y. Gourhant","doi":"10.1109/PIMRC.2008.4699582","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699582","url":null,"abstract":"The recent proliferation of wireless devices extends the scope of mobile ad hoc networks (MANETs) applications beyond the military domain to include civil and commercial application scenarios. Since MANETs are composed of mobile terminals with limited resources, guaranteeing their security remains an unsolved and motivating challenge. Due to advantageous features like infrastructureless and spontaneous deployment, MANETs offer an opportunity to set up temporary, dynamic and local networks for low cost. However, some of their characteristics like unreliability of wireless links, dynamic topology, and absence of underlying infrastructure raise serious problems which become critical when security is also considered. Multipath routing scheme enhances the robustness of routing protocols and offers a mean to mitigate networks mobility impact and node misbehaviors. In this paper we compare the performances of five multipath routing protocols: three node-disjoint multipath routing protocols and two routing protocols based on a Untrusted Node Disjoint (UND) path scheme. Comparisons between these protocols highlight the improvements raised by the UND scheme under different attack configurations.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126638901","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699422
A. Attar, M. R. Nakhai, H. Aghvami
In this paper we develop a cellular cognitive radio network based on MC-CDMA, which is able to coexist with a number of legacy RANs in a shared band. Using the simple-to-obtain knowledge of RF environment, namely the bandwidth and frequency location of each legacy system, the cognitive MC-CDMA transmitter mitigates the interference in the corresponding receivers by adaptive transmission. We will develop an algorithm for calculating the adaptive transmission parameters and elaborate on error performance of this approach analytically and numerically.
{"title":"Spectrum sharing with legacy RANs using cognitive MC-CDMA","authors":"A. Attar, M. R. Nakhai, H. Aghvami","doi":"10.1109/PIMRC.2008.4699422","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699422","url":null,"abstract":"In this paper we develop a cellular cognitive radio network based on MC-CDMA, which is able to coexist with a number of legacy RANs in a shared band. Using the simple-to-obtain knowledge of RF environment, namely the bandwidth and frequency location of each legacy system, the cognitive MC-CDMA transmitter mitigates the interference in the corresponding receivers by adaptive transmission. We will develop an algorithm for calculating the adaptive transmission parameters and elaborate on error performance of this approach analytically and numerically.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126651152","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 : 2008-12-08DOI: 10.1109/PIMRC.2008.4699837
Angelos Vlavianos, Lap Kong Law, Ioannis Broustis, S. Krishnamurthy, M. Faloutsos
The accurate determination of the link quality is critical for ensuring that functionalities such as intelligent routing, load-balancing, power control and frequency selection operate efficiently. There are 4 primary metrics for capturing the quality of a wireless link: RSSI (Received Signal Strength Indication), SINR (Signal-to-Interference-plus-Noise Ratio), PDR (Packet-Delivery Ratio), and BER (Bit-Error Rate). In this paper, we perform a measurement-based study in order to answer the question: which is the appropriate metric to use, and under what conditions? We evaluate the relative accuracy of each metric by conducting experiments with multiple transmission rates and varying levels of interference on a large set of links. We observe that each metric has advantages and projects one or more limitations. Our study suggests that a careful consideration of these limitations is essential, and provides guidelines on the applicability of each metric.
{"title":"Assessing link quality in IEEE 802.11 Wireless Networks: Which is the right metric?","authors":"Angelos Vlavianos, Lap Kong Law, Ioannis Broustis, S. Krishnamurthy, M. Faloutsos","doi":"10.1109/PIMRC.2008.4699837","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699837","url":null,"abstract":"The accurate determination of the link quality is critical for ensuring that functionalities such as intelligent routing, load-balancing, power control and frequency selection operate efficiently. There are 4 primary metrics for capturing the quality of a wireless link: RSSI (Received Signal Strength Indication), SINR (Signal-to-Interference-plus-Noise Ratio), PDR (Packet-Delivery Ratio), and BER (Bit-Error Rate). In this paper, we perform a measurement-based study in order to answer the question: which is the appropriate metric to use, and under what conditions? We evaluate the relative accuracy of each metric by conducting experiments with multiple transmission rates and varying levels of interference on a large set of links. We observe that each metric has advantages and projects one or more limitations. Our study suggests that a careful consideration of these limitations is essential, and provides guidelines on the applicability of each metric.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122545769","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
扫码关注我们
求助内容：
应助结果提醒方式：