As we know in Mobile Ad hoc network our Nodes are highly mobile. They move around the Network. Due to this network topology and number of neighboring nodes in each node frequently change. Movement of nodes from one to another network also affect to the communication between them. To connect the wired and wireless networks particularly the Mobile ad hoc Network is very interesting in real world situations due to its popularity and usefulness. As in our paper we given and explained a approach in which cluster head and gateway will be same and that node is known as cluster head gateway (CHG), in which all the responsibilities of cluster head and gateway will be perform by the CHG and we introduces the prediction table concepts and discusses a mechanism for selecting an alternate route in case if the CHG is unable to forward the packets to the destination, This approach providing Bi-directional connectivity between MANET and wired Nodes. In this paper we are extending the network coverage and the performance measured with other large N/w's. Finally, this paper conducts simulation experiments in the conditions where we connecting MANET nodes to the wired nodes using different networks.
{"title":"Enhancing the MANET Nodes of Hierarchical Architecture for Communication between Mobile Ad Hoc Network and Internet Using Cluster Head Gateway","authors":"A. Bagwari, R. Jee","doi":"10.1109/CICN.2011.71","DOIUrl":"https://doi.org/10.1109/CICN.2011.71","url":null,"abstract":"As we know in Mobile Ad hoc network our Nodes are highly mobile. They move around the Network. Due to this network topology and number of neighboring nodes in each node frequently change. Movement of nodes from one to another network also affect to the communication between them. To connect the wired and wireless networks particularly the Mobile ad hoc Network is very interesting in real world situations due to its popularity and usefulness. As in our paper we given and explained a approach in which cluster head and gateway will be same and that node is known as cluster head gateway (CHG), in which all the responsibilities of cluster head and gateway will be perform by the CHG and we introduces the prediction table concepts and discusses a mechanism for selecting an alternate route in case if the CHG is unable to forward the packets to the destination, This approach providing Bi-directional connectivity between MANET and wired Nodes. In this paper we are extending the network coverage and the performance measured with other large N/w's. Finally, this paper conducts simulation experiments in the conditions where we connecting MANET nodes to the wired nodes using different networks.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"19 15-16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123568461","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}
Biometrics recognition tool has great emphasis in both research and practical applications. With an increasing requirement on security, automated personal identification and verification based biometrics has been receiving extensive attention over the past decade. In this paper Performance Evaluation of Face Recognition based on DWT and DT-CWT using Multi-matching Classifiers (FRMC) is proposed. The face images captured from the persons differ in size and hence image dimensions are converted into 2n * 2n dimension, for DT-CWT. The two level DWT is applied on face images to generate four sub bands. The DT-CWT is applied on only LL sub band to generate DT-CWT coefficients, which forms features for face images. The features of database and test face are compared using Euclidian Distance, Random Forest and Support Vector Machine matching algorithms. It is observed that correct recognition rate, false acceptance rate and false reject rate are better in the case of proposed method as compared to existing techniques.
{"title":"Performance Evaluation of Face Recognition Based on DWT and DT-CWT Using Multi-matching Classifiers","authors":"R. K, K. Raja","doi":"10.1109/CICN.2011.130","DOIUrl":"https://doi.org/10.1109/CICN.2011.130","url":null,"abstract":"Biometrics recognition tool has great emphasis in both research and practical applications. With an increasing requirement on security, automated personal identification and verification based biometrics has been receiving extensive attention over the past decade. In this paper Performance Evaluation of Face Recognition based on DWT and DT-CWT using Multi-matching Classifiers (FRMC) is proposed. The face images captured from the persons differ in size and hence image dimensions are converted into 2n * 2n dimension, for DT-CWT. The two level DWT is applied on face images to generate four sub bands. The DT-CWT is applied on only LL sub band to generate DT-CWT coefficients, which forms features for face images. The features of database and test face are compared using Euclidian Distance, Random Forest and Support Vector Machine matching algorithms. It is observed that correct recognition rate, false acceptance rate and false reject rate are better in the case of proposed method as compared to existing techniques.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124609317","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}
Generic Fourier descriptor yield spectral features and have better retrieval performance due to multi-resolution analysis in both radial and circular directions of the shape. In the proposed work, an automated bamboo species recognition system based on shape features of bamboo culm sheath has been developed using Generic Fourier Moment and compare the result with Hu moment. The performance of the classifier is compared based on the classifier accuracy and conclude that the Fourier moment have significantly good results compare to Hu moment. The results obtained shows considerable recognition accuracy proving that the techniques used is suitable to be implemented for commercial purposes.
{"title":"A Comparison of 2D Moment Based Description Techniques for Classification of Bamboo Plant","authors":"Krishnavir Singh, I. Gupta, Sangeeta Gupta","doi":"10.1109/CICN.2011.4","DOIUrl":"https://doi.org/10.1109/CICN.2011.4","url":null,"abstract":"Generic Fourier descriptor yield spectral features and have better retrieval performance due to multi-resolution analysis in both radial and circular directions of the shape. In the proposed work, an automated bamboo species recognition system based on shape features of bamboo culm sheath has been developed using Generic Fourier Moment and compare the result with Hu moment. The performance of the classifier is compared based on the classifier accuracy and conclude that the Fourier moment have significantly good results compare to Hu moment. The results obtained shows considerable recognition accuracy proving that the techniques used is suitable to be implemented for commercial purposes.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229039","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 secure ad hoc network authorized nodes access the network based on network initialization, authentication and secure communication. Authentication forms the core in security, where nodes exchange data based on key management. Trusted Third Party (TPP) or Certificate Authority (CA) function as trust infrastructure and enable the nodes to access or leave the network. The main feature of security protocols is key management, which includes key distribution and key update. This article gives analysis of various key management and symmetric key distribution techniques in wireless ad hoc network. Master key, pair wise key and random key pre-distribution techniques are used in key management. Analytical methods confirm that for a less dense network master key is used and for a large dense network random key is used. In order to minimize the key management complexity in security protocols, symmetric key distribution is used. Key distribution techniques are classified based node attributes as local area, wide area and threshold area conditions. Analysis of various key distribution method concludes that (i) if keys are compromised in a local area, self-healing key management technique is used (ii) if keys are compromised in wide area, distributed Diffie Hellman is used and (iii) if keys are compromised in threshold area conditions, then subset of m keys are distributed in m different locations.
{"title":"Symmetric key management and distribution techniques in wireless ad hoc networks","authors":"M. Krishna, M. Doja","doi":"10.1109/CICN.2011.158","DOIUrl":"https://doi.org/10.1109/CICN.2011.158","url":null,"abstract":"In secure ad hoc network authorized nodes access the network based on network initialization, authentication and secure communication. Authentication forms the core in security, where nodes exchange data based on key management. Trusted Third Party (TPP) or Certificate Authority (CA) function as trust infrastructure and enable the nodes to access or leave the network. The main feature of security protocols is key management, which includes key distribution and key update. This article gives analysis of various key management and symmetric key distribution techniques in wireless ad hoc network. Master key, pair wise key and random key pre-distribution techniques are used in key management. Analytical methods confirm that for a less dense network master key is used and for a large dense network random key is used. In order to minimize the key management complexity in security protocols, symmetric key distribution is used. Key distribution techniques are classified based node attributes as local area, wide area and threshold area conditions. Analysis of various key distribution method concludes that (i) if keys are compromised in a local area, self-healing key management technique is used (ii) if keys are compromised in wide area, distributed Diffie Hellman is used and (iii) if keys are compromised in threshold area conditions, then subset of m keys are distributed in m different locations.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122008223","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 lung itself cannot generate sound if there is no airflow, pressure differences between structures within the thorax. Listening and interpreting lung sounds by a stethoscope had been an important component of screening and diagnosing lung diseases. However this practice has always been vulnerable to poor audibility, inter-observer variations (between different physicians) and poor reproducibility. Lung sound consists of two main types of sound Basic Lung sound and adventitious sound. The timing, repeatability, and shape of crackles are important parameters for diagnosis. In this paper we aim at automatic analysis of lung sounds for wheeze and crackle detection and classification.
{"title":"Analysis of Deformities in Lung Using Short Time Fourier Transform Spectrogram Analysis on Lung Sound","authors":"A. Parkhi, M. Pawar","doi":"10.1109/CICN.2011.35","DOIUrl":"https://doi.org/10.1109/CICN.2011.35","url":null,"abstract":"The lung itself cannot generate sound if there is no airflow, pressure differences between structures within the thorax. Listening and interpreting lung sounds by a stethoscope had been an important component of screening and diagnosing lung diseases. However this practice has always been vulnerable to poor audibility, inter-observer variations (between different physicians) and poor reproducibility. Lung sound consists of two main types of sound Basic Lung sound and adventitious sound. The timing, repeatability, and shape of crackles are important parameters for diagnosis. In this paper we aim at automatic analysis of lung sounds for wheeze and crackle detection and classification.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122052160","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 ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the "sequencing" algorithm.
{"title":"Add-On to the ETS Algorithm to Improve Its Efficiency in Special Cases Such as a Crown Graph","authors":"P. Jain, S. Mathur, P. Bhatt","doi":"10.1109/CICN.2011.22","DOIUrl":"https://doi.org/10.1109/CICN.2011.22","url":null,"abstract":"The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the \"sequencing\" algorithm.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116117603","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}
An architecture to simplify the circuit implementation of analog-to-digital (A/D) converter in a sigma-delta (S?) modulator is proposed. The two-step quantization technique is utilized to design architecture of S? modulator. The architecture is based on dividing the A/D conversion into two time steps for achieving resolution improvement without decreasing speed. The novel architecture is designed to obtain high dynamic range of input signal, high signal-to-noise ratio and high reliability. Switched capacitor (SC) modulator performance is prone to various nonidealities, which affects overall circuit performance. In this paper a set of models are proposed which takes into account SC S? modulator nonidealities, such as sampling jitter, kT/C noise, and operational amplifier parameters (noise, finite dc gain, finite bandwidth, slew-rate and saturation voltages). Each nonidealities are modelled mathematically and their behaviour is verified using different analysis in MATLAB Simulink. Simulation results on a second-order SC S? modulator with two step quantization demonstrate the validity of the models proposed.
{"title":"Modeling of Sigma-Delta Modulator Non-idealities with Two Step Quantization in MATLAB/SIMULINK","authors":"S. Jaykar, P. Palsodkar, P. Dakhole","doi":"10.1109/CICN.2011.114","DOIUrl":"https://doi.org/10.1109/CICN.2011.114","url":null,"abstract":"An architecture to simplify the circuit implementation of analog-to-digital (A/D) converter in a sigma-delta (S?) modulator is proposed. The two-step quantization technique is utilized to design architecture of S? modulator. The architecture is based on dividing the A/D conversion into two time steps for achieving resolution improvement without decreasing speed. The novel architecture is designed to obtain high dynamic range of input signal, high signal-to-noise ratio and high reliability. Switched capacitor (SC) modulator performance is prone to various nonidealities, which affects overall circuit performance. In this paper a set of models are proposed which takes into account SC S? modulator nonidealities, such as sampling jitter, kT/C noise, and operational amplifier parameters (noise, finite dc gain, finite bandwidth, slew-rate and saturation voltages). Each nonidealities are modelled mathematically and their behaviour is verified using different analysis in MATLAB Simulink. Simulation results on a second-order SC S? modulator with two step quantization demonstrate the validity of the models proposed.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120936107","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}
Complex and large scale scientific computation problems require high computing machines to process data or jobs which are expensive in terms of money. One most successful and low cost mechanism for acquiring the necessary computation power for such type of application is the Peer-to-Peer computing paradigm, which makes use of the computational power of personal computers. The peer-to-peer (P2P) systems represent the applications that allow direct communication between peers and resource harvesting. In this paper we propose a generic Peer-to-Peer computing system (P2PCS) to process complex and large scale scientific computation problems. The system utilizes the CPU cycles of desktop PCs which are connected to the network to perform the computations. We are implementing this system in JAVA technology by using Sun's JXTA --JXSE 2.5 libraries.
{"title":"P2PCS - A Pure Peer-to-Peer Computing System for Large Scale Computation Problems","authors":"Jigyasu Dubey, V. Tokekar","doi":"10.1109/CICN.2011.126","DOIUrl":"https://doi.org/10.1109/CICN.2011.126","url":null,"abstract":"Complex and large scale scientific computation problems require high computing machines to process data or jobs which are expensive in terms of money. One most successful and low cost mechanism for acquiring the necessary computation power for such type of application is the Peer-to-Peer computing paradigm, which makes use of the computational power of personal computers. The peer-to-peer (P2P) systems represent the applications that allow direct communication between peers and resource harvesting. In this paper we propose a generic Peer-to-Peer computing system (P2PCS) to process complex and large scale scientific computation problems. The system utilizes the CPU cycles of desktop PCs which are connected to the network to perform the computations. We are implementing this system in JAVA technology by using Sun's JXTA --JXSE 2.5 libraries.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381198","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}
This paper presents dual wideband microstrip antenna which is designed using stacking configuration to give a better bandwidth as compared to single layer substrate design. The designed slotted stacked patch antenna can operate in the Wimax, (2.2-3.4 GHz) WLAN (2.40--2.48GHz), and UMTS II (2.50--2.69GHz) frequency band giving a maximum bandwidth of 37.95%. The air is used as a dielectric between the two stacks and a height of 10 mm is kept between the two stacks. The feeding technique used in the design is the coaxial probe feed and the impedance matching and radiation characteristics of the structure are investigated using MOM based IE3D. The simulation result shows that the proposed antenna can offer excellent performance for Wi Max and WLAN application.
本文提出了一种双宽带微带天线，该天线采用叠加结构设计，与单层衬底设计相比，具有更好的带宽。所设计的开槽堆叠贴片天线可以在Wimax (2.2-3.4 GHz)、WLAN (2.40- 2.48GHz)和UMTS II (2.50- 2.69GHz)频段工作，最大带宽为37.95%。空气用作两层之间的电介质，两层之间保持10mm的高度。设计中采用的馈电技术为同轴探头馈电，并利用基于MOM的IE3D对结构的阻抗匹配和辐射特性进行了研究。仿真结果表明，该天线在Wi - Max和WLAN应用中具有良好的性能。
{"title":"Dual Wideband Stacked Patch Antenna for WiMax and WLAN Applications","authors":"V. Singh, Z. Ali, Ashutosh Kumar Singh","doi":"10.1109/CICN.2011.66","DOIUrl":"https://doi.org/10.1109/CICN.2011.66","url":null,"abstract":"This paper presents dual wideband microstrip antenna which is designed using stacking configuration to give a better bandwidth as compared to single layer substrate design. The designed slotted stacked patch antenna can operate in the Wimax, (2.2-3.4 GHz) WLAN (2.40--2.48GHz), and UMTS II (2.50--2.69GHz) frequency band giving a maximum bandwidth of 37.95%. The air is used as a dielectric between the two stacks and a height of 10 mm is kept between the two stacks. The feeding technique used in the design is the coaxial probe feed and the impedance matching and radiation characteristics of the structure are investigated using MOM based IE3D. The simulation result shows that the proposed antenna can offer excellent performance for Wi Max and WLAN application.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126843400","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 distributed systems it is often necessary to provide coordination among the multiple concurrent processes to tolerate the contention, periods of asynchrony and a number of failures. Quorum systems provide a decentralized approach for such coordination. In this paper, we propose a replica control protocol by using a Generalized-grid quorum consensus, which is the generalization of a Read-one-write-all (ROWA), Grid quorum consensus, D-Space quorum consensus and Multi-dimensional-grid quorum consensus protocols. This protocol provides a very high read availability and read capacity while maintaining the reconfigurable levels of write availability and fault tolerance.
{"title":"Generalized Grid Quorum Consensus for Replica Control Protocol","authors":"Vinit Kumar, A. Agarwal","doi":"10.1109/CICN.2011.83","DOIUrl":"https://doi.org/10.1109/CICN.2011.83","url":null,"abstract":"In distributed systems it is often necessary to provide coordination among the multiple concurrent processes to tolerate the contention, periods of asynchrony and a number of failures. Quorum systems provide a decentralized approach for such coordination. In this paper, we propose a replica control protocol by using a Generalized-grid quorum consensus, which is the generalization of a Read-one-write-all (ROWA), Grid quorum consensus, D-Space quorum consensus and Multi-dimensional-grid quorum consensus protocols. This protocol provides a very high read availability and read capacity while maintaining the reconfigurable levels of write availability and fault tolerance.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126819161","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
扫码关注我们
求助内容：
应助结果提醒方式：