Pub Date : 2015-04-27DOI: 10.1109/ICT.2015.7124667
Y. Sun, Yuhui Yao, D. Han, C. Phillips
This paper proposes a cross-layer wireless routing protocol called REAR (Radio Environment Adaptive Routing Protocol), which operates with Cognitive Radio (CR) Mobile Ad Hoc Networks (CRMANET). Unlike conventional on-demand routing protocols for ad hoc networks, the design of REAR allows nodes along the route to adjust the next hop according to real-time radio environment conditions during the transmission. This flexibility benefits the communication by reducing the risk of link breaks in the CRMANET and so improves the overall network performance and spectrum utilization. Simulation results show that, compared to DSR [2] and CRMBR [8], REAR provides higher robustness in a rapid changing ad hoc environment. Therefore the overall network throughput is improved with reduced end-to-end delay.
{"title":"REAR: A radio environment adaptive routing protocol for CR Mobile Ad hoc Networks","authors":"Y. Sun, Yuhui Yao, D. Han, C. Phillips","doi":"10.1109/ICT.2015.7124667","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124667","url":null,"abstract":"This paper proposes a cross-layer wireless routing protocol called REAR (Radio Environment Adaptive Routing Protocol), which operates with Cognitive Radio (CR) Mobile Ad Hoc Networks (CRMANET). Unlike conventional on-demand routing protocols for ad hoc networks, the design of REAR allows nodes along the route to adjust the next hop according to real-time radio environment conditions during the transmission. This flexibility benefits the communication by reducing the risk of link breaks in the CRMANET and so improves the overall network performance and spectrum utilization. Simulation results show that, compared to DSR [2] and CRMBR [8], REAR provides higher robustness in a rapid changing ad hoc environment. Therefore the overall network throughput is improved with reduced end-to-end delay.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122986008","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124708
Zhilin Li, Wenbo Xu, Yue Wang, Jiaru Lin
Reconstruction algorithm is a significant research field of compressed sensing (CS). Among existing algorithms, regularized orthogonal matching pursuit (ROMP) enjoys the merit of implementing fast recovery procedures. Recent studies have recognized that sparse signals have special sparse structure, which is useful for reconstruction as prior information. In this paper, by utilizing the sparse tree structure as prior information, we propose a tree-based regularized orthogonal matching pursuit (T-ROMP) reconstruction algorithm. Furthermore, we set a ratio factor to reduce the error probability of the support set. Compared to ROMP, simulation results indicate that the proposed algorithm achieve better reconstruction performance for different conditions.
{"title":"A tree-based regularized orthogonal matching pursuit algorithm","authors":"Zhilin Li, Wenbo Xu, Yue Wang, Jiaru Lin","doi":"10.1109/ICT.2015.7124708","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124708","url":null,"abstract":"Reconstruction algorithm is a significant research field of compressed sensing (CS). Among existing algorithms, regularized orthogonal matching pursuit (ROMP) enjoys the merit of implementing fast recovery procedures. Recent studies have recognized that sparse signals have special sparse structure, which is useful for reconstruction as prior information. In this paper, by utilizing the sparse tree structure as prior information, we propose a tree-based regularized orthogonal matching pursuit (T-ROMP) reconstruction algorithm. Furthermore, we set a ratio factor to reduce the error probability of the support set. Compared to ROMP, simulation results indicate that the proposed algorithm achieve better reconstruction performance for different conditions.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"307 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114804977","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124684
C. Pavlovski, Claudia Warwar, Brett Paskin, Gary Chan
The progression towards the use of mobile network devices in all facets of personal, business and leisure activity has created new threats to users and challenges to the industry to preserve security and privacy. Whilst mobility provides a means for interacting with others and accessing content in an easy and malleable way, these devices are increasingly being targeted by malicious parties in a variety of attacks. In addition, web technologies and applications are supplying more function and capability that attracts users to social media sites, e-shopping malls, and for managing finances (banking). The primary mechanism for authentication still employs a username and password based approach. This is often extended with additional (multifactor) authentication tools such as one time identifiers, hardware tokens, and biometrics. In this paper we discuss the threats, risks and challenges with user authentication and present the techniques to counter these problems with several patterns and approaches. We then outline a framework for supplying these authentication capabilities to the industry based on a unified authentication hub.
{"title":"Unified framework for multifactor authentication","authors":"C. Pavlovski, Claudia Warwar, Brett Paskin, Gary Chan","doi":"10.1109/ICT.2015.7124684","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124684","url":null,"abstract":"The progression towards the use of mobile network devices in all facets of personal, business and leisure activity has created new threats to users and challenges to the industry to preserve security and privacy. Whilst mobility provides a means for interacting with others and accessing content in an easy and malleable way, these devices are increasingly being targeted by malicious parties in a variety of attacks. In addition, web technologies and applications are supplying more function and capability that attracts users to social media sites, e-shopping malls, and for managing finances (banking). The primary mechanism for authentication still employs a username and password based approach. This is often extended with additional (multifactor) authentication tools such as one time identifiers, hardware tokens, and biometrics. In this paper we discuss the threats, risks and challenges with user authentication and present the techniques to counter these problems with several patterns and approaches. We then outline a framework for supplying these authentication capabilities to the industry based on a unified authentication hub.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336196","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124668
Dejing Zhang, Enqing Dong
Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.
{"title":"A bypassing void routing combining of geographic and virtual coordinate information for WSN","authors":"Dejing Zhang, Enqing Dong","doi":"10.1109/ICT.2015.7124668","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124668","url":null,"abstract":"Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122091495","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124692
Shuiyin Liu, Y. Hong, E. Viterbo
While the impact of finite-rate feedback on the capacity of fading channels has been extensively studied in the literature, not much attention has been paid to this problem under secrecy constraint. This paper provides a survey of recent research on physical-layer security considering quantized channel state information (CSI) at the transmitter and perfect CSI at the legitimate receiver, under the assumption that only the statistics of eavesdropper CSI is known at the transmitter. We start by introducing the classical notion of secrecy capacity. Then we show how finite-rate feedback degrades the secrecy capacity.
{"title":"Wiretap channel with finite-rate feedback","authors":"Shuiyin Liu, Y. Hong, E. Viterbo","doi":"10.1109/ICT.2015.7124692","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124692","url":null,"abstract":"While the impact of finite-rate feedback on the capacity of fading channels has been extensively studied in the literature, not much attention has been paid to this problem under secrecy constraint. This paper provides a survey of recent research on physical-layer security considering quantized channel state information (CSI) at the transmitter and perfect CSI at the legitimate receiver, under the assumption that only the statistics of eavesdropper CSI is known at the transmitter. We start by introducing the classical notion of secrecy capacity. Then we show how finite-rate feedback degrades the secrecy capacity.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132406801","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124648
Wenli Liu, Li Guo, Tianyu Kang, Jianwei Zhang, Jiaru Lin
In cognitive radio (CR) systems, we often use jamming schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, it also needs additional signal sources to transmit artificial noise. In this paper, we investigate the multiple-input single-output (MISO) cognitive radio system where two secondary links secure each other's communication. Each secondary transmitter (ST) sends intended messages to its own receiver while acts as a friendly jammer to the other CRN. Our target is to maximize the worst-user's secrecy rate while limiting the interference in the direction of the primary receiver. We solve the problem through a sequence of convex semidefinite programs (SDPs) under individual power constraints. We also introduce two sub-optimal zero-forcing (ZF) beamforming methods, one of which solves the problem based on SDP and the other adopts the approach of Pareto-optimal parameterization in a more computationally efficient way.
{"title":"Secure cognitive radio system with cooperative secondary networks","authors":"Wenli Liu, Li Guo, Tianyu Kang, Jianwei Zhang, Jiaru Lin","doi":"10.1109/ICT.2015.7124648","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124648","url":null,"abstract":"In cognitive radio (CR) systems, we often use jamming schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, it also needs additional signal sources to transmit artificial noise. In this paper, we investigate the multiple-input single-output (MISO) cognitive radio system where two secondary links secure each other's communication. Each secondary transmitter (ST) sends intended messages to its own receiver while acts as a friendly jammer to the other CRN. Our target is to maximize the worst-user's secrecy rate while limiting the interference in the direction of the primary receiver. We solve the problem through a sequence of convex semidefinite programs (SDPs) under individual power constraints. We also introduce two sub-optimal zero-forcing (ZF) beamforming methods, one of which solves the problem based on SDP and the other adopts the approach of Pareto-optimal parameterization in a more computationally efficient way.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130034148","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124657
W. Muhamad, J. Khan, Jason Brown
This paper introduces a new contention window (CW) adaptation algorithm to reduce the collision level in an IEEE802.11 based network with the main objective of maximizing energy efficiency while maintaining required Quality of Service (QoS) performance. The main concept of the proposed algorithm is to dynamically adjust the contention window size according to the network load condition, which represents the level of congestion in a network. Performance analysis is carried out using an OPNET based simulation model to study the effects of CW adaptation on the energy efficiency and QoS performance. Performance of the proposed algorithm is compared with the legacy Distributed Coordination Function (DCF) and other CW adaptation algorithms such as Fast Collision Resolution (FCR) and CW tuning. The results show that the proposed algorithm outperforms the other techniques in terms of reducing collision level and that directly translates to higher energy efficiency as well as better QoS performance. The proposed protocol can be extended to support multi-class traffic with different priorities.
{"title":"Energy efficient contention window adaptation algorithm for IEEE 802.11 WLAN","authors":"W. Muhamad, J. Khan, Jason Brown","doi":"10.1109/ICT.2015.7124657","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124657","url":null,"abstract":"This paper introduces a new contention window (CW) adaptation algorithm to reduce the collision level in an IEEE802.11 based network with the main objective of maximizing energy efficiency while maintaining required Quality of Service (QoS) performance. The main concept of the proposed algorithm is to dynamically adjust the contention window size according to the network load condition, which represents the level of congestion in a network. Performance analysis is carried out using an OPNET based simulation model to study the effects of CW adaptation on the energy efficiency and QoS performance. Performance of the proposed algorithm is compared with the legacy Distributed Coordination Function (DCF) and other CW adaptation algorithms such as Fast Collision Resolution (FCR) and CW tuning. The results show that the proposed algorithm outperforms the other techniques in terms of reducing collision level and that directly translates to higher energy efficiency as well as better QoS performance. The proposed protocol can be extended to support multi-class traffic with different priorities.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132875402","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124649
Jun Zhang, Li Guo, Tianyu Kang, Jianwei Zhang
When a cognitive radio network shares the spectrum with a primary network, the harmful interference to the primary users is one of the most important concerns. In this paper, we propose a new cognitive scheme which has two cognitive sub-networks sharing the same relay station, considering the interference to the primary user. We study the Weighted Rate Balance problem with the constraint of the transmit power of the cognitive network. Joint beamforming at the cognitive base station and the relay station is used to maximize the Weighted Rate Balance of SUs. To solve the non-convex problem, we adopt the classic altering optimization method, namely the Blahut-Arimoto algorithm. We show that we only need to solve several semidefinite programming(SDP) sub-problems, which have linear matrix inequalities(LMIs), in each iterative step. Simulation results show that, compared with the widely studied diagonally structured beamforming design, the proposed approach performs better.
{"title":"Beamforming design for weighted rate balance in cognitive network","authors":"Jun Zhang, Li Guo, Tianyu Kang, Jianwei Zhang","doi":"10.1109/ICT.2015.7124649","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124649","url":null,"abstract":"When a cognitive radio network shares the spectrum with a primary network, the harmful interference to the primary users is one of the most important concerns. In this paper, we propose a new cognitive scheme which has two cognitive sub-networks sharing the same relay station, considering the interference to the primary user. We study the Weighted Rate Balance problem with the constraint of the transmit power of the cognitive network. Joint beamforming at the cognitive base station and the relay station is used to maximize the Weighted Rate Balance of SUs. To solve the non-convex problem, we adopt the classic altering optimization method, namely the Blahut-Arimoto algorithm. We show that we only need to solve several semidefinite programming(SDP) sub-problems, which have linear matrix inequalities(LMIs), in each iterative step. Simulation results show that, compared with the widely studied diagonally structured beamforming design, the proposed approach performs better.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122017528","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124691
Dong Wei, Meng Zhang, W. Fan, Wei-qing Huang
A Polarized Phase Shifting Keying/Quadrature Amplitude Modulation(PPSK/PQAM) scheme in the wireless depolarized channel is proposed. Such scheme uses the carrier's polarization state, amplitude and phase as the information bearing parameters, and can further improve the traditional modulation methods' spectrum efficiency. The impairment to PPSK/PQAM from the wireless depolarized channel is quantitatively analyzed. To mitigate such impairment, a constellation compensation algorithm is also presented. Furthermore, the PPSK/PQAM's symbol error rate is derived on the basis of the proposed constellation compensation; then to maximize the PPSK/PQAM's link spectrum efficiency (LSE), the optimal modulation ratio, which is defined as the ratio of the data rata achieved by the polarization state and amplitude-phase, is also calculated. Finally, simulations show that PPSK/PQAM's SER and LSE performance have significant advantage over the traditional PSK/QAM modulation methods.
{"title":"A spectrum efficient polarized PSK/QAM scheme in the wireless channel with polarization dependent loss effect","authors":"Dong Wei, Meng Zhang, W. Fan, Wei-qing Huang","doi":"10.1109/ICT.2015.7124691","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124691","url":null,"abstract":"A Polarized Phase Shifting Keying/Quadrature Amplitude Modulation(PPSK/PQAM) scheme in the wireless depolarized channel is proposed. Such scheme uses the carrier's polarization state, amplitude and phase as the information bearing parameters, and can further improve the traditional modulation methods' spectrum efficiency. The impairment to PPSK/PQAM from the wireless depolarized channel is quantitatively analyzed. To mitigate such impairment, a constellation compensation algorithm is also presented. Furthermore, the PPSK/PQAM's symbol error rate is derived on the basis of the proposed constellation compensation; then to maximize the PPSK/PQAM's link spectrum efficiency (LSE), the optimal modulation ratio, which is defined as the ratio of the data rata achieved by the polarization state and amplitude-phase, is also calculated. Finally, simulations show that PPSK/PQAM's SER and LSE performance have significant advantage over the traditional PSK/QAM modulation methods.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125848507","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124682
Weizhong Zheng, Shengli Zhang, G. Wang, Qing F. Zhou, Mingjun Dai
Because of the broadcasting nature of wireless communications, passive eavesdropping is a well-known security loophole. Generally there are two basic ideas to deal with the eavesdropper at physical layer: friendly jamming and channel state information dependent encoding. Based on the channel quantized physical-layer network coding (CQ-PNC), we propose a secured CQ-PNC scheme to combine both ideas aforementioned to prevent the eavesdropper from obtaining the messages. Specifically, the CQ-PNC consists of co-channel signal superposition in the air (friendly jamming) and channel state information dependent mapping (PNC mapping). As a result, the information is more difficult to be detected at the eavesdropper, meanwhile there is almost no rate loss at the legal receiver. To verify the effectiveness of the proposed secure CQ-PNC, we implemented the scheme on a software defined radio (USRP) experimental platform.
{"title":"Secure TWRC system based on channel quantized PNC","authors":"Weizhong Zheng, Shengli Zhang, G. Wang, Qing F. Zhou, Mingjun Dai","doi":"10.1109/ICT.2015.7124682","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124682","url":null,"abstract":"Because of the broadcasting nature of wireless communications, passive eavesdropping is a well-known security loophole. Generally there are two basic ideas to deal with the eavesdropper at physical layer: friendly jamming and channel state information dependent encoding. Based on the channel quantized physical-layer network coding (CQ-PNC), we propose a secured CQ-PNC scheme to combine both ideas aforementioned to prevent the eavesdropper from obtaining the messages. Specifically, the CQ-PNC consists of co-channel signal superposition in the air (friendly jamming) and channel state information dependent mapping (PNC mapping). As a result, the information is more difficult to be detected at the eavesdropper, meanwhile there is almost no rate loss at the legal receiver. To verify the effectiveness of the proposed secure CQ-PNC, we implemented the scheme on a software defined radio (USRP) experimental platform.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259138","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
扫码关注我们
求助内容：
应助结果提醒方式：