Pub Date : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963043
S. Sahu, Pooja Priyadarshini, Saurabh Bilgaiyan
Wireless Sensor Networks (WSNs) are vastly used networks that have caught attention of numerous researchers because of their various applications. They are resource constrained networks where memory capacity, energy and consumption of memory are limited. Therefore they are susceptible to several security threats and attacks. One such attack is Distributed Denial of Service (DDoS). These attacks' objective is to overwhelm the target with ample packets so that its resources get drained and also thwart its ability to procure genuine packets so that the victim fails to give desired response. This leads to the congestion of the network and the victim becomes exhausted leading to denial of service. In this paper we propose a traffic filtration mechanism which deploys mitigation measures to restrain the attackers' attempt at deluging the wireless sensor network with the motive of causing denial of service with enormous packets within limited time.
{"title":"Curbing Distributed Denial of Service attack by traffic filtering in Wireless Sensor Network","authors":"S. Sahu, Pooja Priyadarshini, Saurabh Bilgaiyan","doi":"10.1109/ICCCNT.2014.6963043","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963043","url":null,"abstract":"Wireless Sensor Networks (WSNs) are vastly used networks that have caught attention of numerous researchers because of their various applications. They are resource constrained networks where memory capacity, energy and consumption of memory are limited. Therefore they are susceptible to several security threats and attacks. One such attack is Distributed Denial of Service (DDoS). These attacks' objective is to overwhelm the target with ample packets so that its resources get drained and also thwart its ability to procure genuine packets so that the victim fails to give desired response. This leads to the congestion of the network and the victim becomes exhausted leading to denial of service. In this paper we propose a traffic filtration mechanism which deploys mitigation measures to restrain the attackers' attempt at deluging the wireless sensor network with the motive of causing denial of service with enormous packets within limited time.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129470012","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963097
J. Cindhamani, Naguboynia Punya, Rasha Ealaruvi, L. D. Dhinesh Babu
Cloud computing is an emerging and advanced technology in IT enterprise which provides services on demand. Cloud computing includes many advantages such as flexibility, improved performance and low cost. Besides its advantages, cloud has many security issues and challenges. In this paper, we propose an enhanced frame work for data security in cloud which follows the security polices such as integrity, confidentiality and availability. The data is stored in cloud by using 128 bit encryption and RSA algorithm, then we use the trust management i.e., Trusted Party Auditor (TPA) which audits the data instead of client. Thus, we show how efficiently the data can be secured related to performance analysis.
{"title":"An enhanced data security and trust management enabled framework for cloud computing systems","authors":"J. Cindhamani, Naguboynia Punya, Rasha Ealaruvi, L. D. Dhinesh Babu","doi":"10.1109/ICCCNT.2014.6963097","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963097","url":null,"abstract":"Cloud computing is an emerging and advanced technology in IT enterprise which provides services on demand. Cloud computing includes many advantages such as flexibility, improved performance and low cost. Besides its advantages, cloud has many security issues and challenges. In this paper, we propose an enhanced frame work for data security in cloud which follows the security polices such as integrity, confidentiality and availability. The data is stored in cloud by using 128 bit encryption and RSA algorithm, then we use the trust management i.e., Trusted Party Auditor (TPA) which audits the data instead of client. Thus, we show how efficiently the data can be secured related to performance analysis.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130155387","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963117
Eslam Hamouda, Xiaohui Yuan, O. Ouda, T. Hamza, Lei Chen
Due to the wide usage of biometrics, its security issues deserve more attention. Many of biometric protection systems require the biometric templates to be presented in a binary form. Therefore, extracting binary templates from real-valued biometric data is a key step in biometric data protection systems. In addition to meeting the security and privacy requirements, binary biometric templates allow fast matching and reduced storage. The main challenge of these approaches is how to convert the real-valued templates into corresponding binary representation which retains the original information. In this paper, we present a novel method that employs Genetic Algorithms(GA)to generate a binarization scheme which used to transform the real-valued templates into robust binary ones. The main role of GA is to search for the optimal quantization and encoding parameters to generate the binarization scheme. Experiments were conducted with ORL face database for recognition. Our results demonstrated that binary templates achieved promising performance in terms of equal error rate for face recognition using a simple hamming distance classifier.
{"title":"Binary biometric template generation towards security and class separability","authors":"Eslam Hamouda, Xiaohui Yuan, O. Ouda, T. Hamza, Lei Chen","doi":"10.1109/ICCCNT.2014.6963117","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963117","url":null,"abstract":"Due to the wide usage of biometrics, its security issues deserve more attention. Many of biometric protection systems require the biometric templates to be presented in a binary form. Therefore, extracting binary templates from real-valued biometric data is a key step in biometric data protection systems. In addition to meeting the security and privacy requirements, binary biometric templates allow fast matching and reduced storage. The main challenge of these approaches is how to convert the real-valued templates into corresponding binary representation which retains the original information. In this paper, we present a novel method that employs Genetic Algorithms(GA)to generate a binarization scheme which used to transform the real-valued templates into robust binary ones. The main role of GA is to search for the optimal quantization and encoding parameters to generate the binarization scheme. Experiments were conducted with ORL face database for recognition. Our results demonstrated that binary templates achieved promising performance in terms of equal error rate for face recognition using a simple hamming distance classifier.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123770341","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963099
Pengyan Shen, Kai Guo, Mingzhong Xiao
Nowadays, the Personal Cloud Storage (PCS) service has been widely utilized by millions of users, not only because of its reliable ubiquitous storage but also numbers of exciting third-part applications that work as overlay networks based on user's data. However, we usually know few information about the PCS's performance which is quite important for both normal users and programmers. In this paper, we present a measurement study of four popular PCS services: Baidu, Kingsoft, Box and DropBox. By using the REST APIs offered by the storage providers, we collected the information from more than 41,000 storage operations with transferring over 200GB files, characterized the file transfer speed distributions, and analyzed important aspects that impact the file transfer speed. Indeed, we found some important characteristics in China that are different from the situations in the USA and Europe, which is significant. We believe our work can contribute to helping the researchers and developers to understand the behavior of these popular storage services.
{"title":"Measuring the QoS of Personal Cloud Storage","authors":"Pengyan Shen, Kai Guo, Mingzhong Xiao","doi":"10.1109/ICCCNT.2014.6963099","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963099","url":null,"abstract":"Nowadays, the Personal Cloud Storage (PCS) service has been widely utilized by millions of users, not only because of its reliable ubiquitous storage but also numbers of exciting third-part applications that work as overlay networks based on user's data. However, we usually know few information about the PCS's performance which is quite important for both normal users and programmers. In this paper, we present a measurement study of four popular PCS services: Baidu, Kingsoft, Box and DropBox. By using the REST APIs offered by the storage providers, we collected the information from more than 41,000 storage operations with transferring over 200GB files, characterized the file transfer speed distributions, and analyzed important aspects that impact the file transfer speed. Indeed, we found some important characteristics in China that are different from the situations in the USA and Europe, which is significant. We believe our work can contribute to helping the researchers and developers to understand the behavior of these popular storage services.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126938373","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963017
B. S. Premananda, S. S. Pai, B. Shashank, S. Bhat
Complex number multiplication is one of the most important arithmetic operations in signal processing. The paper proposes a design of high speed 8-bit complex number multiplier where the multiplication process is carried out using Vedic Mathematics [1], Urdhva Tiryagbhyam (Vertically and Cross-wise) sutra and the addition achieved by use of modified adder architectures to reduce the area occupied and power dissipated. Multiplication is realized using modified 8-bit multipliers [2]. The proposed 8-bit multiplier [2] results in a 6.23% increase in speed, 1.88% decrease in area and 13.84% decrease in power dissipation when compared to the normal 8-bit Vedic multiplier. Further, the proposed 8-bit complex number multiplier results in a 9.11% decrease in power dissipated when compared to the normal 8-bit complex number Vedic multiplier.
{"title":"Design of area and power efficient complex number multiplier","authors":"B. S. Premananda, S. S. Pai, B. Shashank, S. Bhat","doi":"10.1109/ICCCNT.2014.6963017","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963017","url":null,"abstract":"Complex number multiplication is one of the most important arithmetic operations in signal processing. The paper proposes a design of high speed 8-bit complex number multiplier where the multiplication process is carried out using Vedic Mathematics [1], Urdhva Tiryagbhyam (Vertically and Cross-wise) sutra and the addition achieved by use of modified adder architectures to reduce the area occupied and power dissipated. Multiplication is realized using modified 8-bit multipliers [2]. The proposed 8-bit multiplier [2] results in a 6.23% increase in speed, 1.88% decrease in area and 13.84% decrease in power dissipation when compared to the normal 8-bit Vedic multiplier. Further, the proposed 8-bit complex number multiplier results in a 9.11% decrease in power dissipated when compared to the normal 8-bit complex number Vedic multiplier.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124078711","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963151
Huang Beilei, Sheng Mingyu, Zhao Jiao
Intelligent transportation system (ITS) is an effective way to solve the increasingly serious traffic problems. It is also the development direction of traffic system in the future. The collection technology of road traffic information is one of the key technologies of ITS. Vehicle information can be obtained by the communication between vehicles and RSUs which is deployed on the side of the road. But the deployment cost of RSUs is higher. In the view of the shortage of the current information collection method, the collection method and the related technology of road traffic information have been researched in this paper, and a traffic information collection method based on WSN have been discussed. The emphasis is the data collecting and processing, and the routing strategy based on node correlation degree. Finally, the effectiveness of the scheme is analyzed.
{"title":"Study of a WSN cooperation vehicle information collection method","authors":"Huang Beilei, Sheng Mingyu, Zhao Jiao","doi":"10.1109/ICCCNT.2014.6963151","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963151","url":null,"abstract":"Intelligent transportation system (ITS) is an effective way to solve the increasingly serious traffic problems. It is also the development direction of traffic system in the future. The collection technology of road traffic information is one of the key technologies of ITS. Vehicle information can be obtained by the communication between vehicles and RSUs which is deployed on the side of the road. But the deployment cost of RSUs is higher. In the view of the shortage of the current information collection method, the collection method and the related technology of road traffic information have been researched in this paper, and a traffic information collection method based on WSN have been discussed. The emphasis is the data collecting and processing, and the routing strategy based on node correlation degree. Finally, the effectiveness of the scheme is analyzed.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132270237","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963066
M. Hosny, Mohammed Amr, Ibrahim A. Zedan, M. Abdelsalam, Muhammad Al-Sayd
In this paper, a new computational fluid dynamics-based system identification for marine vehicles (such as ships and underwater vehicles) is proposed. The procedure has the advantage of being quite intuitive due to its clear similarity with conventional practical system identification experiments. This helps the user to quickly setup reliable simulation experiments and eliminates lengthy abstraction/ modeling that is often needed to perform a practical experiment in simulation. The simulation times are quite reasonable and can be performed using opensource software, thus eliminating the high cost and “time-consuming”ness typically associated with conventional practical experiments-based system identification. Two case studies are used to demonstrate the procedure as well as a discussion of candidate applications where it may prove to be useful.
{"title":"Computational fluid dynamics-based system identification of marine vehicles","authors":"M. Hosny, Mohammed Amr, Ibrahim A. Zedan, M. Abdelsalam, Muhammad Al-Sayd","doi":"10.1109/ICCCNT.2014.6963066","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963066","url":null,"abstract":"In this paper, a new computational fluid dynamics-based system identification for marine vehicles (such as ships and underwater vehicles) is proposed. The procedure has the advantage of being quite intuitive due to its clear similarity with conventional practical system identification experiments. This helps the user to quickly setup reliable simulation experiments and eliminates lengthy abstraction/ modeling that is often needed to perform a practical experiment in simulation. The simulation times are quite reasonable and can be performed using opensource software, thus eliminating the high cost and “time-consuming”ness typically associated with conventional practical experiments-based system identification. Two case studies are used to demonstrate the procedure as well as a discussion of candidate applications where it may prove to be useful.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131156917","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963073
Shengchao Yan, S. Lv, Juan Qi
In order to realize security checking on power communication operation mode, we introduce a new method for service and system security checking and analyzing, which include the multidimensional analysis and the N-1 service impact analysis. Based on this method we managed to design and realize the system, which can monitor and display the effective mode security checking and result analysis, as well as, highly improve management efficiency for the power communication network.
{"title":"Study and application on power communication operation mode checking and analysis method","authors":"Shengchao Yan, S. Lv, Juan Qi","doi":"10.1109/ICCCNT.2014.6963073","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963073","url":null,"abstract":"In order to realize security checking on power communication operation mode, we introduce a new method for service and system security checking and analyzing, which include the multidimensional analysis and the N-1 service impact analysis. Based on this method we managed to design and realize the system, which can monitor and display the effective mode security checking and result analysis, as well as, highly improve management efficiency for the power communication network.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131255448","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963083
Satyabrata Maiti, Sudip Kumar Rajak, A. Mukherjee
This paper deals with a new compact, ultrawideband (UWB) antenna using a coaxial probe feed technique by introducing some slots in the square patch of 20mm × 20 mm. The proposed antenna is designed to operate from 1.82 to 3.72 GHz with the center frequency at 2.20 GHz. Size reduction of 83% is also presented in this paper. The antenna has nearly good Omni-directional radiation pattern and peak gain of 3.65 dBi. The group delay profile of the proposed antenna lies within 1ns. The areas of applications are medical imaging, wireless communication, and vehicular radar. Theoretical investigations have been done by An soft designer software.
{"title":"Design of a compact ultra wide band microstrip patch antenna","authors":"Satyabrata Maiti, Sudip Kumar Rajak, A. Mukherjee","doi":"10.1109/ICCCNT.2014.6963083","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963083","url":null,"abstract":"This paper deals with a new compact, ultrawideband (UWB) antenna using a coaxial probe feed technique by introducing some slots in the square patch of 20mm × 20 mm. The proposed antenna is designed to operate from 1.82 to 3.72 GHz with the center frequency at 2.20 GHz. Size reduction of 83% is also presented in this paper. The antenna has nearly good Omni-directional radiation pattern and peak gain of 3.65 dBi. The group delay profile of the proposed antenna lies within 1ns. The areas of applications are medical imaging, wireless communication, and vehicular radar. Theoretical investigations have been done by An soft designer software.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"16 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132740630","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963001
Jingting Lu, Xiaoping Liu
Foot plant detection is a fundamental step of most motion editing researches. Due to the footskate of captured motions, it is difficult to precisely extract foot plants. In this paper, we present a general, efficient approach for foot plant detection. The key idea is determining the boundaries of foot plants by searching the most salient points around the boundaries. By this approach, foot plants can be precisely extracted from most of the flat terrain motions. The experimental results show the generality and robustness of our approach.
{"title":"Foot plant detection for motion capture data by curve saliency","authors":"Jingting Lu, Xiaoping Liu","doi":"10.1109/ICCCNT.2014.6963001","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963001","url":null,"abstract":"Foot plant detection is a fundamental step of most motion editing researches. Due to the footskate of captured motions, it is difficult to precisely extract foot plants. In this paper, we present a general, efficient approach for foot plant detection. The key idea is determining the boundaries of foot plants by searching the most salient points around the boundaries. By this approach, foot plants can be precisely extracted from most of the flat terrain motions. The experimental results show the generality and robustness of our approach.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128460638","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
扫码关注我们
求助内容：
应助结果提醒方式：