Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546450
Miao Yuan, Guoqiang Bai
A variety of masking schemes have been introduced to protect the block cipher. The critical technology lies on how to implement the nonlinear part with minimal resources. One popular way to solve this problem is using tower field representation. However, this idea always need two variables as inputs for conversion, which may result in suspicious first-order leakages during this operation. In this paper, we apply first-order attacks against variables of the conversion part based on simulation experiments to prove our speculation. The simulation results show that our proposed idea is more efficient than the second-order attacks in the noisy scenario.
{"title":"Detecting first-order leakages against the tower field masking scheme","authors":"Miao Yuan, Guoqiang Bai","doi":"10.1109/CITS.2016.7546450","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546450","url":null,"abstract":"A variety of masking schemes have been introduced to protect the block cipher. The critical technology lies on how to implement the nonlinear part with minimal resources. One popular way to solve this problem is using tower field representation. However, this idea always need two variables as inputs for conversion, which may result in suspicious first-order leakages during this operation. In this paper, we apply first-order attacks against variables of the conversion part based on simulation experiments to prove our speculation. The simulation results show that our proposed idea is more efficient than the second-order attacks in the noisy scenario.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709249","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546411
Yun Zhang, Yu Guo, Zhenqiang Mi, Yang Yang, M. Obaidat
As the virtual backbone of the network, connected dominating set (CDS) plays an important role in supporting data communication, reducing the routing overhead, and enhancing the scalability of the network. Traditional CDS construction algorithms are usually applied to the networks with homogeneous nodes, e.g., a pure wireless sensor network. In the past few years, Wireless Sensor and Actor Networks (WSANs) have attracted growing attentions due to its capabilities of sensing and gathering information, as well as performing certain tasks by actor nodes. One of the most critical issues in WSAN is how to construct an appropriate CDS with the consideration of heterogeneous nodes. Specifically, how to construct the CDS that contains minimum number of actors, so that the movement of actors poses a minimal threat to the integrity of the CDS. In this paper, we take the nature of the actor nodes into consideration and propose a CDS construction algorithm named Min-Actor algorithm (MIA), which can reduce nodes' movement constraints in WSAN. Simulation results confirm that MIA can effectively reduce the number of the actors in CDS, thus reducing the impact of actors' movement on the network.
{"title":"A Min-Actor algorithm for connected dominating set formation in WSAN","authors":"Yun Zhang, Yu Guo, Zhenqiang Mi, Yang Yang, M. Obaidat","doi":"10.1109/CITS.2016.7546411","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546411","url":null,"abstract":"As the virtual backbone of the network, connected dominating set (CDS) plays an important role in supporting data communication, reducing the routing overhead, and enhancing the scalability of the network. Traditional CDS construction algorithms are usually applied to the networks with homogeneous nodes, e.g., a pure wireless sensor network. In the past few years, Wireless Sensor and Actor Networks (WSANs) have attracted growing attentions due to its capabilities of sensing and gathering information, as well as performing certain tasks by actor nodes. One of the most critical issues in WSAN is how to construct an appropriate CDS with the consideration of heterogeneous nodes. Specifically, how to construct the CDS that contains minimum number of actors, so that the movement of actors poses a minimal threat to the integrity of the CDS. In this paper, we take the nature of the actor nodes into consideration and propose a CDS construction algorithm named Min-Actor algorithm (MIA), which can reduce nodes' movement constraints in WSAN. Simulation results confirm that MIA can effectively reduce the number of the actors in CDS, thus reducing the impact of actors' movement on the network.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864725","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546389
Z. Liu, Ruoyu Wang, Deyu Tang
A huge amount of mobile traffic runs on Internet every day. The complex mobile traffic data may degrade the network performance if they are not well managed. As the important foundation of network management, mobile network traffic classification aim to map IP packets into a predefined traffic class set. Most work in this area until now has focused on classification schemes. In contrast, little attention has been paid towards traffic class definition. Various kinds of traffic class lead to difficultly comparing these traffic classification methods. This paper presents a mobile traffic taxonomy based on ontology paradigm. Its meta-characteristic is the mobile traffic communication from users' perspective. It defines mobile network traffic into four levels of categories. And the taxonomy could be used for multiple traffic classification purposes.
{"title":"Research on mobile network traffic taxonomy","authors":"Z. Liu, Ruoyu Wang, Deyu Tang","doi":"10.1109/CITS.2016.7546389","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546389","url":null,"abstract":"A huge amount of mobile traffic runs on Internet every day. The complex mobile traffic data may degrade the network performance if they are not well managed. As the important foundation of network management, mobile network traffic classification aim to map IP packets into a predefined traffic class set. Most work in this area until now has focused on classification schemes. In contrast, little attention has been paid towards traffic class definition. Various kinds of traffic class lead to difficultly comparing these traffic classification methods. This paper presents a mobile traffic taxonomy based on ontology paradigm. Its meta-characteristic is the mobile traffic communication from users' perspective. It defines mobile network traffic into four levels of categories. And the taxonomy could be used for multiple traffic classification purposes.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439065","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}
Temporal neural networks such as Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM) are popular for their incremental and explicit learning abilities. However, for sub-sequence clustering TKM and RSOM may generate many fragments whose classification membership is hard to decide. Besides they have stability issues in multivariate time series processing because they model the historical neuron activities on each variable independently. To overcome the drawbacks, we propose an adaptive sub-sequence clustering method based on single layered Self-Organizing Incremental Neural Network (SOINN). A recurrent filter is proposed to model the quantizations of neuron activations each as a scalar instead of a vector like in TKM and RSOM. Then it is integrated with the single layered SOINN for adaptive clustering where fragmented clusters in TKM and RSOM is replaced by a smoothed clustering result. Experiments are carried out on two datasets, namely a traffic flow dataset from open Caltrans performance measurement systems and a part of the KDD Cup 99 intrusion detection dataset. Experimental results show that the proposed method outperforms the conventional methods by 21.3% and 9.1% on the two datasets respectively.
时间神经网络如时间Kohonen Map (TKM)和递归自组织Map (RSOM)因其增量式和显式学习能力而广受欢迎。然而，对于子序列聚类，TKM和RSOM可能会产生许多难以确定分类隶属的片段。此外，它们在多变量时间序列处理中存在稳定性问题，因为它们独立地对每个变量的历史神经元活动进行建模。为了克服这种缺点，提出了一种基于单层自组织增量神经网络(SOINN)的自适应子序列聚类方法。提出了一种递归滤波器，将神经元激活的量化建模为标量，而不是像TKM和RSOM那样的向量。然后结合单层SOINN进行自适应聚类，将TKM和RSOM中的碎片聚类替换为平滑聚类结果。实验在两个数据集上进行，即来自开放Caltrans性能测量系统的交通流数据集和KDD Cup 99入侵检测数据集的一部分。实验结果表明，该方法在两个数据集上分别比传统方法提高了21.3%和9.1%。
{"title":"A temporal self-organizing neural network for adaptive sub-sequence clustering and case studies","authors":"Dong Wang, Yanfang Long, Zhu Xiao, Zhiyang Xiang, Wenjie Chen","doi":"10.1109/CITS.2016.7546436","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546436","url":null,"abstract":"Temporal neural networks such as Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM) are popular for their incremental and explicit learning abilities. However, for sub-sequence clustering TKM and RSOM may generate many fragments whose classification membership is hard to decide. Besides they have stability issues in multivariate time series processing because they model the historical neuron activities on each variable independently. To overcome the drawbacks, we propose an adaptive sub-sequence clustering method based on single layered Self-Organizing Incremental Neural Network (SOINN). A recurrent filter is proposed to model the quantizations of neuron activations each as a scalar instead of a vector like in TKM and RSOM. Then it is integrated with the single layered SOINN for adaptive clustering where fragmented clusters in TKM and RSOM is replaced by a smoothed clustering result. Experiments are carried out on two datasets, namely a traffic flow dataset from open Caltrans performance measurement systems and a part of the KDD Cup 99 intrusion detection dataset. Experimental results show that the proposed method outperforms the conventional methods by 21.3% and 9.1% on the two datasets respectively.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115049395","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}
The emergence of new technologies about the smart home system provides more innovative ideas and solutions, and the smart home system based on the Internet of Things can achieve the convenience of life by sensing, interconnection and intelligent control. However, most methods of controlling the appliances are based on the expatiatory menu, and users usually need to choose the electrical appliances by page turning of the menu items, which is not convenient. Therefore, this paper proposed a distinctive system based on indoor location and attitude estimation. Further more, the indoor location algorithm is achieved with the combination of image pattern recognition and fingerprint matching. The user can choose the appliances that he wants and control them by touching the screen of the mobile device while the mobile device is pointing to the appliance. The prototype of the smart home system is implemented and the availability test is conducted. It proved that the solution will simplify the control operation procedure and improve the user's experience.
{"title":"A smart home control system based on indoor location and attitude estimation","authors":"Mingliang Xiong, Yiming Wu, Yipeng Ding, Xueyu Mao, Zhenyi Fang, Haiping Huang","doi":"10.1109/CITS.2016.7546460","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546460","url":null,"abstract":"The emergence of new technologies about the smart home system provides more innovative ideas and solutions, and the smart home system based on the Internet of Things can achieve the convenience of life by sensing, interconnection and intelligent control. However, most methods of controlling the appliances are based on the expatiatory menu, and users usually need to choose the electrical appliances by page turning of the menu items, which is not convenient. Therefore, this paper proposed a distinctive system based on indoor location and attitude estimation. Further more, the indoor location algorithm is achieved with the combination of image pattern recognition and fingerprint matching. The user can choose the appliances that he wants and control them by touching the screen of the mobile device while the mobile device is pointing to the appliance. The prototype of the smart home system is implemented and the availability test is conducted. It proved that the solution will simplify the control operation procedure and improve the user's experience.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122675115","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546432
Wenjie Chen, Huashan Li, Zhongfeng Li, Zhu Xiao, Dong Wang
Various types of small cell base stations (SBSs) are deployed randomly in heterogeneous small cell network to meet the soaring growth in traffic, which leads to more and more complex network topological structure and resource management. In this paper, we analyze the coverage performance and energy efficiency of a two tier heterogeneous network which is composed of micro tier and pico tier. With the aid of stochastic geometry tools and PPP properties, the analytical expression of success probability for each tier is derived to evaluate the tier's coverage performance how to vary with the SBS deployment density. In addition, the energy efficiency optimization question is formulated in terms of the resource allocation fairness proposed in this paper. Base on the analytical results, numerical simulations show that the effects that the SBS deployment density has on the coverage performance and energy efficiency and confirms that there exits an optimal SBS density ratio among the two tier which can be applied to maximize the energy efficiency.
{"title":"Optimization of small cell deployment in heterogeneous wireless networks","authors":"Wenjie Chen, Huashan Li, Zhongfeng Li, Zhu Xiao, Dong Wang","doi":"10.1109/CITS.2016.7546432","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546432","url":null,"abstract":"Various types of small cell base stations (SBSs) are deployed randomly in heterogeneous small cell network to meet the soaring growth in traffic, which leads to more and more complex network topological structure and resource management. In this paper, we analyze the coverage performance and energy efficiency of a two tier heterogeneous network which is composed of micro tier and pico tier. With the aid of stochastic geometry tools and PPP properties, the analytical expression of success probability for each tier is derived to evaluate the tier's coverage performance how to vary with the SBS deployment density. In addition, the energy efficiency optimization question is formulated in terms of the resource allocation fairness proposed in this paper. Base on the analytical results, numerical simulations show that the effects that the SBS deployment density has on the coverage performance and energy efficiency and confirms that there exits an optimal SBS density ratio among the two tier which can be applied to maximize the energy efficiency.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120944298","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546455
Dijie Wang, Rong Chai, F. Gao
Root-MUSIC algorithm is a method of DOA estimation based on polynomial rooting. It estimated based on the cost function instead of peak searching, which greatly reduces the computation compared with MUSIC algorithm. However, it came with some other errors. In this letter, we propose a new method based on the the first-order derivative of the cost function and analyze the mean and the MSE of the proposed method. Simulation results show that the improved method performs better than the existing Root-MUSIC method.
{"title":"An improved root-MUSIC algorithm and MSE analysis","authors":"Dijie Wang, Rong Chai, F. Gao","doi":"10.1109/CITS.2016.7546455","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546455","url":null,"abstract":"Root-MUSIC algorithm is a method of DOA estimation based on polynomial rooting. It estimated based on the cost function instead of peak searching, which greatly reduces the computation compared with MUSIC algorithm. However, it came with some other errors. In this letter, we propose a new method based on the the first-order derivative of the cost function and analyze the mean and the MSE of the proposed method. Simulation results show that the improved method performs better than the existing Root-MUSIC method.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121042545","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546406
Min Wang, Xianxian Wang, Xiaomeng Chai, W. Huangfu
In this paper, the capacity of underlaying cellular networks is analyzed by considering the impact of Device-to-Device (D2D) mode, which is shown to be capable of substantially enhancing the sum transmission rate of the cellular network. Based on the theory of stochastic geometry, the successful transmission probabilities of both the D2D users and the conventional cellular users(CUs) are derived, with the D2D transmission rate as well as the sum rate given out simultaneously. Furthermore, the optimal D2D-users(DUs) density that maximizes the sum rate is also derived. In addition, we extend the analysis from single-cell scenario to the multicell environment. Numerical results demonstrate the relationship between D2D-contributed capacity and the D2D-users density. It is shown that the network capacity can be enhanced by increasing the density D2D users when the D2D-users density is relatively low, until a break-even point is approach, in which case further increasing D2D users may even erode the sum rate.
{"title":"The impact of device-to-device communication on the capacity of cellular systems","authors":"Min Wang, Xianxian Wang, Xiaomeng Chai, W. Huangfu","doi":"10.1109/CITS.2016.7546406","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546406","url":null,"abstract":"In this paper, the capacity of underlaying cellular networks is analyzed by considering the impact of Device-to-Device (D2D) mode, which is shown to be capable of substantially enhancing the sum transmission rate of the cellular network. Based on the theory of stochastic geometry, the successful transmission probabilities of both the D2D users and the conventional cellular users(CUs) are derived, with the D2D transmission rate as well as the sum rate given out simultaneously. Furthermore, the optimal D2D-users(DUs) density that maximizes the sum rate is also derived. In addition, we extend the analysis from single-cell scenario to the multicell environment. Numerical results demonstrate the relationship between D2D-contributed capacity and the D2D-users density. It is shown that the network capacity can be enhanced by increasing the density D2D users when the D2D-users density is relatively low, until a break-even point is approach, in which case further increasing D2D users may even erode the sum rate.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116222807","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546424
D. Sharma, S. K. Dhurandher, M. Obaidat, Sahil Pruthi, B. Sadoun
Opportunistic Networks (Oppnets) are the recent evolution of Mobile Ad hoc Networks (MANETs), where an end to end path from the source to the destination does not exist, or exists for a very small amount of time. That is, the connections between the nodes are often intermittent, and the power of the nodes may go up or down. This paper aims at improving the forwarding strategy in the Epidemic routing protocol for Oppnets, which currently makes use of First in First Out (FIFO) strategy to forward the data packets. In this work, Priority Based Forwarding for Epidemic Routing (PBFER) is presented that forwards the packets based on the priority of messages. Through simulations the performance of PBFER is evaluated and compared with Epidemic routing protocol. It has been found out that PBFER performs better than the Epidemic protocol in terms of the number of high priority messages received, latency, delivery probability, overhead ratio, average hop count.
{"title":"A priority based message forwarding scheme for Opportunistic Networks","authors":"D. Sharma, S. K. Dhurandher, M. Obaidat, Sahil Pruthi, B. Sadoun","doi":"10.1109/CITS.2016.7546424","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546424","url":null,"abstract":"Opportunistic Networks (Oppnets) are the recent evolution of Mobile Ad hoc Networks (MANETs), where an end to end path from the source to the destination does not exist, or exists for a very small amount of time. That is, the connections between the nodes are often intermittent, and the power of the nodes may go up or down. This paper aims at improving the forwarding strategy in the Epidemic routing protocol for Oppnets, which currently makes use of First in First Out (FIFO) strategy to forward the data packets. In this work, Priority Based Forwarding for Epidemic Routing (PBFER) is presented that forwards the packets based on the priority of messages. Through simulations the performance of PBFER is evaluated and compared with Epidemic routing protocol. It has been found out that PBFER performs better than the Epidemic protocol in terms of the number of high priority messages received, latency, delivery probability, overhead ratio, average hop count.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126346195","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 : 2016-07-06DOI: 10.1109/CITS.2016.7546418
Hao Deng, Huiming Wang, Yi Zhang, Qian Yang, Xueqin Jiang, Wenjie Wang
In this paper, we investigate the impact of relative distance and large-scale fading of legitimate user and eavesdropper on the artificial noise (AN) assisted secrecy scheme in a multiple-input single-output (MISO) wiretap channel. We show that AN does not always improve the achievable ergodic secrecy rate (ESR), and provide an exact signal-to-noise ratio (SNR) threshold below which AN does not work. We also derive approximately closed-form expressions of AN secrecy gain, which is defined as the difference between the ESR with AN and without AN. Analytical and numerical results verify that the relative distance impacts greatly on the SNR threshold and the AN secrecy gain.
{"title":"The impact of relative distance on artificial-noise-aided secure transmission","authors":"Hao Deng, Huiming Wang, Yi Zhang, Qian Yang, Xueqin Jiang, Wenjie Wang","doi":"10.1109/CITS.2016.7546418","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546418","url":null,"abstract":"In this paper, we investigate the impact of relative distance and large-scale fading of legitimate user and eavesdropper on the artificial noise (AN) assisted secrecy scheme in a multiple-input single-output (MISO) wiretap channel. We show that AN does not always improve the achievable ergodic secrecy rate (ESR), and provide an exact signal-to-noise ratio (SNR) threshold below which AN does not work. We also derive approximately closed-form expressions of AN secrecy gain, which is defined as the difference between the ESR with AN and without AN. Analytical and numerical results verify that the relative distance impacts greatly on the SNR threshold and the AN secrecy gain.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130320642","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
扫码关注我们
求助内容：
应助结果提醒方式：