Though the fast depletion of conventional energy reserves motivating the generation and usage of nonconventional energy sources, the initial investment on wind energy converters and their high maintenance cost due to the height of the wind tower, down time cost due to nonavailability of skilled maintenance technicians on time, are forcing the rural people away from installing the wind energy converters, even though the wind energy and solar energy are the promising non depleting resources available in abundance in rural India. The Government of India is offering subsidies to rural people to solve the problem of the high initial investment to certain extent, but the problem of high cost of maintenance is unattended to. The authors propose a low cost solution to the maintenance problem by developing a preventive condition monitoring system using WPAN (Wireless Personal Area Networks) IEEE 802.15.4 based wireless technology which continuously monitors the health of the energy converter. It reduces the maintenance costs, as the skilled personnel can be hired only as and when needed. It also reduces the down time costs, as the system gives hourly health data of the converter, the preventive maintenance can be affected.
{"title":"WPAN Based Preventive Condition Monitoring for Solar Wind Energy Converters in Rural Electrification","authors":"R. Vatti, A. Gaikwad","doi":"10.1109/CICN.2013.123","DOIUrl":"https://doi.org/10.1109/CICN.2013.123","url":null,"abstract":"Though the fast depletion of conventional energy reserves motivating the generation and usage of nonconventional energy sources, the initial investment on wind energy converters and their high maintenance cost due to the height of the wind tower, down time cost due to nonavailability of skilled maintenance technicians on time, are forcing the rural people away from installing the wind energy converters, even though the wind energy and solar energy are the promising non depleting resources available in abundance in rural India. The Government of India is offering subsidies to rural people to solve the problem of the high initial investment to certain extent, but the problem of high cost of maintenance is unattended to. The authors propose a low cost solution to the maintenance problem by developing a preventive condition monitoring system using WPAN (Wireless Personal Area Networks) IEEE 802.15.4 based wireless technology which continuously monitors the health of the energy converter. It reduces the maintenance costs, as the skilled personnel can be hired only as and when needed. It also reduces the down time costs, as the system gives hourly health data of the converter, the preventive maintenance can be affected.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125460633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper describes a technique for improvement in gain and noise figure of an Ultra Wideband amplifier. The paper gives an overview of the Ultra Wideband technology and the amplifier as well. The input to the amplifier comes from the UWB signal generator which is then sent to the antenna after amplification. The design is proposed using a single stage amplifier circuit and attains a better response along the bandwidth with minimum distortion and low losses. The circuit consists of Hetro-junction Bipolar transistor or HBT that is biased using a voltage divider bias. Key parameters have been analysed on Serenade SV simulation tool. The amplifier gain in the whole bandwidth has been improved and the noise figure is also reduced in that bandwidth. The reflection from the either ports in minimised substantially. The proposed amplifier has a simple structure and works satisfactorily over the entire bandwidth.
{"title":"Design of Ultra Wideband Amplifier Using Single Hetero-junction Bipolar Transistor for Wireless Applications","authors":"A. Aneja, Mithilesh Kumar","doi":"10.1109/CICN.2013.97","DOIUrl":"https://doi.org/10.1109/CICN.2013.97","url":null,"abstract":"The paper describes a technique for improvement in gain and noise figure of an Ultra Wideband amplifier. The paper gives an overview of the Ultra Wideband technology and the amplifier as well. The input to the amplifier comes from the UWB signal generator which is then sent to the antenna after amplification. The design is proposed using a single stage amplifier circuit and attains a better response along the bandwidth with minimum distortion and low losses. The circuit consists of Hetro-junction Bipolar transistor or HBT that is biased using a voltage divider bias. Key parameters have been analysed on Serenade SV simulation tool. The amplifier gain in the whole bandwidth has been improved and the noise figure is also reduced in that bandwidth. The reflection from the either ports in minimised substantially. The proposed amplifier has a simple structure and works satisfactorily over the entire bandwidth.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130761282","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}
In this paper, three dimensional tradeoff between diversity, multiplexing, and delay is explored, where the delay considered is introduced only by retransmissions. Multiple antennas at the transceiver stations provide better reliability of reception and it can also increase the data rate of communication to improve the system performance. Channel controlled automatic retransmission request (CC-ARQ) design is used on the channel link to achieve the better diversity gain at the cost of increased retransmission request. Further, theoretical results are verified using the numerical simulation which shows the tradeoff between diversity (i.e., reliability), multiplexing (i.e., data rate), and delay (i.e., no. of ARQ rounds).
{"title":"Diversity-Multiplexing-Delay Tradeoff in Decode-and-Forward MIMO Relay Network with CC-ARQ","authors":"Praveen Pawar, A. Trivedi, K. Arya","doi":"10.1109/CICN.2013.46","DOIUrl":"https://doi.org/10.1109/CICN.2013.46","url":null,"abstract":"In this paper, three dimensional tradeoff between diversity, multiplexing, and delay is explored, where the delay considered is introduced only by retransmissions. Multiple antennas at the transceiver stations provide better reliability of reception and it can also increase the data rate of communication to improve the system performance. Channel controlled automatic retransmission request (CC-ARQ) design is used on the channel link to achieve the better diversity gain at the cost of increased retransmission request. Further, theoretical results are verified using the numerical simulation which shows the tradeoff between diversity (i.e., reliability), multiplexing (i.e., data rate), and delay (i.e., no. of ARQ rounds).","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131131452","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}
Mahtaab Khan, Deepika Dubey, Huma Gupta, A. Saxena
Learning is the process of generating useful information from a huge volume of data. Learning can be classified as supervised learning and unsupervised learning. Classification is a kind of supervised learning and Clustering is a kind of unsupervised learning. Prototype clustering and classification is new technique in data mining. The prototype clustering and classification also called as ensemble clustering and classification. The Proposed novel method for prototype clustering and classification based on ant colony optimization and genetic algorithm. We conduct experiments with the prototype clustering and classification based on GA ANT hybrid technique using UCI repository with three data sets. The experimental results show that the proposed approach can achieve superior classification performance than other commonly used data mining approaches.
{"title":"Optimize Prototype Classification Based on GA ANT Hybrid Technique","authors":"Mahtaab Khan, Deepika Dubey, Huma Gupta, A. Saxena","doi":"10.1109/CICN.2013.113","DOIUrl":"https://doi.org/10.1109/CICN.2013.113","url":null,"abstract":"Learning is the process of generating useful information from a huge volume of data. Learning can be classified as supervised learning and unsupervised learning. Classification is a kind of supervised learning and Clustering is a kind of unsupervised learning. Prototype clustering and classification is new technique in data mining. The prototype clustering and classification also called as ensemble clustering and classification. The Proposed novel method for prototype clustering and classification based on ant colony optimization and genetic algorithm. We conduct experiments with the prototype clustering and classification based on GA ANT hybrid technique using UCI repository with three data sets. The experimental results show that the proposed approach can achieve superior classification performance than other commonly used data mining approaches.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The data in wireless sensor networks is organized in an efficient manner using data aggregation and data dissemination protocols. Due to the energy constraints in sensor nodes, energy-efficient data aggregation protocols are used to save the node energy and enhance the network life cycle. Deploying additional sensor nodes in the network reduce the resource constraints but increase the rate of data redundancy. This limitation is addressed by the data aggregation protocols in sensor networks. Data aggregation protocols use cluster head node to collect the data, aggregate the data and forward the data to the base station. The primary attributes considered in the design of data aggregation protocols are energy, latency, cluster size and data rate. In this article, we present a novel approach to classify the energy-efficient data aggregation protocols based on structure, search-based and time-based approaches. Analysis for structure-free, structure-based, distance and time-based data aggregation protocols are given in detail. Simulation results indicate that the energy and throughput rate are improved in the cluster-based data aggregation protocols as compared to the structure-free, time-based or search-based data aggregation protocols.
{"title":"Energy efficient data aggregation techniques in wireless sensor networks","authors":"M. Bala Krishna, Noble Vashishta","doi":"10.1109/CICN.2013.143","DOIUrl":"https://doi.org/10.1109/CICN.2013.143","url":null,"abstract":"The data in wireless sensor networks is organized in an efficient manner using data aggregation and data dissemination protocols. Due to the energy constraints in sensor nodes, energy-efficient data aggregation protocols are used to save the node energy and enhance the network life cycle. Deploying additional sensor nodes in the network reduce the resource constraints but increase the rate of data redundancy. This limitation is addressed by the data aggregation protocols in sensor networks. Data aggregation protocols use cluster head node to collect the data, aggregate the data and forward the data to the base station. The primary attributes considered in the design of data aggregation protocols are energy, latency, cluster size and data rate. In this article, we present a novel approach to classify the energy-efficient data aggregation protocols based on structure, search-based and time-based approaches. Analysis for structure-free, structure-based, distance and time-based data aggregation protocols are given in detail. Simulation results indicate that the energy and throughput rate are improved in the cluster-based data aggregation protocols as compared to the structure-free, time-based or search-based data aggregation protocols.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257787","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}
LOD (Levels of Details) is a technology often applied in real-time photo realistic, which reduces the complexity of scene preferably. At the same time, the distortion is lessened and the request of real time is met. A frequency used algorithm of LOD in lots of literatures is based on quad tree. This paper discusses the development of LOD technology, introduces LOD algorithm based on quad-tree, and realizes the loading terrain module in the scene of high-speed railway virtual reality. In the end, an ulterior development of LOD is referred.
LOD (Levels of Details)是一种经常应用于实时照片真实感的技术，它能较好地降低场景的复杂性。同时减少了失真，满足了实时性的要求。大量文献中常用的一种基于四叉树的LOD算法。论述了LOD技术的发展，介绍了基于四叉树的LOD算法，实现了高速铁路虚拟现实场景中的加载地形模块。最后，对LOD的未来发展进行了展望。
{"title":"A LOD Algorithm for Terrain-Load in the Scene of High-Speed Railway Virtual Reality Based on Quad-tree","authors":"Yang Li, Shiyao Sun, Huaiyu Xu","doi":"10.1109/CICN.2013.109","DOIUrl":"https://doi.org/10.1109/CICN.2013.109","url":null,"abstract":"LOD (Levels of Details) is a technology often applied in real-time photo realistic, which reduces the complexity of scene preferably. At the same time, the distortion is lessened and the request of real time is met. A frequency used algorithm of LOD in lots of literatures is based on quad tree. This paper discusses the development of LOD technology, introduces LOD algorithm based on quad-tree, and realizes the loading terrain module in the scene of high-speed railway virtual reality. In the end, an ulterior development of LOD is referred.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124313069","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}
Information retrieving and storing are the basic tasks of the relational database. Query optimization is used for accessing database in an efficient manner, analyzing and choosing an optimized plan is a complex process. Today's end-users are more interested in specific results rather than getting response in short time. Ranking queries (or top-k queries) are support for accessing specific results based on user's demand. Efficient execution of top-k queries is becoming a major challenge for relational database. Ranking queries produce results that are ordered on some ranking attribute. This paper presents a scoring function based rank query optimization methodology where scoring function decide preference over conduction as per user demand and shows the result of both query without ranking and ranked query, the result of ranked query is better than without ranked query.
{"title":"An Approach to Optimize Query Using Rank Aware Scoring Function","authors":"Vivek Shrivastava, B. Patel","doi":"10.1109/CICN.2013.110","DOIUrl":"https://doi.org/10.1109/CICN.2013.110","url":null,"abstract":"Information retrieving and storing are the basic tasks of the relational database. Query optimization is used for accessing database in an efficient manner, analyzing and choosing an optimized plan is a complex process. Today's end-users are more interested in specific results rather than getting response in short time. Ranking queries (or top-k queries) are support for accessing specific results based on user's demand. Efficient execution of top-k queries is becoming a major challenge for relational database. Ranking queries produce results that are ordered on some ranking attribute. This paper presents a scoring function based rank query optimization methodology where scoring function decide preference over conduction as per user demand and shows the result of both query without ranking and ranked query, the result of ranked query is better than without ranked query.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125033578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper proposes a dual cancellable fingerprint template method based on BioHashing and Fuzzy Commitment. In the new method, firstly, Finger Code extracted from fingerprint image is noninvertibly mapped into a string of binary bits by BioHashing, and then the bit string is bound with a key by Fuzzy Commitment to generate the final template data stored in the database. It can overcome threat of replay attack in the approach of biometric feature transformation, and also avoid latent leakage of original template feature. in addition, as for the poor recognition when the random matrix is public in BioHashing, we also proposes some improvements, including aligning fingerprints with both fingerprint core point and minutiae, and assigning a random point instead of the core point as the reference point of Finger Code. These improvements enhance the ability of fingerprint recognition, and reduce the rate of failure to enroll, and also increase the difficulty of crack for attackers.
{"title":"An Enhancing Fingerprint Template Protection Method","authors":"C. Kaizhi, H. Aiqun","doi":"10.1109/CICN.2013.65","DOIUrl":"https://doi.org/10.1109/CICN.2013.65","url":null,"abstract":"The paper proposes a dual cancellable fingerprint template method based on BioHashing and Fuzzy Commitment. In the new method, firstly, Finger Code extracted from fingerprint image is noninvertibly mapped into a string of binary bits by BioHashing, and then the bit string is bound with a key by Fuzzy Commitment to generate the final template data stored in the database. It can overcome threat of replay attack in the approach of biometric feature transformation, and also avoid latent leakage of original template feature. in addition, as for the poor recognition when the random matrix is public in BioHashing, we also proposes some improvements, including aligning fingerprints with both fingerprint core point and minutiae, and assigning a random point instead of the core point as the reference point of Finger Code. These improvements enhance the ability of fingerprint recognition, and reduce the rate of failure to enroll, and also increase the difficulty of crack for attackers.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128168471","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}
A web service is a method of communication between two electronic devices over the World Wide Web. The web service is a software function that provides different business functionality to service consumers. The set of web services can be composed together as a composition operation to fulfill and achieve the complex business requirements with the help of Business Process Execution Language (BPEL) or business processes. The existing business processes are having set of merits such as industry oriented approach and good control over workflow design. The business processes are unable to support for human user interaction, encryption and decryption mechanisms for providing the security for its data processing, therefore, the data process by business processes will not be secure from unauthorized users over the network. In this paper, we propose a secure framework for business processes to provide data security over the network. The proposed framework implements Caesar Cipher technique of cryptography with an example. The proposed technique transmits data in a secure manner over the network.
{"title":"A Secure Framework for Business Process Execution","authors":"R. Bhandari, U. Suman","doi":"10.1109/CICN.2013.88","DOIUrl":"https://doi.org/10.1109/CICN.2013.88","url":null,"abstract":"A web service is a method of communication between two electronic devices over the World Wide Web. The web service is a software function that provides different business functionality to service consumers. The set of web services can be composed together as a composition operation to fulfill and achieve the complex business requirements with the help of Business Process Execution Language (BPEL) or business processes. The existing business processes are having set of merits such as industry oriented approach and good control over workflow design. The business processes are unable to support for human user interaction, encryption and decryption mechanisms for providing the security for its data processing, therefore, the data process by business processes will not be secure from unauthorized users over the network. In this paper, we propose a secure framework for business processes to provide data security over the network. The proposed framework implements Caesar Cipher technique of cryptography with an example. The proposed technique transmits data in a secure manner over the network.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128185403","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}
Wide band truncated rectangular micro strip antenna with slot loaded stacked patches and defected ground plane structure is presented in this paper to increase the bandwidth. By inserting slot in the ground plane the bandwidth of the stacked truncated rectangular micro strip antenna is improve by twice. The bandwidth before adding the slot in the ground structure was 29.7% whereas after adding the slot in the ground plane of a stacked truncated rectangular micro strip antenna it increases up to 63.65% ranging from 2.72 to 5.26 GHz. The radiation pattern has acceptable response at both E&H plane. The antenna is design at FR4 glass epoxy substrate fed by a coaxial feeding technique. Detail of the proposed antenna and the simulated results are presented.
{"title":"Bandwidth Enhancement for Truncated Rectangular Microstrip Antenna Using Stacked Patches and Defected Ground Structure","authors":"S. N. Ather, R. Verma, P. Singhal","doi":"10.1109/CICN.2013.21","DOIUrl":"https://doi.org/10.1109/CICN.2013.21","url":null,"abstract":"Wide band truncated rectangular micro strip antenna with slot loaded stacked patches and defected ground plane structure is presented in this paper to increase the bandwidth. By inserting slot in the ground plane the bandwidth of the stacked truncated rectangular micro strip antenna is improve by twice. The bandwidth before adding the slot in the ground structure was 29.7% whereas after adding the slot in the ground plane of a stacked truncated rectangular micro strip antenna it increases up to 63.65% ranging from 2.72 to 5.26 GHz. The radiation pattern has acceptable response at both E&H plane. The antenna is design at FR4 glass epoxy substrate fed by a coaxial feeding technique. Detail of the proposed antenna and the simulated results are presented.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130614922","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
扫码关注我们
求助内容：
应助结果提醒方式：