2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)最新文献

筛选
英文 中文
Design and FPGA Prototype of 1024- bit Blum-Blum-Shub PRBG Architecture 1024位Blum-Blum-Shub PRBG架构的设计与FPGA原型
A. K. Panda, K. C. Ray
{"title":"Design and FPGA Prototype of 1024- bit Blum-Blum-Shub PRBG Architecture","authors":"A. K. Panda, K. C. Ray","doi":"10.1109/ICICSP.2018.8549715","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549715","url":null,"abstract":"The necessity of hardware security for internet-of-things applications demands a low hardware area, high speed and secure pseudorandom bit generator (PRBG). Amongst various PRBGs, Blum-Blum-Shub (BBS) is the proven cryptographically secure PRBG because of its large prime factorize problem. The efficient implementation of BBS method relies on the large integer modular multiplication which makes it computationally expensive. Montgomery algorithm is a very efficient solution to perform the modular multiplication which replaces the critical trial division with series of shift and additions. However, the clock latency and critical path delay are increased with increase of modular size. Therefore, in this paper, a modified radix-2 iterative Montgomery modular multiplier is used for efficient hardware implementation of 1024-bit BBS generator. It replaces two two-operand adders with one three-operand adder. Carry-save adder is the commonly used technique for three-operand addition which experiences high critical path delay. Hence, the critical path delay is further reduced by employing a fast parallel prefix Han-Carlson adder for three-operand addition in the proposed architecture. The proposed architecture is designed using Verilog HDL and prototyped on the Virtex5 FPGA device. The physical implementation results report that the proposed 1024-bit BBS architecture can work at a maximum frequency of 71.2 MHz with overall latency improvement of 93.87%.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126529333","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}
引用次数: 10
Secure and Efficient Vertical Handover Authentication for 5G HetNets 安全高效的5G HetNets垂直切换认证
Alican Ozhelvaci, M. Ma
{"title":"Secure and Efficient Vertical Handover Authentication for 5G HetNets","authors":"Alican Ozhelvaci, M. Ma","doi":"10.1109/ICICSP.2018.8549809","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549809","url":null,"abstract":"5G is a new paradigm that brings new technologies to overcome the challenges of the next-generation wireless mobile network. Also, 5G is expected to supply fastest, most reliable network access to support huge data traffic and massively connected nodes with low latency and high throughput. There are different new technologies that are emerging to tackle requirements of the future wireless mobile network, such as Network Function Virtualization (NFV), Software Defined Networking (SDN) and cloud computing. The heterogeneous environment of 5G will cause frequent handoff in small cells where users join and leave frequently. Therefore, in this paper, the focus is on secure and seamless handover mechanism to supply strong, quick and mutual authentication. And, a careful attention is needed to security challenges, therefore, potential pitfalls can be avoided. It is begun by explaining emerging technologies for the 5G mobile network. Then, the architecture of SDN is briefly described. Finally, this article presents a fast and efficient vertical handover authentication for next-generation wireless mobile communication - 5G - based on SDN architecture.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124291289","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}
引用次数: 15
A new Tag Recombinant Approach Based on Apriori Algorithm 一种基于Apriori算法的标签重组方法
Jiangli Jiao, Xueying Zhang, Fenglian Li, Yan Wang
{"title":"A new Tag Recombinant Approach Based on Apriori Algorithm","authors":"Jiangli Jiao, Xueying Zhang, Fenglian Li, Yan Wang","doi":"10.1109/ICICSP.2018.8549827","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549827","url":null,"abstract":"In the recommender system, users often label multiple same tags on the interesting items which other users have labeled. It can cause that many same tags are often repeatedly labeled, resulting in the tag redundancy situation on the user-item-tag data set. In this paper, a tag recombinant approach based on Apriori algorithm is proposed for reducing the tag redundancy situation. The approach first utilized the Apriori algorithm to preprocess the original tag data for searching the frequent itemsets of tags, and then recombined the new tags to form a new data set. The experimental results demonstrated that based on the proposed approach, the newly formed data set significantly reduced the number of the tuples, and at the same time the relationship among the user, item and tag can be reflected more clearly.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"26 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120911125","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}
引用次数: 1
Speaker Localization with Smoothing Generalized Cross Correlation Based on Naive Bayes Classifier 基于朴素贝叶斯分类器的平滑广义互相关说话人定位
Lixia Huang, Suisui Zhang, Danfei Zan, Xueying Zhang, Fenglian Li
{"title":"Speaker Localization with Smoothing Generalized Cross Correlation Based on Naive Bayes Classifier","authors":"Lixia Huang, Suisui Zhang, Danfei Zan, Xueying Zhang, Fenglian Li","doi":"10.1109/ICICSP.2018.8549819","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549819","url":null,"abstract":"Conventional approaches to acoustic source localization simply based on the received microphone signals, are often vulnerable to adverse acoustic conditions, such as low signal-to-noise ratio (SNR) or high reverberation. But, approaches based on Pattern Recognition and Machine Learning Technology can increase accuracy to locate source in adverse acoustic environment. The advantage of the algorithm is that it requires no calibration of microphone arrays. And Naive Bayes Classifier is simple, fast, and has a small error rate. This paper proposed an improved localization algorithm based on classification of cross-correlation functions (GCC). The weighted cross power spectrum of GCC is smoothed by a smooth filter to formed smooth generalized cross-correlation (SGCC). Then, the classifier model is obtained in each location and form the feature vector. Finally, acoustic source location is estimated by Naive- Bayes classifier. We also proposed in this study the source localization system that based on merely two microphones to input sound signals, combined with improved and optimal methods proposed above. Real-data experiments have demonstrated that algorithm with SGCC has higher localization accuracy than with GCC by 20% in the proposed system at least. The system has good ability to acoustic source localization.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122592306","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}
引用次数: 1
Optimal Relay Node Placement for Connectivity Recovery in Underwater Acoustic Sensor Networks 水声传感器网络连接恢复中继节点优化配置
Lingfeng Liu, Chunfeng Liu, Y. Shu, M. Ma
{"title":"Optimal Relay Node Placement for Connectivity Recovery in Underwater Acoustic Sensor Networks","authors":"Lingfeng Liu, Chunfeng Liu, Y. Shu, M. Ma","doi":"10.1109/ICICSP.2018.8549730","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549730","url":null,"abstract":"Due to the harsh surroundings, a underwater acoustic sensor network (UASN) may suffer large scale damage where many nodes fail simultaneously causing the network to get partitioned into multiple disjoint segments. In this work, we studied the crucial issue to reestablish the network connectivity with the least number of relay nodes which is NP-hard in general. To solve the problem efficiently, this paper proposes a novel heuristic scheme for UASNs which works based on a 3 dimensional (3D) architecture. The proposed scheme consists of two algorithms, named as Alternative Tree Construction and Fermat-point Selection (ATCFS) as a whole. Extensive simulation experiments demonstrate that the proposed scheme offers a simple yet attractive solution to the problem.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132722689","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}
引用次数: 4
A Highly Secure Digital Image Steganography Technique Using Chaotic Logistic Map and Support Image 基于混沌逻辑映射和支持图像的高安全数字图像隐写技术
Md. Anwar Hussain, Popi Bora
{"title":"A Highly Secure Digital Image Steganography Technique Using Chaotic Logistic Map and Support Image","authors":"Md. Anwar Hussain, Popi Bora","doi":"10.1109/ICICSP.2018.8549790","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549790","url":null,"abstract":"A widely applied technique to transmit secret information, hiding in a cover image is Least Significant Bit (LSB) image steganography. Various stega-analysis algorithms are available to detect the amount of hidden data in such cover image. Nonlinear chaotic map functions which are highly complex in behaviour with unpredictable time evolution are used for designing security algorithms. In this paper we report a highly secure steganography technique using chaotic map and a support image to hide secret information in a grayscale cover image. The secret information is encrypted before hiding and the support image is pre-processed to defy stega-analysis. Our technique applies three prong security to secret information by using a very robust random sequence for encryption, a support grayscale image, and pre-processing of the support image.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116858125","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}
引用次数: 4
Real-time Complexity Control for High Efficiency Video Coding 高效视频编码的实时复杂度控制
J. Fang, Yu-Liang Tu, Li-Ping Yu, P. Chang
{"title":"Real-time Complexity Control for High Efficiency Video Coding","authors":"J. Fang, Yu-Liang Tu, Li-Ping Yu, P. Chang","doi":"10.1109/ICICSP.2018.8549738","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549738","url":null,"abstract":"The current video coding standard, High Efficiency Video Coding (HEVC), provides quad-tree structures of the coding unit (CU) to achieve high coding efficiency. Compared with previous standards, the HEVC encoder increases much computational complexity to levels inappropriate for applications of power-constrained devices. This work thus proposes a real-time complexity control scheme to control each frame complexity if the complexity of encoded frames is counted and its accumulated value is over the threshold. To further improve the coding efficiency, a fast CU depth decision algorithm is proposed. Experimental results show that a two-level of complexity control scheme was designed. In addition, the loss of the average BD-PSNR was about 0.23 dB and 0.27 dB as the target complexity was set to 80% and 60% of the unconstrained complexity, respectively.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130152153","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}
引用次数: 2
Unsupervised LBP histogram selection for color texture classification via sparse representation 基于稀疏表示的无监督LBP直方图选择颜色纹理分类
Vinh Truong Hoang
{"title":"Unsupervised LBP histogram selection for color texture classification via sparse representation","authors":"Vinh Truong Hoang","doi":"10.1109/ICICSP.2018.8549724","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549724","url":null,"abstract":"In recent years, LBP and its variants have led to significant progress in applying texture methods to different applications. However, this operator tends to produce high dimensional feature vectors, especially when the number of considered neighboring pixels increases or when it is applied to color images. Various approaches are proposed to obtain more discriminative, robust LBP-features with reduced feature dimensionality. LBP histogram selection is a method to reduce the number of histogram to characterize color image. In this paper, we propose to construct sparse similarity matrix by an unsupervised way for LBP histogram selection.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127618607","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}
引用次数: 3
Secure OFDM based on Coupled Linear Congruential Generator and its FPGA Prototype 基于耦合线性同余发生器的安全OFDM及其FPGA原型
Rakesh Palisetty, A. K. Panda, K. C. Ray
{"title":"Secure OFDM based on Coupled Linear Congruential Generator and its FPGA Prototype","authors":"Rakesh Palisetty, A. K. Panda, K. C. Ray","doi":"10.1109/ICICSP.2018.8549826","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549826","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is a promising technology for 4G, 5G and IoT applications. In OFDM, physical layer security is an important aspect due to increased data traffic, and number of users. But most of the security features are performed in the medium access control (MAC) layer and the transmissions at physical layer are highly susceptible to the eavesdropping. Scrambler associated with OFDM scheme is only used for avoiding long sequence of ones or zeros in the input data by employing linear feedback shift register (LFSR). In this paper, LFSR is replaced with secured pseudorandom bit generator (PRBG) i.e., coupled linear congruential generator (CLCG) in the scrambler/ descrambler module that adds security features in the physical layer and performs scrambling as well. All the NIST tests are performed that demonstrates CLCG is better than LFSR in terms of randomness and security. Therefore, an efficient hardware architectural design and implementation methodology of the proposed scheme i.e., CLCG based secure OFDM for an application of 802.11a is demonstrated in this paper. The baseband transceiver modules of CLCG based secure OFDM along with AWGN channel are prototyped on commercially available virtex xc5vlx110t-l FPGA device. The bit error rate (BER) and peak to average power ratio (PAPR) performance of the proposed scheme are also studied.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127929435","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}
引用次数: 0
A Load-Aware Dynamic TDMA Protocol for Terahertz Wireless NanoSensor Networks 面向太赫兹无线纳米传感器网络的负载感知动态TDMA协议
Juan Xu, Yakun Zhao, Rong Zhang, Jiali Kan
{"title":"A Load-Aware Dynamic TDMA Protocol for Terahertz Wireless NanoSensor Networks","authors":"Juan Xu, Yakun Zhao, Rong Zhang, Jiali Kan","doi":"10.1109/ICICSP.2018.8549740","DOIUrl":"https://doi.org/10.1109/ICICSP.2018.8549740","url":null,"abstract":"Wireless NanoSensor Networks (WNSNs) is a new type of networks which combines nanotechnology and sensor networks, having promising applications in the biomedical, industrial, environmental and military fields. Due to the peculiarities of WNSNs, such as molecular absorption noise in the Terahertz channel and the limited capacities of nano-nodes, novel Medium Access Control (MAC) protocols are needed to regulate access to the channel and coordinate transmission orders among nano-nodes. In this paper, a load-aware dynamic TDMA (LAD-TDMA) protocol is proposed. This protocol is built on a novel pulsed-based communication scheme called TS-OOK and avoids symbol collisions to achieve high energy efficiency. LAD-TDMA adopts a dynamic TDMA-based time slot allocation mechanism according to the current number and corresponding traffic of source nodes, the transmission peculiarities of Terahertz channel. The performance of the protocol is evaluated and analyzed in terms of energy consumption, average end-to-end delay and average throughput, by using the NS3 simulation platform. Results show that LAD-TDMA is energy efficient and advantageous in average end-to-end delay and average throughput, which is proved to be suitable to support node-intensive and load-unbalanced WNSNs, by considering the properties of Terahertz band, energy limitation of nano-devices and nano-nodes' traffic.","PeriodicalId":260723,"journal":{"name":"2018 IEEE International Conference on Information Communication and Signal Processing (ICICSP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535237","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书