Pub Date : 2017-09-01DOI: 10.1109/ISPCC.2017.8269745
Deeksha, Ajay Kumar, M. Bansal
In the development of smart cities across the world VANET plays a vital role for optimized route between source and destination. The VANETs is based on infra-structure less network. It facilitates vehicles to give information about safety through vehicle to vehicle communication (V2V) or vehicle to infrastructure communication (V2I). In VANETs wireless communication between vehicles so attackers violate authenticity, confidentiality and privacy properties which further effect security. The VANET technology is encircled with security challenges these days. This paper presents overview on VANETs architecture, a related survey on VANET with major concern of the security issues. Further, prevention measures of those issues, and comparative analysis is done. From the survey, found out that encryption and authentication plays an important role in VANETS also some research direction defined for future work.
{"title":"A review on VANET security attacks and their countermeasure","authors":"Deeksha, Ajay Kumar, M. Bansal","doi":"10.1109/ISPCC.2017.8269745","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269745","url":null,"abstract":"In the development of smart cities across the world VANET plays a vital role for optimized route between source and destination. The VANETs is based on infra-structure less network. It facilitates vehicles to give information about safety through vehicle to vehicle communication (V2V) or vehicle to infrastructure communication (V2I). In VANETs wireless communication between vehicles so attackers violate authenticity, confidentiality and privacy properties which further effect security. The VANET technology is encircled with security challenges these days. This paper presents overview on VANETs architecture, a related survey on VANET with major concern of the security issues. Further, prevention measures of those issues, and comparative analysis is done. From the survey, found out that encryption and authentication plays an important role in VANETS also some research direction defined for future work.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124169903","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-09-01DOI: 10.1109/ISPCC.2017.8269659
Simarjot Kaur Randhawa, R. K. Sunkaria
In this work, a comparison of existing speckle reduction techniques have been done. Median and wiener filters, wavelet based methods and SRAD methods have been compared. The methods are first tested on synthetic images for comparison of the results and then applied on real ultrasound images. It is observed that SRAD method outperforms the other techniques for low noise variance. For higher noise variance, exponential thresholding outperforms the remaining techniques. Also, it is observed that wiener filter have a comparable performance and hence performs well over range of noise variance. Wavelet denoising based on the soft thresholding is reported to be least performing.
{"title":"A comparative analysis of various speckle reduction techniques for ultrasound images","authors":"Simarjot Kaur Randhawa, R. K. Sunkaria","doi":"10.1109/ISPCC.2017.8269659","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269659","url":null,"abstract":"In this work, a comparison of existing speckle reduction techniques have been done. Median and wiener filters, wavelet based methods and SRAD methods have been compared. The methods are first tested on synthetic images for comparison of the results and then applied on real ultrasound images. It is observed that SRAD method outperforms the other techniques for low noise variance. For higher noise variance, exponential thresholding outperforms the remaining techniques. Also, it is observed that wiener filter have a comparable performance and hence performs well over range of noise variance. Wavelet denoising based on the soft thresholding is reported to be least performing.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124355709","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-09-01DOI: 10.1109/ISPCC.2017.8269709
P. Asthana, G. Khanna
A micro electro-mechanical system based energy harvester is designed for conversion of mechanical vibration energy via piezoelectric effect. This paper describes vibration based piezoelectric energy harvester in side clamped and slotted form. The cantilever structures are designed in COMSOL Multiphysics tool. A resonant frequency analysis for the cantilever structure has been carried out. The cantilever structures are compared under identical condition of 1 g acceleration. Slotted cantilever structures has a better resonant frequency compared to the side clamped structure, but the peak power density of the system is quite low as compared to the side clamped structure.
{"title":"Design and analysis of slotted cantilever structure for piezoelectric energy harvesting","authors":"P. Asthana, G. Khanna","doi":"10.1109/ISPCC.2017.8269709","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269709","url":null,"abstract":"A micro electro-mechanical system based energy harvester is designed for conversion of mechanical vibration energy via piezoelectric effect. This paper describes vibration based piezoelectric energy harvester in side clamped and slotted form. The cantilever structures are designed in COMSOL Multiphysics tool. A resonant frequency analysis for the cantilever structure has been carried out. The cantilever structures are compared under identical condition of 1 g acceleration. Slotted cantilever structures has a better resonant frequency compared to the side clamped structure, but the peak power density of the system is quite low as compared to the side clamped structure.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122002444","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-09-01DOI: 10.1109/ISPCC.2017.8269662
R. Kaur, Dolly Sharma, Amit Verma
Facial recognition has most significant real-life requests like investigation and access control. It is associated through the issue of appropriately verifying face pictures and transmit them person in a database. In a past years face study has been emerging active topic. Most of the face detector techniques could be classified into feature based methods and image based also. Feature based techniques adds low-level analysis, feature analysis, etc. Facial recognition is a system capable of verifying / identifying a human after 3D images. By evaluating selected facial unique features from the image and face dataset. Design from transformation method given vector dimensional illustration of individual face in a prepared set of images, Principle component analysis inclines to search a dimensional sub-space whose normal vector features correspond to the maximum variance direction in the real image space. The PCA algorithm evaluates the feature extraction, data, i.e. Eigen Values and vectors of the scatter matrix. In literature survey, Face recognition is a design recognition mission performed exactly on faces. It can be described as categorizing a facial either “known” or “unknown”, after comparing it with deposits known individuals. It is also necessary to need a system that has the capability of knowledge to recognize indefinite faces. Computational representations of facial recognition must statement various difficult issues. After existing work, we study the SIFT structures for the gratitude method. The novel technique is compared with well settled facial recognition methods, name component analysis and eigenvalues and vector. This algorithm is called PCA and ICA (Independent Component Analysis). In research work, we implement the novel approach to detect the face in minimum time and evaluate the better accuracy based on Back Propagation Neural Networks. We design the framework in face recognition using MATLAB 2013a simulation tool. Evaluate the performance parameters, i.e. the FAR (false acceptance rate), FRR (False rejection Rate) and Accuracy and compare the existing performance parameters i.e. accuracy.
{"title":"An advance 2D face recognition by feature extraction (ICA) and optimize multilayer architecture","authors":"R. Kaur, Dolly Sharma, Amit Verma","doi":"10.1109/ISPCC.2017.8269662","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269662","url":null,"abstract":"Facial recognition has most significant real-life requests like investigation and access control. It is associated through the issue of appropriately verifying face pictures and transmit them person in a database. In a past years face study has been emerging active topic. Most of the face detector techniques could be classified into feature based methods and image based also. Feature based techniques adds low-level analysis, feature analysis, etc. Facial recognition is a system capable of verifying / identifying a human after 3D images. By evaluating selected facial unique features from the image and face dataset. Design from transformation method given vector dimensional illustration of individual face in a prepared set of images, Principle component analysis inclines to search a dimensional sub-space whose normal vector features correspond to the maximum variance direction in the real image space. The PCA algorithm evaluates the feature extraction, data, i.e. Eigen Values and vectors of the scatter matrix. In literature survey, Face recognition is a design recognition mission performed exactly on faces. It can be described as categorizing a facial either “known” or “unknown”, after comparing it with deposits known individuals. It is also necessary to need a system that has the capability of knowledge to recognize indefinite faces. Computational representations of facial recognition must statement various difficult issues. After existing work, we study the SIFT structures for the gratitude method. The novel technique is compared with well settled facial recognition methods, name component analysis and eigenvalues and vector. This algorithm is called PCA and ICA (Independent Component Analysis). In research work, we implement the novel approach to detect the face in minimum time and evaluate the better accuracy based on Back Propagation Neural Networks. We design the framework in face recognition using MATLAB 2013a simulation tool. Evaluate the performance parameters, i.e. the FAR (false acceptance rate), FRR (False rejection Rate) and Accuracy and compare the existing performance parameters i.e. accuracy.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129972652","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-09-01DOI: 10.1109/ISPCC.2017.8269704
Namita, T. Sasamal
Quantum-Dot Cellular Automata (QCA) as technology is a promising candidate that has tremendous potential to replace CMOS due to its outstanding features such as low-power, extremely high density, fast operation speed. However, due to its four-phased clocking scheme and timing requirements, various issues in timing for interconnections and feedback are present. In this paper, the delay transfers and retiming using QCA characteristics to solve timing issues has been explored. The problem in assigning appropriate clock zones and feedback has been addressed. Based on the design rules and constraints, retiming technique has been discussed to perform delay-transfer and time-scaling to achieve efficient clock zone assignment. A serial adder has been designed that uses multilayer crossover. As a case study, a 4-bit serial-parallel multiplier has been designed using the serial adder as basic input circuit to illustrate the rules of retiming.
{"title":"Design of 4-bit serial-parallel multiplier in Quantum-Dot Cellular Automata","authors":"Namita, T. Sasamal","doi":"10.1109/ISPCC.2017.8269704","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269704","url":null,"abstract":"Quantum-Dot Cellular Automata (QCA) as technology is a promising candidate that has tremendous potential to replace CMOS due to its outstanding features such as low-power, extremely high density, fast operation speed. However, due to its four-phased clocking scheme and timing requirements, various issues in timing for interconnections and feedback are present. In this paper, the delay transfers and retiming using QCA characteristics to solve timing issues has been explored. The problem in assigning appropriate clock zones and feedback has been addressed. Based on the design rules and constraints, retiming technique has been discussed to perform delay-transfer and time-scaling to achieve efficient clock zone assignment. A serial adder has been designed that uses multilayer crossover. As a case study, a 4-bit serial-parallel multiplier has been designed using the serial adder as basic input circuit to illustrate the rules of retiming.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130040817","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-09-01DOI: 10.1109/ISPCC.2017.8269720
Nighat Nazir
Fuzzy C-means (FCM) is the classical clustering algorithm for segmentation of tissues such as cerebrospinal fluid (CSF), gray matter (GM) and white matter (WM) from magnetic resonance images (MRI). Medical images such as brain MRI are often corrupted by Rician noise thus, segmentation with FCM becomes problematic. Various variants of the classical FCM have been proposed which are robust to image noise. This paper presents a comparative performance evaluation of brain MRI segmentation methods based on Fuzzy C-means using Jaccard similarity (JS).
{"title":"A comparative performance analysis of fuzzy C-means based methods for segmentation of brain magnetic resonance images","authors":"Nighat Nazir","doi":"10.1109/ISPCC.2017.8269720","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269720","url":null,"abstract":"Fuzzy C-means (FCM) is the classical clustering algorithm for segmentation of tissues such as cerebrospinal fluid (CSF), gray matter (GM) and white matter (WM) from magnetic resonance images (MRI). Medical images such as brain MRI are often corrupted by Rician noise thus, segmentation with FCM becomes problematic. Various variants of the classical FCM have been proposed which are robust to image noise. This paper presents a comparative performance evaluation of brain MRI segmentation methods based on Fuzzy C-means using Jaccard similarity (JS).","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130061665","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-09-01DOI: 10.1109/ISPCC.2017.8269668
Nancy Bansal, Amit Verma, Iqbaldeep Kaur, Dolly Sharma
The physiological biometrics like face is combined with behavioral biometrics like speech to achieve the robustness of fusion process of a multimodal system. The selection of the biometrics is dependent on the robustness and uniqueness of the biometric. That is why, the selection of these two biometrics is done in this work. Mel Frequency Cepstral Coefficients has been utilized for speech feature extraction and in addition to this fuzzy logic is also utilized for training purpose. Then, the optimized features values are reduced using genetic algorithm. In the end, fusion is achieved by combination of fuse values obtained from both 2 biometrics. The whole simulation is tested in MATLAB environment.
{"title":"Multimodal biometrics by fusion for security using genetic algorithm","authors":"Nancy Bansal, Amit Verma, Iqbaldeep Kaur, Dolly Sharma","doi":"10.1109/ISPCC.2017.8269668","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269668","url":null,"abstract":"The physiological biometrics like face is combined with behavioral biometrics like speech to achieve the robustness of fusion process of a multimodal system. The selection of the biometrics is dependent on the robustness and uniqueness of the biometric. That is why, the selection of these two biometrics is done in this work. Mel Frequency Cepstral Coefficients has been utilized for speech feature extraction and in addition to this fuzzy logic is also utilized for training purpose. Then, the optimized features values are reduced using genetic algorithm. In the end, fusion is achieved by combination of fuse values obtained from both 2 biometrics. The whole simulation is tested in MATLAB environment.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134406548","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-09-01DOI: 10.1109/ISPCC.2017.8269581
N. Kumar, Shobha Antwal, Ganesh Samarthyam, S. Jain
Content-Defined Chunking (CDC) detect maximum redundancy in data deduplication systems in the past years. In this research work, we focus on optimizing the deduplication system by adjusting the pertinent factors in content defined chunking (CDC) to identify as the key ingredients by declaring chunk cut-points and efficient fingerprint lookup using bucket based index partitioning. For efficient chunking, we propose Genetic Evolution (GE) algorithm based approach which is optimized Two Thresholds Two Divisors (TTTD-P) CDC algorithm where we significantly reduce the number of computing operations by using single dynamic optimal parameter divisor D with optimal threshold value exploiting the multi-operations nature of TTTD. To reduce the chunk-size variance, TTTD algorithm introduces an additional backup divisor D' that has a higher probability of finding cut-points. However, adding an additional divisor decreases the chunking throughput, meaning that TTTD algorithm aggravates Rabin's CDC performance bottleneck. To this end, Asymmetric Extremum (AE) significantly improves chunking throughput while providing comparable deduplication efficiency by using the local extreme value in a variable-sized asymmetric window to overcome the Rabin, MAXP and TTTD boundaries-shift problem. FAST CDC in the year 2016 is about 10 times faster than unimodal Rabin CDC and about 3 times faster than Gear and Asymmetric Extremum (AE) CDC, while achieving nearby the same deduplication ratio (DR). Therefore, we propose GE based TTTD-P optimized chunking to maximize chunking throughput with increased DR; and bucket indexing approach reduces hash values judgement time to identify and declare redundant chunk about 16 times than unimodal baseline Rabin CDC, 5 times than AE CDC, 1.6 times than FAST CDC. Our experimental results comparative analysis reveals that TTTD-P using fast BUZ rolling hash function with bucket indexing on Hadoop Distributed File System (HDFS) provide a comparatively maximum redundancy detection with higher throughput, higher deduplication ratio, lesser computation time and very low hash values comparison time as being best data deduplication for distributed big data storage systems.
{"title":"Genetic optimized data deduplication for distributed big data storage systems","authors":"N. Kumar, Shobha Antwal, Ganesh Samarthyam, S. Jain","doi":"10.1109/ISPCC.2017.8269581","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269581","url":null,"abstract":"Content-Defined Chunking (CDC) detect maximum redundancy in data deduplication systems in the past years. In this research work, we focus on optimizing the deduplication system by adjusting the pertinent factors in content defined chunking (CDC) to identify as the key ingredients by declaring chunk cut-points and efficient fingerprint lookup using bucket based index partitioning. For efficient chunking, we propose Genetic Evolution (GE) algorithm based approach which is optimized Two Thresholds Two Divisors (TTTD-P) CDC algorithm where we significantly reduce the number of computing operations by using single dynamic optimal parameter divisor D with optimal threshold value exploiting the multi-operations nature of TTTD. To reduce the chunk-size variance, TTTD algorithm introduces an additional backup divisor D' that has a higher probability of finding cut-points. However, adding an additional divisor decreases the chunking throughput, meaning that TTTD algorithm aggravates Rabin's CDC performance bottleneck. To this end, Asymmetric Extremum (AE) significantly improves chunking throughput while providing comparable deduplication efficiency by using the local extreme value in a variable-sized asymmetric window to overcome the Rabin, MAXP and TTTD boundaries-shift problem. FAST CDC in the year 2016 is about 10 times faster than unimodal Rabin CDC and about 3 times faster than Gear and Asymmetric Extremum (AE) CDC, while achieving nearby the same deduplication ratio (DR). Therefore, we propose GE based TTTD-P optimized chunking to maximize chunking throughput with increased DR; and bucket indexing approach reduces hash values judgement time to identify and declare redundant chunk about 16 times than unimodal baseline Rabin CDC, 5 times than AE CDC, 1.6 times than FAST CDC. Our experimental results comparative analysis reveals that TTTD-P using fast BUZ rolling hash function with bucket indexing on Hadoop Distributed File System (HDFS) provide a comparatively maximum redundancy detection with higher throughput, higher deduplication ratio, lesser computation time and very low hash values comparison time as being best data deduplication for distributed big data storage systems.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134381125","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-09-01DOI: 10.1109/ISPCC.2017.8269580
U. Bhanja, A. Khuntia, A. Swati
With the emerging of advanced technologies in the global market, now-a-days optical networks are the most ideal medium for high bandwidth communication. Optical wireless networks predicated on free space optics (FSO) technology must be designed to combat changes in the atmosphere, which can affect FSO system performance capacity. FSO is a security module due to Line of sight operation and does not require any system security upgradations. However, FSO requires secured communication for longer distance. FSO has been used in different ways to provide fast communication connectivity in inaccessible areas. Various methodologies are introduced to enhance FSO performance in terms of security that leads to the development of the secured FSO system. Optical code division multiple access (OCDMA) is becoming more popular in the field of optical communication, due to asynchronous transmission, flexibility, security and scalability. The major advantage of OCDMA is its efficient use of spectrum as well as the multiuser communication capabilities. OCDMA requires spectral amplitude coding (SAC) to minimize the impact of multiuser interference and also suppress the effect of phase induced intensity noise (PIIN) with fixed in phase cross-correlation. In this work, SAC-OCDMA over FSO communication design is proposed. In this paper, SAC-OCDMA FSO communication system is evaluated at 10 Gbps using Modified random diagonal (MRD) code that possesses better auto correlation, minimum cross correlation and high cardinality. The proposed SAC-OCDMA MRD is compared with the existing Multi-diagonal (MD) and Random diagonal (RD) codes under different weather conditions. The simulation results signify that optical system based on MRD code is better than MD and RD codes in terms of bit error rate (BER). The simulation results are validated using Optisystem version 14.
随着全球市场先进技术的不断涌现，光网络成为当今高带宽通信最理想的媒介。基于自由空间光学(FSO)技术的光纤无线网络必须设计成能够抵抗大气变化的能力，因为大气变化会影响FSO系统的性能。FSO是一个安全模块，由于视线操作，不需要任何系统安全升级。但是，无线光通信需要更远距离的安全通信。无线光通信以不同的方式用于在人迹罕至的地区提供快速通信连接。介绍了各种方法来提高无线光控系统在安全性方面的性能，从而开发出安全的无线光控系统。光码分多址(OCDMA)由于具有异步传输、灵活性、安全性和可扩展性等优点，在光通信领域得到越来越广泛的应用。OCDMA的主要优点是有效利用频谱和多用户通信能力。OCDMA需要频谱幅度编码(SAC)来最大限度地减少多用户干扰的影响，并抑制具有固定相位互相关的相位诱导强度噪声(PIIN)的影响。在这项工作中，提出了基于FSO的SAC-OCDMA通信设计。本文采用自相关性能好、互相关最小、基数高的改进随机对角码(MRD)，对10gbps速率下的SAC-OCDMA FSO通信系统进行了评价。在不同的天气条件下，将所提出的SAC-OCDMA MRD与现有的多对角码(MD)和随机对角码(RD)进行了比较。仿真结果表明，基于MRD码的光学系统在误码率方面优于基于MD和RD码的光学系统。使用Optisystem version 14对仿真结果进行了验证。
{"title":"Performance analysis of a SAC-OCDMA FSO network","authors":"U. Bhanja, A. Khuntia, A. Swati","doi":"10.1109/ISPCC.2017.8269580","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269580","url":null,"abstract":"With the emerging of advanced technologies in the global market, now-a-days optical networks are the most ideal medium for high bandwidth communication. Optical wireless networks predicated on free space optics (FSO) technology must be designed to combat changes in the atmosphere, which can affect FSO system performance capacity. FSO is a security module due to Line of sight operation and does not require any system security upgradations. However, FSO requires secured communication for longer distance. FSO has been used in different ways to provide fast communication connectivity in inaccessible areas. Various methodologies are introduced to enhance FSO performance in terms of security that leads to the development of the secured FSO system. Optical code division multiple access (OCDMA) is becoming more popular in the field of optical communication, due to asynchronous transmission, flexibility, security and scalability. The major advantage of OCDMA is its efficient use of spectrum as well as the multiuser communication capabilities. OCDMA requires spectral amplitude coding (SAC) to minimize the impact of multiuser interference and also suppress the effect of phase induced intensity noise (PIIN) with fixed in phase cross-correlation. In this work, SAC-OCDMA over FSO communication design is proposed. In this paper, SAC-OCDMA FSO communication system is evaluated at 10 Gbps using Modified random diagonal (MRD) code that possesses better auto correlation, minimum cross correlation and high cardinality. The proposed SAC-OCDMA MRD is compared with the existing Multi-diagonal (MD) and Random diagonal (RD) codes under different weather conditions. The simulation results signify that optical system based on MRD code is better than MD and RD codes in terms of bit error rate (BER). The simulation results are validated using Optisystem version 14.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972946","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-09-01DOI: 10.1109/ISPCC.2017.8269650
M. Kaur, Amit Verma, Iqbaldeep Kaur, Dolly Sharma
Cloud computing is basically excogitated from the word internet, which is an advance technology. Cloud computing enables us to access services and infrastructure over the cloud through internet and also permits secure sharing of resources. The use of computing resources as a service with the help of internet is called Cloud Computing. It has started to gain vision in corporate data centers. In recent years, cloud computing is including grid computing because utilization of virtualization at data center could increase. With increase in the number of user and data, there is a need of data confidentiality as well as authenticity of users connected to the cloud so as to protect them from each other as well as from the hackers too.
{"title":"Review on various authentication scheme over cloud computing","authors":"M. Kaur, Amit Verma, Iqbaldeep Kaur, Dolly Sharma","doi":"10.1109/ISPCC.2017.8269650","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269650","url":null,"abstract":"Cloud computing is basically excogitated from the word internet, which is an advance technology. Cloud computing enables us to access services and infrastructure over the cloud through internet and also permits secure sharing of resources. The use of computing resources as a service with the help of internet is called Cloud Computing. It has started to gain vision in corporate data centers. In recent years, cloud computing is including grid computing because utilization of virtualization at data center could increase. With increase in the number of user and data, there is a need of data confidentiality as well as authenticity of users connected to the cloud so as to protect them from each other as well as from the hackers too.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123211558","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
扫码关注我们
求助内容：
应助结果提醒方式：