Pub Date : 2013-12-11DOI: 10.1109/PIMRC.2013.6666222
Ming Liu, M. Hélard, J. Hélard, M. Crussiére
In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4 × 2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M4,5) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.
{"title":"A fast decodable full-rate STBC with high coding gain for 4 × 2 MIMO systems","authors":"Ming Liu, M. Hélard, J. Hélard, M. Crussiére","doi":"10.1109/PIMRC.2013.6666222","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666222","url":null,"abstract":"In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4 × 2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M4,5) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129089034","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666134
F. Monsees, C. Bockelmann, A. Dekorsy
Performing joint activity and data detection has recently gained attention for reducing signaling overhead in multi-user Machine-to-Machine Communication systems. In this context, Compressed Sensing has been identified as a good candidate for joint activity and data detection especially in scenarios where the activity probability is very low. This paper augments activity and data detection for frame based multi-user uplink scenarios where nodes are (in)active for the duration of a frame. We propose a two stage detector which first estimates the set of active nodes followed by a data detector. Our detector outperforms symbol-by-symbol Maximum a posteriori detection.
{"title":"Compressed sensing Bayes-risk detection for frame based multi-user systems","authors":"F. Monsees, C. Bockelmann, A. Dekorsy","doi":"10.1109/PIMRC.2013.6666134","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666134","url":null,"abstract":"Performing joint activity and data detection has recently gained attention for reducing signaling overhead in multi-user Machine-to-Machine Communication systems. In this context, Compressed Sensing has been identified as a good candidate for joint activity and data detection especially in scenarios where the activity probability is very low. This paper augments activity and data detection for frame based multi-user uplink scenarios where nodes are (in)active for the duration of a frame. We propose a two stage detector which first estimates the set of active nodes followed by a data detector. Our detector outperforms symbol-by-symbol Maximum a posteriori detection.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663012","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666595
Ping-Chen Lin, R. Cheng
Relaying technology is a cost-effective solution for achieving throughput enhancement for cell-edge users or extending the cell coverage for the 3GPP LTE-A systems. In this study, we investigate the flow control scheme in the LTE-A relay networks employing the Type-I relay nodes (RNs). However, the buffer-overflow problem [7, 8] caused by high-speed arrival traffic and the handover forwarding problem caused by UE's handover are two main issues that affect the performance of 3GPP LTE-A relay networks. To mitigate these problems, we present a dynamic two-threshold flow control scheme (DTFCS) which can dynamically adjust the upper buffer-threshold of RN based on the channel quality. Results showed that DTFCS can reduce 40% of the total number of forwarding packets during the handover when compared with the two-threshold flow control scheme. Additionally, when the proposed scheme is compared to single-threshold flow control scheme, DTFCS excels by imposing much less signaling overhead on the expense of a slight increase in the number of forwarding packets.
{"title":"Dynamic two-threshold flow control scheme for 3GPP LTE-A relay networks","authors":"Ping-Chen Lin, R. Cheng","doi":"10.1109/PIMRC.2013.6666595","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666595","url":null,"abstract":"Relaying technology is a cost-effective solution for achieving throughput enhancement for cell-edge users or extending the cell coverage for the 3GPP LTE-A systems. In this study, we investigate the flow control scheme in the LTE-A relay networks employing the Type-I relay nodes (RNs). However, the buffer-overflow problem [7, 8] caused by high-speed arrival traffic and the handover forwarding problem caused by UE's handover are two main issues that affect the performance of 3GPP LTE-A relay networks. To mitigate these problems, we present a dynamic two-threshold flow control scheme (DTFCS) which can dynamically adjust the upper buffer-threshold of RN based on the channel quality. Results showed that DTFCS can reduce 40% of the total number of forwarding packets during the handover when compared with the two-threshold flow control scheme. Additionally, when the proposed scheme is compared to single-threshold flow control scheme, DTFCS excels by imposing much less signaling overhead on the expense of a slight increase in the number of forwarding packets.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124582189","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}
Detection of wideband communication signals is critical for cognitive radio (CR) as it enables secondary users to dynamically access the unoccupied bands. However, accurate and fast spectrum sensing is still a challenge in low signal to noise ratio (SNR) environment. To encounter this problem, a feature detector based on compressed sensing (CS) and wavelet transform (WT) (CS-WT feature detector) is proposed. Feature detector is chosen for its accuracy under low SNR, and CS is introduced to alleviate the sampling bottleneck of wideband sensing. Moreover, noise caused by the CS process is analyzed, and a traditional noise reduction method-two dimensional wavelet transform is utilized to cope with it by treating the spectral correlation function (SCF) as a grey image. It is verified by simulation that WT can effectively reduce the noise introduced by CS, and the proposed detector can achieve 90% detection probability under -10dB, making cyclostationary detection based on CS applicable.
{"title":"A feature detector based on compressed sensing and wavelet transform for wideband cognitive radio","authors":"Xiaoming Liu, Qixun Zhang, Xiao Yan, Z. Feng, Jianwei Liu, Yingdong Zhu, Jian-hua Zhang","doi":"10.1109/PIMRC.2013.6666588","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666588","url":null,"abstract":"Detection of wideband communication signals is critical for cognitive radio (CR) as it enables secondary users to dynamically access the unoccupied bands. However, accurate and fast spectrum sensing is still a challenge in low signal to noise ratio (SNR) environment. To encounter this problem, a feature detector based on compressed sensing (CS) and wavelet transform (WT) (CS-WT feature detector) is proposed. Feature detector is chosen for its accuracy under low SNR, and CS is introduced to alleviate the sampling bottleneck of wideband sensing. Moreover, noise caused by the CS process is analyzed, and a traditional noise reduction method-two dimensional wavelet transform is utilized to cope with it by treating the spectral correlation function (SCF) as a grey image. It is verified by simulation that WT can effectively reduce the noise introduced by CS, and the proposed detector can achieve 90% detection probability under -10dB, making cyclostationary detection based on CS applicable.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325758","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666528
B. Senadji, Kevin Chang
Spectrum sensing of multiple primary user channels is a crucial function in cognitive radio networks. In this paper we propose an optimal, sensing resource allocation algorithm for multi-channel cooperative spectrum sensing. The channel target is implemented as an objective and constraint to ensure a pre-determined number of empty channels are detected for secondary user network operations. Based on primary user traffic parameters, we calculate the minimum number of primary user channels that must be sensed to satisfy the channel target. We implement a hybrid sensing structure by grouping secondary user nodes into clusters and assign each cluster to sense a different primary user channels. We then solve the resource allocation problem to find the optimal sensing configuration and node allocation to minimise sensing duration. Simulation results show that the proposed algorithm requires the shortest sensing duration to achieve the channel target compared to existing studies that require long sensing and cannot guarantee the target.
{"title":"Hybrid multi-channel cooperative spectrum sensing to satisfy channel target","authors":"B. Senadji, Kevin Chang","doi":"10.1109/PIMRC.2013.6666528","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666528","url":null,"abstract":"Spectrum sensing of multiple primary user channels is a crucial function in cognitive radio networks. In this paper we propose an optimal, sensing resource allocation algorithm for multi-channel cooperative spectrum sensing. The channel target is implemented as an objective and constraint to ensure a pre-determined number of empty channels are detected for secondary user network operations. Based on primary user traffic parameters, we calculate the minimum number of primary user channels that must be sensed to satisfy the channel target. We implement a hybrid sensing structure by grouping secondary user nodes into clusters and assign each cluster to sense a different primary user channels. We then solve the resource allocation problem to find the optimal sensing configuration and node allocation to minimise sensing duration. Simulation results show that the proposed algorithm requires the shortest sensing duration to achieve the channel target compared to existing studies that require long sensing and cannot guarantee the target.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131499658","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666399
D. Tarchi, R. Fantacci, D. Marabissi
The radio resource shortage is one of the most important issues to be taken into account when deploying modern wireless communication systems. A novel communication paradigm named cognitive radio, has been introduced in the last years for a more efficient exploitation of the limited available spectrum and cope with the inefficiency in the spectrum usage. Its main aim is to allow the co-existence of different wireless systems on the same spectral resources by limiting the mutual interference. The aim of this paper is to design a cognitive networking environment where the primary network is based on the OFDMA principle. The proposed Medium Access Control (MAC) technique for the secondary network, named Data Aided Cognitive Technique (DACT), aims to exploit the framing information broadcast by the primary network in order to setup transparently an independent network with a particular focus on Machine to Machine (M2M) communications.
{"title":"Proposal of a cognitive based MAC protocol for M2M environments","authors":"D. Tarchi, R. Fantacci, D. Marabissi","doi":"10.1109/PIMRC.2013.6666399","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666399","url":null,"abstract":"The radio resource shortage is one of the most important issues to be taken into account when deploying modern wireless communication systems. A novel communication paradigm named cognitive radio, has been introduced in the last years for a more efficient exploitation of the limited available spectrum and cope with the inefficiency in the spectrum usage. Its main aim is to allow the co-existence of different wireless systems on the same spectral resources by limiting the mutual interference. The aim of this paper is to design a cognitive networking environment where the primary network is based on the OFDMA principle. The proposed Medium Access Control (MAC) technique for the secondary network, named Data Aided Cognitive Technique (DACT), aims to exploit the framing information broadcast by the primary network in order to setup transparently an independent network with a particular focus on Machine to Machine (M2M) communications.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132022054","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666515
Katarzyna Kosek-Szott
Analytical models of the Distributed Coordination Function (DCF) have numerous applications in the performance analysis of IEEE 802.11 networks. The model proposed in this paper distinguishes itself from existing approaches in that it allows throughput, delay, and frame loss ratio analysis under both saturation and non-saturation network conditions. It combines the Markov chain and the queuing theory to comprehensively and efficiently analyze the DCF channel access procedure assuming finite (M/M/1/K) queues. Additionally, it incorporates advantages of models previously proposed in the literature: correct backoff countdown, proper handling of frames and distinction of the wireless channel blocking probability from the frame blocking probability during the backoff countdown. Furthermore, it is kept reasonably simple to attract network designers. Simulation results validate the correctness of the new model for a variable number of nodes and under different network loads. Additionally, we demonstrate that the new model outperforms three previous models known from the literature.
{"title":"Throughput, delay, and frame loss probability analysis of IEEE 802.11 DCF with M/M/1/K queues","authors":"Katarzyna Kosek-Szott","doi":"10.1109/PIMRC.2013.6666515","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666515","url":null,"abstract":"Analytical models of the Distributed Coordination Function (DCF) have numerous applications in the performance analysis of IEEE 802.11 networks. The model proposed in this paper distinguishes itself from existing approaches in that it allows throughput, delay, and frame loss ratio analysis under both saturation and non-saturation network conditions. It combines the Markov chain and the queuing theory to comprehensively and efficiently analyze the DCF channel access procedure assuming finite (M/M/1/K) queues. Additionally, it incorporates advantages of models previously proposed in the literature: correct backoff countdown, proper handling of frames and distinction of the wireless channel blocking probability from the frame blocking probability during the backoff countdown. Furthermore, it is kept reasonably simple to attract network designers. Simulation results validate the correctness of the new model for a variable number of nodes and under different network loads. Additionally, we demonstrate that the new model outperforms three previous models known from the literature.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026743","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666191
Li Chen, Ying Yang, Guo Wei
In this paper, we present and analyze utilizing generalized selection combining (GSC) scheme to enhance the physical layer (PHY) security of a wireless communication system consisting of a single antenna transmitter, a multi-antennas receiver and a multi-antennas eavesdropper. We consider a practical scenario where GSC scheme is applied to the receiver considering both the complexity and the energy dissipation while maximal ratio combining (MRC) scheme is applied to the eavesdropper in order to maximize its instantaneous signal to noise ratio (SNR). This work bridges the gap between the existing works utilizing MRC scheme and transmit antenna selection (TAS) scheme to enhance the PHY security. Closed-form expressions for both the probability of non-zero secrecy capacity and the exact secrecy outage probability are derived over Rayleigh fading channels. The security capacity performances are also shown and analyzed through numerical results. The impacts of the number of selected branches, the average SNR of transmitter's channel and eavesdropper's channel are discussed.
{"title":"Physical layer security enhancement with generalized selection diversity combining","authors":"Li Chen, Ying Yang, Guo Wei","doi":"10.1109/PIMRC.2013.6666191","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666191","url":null,"abstract":"In this paper, we present and analyze utilizing generalized selection combining (GSC) scheme to enhance the physical layer (PHY) security of a wireless communication system consisting of a single antenna transmitter, a multi-antennas receiver and a multi-antennas eavesdropper. We consider a practical scenario where GSC scheme is applied to the receiver considering both the complexity and the energy dissipation while maximal ratio combining (MRC) scheme is applied to the eavesdropper in order to maximize its instantaneous signal to noise ratio (SNR). This work bridges the gap between the existing works utilizing MRC scheme and transmit antenna selection (TAS) scheme to enhance the PHY security. Closed-form expressions for both the probability of non-zero secrecy capacity and the exact secrecy outage probability are derived over Rayleigh fading channels. The security capacity performances are also shown and analyzed through numerical results. The impacts of the number of selected branches, the average SNR of transmitter's channel and eavesdropper's channel are discussed.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126388628","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666310
C. Zheng, J. Zhong, Yabo Li, Minjian Zhao, Jie-Qing Wu
In order to achieve reliable communication, transmit diversity is commonly used in multiple antenna systems. Currently, to obtain transmit diversity, space-time code is usually used. In this paper, a new multiplicative transformation scheme is proposed for multiple antenna systems with non-binary low-density parity-check (LDPC) codes. It is shown that this scheme can provide transmit diversity. In the scheme, for the first antenna, the modulated LDPC codeword is directly applied, while for the second antenna, before modulation, a multiplicative transformation is used, where the multiplication is defined in the same Galois field as that used to construct the nonbinary LDPC code. The performance of the proposed system is analyzed, and it is shown that, compared with phase sweeping transmit diversity (PSTD) and Alamouti's space-time block code (STBC), the proposed system not only provides transmit diversity, but also achieves good gain. Simulation results further prove the increased performance in both block fading and slow fading channels.
{"title":"Transmit diversity based on multiplicative transformation for non-binary LDPC codes in MIMO systems","authors":"C. Zheng, J. Zhong, Yabo Li, Minjian Zhao, Jie-Qing Wu","doi":"10.1109/PIMRC.2013.6666310","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666310","url":null,"abstract":"In order to achieve reliable communication, transmit diversity is commonly used in multiple antenna systems. Currently, to obtain transmit diversity, space-time code is usually used. In this paper, a new multiplicative transformation scheme is proposed for multiple antenna systems with non-binary low-density parity-check (LDPC) codes. It is shown that this scheme can provide transmit diversity. In the scheme, for the first antenna, the modulated LDPC codeword is directly applied, while for the second antenna, before modulation, a multiplicative transformation is used, where the multiplication is defined in the same Galois field as that used to construct the nonbinary LDPC code. The performance of the proposed system is analyzed, and it is shown that, compared with phase sweeping transmit diversity (PSTD) and Alamouti's space-time block code (STBC), the proposed system not only provides transmit diversity, but also achieves good gain. Simulation results further prove the increased performance in both block fading and slow fading channels.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125271137","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666097
M. Ijaz, Zabih Ghassemlooy, H. L. Minh, S. Zvánovec, Joaquin Perez, J. Pesek, O. Fiser
In this paper, we present the experimental results free space optics (FSO) communication systems operating at visible and near infrared wavelengths (from 0.6 μm to 1.6 μm) under fog conditions. Different empirical fog models are typically used to characterize the fog attenuation of optical beam in FSO systems. A number of empirical fog models are evaluated in order to verify them experimentally and to fill several unmeasured gaps within the entire spectrum from the visible - near infrared (NIR) range for light to dense fog conditions. The experimental results in the controlled laboratory fog environment are compared with the selected empirical fog models in order to practically validate their performance over wide range of wavelengths. The results indicate wavelength dependency of the fog attenuation for visibilities higher than 15 m, whereas the cases with shorter visibilities contradict the Kim model.
{"title":"Experimental validation of fog models for FSO under laboratory controlled conditions","authors":"M. Ijaz, Zabih Ghassemlooy, H. L. Minh, S. Zvánovec, Joaquin Perez, J. Pesek, O. Fiser","doi":"10.1109/PIMRC.2013.6666097","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666097","url":null,"abstract":"In this paper, we present the experimental results free space optics (FSO) communication systems operating at visible and near infrared wavelengths (from 0.6 μm to 1.6 μm) under fog conditions. Different empirical fog models are typically used to characterize the fog attenuation of optical beam in FSO systems. A number of empirical fog models are evaluated in order to verify them experimentally and to fill several unmeasured gaps within the entire spectrum from the visible - near infrared (NIR) range for light to dense fog conditions. The experimental results in the controlled laboratory fog environment are compared with the selected empirical fog models in order to practically validate their performance over wide range of wavelengths. The results indicate wavelength dependency of the fog attenuation for visibilities higher than 15 m, whereas the cases with shorter visibilities contradict the Kim model.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":" 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113952776","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
扫码关注我们
求助内容：
应助结果提醒方式：