In this paper, we investigate the problem of multiuser channel selection in cognitive radio networks (CRN) with heterogenous channel availability. We consider a practical scenario where the channel availability statistics are unknown. Due to limited sensing capabilities, secondary users (SUs) can only sense partial of the channels. In this case, secondary users can collaboratively share their respective sensing results to gather enough information about the statistics of the unknown channels. By taking into account the competition among SUs, We formulate the problem of multiuser channel selection as an evolutionary game in which SUs make their decisions under replicator dynamics. Furthermore, we develop a decentralized channel selection algorithm based on learning automata, and prove that the replicator dynamics can converge to the evolutionary stable strategy efficiently. Simulation results show that our proposed learning algorithm helps SUs share the spectrum efficiently and the system throughput obtained outperforms that of the random access scheme.
{"title":"Collaborative spectrum sharing based on information pooling for cognitive radio networks with channel heterogeneity","authors":"Longwei Wang, Xianfu Chen, Zhifeng Zhao, Honggang Zhang","doi":"10.1109/ISCIT.2011.6092154","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092154","url":null,"abstract":"In this paper, we investigate the problem of multiuser channel selection in cognitive radio networks (CRN) with heterogenous channel availability. We consider a practical scenario where the channel availability statistics are unknown. Due to limited sensing capabilities, secondary users (SUs) can only sense partial of the channels. In this case, secondary users can collaboratively share their respective sensing results to gather enough information about the statistics of the unknown channels. By taking into account the competition among SUs, We formulate the problem of multiuser channel selection as an evolutionary game in which SUs make their decisions under replicator dynamics. Furthermore, we develop a decentralized channel selection algorithm based on learning automata, and prove that the replicator dynamics can converge to the evolutionary stable strategy efficiently. Simulation results show that our proposed learning algorithm helps SUs share the spectrum efficiently and the system throughput obtained outperforms that of the random access scheme.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115555941","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089728
Zhenxing Luo, C. Lou, Shichuan Chen, Shilian Zheng, Shaowei Li
Cognitive Radio (CR) is considered as an effective technology for alleviating the spectrum shortage problem by enabling secondary users to utilize vacant spectrum allocated to a primary user (PU). IEEE 802.22 which is the first standard based on CR is developed to increase the efficiency of TV bands. However the physical layer security of IEEE 802.22 has been studied rarely. In this paper, we propose a scheme to sense the specific primary user for dealing with Primary User Emulation (PUE) Attack which is a possible threat to wireless security. According to ATSC digital TV which is one of the important PUs, we estimate the accuracies of pilot and symbol rate as RF fingerprint (RFF), and Support Vector Data Description (SVDD) is introduced to sense the fine differences of RFF to distinguish PUE attacker from PU. The simulation results show that the proposed scheme is feasible to verify the PUE attacker at a relative high SNR level.
{"title":"Specific primary user sensing for wireless security in IEEE 802.22 network","authors":"Zhenxing Luo, C. Lou, Shichuan Chen, Shilian Zheng, Shaowei Li","doi":"10.1109/ISCIT.2011.6089728","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089728","url":null,"abstract":"Cognitive Radio (CR) is considered as an effective technology for alleviating the spectrum shortage problem by enabling secondary users to utilize vacant spectrum allocated to a primary user (PU). IEEE 802.22 which is the first standard based on CR is developed to increase the efficiency of TV bands. However the physical layer security of IEEE 802.22 has been studied rarely. In this paper, we propose a scheme to sense the specific primary user for dealing with Primary User Emulation (PUE) Attack which is a possible threat to wireless security. According to ATSC digital TV which is one of the important PUs, we estimate the accuracies of pilot and symbol rate as RF fingerprint (RFF), and Support Vector Data Description (SVDD) is introduced to sense the fine differences of RFF to distinguish PUE attacker from PU. The simulation results show that the proposed scheme is feasible to verify the PUE attacker at a relative high SNR level.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115591588","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089757
Feng Zhou, Qingsheng Hu
This paper presents an FPGA-based design and implementation of TCP packet reordering for multiple TCP connections. In the packet processing, two FIFOs are used to preserve the packet header information and data information, respectively. The reordering process is based on the sequence and command information which can be used to determine where and how many to store the coming disorder packet or just send the ordered packet to application layer directly. This design has the advantages of high speed and good flexibility. The performance analysis shows that the data transmission collision is only 1.6% in the worst case. Using Altera FPGA, the design can be realized at 175MHz working frequency.
{"title":"High-performance FPGA implementation of packet reordering for multiple TCP connections","authors":"Feng Zhou, Qingsheng Hu","doi":"10.1109/ISCIT.2011.6089757","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089757","url":null,"abstract":"This paper presents an FPGA-based design and implementation of TCP packet reordering for multiple TCP connections. In the packet processing, two FIFOs are used to preserve the packet header information and data information, respectively. The reordering process is based on the sequence and command information which can be used to determine where and how many to store the coming disorder packet or just send the ordered packet to application layer directly. This design has the advantages of high speed and good flexibility. The performance analysis shows that the data transmission collision is only 1.6% in the worst case. Using Altera FPGA, the design can be realized at 175MHz working frequency.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122930926","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092158
Ruofan Jin, D. Grace, P. Mitchell
In this paper we study a cognitive power allocation scheme for a fully distributed Ultra Wide Band (UWB) system. We show that the highly restricted spectrum power density and multi-user interference can be mitigated by means of a game based solution. The impact of UWB frequency selective fading on our cognitive power allocation scheme is examined and we compare our scheme with the existing iterative water filling technique. The results show that our proposed power allocation scheme is equal to or more power efficient than the iterative water filling technique in a UWB fading channel, while also converging significantly faster.
{"title":"Cognitive UWB spectrum sharing and power allocation in a multipath fading channel","authors":"Ruofan Jin, D. Grace, P. Mitchell","doi":"10.1109/ISCIT.2011.6092158","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092158","url":null,"abstract":"In this paper we study a cognitive power allocation scheme for a fully distributed Ultra Wide Band (UWB) system. We show that the highly restricted spectrum power density and multi-user interference can be mitigated by means of a game based solution. The impact of UWB frequency selective fading on our cognitive power allocation scheme is examined and we compare our scheme with the existing iterative water filling technique. The results show that our proposed power allocation scheme is equal to or more power efficient than the iterative water filling technique in a UWB fading channel, while also converging significantly faster.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850599","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092190
Chenxi Lu, Yunhua Tan, Lezhu Zhou
A new adaptive Kalman filtering algorithm for dual-frequency navigation with carrier phase is presented. By reducing the filtering order after full-order initialization, this algorithm saves the extra computational cost brought by carrier phase observations. The improved adaptation of state covariance matrix in reduced-order processing also improves filtering precision and robustness. Finally applications on both static data and kinetic simulations demonstrate the validity and efficiency of the algorithm.
{"title":"Reduced-order adaptive Kalman filtering for dual-frequency navigation with carrier phase","authors":"Chenxi Lu, Yunhua Tan, Lezhu Zhou","doi":"10.1109/ISCIT.2011.6092190","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092190","url":null,"abstract":"A new adaptive Kalman filtering algorithm for dual-frequency navigation with carrier phase is presented. By reducing the filtering order after full-order initialization, this algorithm saves the extra computational cost brought by carrier phase observations. The improved adaptation of state covariance matrix in reduced-order processing also improves filtering precision and robustness. Finally applications on both static data and kinetic simulations demonstrate the validity and efficiency of the algorithm.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129618938","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089756
Kyung-Hyo Lee, Y. Miyanaga
This paper proposes Low-Pass running spectrum filtering (Low-Pass RSF) with low filter order. Using the proposed filtering, additive noises in high frequency band of the modulation spectrum domain are reduced and high speed calculation mechanism are realized. The cepstrum mean subtraction method (CMS) and dynamic range adjustment (DRA) are also employed with Low-Pass RSF. Using the proposed method, the similar recognition performance as conventional noise robust speech recognition can be obtained with quite low calculation cost.
{"title":"A study of robust speech recognition using modified running-spectrum-filtering","authors":"Kyung-Hyo Lee, Y. Miyanaga","doi":"10.1109/ISCIT.2011.6089756","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089756","url":null,"abstract":"This paper proposes Low-Pass running spectrum filtering (Low-Pass RSF) with low filter order. Using the proposed filtering, additive noises in high frequency band of the modulation spectrum domain are reduced and high speed calculation mechanism are realized. The cepstrum mean subtraction method (CMS) and dynamic range adjustment (DRA) are also employed with Low-Pass RSF. Using the proposed method, the similar recognition performance as conventional noise robust speech recognition can be obtained with quite low calculation cost.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124646175","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089723
H. Hamdoun, P. Loskot, T. O’Farrell
Scalability of network coding (NC) for a two-way relay channel (TWRC) is investigated in a scenario where the multiple user equipments (UEs) are served by one relay station (RS) in a single Long Term Evolution (LTE) cell. In this context, the NC is employed independently over the multiple TWRCs formed by each UE, and more importantly, assuming that the radio resources are shared by all the UEs in the cell. The performance of this NC scheme is assessed in terms of the radio overhead energy reduction gain (ERG), the throughput gain and the number of resource blocks (RBs) saved due to NC. The operational energy consumptions of the base station (eNB) and of the RS are also considered in our analysis. It is found that the gains due to NC are scalable with the number of UEs and with the offered traffic load in the cell. Furthermore, since the operational energy dominates the overall energy consumption, the corresponding ERG of the NC is almost independent of the number of UEs.
{"title":"Scalability of two-way relay channel network coding in a relay enhanced LTE cell","authors":"H. Hamdoun, P. Loskot, T. O’Farrell","doi":"10.1109/ISCIT.2011.6089723","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089723","url":null,"abstract":"Scalability of network coding (NC) for a two-way relay channel (TWRC) is investigated in a scenario where the multiple user equipments (UEs) are served by one relay station (RS) in a single Long Term Evolution (LTE) cell. In this context, the NC is employed independently over the multiple TWRCs formed by each UE, and more importantly, assuming that the radio resources are shared by all the UEs in the cell. The performance of this NC scheme is assessed in terms of the radio overhead energy reduction gain (ERG), the throughput gain and the number of resource blocks (RBs) saved due to NC. The operational energy consumptions of the base station (eNB) and of the RS are also considered in our analysis. It is found that the gains due to NC are scalable with the number of UEs and with the offered traffic load in the cell. Furthermore, since the operational energy dominates the overall energy consumption, the corresponding ERG of the NC is almost independent of the number of UEs.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129450678","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089726
Zhou Feng, Wei Wang, R. Guo
In the wireless communication and ultra-wideband communication, Single Carrier Frequency Domain Equalization (SC-FDE) has received extensive concern with its high spectral using efficiency and simple implementation of equalization in recent years. The paper mainly integrates SC-FDE and Space Diversity technology and designs a scheme which is suitable for underwater acoustic communication. The simulation and the experiment verify that the algorithm can effectively reduce error probabilities and rapidly implement the combination of each branch.
{"title":"Method of space diversity frequency combining based on single carrier frequency domain equalization","authors":"Zhou Feng, Wei Wang, R. Guo","doi":"10.1109/ISCIT.2011.6089726","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089726","url":null,"abstract":"In the wireless communication and ultra-wideband communication, Single Carrier Frequency Domain Equalization (SC-FDE) has received extensive concern with its high spectral using efficiency and simple implementation of equalization in recent years. The paper mainly integrates SC-FDE and Space Diversity technology and designs a scheme which is suitable for underwater acoustic communication. The simulation and the experiment verify that the algorithm can effectively reduce error probabilities and rapidly implement the combination of each branch.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123345917","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092188
Jinsong Wu, P. Xiao, Qingchun Chen, S. Blostein
This paper investigates joint complex diversity coding (CDC) and error control coding (ECC) to increase diversity gains across multiple antennas, OFDM blocks, and OFDM sub-carriers. A general diversity analysis for joint CDC and ECC based space-time-frequency codes (STFCs) is provided. The mapping designs from ECC to CDC are crucial for efficient exploitation of the diversity potential. This paper provides and proves a sufficient condition of full diversity construction with joint 3D CDC and ECC, bit-interleaved coded complex diversity coding (BICCDC) and symbol-interleaved coded complex diversity coding (SICCDC). A multi-stream architecture is also introduced to reduce the complexity and latency of the decoding process.
{"title":"Three-dimensional combined diversity coding and error control coding: Code design and diversity analysis","authors":"Jinsong Wu, P. Xiao, Qingchun Chen, S. Blostein","doi":"10.1109/ISCIT.2011.6092188","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092188","url":null,"abstract":"This paper investigates joint complex diversity coding (CDC) and error control coding (ECC) to increase diversity gains across multiple antennas, OFDM blocks, and OFDM sub-carriers. A general diversity analysis for joint CDC and ECC based space-time-frequency codes (STFCs) is provided. The mapping designs from ECC to CDC are crucial for efficient exploitation of the diversity potential. This paper provides and proves a sufficient condition of full diversity construction with joint 3D CDC and ECC, bit-interleaved coded complex diversity coding (BICCDC) and symbol-interleaved coded complex diversity coding (SICCDC). A multi-stream architecture is also introduced to reduce the complexity and latency of the decoding process.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131083005","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089727
Dongsheng Wang, Pin Lv, Yingwen Chen, Ming Xu
Wireless mesh network (WMN) is deemed as a promising technology to provide last few miles connectivity. Multi-radio multi-channel mesh nodes are often used to increase the chance of concurrent transmission. Although IEEE 802.11b/g standards define 11 available channels, the maximum number of non-overlapping channels is only three. Most existing channel assignment schemes are based on these non-overlapping channels. However, exploiting the partially overlapped channels can further improve the network performance. In this paper, we model the partially overlapped channels and propose a new partially overlapped channel assignment algorithm called POCAM. The POCAM algorithm stems from the measurements of commercial radios on real testbeds. The characteristics of traffic distribution in the WMN backhaul are also taken into consideration. The simulation results based on NS-3 demonstrate that POCAM achieves much better performance than the traditional channel assignment schemes which only utilize non-overlapping channels.
{"title":"POCAM: Partially overlapped channel assignment in multi-radio multi-channel wireless mesh network","authors":"Dongsheng Wang, Pin Lv, Yingwen Chen, Ming Xu","doi":"10.1109/ISCIT.2011.6089727","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089727","url":null,"abstract":"Wireless mesh network (WMN) is deemed as a promising technology to provide last few miles connectivity. Multi-radio multi-channel mesh nodes are often used to increase the chance of concurrent transmission. Although IEEE 802.11b/g standards define 11 available channels, the maximum number of non-overlapping channels is only three. Most existing channel assignment schemes are based on these non-overlapping channels. However, exploiting the partially overlapped channels can further improve the network performance. In this paper, we model the partially overlapped channels and propose a new partially overlapped channel assignment algorithm called POCAM. The POCAM algorithm stems from the measurements of commercial radios on real testbeds. The characteristics of traffic distribution in the WMN backhaul are also taken into consideration. The simulation results based on NS-3 demonstrate that POCAM achieves much better performance than the traditional channel assignment schemes which only utilize non-overlapping channels.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121941239","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
扫码关注我们
求助内容：
应助结果提醒方式：