Pub Date : 2011-11-03DOI: 10.1109/RAICS.2011.6069371
Jayanta K. Chandra, Pradipta K. Banerjee, A. K. Datta
In this paper a new approach for the detection of defects in woven fabric is presented where the singular value decomposition (SVD) method is used. SVD basically removes the interlaced grating structure of the waft and warp of the fabric leaving aside the defective part of the fabric. An intensity threshold value along with the module of definite size is considered for the binarization of the background free fabric image. Finally, for the removal of the noise from the binary fabric image the morphological opening operation with the suitable structuring element is performed. The technique is tested on 287 fabric samples consisting of five different types of defects in three types of woven fabrics from TILDA database. 94.08% success rate of detection of defects is achieved.
{"title":"Singular value decomposition method for the detection of defects in woven fabric refined by morphological operation","authors":"Jayanta K. Chandra, Pradipta K. Banerjee, A. K. Datta","doi":"10.1109/RAICS.2011.6069371","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069371","url":null,"abstract":"In this paper a new approach for the detection of defects in woven fabric is presented where the singular value decomposition (SVD) method is used. SVD basically removes the interlaced grating structure of the waft and warp of the fabric leaving aside the defective part of the fabric. An intensity threshold value along with the module of definite size is considered for the binarization of the background free fabric image. Finally, for the removal of the noise from the binary fabric image the morphological opening operation with the suitable structuring element is performed. The technique is tested on 287 fabric samples consisting of five different types of defects in three types of woven fabrics from TILDA database. 94.08% success rate of detection of defects is achieved.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"652 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115113863","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069294
K. Arun, K. Sarath
This paper deals with the problem of gender classification using fingerprint images. Our attempt to gender identification follows the use of machine learning to determine the differences between fingerprint images. Each image in the database was represented by a feature vector consisting of ridge thickness to valley thickness ratio (RTVTR) and the ridge density values. By using a support vector machine trained on a set of 150 male and 125 female images, we obtain a robust classifying function for male and female feature vector patterns.
{"title":"A machine learning approach for fingerprint based gender identification","authors":"K. Arun, K. Sarath","doi":"10.1109/RAICS.2011.6069294","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069294","url":null,"abstract":"This paper deals with the problem of gender classification using fingerprint images. Our attempt to gender identification follows the use of machine learning to determine the differences between fingerprint images. Each image in the database was represented by a feature vector consisting of ridge thickness to valley thickness ratio (RTVTR) and the ridge density values. By using a support vector machine trained on a set of 150 male and 125 female images, we obtain a robust classifying function for male and female feature vector patterns.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115620052","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069318
R. Chouhan, R. K. Jha, M. Shrivastava, Apoorv Chaturvedi
In this paper, a dynamic stochastic resonance (DSR)-based blind watermark extraction technique has been proposed for robust extraction of a binary watermark. The watermark embedding has been done in mid-band DCT coefficients using well-known PN sequences. Dynamic stochastic resonance has been strategically used to improve the robustness of the extraction algorithm by utilizing the added noise (or degradation) during attacks itself. DSR is a converging iterative process that tunes the coefficients of the possibly attacked image so that effect of noise is suppressed and hidden information is enhanced. Resilience of this technique has been tested in the presence of various attacks such as noise attacks, geometrical distortions, enhancement, compression and filtering. A simple optimization procedure has been adopted for the selection of bistable double-well system parameters in the DSR step so to achieve maximum correlation coefficient under minimum computational complexity. Using the proposed adaptive DSR-based extraction technique, a very robust extraction of watermark can be done without trading-off with visual quality of the watermarked image. When compared with the plain DCT-based technique, the proposed DSR-based DCT technique has been found to give better performance.
{"title":"Improved watermark extraction using dynamic stochastic resonance","authors":"R. Chouhan, R. K. Jha, M. Shrivastava, Apoorv Chaturvedi","doi":"10.1109/RAICS.2011.6069318","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069318","url":null,"abstract":"In this paper, a dynamic stochastic resonance (DSR)-based blind watermark extraction technique has been proposed for robust extraction of a binary watermark. The watermark embedding has been done in mid-band DCT coefficients using well-known PN sequences. Dynamic stochastic resonance has been strategically used to improve the robustness of the extraction algorithm by utilizing the added noise (or degradation) during attacks itself. DSR is a converging iterative process that tunes the coefficients of the possibly attacked image so that effect of noise is suppressed and hidden information is enhanced. Resilience of this technique has been tested in the presence of various attacks such as noise attacks, geometrical distortions, enhancement, compression and filtering. A simple optimization procedure has been adopted for the selection of bistable double-well system parameters in the DSR step so to achieve maximum correlation coefficient under minimum computational complexity. Using the proposed adaptive DSR-based extraction technique, a very robust extraction of watermark can be done without trading-off with visual quality of the watermarked image. When compared with the plain DCT-based technique, the proposed DSR-based DCT technique has been found to give better performance.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121796729","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069349
M. R. Ram, K. V. Madhav, E. Krishna, K. N. Reddy, K. Reddy
Arterial blood oxygen saturation (SpO2) is effectively measured by the pulse oximeter. The common cause of pulse oximeter failure, in error- free SpO2 estimation, is motion artifact (MA) corruption in the detected PPG signals. For a reliable and a low failure rate SpO2 estimation, the pulse oximeters must be provided with a clean artifact-free PPG signals with clearly separable DC and AC parts from which the SpO2 is computed in time domain. In this paper, we present non-parametric spectral estimation methods for computing SpO2. The PPG signals recorded with frequently encountered artifacts (bending, vertical and horizontal motions of finger) were used for validation of the proposed methods. Experimental results revealed that the non-parametric spectral estimation methods are as accurate as the time domain analysis and particularly the Blackman-Tukey based SpO2 estimation out performed other non-parametric methods. Further, the Daubechies wavelet based method efficiently reduced motion artifacts restoring all the morphological features of the PPG signals.
{"title":"Use of spectral estimation methods for computation of SpO2 from artifact reduced PPG signals","authors":"M. R. Ram, K. V. Madhav, E. Krishna, K. N. Reddy, K. Reddy","doi":"10.1109/RAICS.2011.6069349","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069349","url":null,"abstract":"Arterial blood oxygen saturation (SpO2) is effectively measured by the pulse oximeter. The common cause of pulse oximeter failure, in error- free SpO2 estimation, is motion artifact (MA) corruption in the detected PPG signals. For a reliable and a low failure rate SpO2 estimation, the pulse oximeters must be provided with a clean artifact-free PPG signals with clearly separable DC and AC parts from which the SpO2 is computed in time domain. In this paper, we present non-parametric spectral estimation methods for computing SpO2. The PPG signals recorded with frequently encountered artifacts (bending, vertical and horizontal motions of finger) were used for validation of the proposed methods. Experimental results revealed that the non-parametric spectral estimation methods are as accurate as the time domain analysis and particularly the Blackman-Tukey based SpO2 estimation out performed other non-parametric methods. Further, the Daubechies wavelet based method efficiently reduced motion artifacts restoring all the morphological features of the PPG signals.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124942478","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069285
M. Naga Raju, K. Anuradha, G. Murthy, A. Santha Kumari
This paper presents simulation study of an Electric Arc Furnace (EAF) model in the MATLAB/SIMULINK environment. EAF was modeled as a time domain controlled voltage source (CVS) model. Voltage flicker, a phenomenon of annoying light intensity fluctuation, caused by EAF, has been a major power quality concern for both power companies and customers. A model was developed for the EAF and it was applied in the simulation studies of cascaded H-bridge converter based Distribution STATic synchronous COMpensator (DSTATCOM) for voltage flicker mitigation. The controller for DSTATCOM was designed based on d-q model for the reactive power management, which helps in the mitigation of the flicker. With the validated EAF and STATCOM model, simulations are conducted to study the response of the compensator in the distribution system.
{"title":"Voltage flicker mitigation by DSTATCOM for voltage source Arc furnace model","authors":"M. Naga Raju, K. Anuradha, G. Murthy, A. Santha Kumari","doi":"10.1109/RAICS.2011.6069285","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069285","url":null,"abstract":"This paper presents simulation study of an Electric Arc Furnace (EAF) model in the MATLAB/SIMULINK environment. EAF was modeled as a time domain controlled voltage source (CVS) model. Voltage flicker, a phenomenon of annoying light intensity fluctuation, caused by EAF, has been a major power quality concern for both power companies and customers. A model was developed for the EAF and it was applied in the simulation studies of cascaded H-bridge converter based Distribution STATic synchronous COMpensator (DSTATCOM) for voltage flicker mitigation. The controller for DSTATCOM was designed based on d-q model for the reactive power management, which helps in the mitigation of the flicker. With the validated EAF and STATCOM model, simulations are conducted to study the response of the compensator in the distribution system.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116430980","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069287
M. Sinith, M. N. Nair, Niveditha P. Nair, S. Parvathy
This paper, presents a new approach in Blind Source Separation (BSS) using identified wavelets in musical instruments as window function in the Degenerate Unmixing Estimation Technique (DUET) algorithm. the scaling function and the wavelet functions of the wavelets present in musical instruments, violin and flute is presented. NLMS algorithm is used to identify the filter bank coefficients of wavelet-like elements, found repeating in musical notes of the instruments. Scaling functions of the standard wavelets are also found out by an iterative manner using NLMS algorithm. wavelets for different musical instruments are developed. The obtained wavelets are utilized in the DUET algorithm to achieve the goal of BSS to the mixed source of music instruments signals.
{"title":"Blind Source Separation of musical instrument signals by identification of wavelets and filter bank coefficients","authors":"M. Sinith, M. N. Nair, Niveditha P. Nair, S. Parvathy","doi":"10.1109/RAICS.2011.6069287","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069287","url":null,"abstract":"This paper, presents a new approach in Blind Source Separation (BSS) using identified wavelets in musical instruments as window function in the Degenerate Unmixing Estimation Technique (DUET) algorithm. the scaling function and the wavelet functions of the wavelets present in musical instruments, violin and flute is presented. NLMS algorithm is used to identify the filter bank coefficients of wavelet-like elements, found repeating in musical notes of the instruments. Scaling functions of the standard wavelets are also found out by an iterative manner using NLMS algorithm. wavelets for different musical instruments are developed. The obtained wavelets are utilized in the DUET algorithm to achieve the goal of BSS to the mixed source of music instruments signals.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116452918","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069308
M. Bhaskar, D. Parthiban, B. Venkataramani
In literature, surfing scheme has been used in wave pipelined serial interconnects to decrease the delay and ensure transmission reliability. In this paper, a “Controllable inverter pair” is proposed for surfing the differential wave pipelined serial interconnects. The proposed surfing scheme is implemented in UMC 0.18µm technology and the post layout performance is studied through simulation in Cadence spectre tool. The performance of the new scheme is compared with that of a single ended wave-pipelined link with surfing. The proposed scheme permits the data transmission rate of 2.78Gbps and it is higher by a factor of 2.08 compared to the single ended scheme. It also does not require any set up time constraints unlike single ended scheme, where the surfing signal must be ascertained before the data signal about one fourth of the data period.
{"title":"Design and implementation of surfing scheme to wave pipelined differential serial interconnect","authors":"M. Bhaskar, D. Parthiban, B. Venkataramani","doi":"10.1109/RAICS.2011.6069308","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069308","url":null,"abstract":"In literature, surfing scheme has been used in wave pipelined serial interconnects to decrease the delay and ensure transmission reliability. In this paper, a “Controllable inverter pair” is proposed for surfing the differential wave pipelined serial interconnects. The proposed surfing scheme is implemented in UMC 0.18µm technology and the post layout performance is studied through simulation in Cadence spectre tool. The performance of the new scheme is compared with that of a single ended wave-pipelined link with surfing. The proposed scheme permits the data transmission rate of 2.78Gbps and it is higher by a factor of 2.08 compared to the single ended scheme. It also does not require any set up time constraints unlike single ended scheme, where the surfing signal must be ascertained before the data signal about one fourth of the data period.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121847327","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069343
E. Madhusudhana Reddy, K. Suresh Kumar Reddy, M. Padmavathamma
Digital Signature Scheme is very useful in communication between parties. We studied new applications of Jordon-Totient function and applied them to RSA Digital Signature Scheme and developed protocols for communication between two parties using java and shown the graphical performance analysis on test results for key generation time, encryption time and decryption time respectively.
{"title":"An e-commerce security solution using MJ2-RSA Digital Signature","authors":"E. Madhusudhana Reddy, K. Suresh Kumar Reddy, M. Padmavathamma","doi":"10.1109/RAICS.2011.6069343","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069343","url":null,"abstract":"Digital Signature Scheme is very useful in communication between parties. We studied new applications of Jordon-Totient function and applied them to RSA Digital Signature Scheme and developed protocols for communication between two parties using java and shown the graphical performance analysis on test results for key generation time, encryption time and decryption time respectively.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122071417","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069386
K. A. Navas, D. Gayathri, M. Athulya, Anjali Vasudev
Researchers in the field of image and video processing use MSE (Mean Square Error) based fidelity metrics to validate their research results. The most popular MSE-based metrics are PSNR (Peak Signal to Noise Ratio) and WPSNR (Weighted Peak Signal to Noise Ratio). When large quantities of data are to be assessed, subjective metric such as MOS (Mean Opinion Score) is not pragmatic since it needs experts and inordinate amount of time. PSNR and WPSNR are independent of Human Visual System (HVS) parameters and hence they are inappropriate scales to measure potential research results. This paper brings out their inappropriateness and propose a new image fidelity metric called Modified Weighted Peak Signal to Noise Ratio (MWPSNR). This metric has been experimentally proven to be better than PSNR and WPSNR.
{"title":"MWPSNR: A new image fidelity metric","authors":"K. A. Navas, D. Gayathri, M. Athulya, Anjali Vasudev","doi":"10.1109/RAICS.2011.6069386","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069386","url":null,"abstract":"Researchers in the field of image and video processing use MSE (Mean Square Error) based fidelity metrics to validate their research results. The most popular MSE-based metrics are PSNR (Peak Signal to Noise Ratio) and WPSNR (Weighted Peak Signal to Noise Ratio). When large quantities of data are to be assessed, subjective metric such as MOS (Mean Opinion Score) is not pragmatic since it needs experts and inordinate amount of time. PSNR and WPSNR are independent of Human Visual System (HVS) parameters and hence they are inappropriate scales to measure potential research results. This paper brings out their inappropriateness and propose a new image fidelity metric called Modified Weighted Peak Signal to Noise Ratio (MWPSNR). This metric has been experimentally proven to be better than PSNR and WPSNR.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236044","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 : 2011-11-03DOI: 10.1109/RAICS.2011.6069391
A. Bagwari, S. Bisht
Mobile Ad Hoc Network (MANET) consists of dynamic topology as nodes in the network are mobile, and connected via wireless links. Nodes within the cluster communicate directly. However, nodes communicate outside the cluster through a centralized node that is called a Cluster Head Gateway (CHG) [1]. As the number of nodes increases complexity of MANET increases in various issues. Ad hoc wireless network is a dynamic multi-hop network, which is established by a group of mobile nodes on a shared wireless channel. The shared medium and the multi-hop nature of the wireless ad hoc networks pose fundamental challenges to the design of an effective resource allocation algorithm to maximize the aggregated utility of flows, maintaining basic fairness among the multiple flows. An elected Cluster Head Gateway (CHG) is assigned for communication with all other clusters. The centralized Cluster Head Gateway can become a bottleneck and possibly cause a lower connectivity for the clustering system. In this paper we propose a mechanism in which communication outside the cluster is distributed through separate Cluster Head Gateways. We will discuss how the averaged connectivity for the clustering system increases considerably. We also show that the increase in overall connectivity is by the increase/add Cluster Head Gateways. Additionally, the routing reliability to outside the cluster is increased since routes to different clusters use distinct Cluster Head Gateways. Finally, this paper conducts simulation experiments in the conditions where we using Multiple CHG to the nodes within a network.
{"title":"Cluster Head Gateway approach using in Integrated Mobile Ad hoc Network","authors":"A. Bagwari, S. Bisht","doi":"10.1109/RAICS.2011.6069391","DOIUrl":"https://doi.org/10.1109/RAICS.2011.6069391","url":null,"abstract":"Mobile Ad Hoc Network (MANET) consists of dynamic topology as nodes in the network are mobile, and connected via wireless links. Nodes within the cluster communicate directly. However, nodes communicate outside the cluster through a centralized node that is called a Cluster Head Gateway (CHG) [1]. As the number of nodes increases complexity of MANET increases in various issues. Ad hoc wireless network is a dynamic multi-hop network, which is established by a group of mobile nodes on a shared wireless channel. The shared medium and the multi-hop nature of the wireless ad hoc networks pose fundamental challenges to the design of an effective resource allocation algorithm to maximize the aggregated utility of flows, maintaining basic fairness among the multiple flows. An elected Cluster Head Gateway (CHG) is assigned for communication with all other clusters. The centralized Cluster Head Gateway can become a bottleneck and possibly cause a lower connectivity for the clustering system. In this paper we propose a mechanism in which communication outside the cluster is distributed through separate Cluster Head Gateways. We will discuss how the averaged connectivity for the clustering system increases considerably. We also show that the increase in overall connectivity is by the increase/add Cluster Head Gateways. Additionally, the routing reliability to outside the cluster is increased since routes to different clusters use distinct Cluster Head Gateways. Finally, this paper conducts simulation experiments in the conditions where we using Multiple CHG to the nodes within a network.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129425215","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
扫码关注我们
求助内容：
应助结果提醒方式：