Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359771
Q. Tang, Jian Wang
In the process of locating in wireless sensor networks, the illegal nodes through Sybil attack can act as anchor nodes by capturing or constructing fake nodes, and further send the wrong location reference information. Considering the nodes through Sybil attack must first pass the neighbor's discovery and identification processes, we propose a secure positioning algorithm based on number allocating and mutual guarantee relying on neighbors. If the declaration number, the guaranteed node and its own ID of a node aren't completely matching, then the neighbors refuse the node to enter the network. The scheme also adopts the authentication mechanism of one-way hash function. There's no need for base station or cluster heads, so we achieve fast, lightweight and high detection rate secure localization. Compared with similar literature, this secure algorithm has a higher detection rate and positioning accuracy, and the communication cost is smaller.
{"title":"A secure positioning algorithm against Sybil attack in wireless sensor networks based on number allocating","authors":"Q. Tang, Jian Wang","doi":"10.1109/ICCT.2017.8359771","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359771","url":null,"abstract":"In the process of locating in wireless sensor networks, the illegal nodes through Sybil attack can act as anchor nodes by capturing or constructing fake nodes, and further send the wrong location reference information. Considering the nodes through Sybil attack must first pass the neighbor's discovery and identification processes, we propose a secure positioning algorithm based on number allocating and mutual guarantee relying on neighbors. If the declaration number, the guaranteed node and its own ID of a node aren't completely matching, then the neighbors refuse the node to enter the network. The scheme also adopts the authentication mechanism of one-way hash function. There's no need for base station or cluster heads, so we achieve fast, lightweight and high detection rate secure localization. Compared with similar literature, this secure algorithm has a higher detection rate and positioning accuracy, and the communication cost is smaller.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130989303","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359681
Shengxiang Li, Guangyi Liu, Ou Li, Siyuan Ding
In this paper, we propose a novel approach called Wntiifs to infer the topology of CSMA/CA wireless network without the need to cooperate in the network or decode the network's messages. The approach divides RF frames observed into session atoms according to an inter frame space threshold, and ensures that a session atom consists only of frames transmitted by two nodes. Then, it extracts the link in each atom in different observation time window. Finally, it merges the links in different time window to reconstruct the complete network topology. Experimental results demonstrate that, compared with the existing wireless network topology inference algorithms, Wntiifs is of higher topology inference accuracy.
{"title":"Topology inference for CSMA/CA wireless network based on inter frame space","authors":"Shengxiang Li, Guangyi Liu, Ou Li, Siyuan Ding","doi":"10.1109/ICCT.2017.8359681","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359681","url":null,"abstract":"In this paper, we propose a novel approach called Wntiifs to infer the topology of CSMA/CA wireless network without the need to cooperate in the network or decode the network's messages. The approach divides RF frames observed into session atoms according to an inter frame space threshold, and ensures that a session atom consists only of frames transmitted by two nodes. Then, it extracts the link in each atom in different observation time window. Finally, it merges the links in different time window to reconstruct the complete network topology. Experimental results demonstrate that, compared with the existing wireless network topology inference algorithms, Wntiifs is of higher topology inference accuracy.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130396463","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359477
Shufeng Li, Hongda Wu, Libiao Jin, Shanshan Wei
We propose a new construction method for deterministic sensing matrix, using complementary sequence, which is called Compressed Sensing Matrix Based on Cyclic Complementary Sequence. Simulation results show that the reconstruction of this matrix better than sparse sensing matrices and Toeplitz matrices. Once the complementary sequences are given, each element in the matrix can be determined, and thus the uncertainty caused by using random matrices shall be avoided; moreover, the cyclic property of the matrix proposed makes it easier for hardware implementation and avoid the deficiency of taking up large storage space, which is universal for random matrices, and thus makes the matrix more practical.
{"title":"Construction of compressed sensing matrix based on complementary sequence","authors":"Shufeng Li, Hongda Wu, Libiao Jin, Shanshan Wei","doi":"10.1109/ICCT.2017.8359477","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359477","url":null,"abstract":"We propose a new construction method for deterministic sensing matrix, using complementary sequence, which is called Compressed Sensing Matrix Based on Cyclic Complementary Sequence. Simulation results show that the reconstruction of this matrix better than sparse sensing matrices and Toeplitz matrices. Once the complementary sequences are given, each element in the matrix can be determined, and thus the uncertainty caused by using random matrices shall be avoided; moreover, the cyclic property of the matrix proposed makes it easier for hardware implementation and avoid the deficiency of taking up large storage space, which is universal for random matrices, and thus makes the matrix more practical.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127841233","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359960
Zekun Li, Shuyu Li
Trying to solve the risk of data privacy disclosure in classification process, a Random Forest algorithm under differential privacy named DPRF-gini is proposed in the paper. In the process of building decision tree, the algorithm first disturbed the process of feature selection and attribute partition by using exponential mechanism, and then meet the requirement of differential privacy by adding Laplace noise to the leaf node. Compared with the original algorithm, Empirical results show that protection of data privacy is further enhanced while the accuracy of the algorithm is slightly reduced.
{"title":"Random forest algorithm under differential privacy","authors":"Zekun Li, Shuyu Li","doi":"10.1109/ICCT.2017.8359960","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359960","url":null,"abstract":"Trying to solve the risk of data privacy disclosure in classification process, a Random Forest algorithm under differential privacy named DPRF-gini is proposed in the paper. In the process of building decision tree, the algorithm first disturbed the process of feature selection and attribute partition by using exponential mechanism, and then meet the requirement of differential privacy by adding Laplace noise to the leaf node. Compared with the original algorithm, Empirical results show that protection of data privacy is further enhanced while the accuracy of the algorithm is slightly reduced.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131653639","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359811
Weigang Wang, Wenrui Wang, Kexue Sun
To solve the localization problem of multipath propagation in complex indoor circumstance, a localization method of signal subspace matching based on fingerprint database is proposed by using small antenna array in the indoor environment. Compared to the RSSI, the signal subspace fingerprint can obtain better effect by utilizing more space information. The received signal from each array is firstly processed with self-correlation and it's eigenvalue decomposed to create the signal subspace fingerprint. Location is then determined by the smallest angle between the received signal subspace and the fingerprint database. Simulation results show that the proposed algorithm has made a great improvement in localization accuracy.
{"title":"Hybrid indoor localization method based on signal subspace fingerprint database","authors":"Weigang Wang, Wenrui Wang, Kexue Sun","doi":"10.1109/ICCT.2017.8359811","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359811","url":null,"abstract":"To solve the localization problem of multipath propagation in complex indoor circumstance, a localization method of signal subspace matching based on fingerprint database is proposed by using small antenna array in the indoor environment. Compared to the RSSI, the signal subspace fingerprint can obtain better effect by utilizing more space information. The received signal from each array is firstly processed with self-correlation and it's eigenvalue decomposed to create the signal subspace fingerprint. Location is then determined by the smallest angle between the received signal subspace and the fingerprint database. Simulation results show that the proposed algorithm has made a great improvement in localization accuracy.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128821266","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359883
Yi Zhang, Qi-chang Duan, Sile Li, Yunxian Ran
Based on the existing methods, this paper tries to propose a salient region detection based on integrated theory of features and Adaboost algorithm. The integration theory of features indicates that the salient region corresponds to multi-features space, such as color, direction, shape, texture and so on. And the visual system deals with independent features in parallel. The visual system make individual characteristics become a salient area. Adaboost algorithm is able to integrate multiple independent weakly classifiers into a high-performance and powerful classifier. In order to obtain better salient region result, this paper introduces the Adaboost theory to integrate multi-features space.
{"title":"Salient region detection based on Adaboost and integration of multi-features space","authors":"Yi Zhang, Qi-chang Duan, Sile Li, Yunxian Ran","doi":"10.1109/ICCT.2017.8359883","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359883","url":null,"abstract":"Based on the existing methods, this paper tries to propose a salient region detection based on integrated theory of features and Adaboost algorithm. The integration theory of features indicates that the salient region corresponds to multi-features space, such as color, direction, shape, texture and so on. And the visual system deals with independent features in parallel. The visual system make individual characteristics become a salient area. Adaboost algorithm is able to integrate multiple independent weakly classifiers into a high-performance and powerful classifier. In order to obtain better salient region result, this paper introduces the Adaboost theory to integrate multi-features space.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125424138","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359750
Teng Niu, Zhi Chen, Dongmei Zhang, Kui Xu
We are concerned with designing an optimal binary determine linear network coding (B-DLNC) strategy with the aim of reducing the number of transmissions and the average packets decoding delay for wireless broadcasting scenarios. In this paper, we first propose the concept of the B-DLNC that no longer limits the encoding packets to be immediately decoded by the receivers and allows the receivers to cache the correctly received undecodable retransmission packets waiting for future decoding opportunities. Next, we use channel coding theory (generation matrix and decoding matrix) to analyze the performance of B-DLNC strategy. In addition, we formulate the average packets decoding delay minimization problem as a max-weight search problem and propose a heuristic algorithm (IMWSA) to improve search efficiency. The simulation results show that compared with the traditional strategies, the proposed strategy can obviously reduce the number of transmissions and average packets decoding delay.
{"title":"On minimizing average packets decoding delay based on B-DLNC for wireless broadcasting","authors":"Teng Niu, Zhi Chen, Dongmei Zhang, Kui Xu","doi":"10.1109/ICCT.2017.8359750","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359750","url":null,"abstract":"We are concerned with designing an optimal binary determine linear network coding (B-DLNC) strategy with the aim of reducing the number of transmissions and the average packets decoding delay for wireless broadcasting scenarios. In this paper, we first propose the concept of the B-DLNC that no longer limits the encoding packets to be immediately decoded by the receivers and allows the receivers to cache the correctly received undecodable retransmission packets waiting for future decoding opportunities. Next, we use channel coding theory (generation matrix and decoding matrix) to analyze the performance of B-DLNC strategy. In addition, we formulate the average packets decoding delay minimization problem as a max-weight search problem and propose a heuristic algorithm (IMWSA) to improve search efficiency. The simulation results show that compared with the traditional strategies, the proposed strategy can obviously reduce the number of transmissions and average packets decoding delay.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126866416","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359858
Bingbing Lu, Hua Zhang, B. Liu, Zhonghua Zhao
VPN (Virtual Private Network) is the primary mean for users to access network information by crossing the border currently. There is little research about VPN users, though the number of users who using VPN is pretty large. Consequently, it is desiderated to find a solution to strengthen the ability to observe and discover cross-border access users. This paper proposes a novel user identification algorithm according to massive multi-site VPN log. First of all, a formal description of VPN user identification problems is given, then we analyze quantitatively for probability distribution of VPN log in two dimensions: usernames and CIP (Client Internet Protocol) addresses. Based on this, we give the solution of problems in VPN user identification, and propose a user identification algorithm based on the combination of access vector similarity, username similarity, the number of regions where users surf the internet and the connected subgraphs. Then we test the algorithm in VPN log within two months, which has proved the effectiveness and correctness of user identification algorithm.
{"title":"Research on user identification algorithm based on massive multi-site VPN log","authors":"Bingbing Lu, Hua Zhang, B. Liu, Zhonghua Zhao","doi":"10.1109/ICCT.2017.8359858","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359858","url":null,"abstract":"VPN (Virtual Private Network) is the primary mean for users to access network information by crossing the border currently. There is little research about VPN users, though the number of users who using VPN is pretty large. Consequently, it is desiderated to find a solution to strengthen the ability to observe and discover cross-border access users. This paper proposes a novel user identification algorithm according to massive multi-site VPN log. First of all, a formal description of VPN user identification problems is given, then we analyze quantitatively for probability distribution of VPN log in two dimensions: usernames and CIP (Client Internet Protocol) addresses. Based on this, we give the solution of problems in VPN user identification, and propose a user identification algorithm based on the combination of access vector similarity, username similarity, the number of regions where users surf the internet and the connected subgraphs. Then we test the algorithm in VPN log within two months, which has proved the effectiveness and correctness of user identification algorithm.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126880046","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 : 2017-10-01DOI: 10.1109/icct.2017.8359751
Shi Qian-qian, Zhang Yan, Zhao Peng
In this paper, we design a communication system in order to improve the utilization of spectral debris using the idea of cognitive radio by detecting the spectrum of external environment to provide a reference for the avoidance of communication interference. Accordingly, a communication system transmission using the method of spectrum energy sensing, based on the software-defined radio (SDR) platform of NI company's universal software radio peripheral (USRPs) and the graphical programming language LabVIEW software, achieves a reliable dynamic access for video transmission. We also design adaptive access and frequency hopping access for the data channel and control channel, thus completing the anti-jamming communication system.
{"title":"Research and implementation of reliable dynamic access based on cognitive radio","authors":"Shi Qian-qian, Zhang Yan, Zhao Peng","doi":"10.1109/icct.2017.8359751","DOIUrl":"https://doi.org/10.1109/icct.2017.8359751","url":null,"abstract":"In this paper, we design a communication system in order to improve the utilization of spectral debris using the idea of cognitive radio by detecting the spectrum of external environment to provide a reference for the avoidance of communication interference. Accordingly, a communication system transmission using the method of spectrum energy sensing, based on the software-defined radio (SDR) platform of NI company's universal software radio peripheral (USRPs) and the graphical programming language LabVIEW software, achieves a reliable dynamic access for video transmission. We also design adaptive access and frequency hopping access for the data channel and control channel, thus completing the anti-jamming communication system.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123350077","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359975
Y. Qin, Tongsheng Xia
With the rapid development of Integrated Circuit (IC) technology, more and more attentions are paid to chip security issues. As Hardware Trojan horse becomes a great potential threat to the IC industry, researches have been done on Trojan detection methods. Recently, Ring Oscillator Network (RON) detection structure has been proposed to precisely detect the Hardware Trojan. And we find the detection accuracy of RON detection method is affected by Trojan circuit logic gate switching frequency. In this paper, we analyze the impact of Hardware Trojan activity on ring oscillator frequency. A Hardware Trojan is used to study the detection sensitivity of RON detection structure at different Trojan gate switching frequencies. Result shows the Hardware Trojan gate switching noise has a spatial influence on the frequency of RO array. Especially we find that too low Trojan gate switching frequency will make the RON detection unsuccessful.
{"title":"Sensitivity analysis of ring oscillator based hardware Trojan detection","authors":"Y. Qin, Tongsheng Xia","doi":"10.1109/ICCT.2017.8359975","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359975","url":null,"abstract":"With the rapid development of Integrated Circuit (IC) technology, more and more attentions are paid to chip security issues. As Hardware Trojan horse becomes a great potential threat to the IC industry, researches have been done on Trojan detection methods. Recently, Ring Oscillator Network (RON) detection structure has been proposed to precisely detect the Hardware Trojan. And we find the detection accuracy of RON detection method is affected by Trojan circuit logic gate switching frequency. In this paper, we analyze the impact of Hardware Trojan activity on ring oscillator frequency. A Hardware Trojan is used to study the detection sensitivity of RON detection structure at different Trojan gate switching frequencies. Result shows the Hardware Trojan gate switching noise has a spatial influence on the frequency of RO array. Especially we find that too low Trojan gate switching frequency will make the RON detection unsuccessful.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123357822","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
扫码关注我们
求助内容：
应助结果提醒方式：