Pub Date : 2013-05-13DOI: 10.1109/IADCC.2013.6514465
R. Kushwah, S. Akashe
In this paper, we included designing of low power tunable analog circuits using double gate (DG) MOSFET, where the front gate output is changed by control voltage on the back gate. The DG devices can be used to improve the performance and reduce the power dissipation when front gate and back gate both are independently controlled. In this paper, we included the analysis of the analog tunable circuits such as CMOS Amplifier pair, Schmitt Trigger circuit and Operational trans-conductance Amplifier. Gain, phase and output response of analog tunable circuits have been illustrated in the paper. These circuit blocks are used for low-noise high-performance integrated circuits for analog and mixed-signal applications. The simulation results are predicted by Cadence Virtuoso Tool in 45nm complementary metal oxide semiconductor (CMOS) Technology.
{"title":"Design and analysis of tunable analog circuit using double gate MOSFET at 45nm CMOS technology","authors":"R. Kushwah, S. Akashe","doi":"10.1109/IADCC.2013.6514465","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514465","url":null,"abstract":"In this paper, we included designing of low power tunable analog circuits using double gate (DG) MOSFET, where the front gate output is changed by control voltage on the back gate. The DG devices can be used to improve the performance and reduce the power dissipation when front gate and back gate both are independently controlled. In this paper, we included the analysis of the analog tunable circuits such as CMOS Amplifier pair, Schmitt Trigger circuit and Operational trans-conductance Amplifier. Gain, phase and output response of analog tunable circuits have been illustrated in the paper. These circuit blocks are used for low-noise high-performance integrated circuits for analog and mixed-signal applications. The simulation results are predicted by Cadence Virtuoso Tool in 45nm complementary metal oxide semiconductor (CMOS) Technology.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645558","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514312
P. Patel, U. Singh
One of the challenges in detection of data theft is the difficulty to distinguish copy operation from other type of access operations. Existing work in this area focuses on the stochastic model of filesystem behaviour to identify emergent patterns in MAC timestamps unique to copying. Such an approach produces lot of false positives because of the fact that patterns emerging due to copying are similar to other access operations like searching a file in folder, compressing a folder and scanning a folder by antivirus software. This paper proposes a technique that can be used to distinguish copy operation from other type of operations so that forensic analyst can concentrate on more relevant artefacts. The paper describes fuzzy inference system based technique that gives a confidence value to each cluster generated by stochastic forensic approach. Experimental results have shown that the false positives that are generated by the stochastic forensic approach can be filtered using the cluster confidence of our technique.
{"title":"Detection of data theft using fuzzy inference system","authors":"P. Patel, U. Singh","doi":"10.1109/IADCC.2013.6514312","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514312","url":null,"abstract":"One of the challenges in detection of data theft is the difficulty to distinguish copy operation from other type of access operations. Existing work in this area focuses on the stochastic model of filesystem behaviour to identify emergent patterns in MAC timestamps unique to copying. Such an approach produces lot of false positives because of the fact that patterns emerging due to copying are similar to other access operations like searching a file in folder, compressing a folder and scanning a folder by antivirus software. This paper proposes a technique that can be used to distinguish copy operation from other type of operations so that forensic analyst can concentrate on more relevant artefacts. The paper describes fuzzy inference system based technique that gives a confidence value to each cluster generated by stochastic forensic approach. Experimental results have shown that the false positives that are generated by the stochastic forensic approach can be filtered using the cluster confidence of our technique.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003361","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514332
A. Kumbhar, A. Kulkarni, U. Sutar
In healthcare applications, there is tremendous growth in using the computer assistance for effective and fast diagnostic. There are various modalities such as Magnetic resonance imaging (MRI), computed tomography (CT), digital mammography, and others, to provide an insight of subject's body, noninvasively in order to facilitate diagnostic stakeholders to take decision in diagnosis. Being an important step of imaging systems in diagnostic, MRI imaging has been active area for researchers in computational intelligence and image processing. One of the most important problems in image processing and analysis is segmentation and same is true for biomedical imaging. The main objective of segmentation is separating the pixels associated with different types of tissues like white matter (WM), gray matter (GM) and cerebrospinal fluid (CSF). In this paper, we attempted to optimize the feature set constructed from more than three different types of features. It is well-known fact that, long feature vector representation can be boosting the performance. However, irrelevant feature elements from the long feature vector can become hurdle in convergence of classifier. The optimization feature vector is accomplished using genetic algorithm (GA) with an objective function of maximizing the sum of precision and recall. In addition to the elimination of the feature elements, some elements were also weighted to reduce their effect in the feature matching score. This overall process can also be considered as “fusion of features” for MRI segmentation.
{"title":"Fusion of multiple features in Magnetic resonant image segmentation using genetic algorithm","authors":"A. Kumbhar, A. Kulkarni, U. Sutar","doi":"10.1109/IADCC.2013.6514332","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514332","url":null,"abstract":"In healthcare applications, there is tremendous growth in using the computer assistance for effective and fast diagnostic. There are various modalities such as Magnetic resonance imaging (MRI), computed tomography (CT), digital mammography, and others, to provide an insight of subject's body, noninvasively in order to facilitate diagnostic stakeholders to take decision in diagnosis. Being an important step of imaging systems in diagnostic, MRI imaging has been active area for researchers in computational intelligence and image processing. One of the most important problems in image processing and analysis is segmentation and same is true for biomedical imaging. The main objective of segmentation is separating the pixels associated with different types of tissues like white matter (WM), gray matter (GM) and cerebrospinal fluid (CSF). In this paper, we attempted to optimize the feature set constructed from more than three different types of features. It is well-known fact that, long feature vector representation can be boosting the performance. However, irrelevant feature elements from the long feature vector can become hurdle in convergence of classifier. The optimization feature vector is accomplished using genetic algorithm (GA) with an objective function of maximizing the sum of precision and recall. In addition to the elimination of the feature elements, some elements were also weighted to reduce their effect in the feature matching score. This overall process can also be considered as “fusion of features” for MRI segmentation.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121815090","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514317
N. Dey, B. Nandi, M. Dey, D. Biswas, A. Das, S. S. Chaudhuri
Biometric Authentication System used for verifying identity of a person is getting highly popularized. In today's world when online communication and transactions are a widespread reality, verification of user's identity has become all the more challenging. Biometric Authentication provides a secured and robust system for verification purpose. This paper proposes a cancelable biometric approach called BioHashing. The method uses ECG features and Tokenized Random Number to generate an inner product. The obtained products which are above a previously defined threshold are coded as 1, and the rest 0, thus generating the BioHash Code.
{"title":"BioHash code generation from electrocardiogram features","authors":"N. Dey, B. Nandi, M. Dey, D. Biswas, A. Das, S. S. Chaudhuri","doi":"10.1109/IADCC.2013.6514317","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514317","url":null,"abstract":"Biometric Authentication System used for verifying identity of a person is getting highly popularized. In today's world when online communication and transactions are a widespread reality, verification of user's identity has become all the more challenging. Biometric Authentication provides a secured and robust system for verification purpose. This paper proposes a cancelable biometric approach called BioHashing. The method uses ECG features and Tokenized Random Number to generate an inner product. The obtained products which are above a previously defined threshold are coded as 1, and the rest 0, thus generating the BioHash Code.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088484","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514462
R. K. Yadav, S. Das, R. L. Yadava
This paper presents design and optimization of DGS based Pentagonal and Circular patch antennas suitable for wireless communication systems. The obtained results are impressive due to its improved bandwidth which covers wide frequency range having return loss less than -10 dB. Also found that Pentagonal antennas have better BW compare to Circular antennas.
{"title":"DGS based microstrip patch antennas for UWB systems","authors":"R. K. Yadav, S. Das, R. L. Yadava","doi":"10.1109/IADCC.2013.6514462","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514462","url":null,"abstract":"This paper presents design and optimization of DGS based Pentagonal and Circular patch antennas suitable for wireless communication systems. The obtained results are impressive due to its improved bandwidth which covers wide frequency range having return loss less than -10 dB. Also found that Pentagonal antennas have better BW compare to Circular antennas.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122540253","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514370
S. Jhodge, G. Chiddarwar, G. Shinde
Face recognition technique nowadays is emerging as the most significant and challenging aspects in terms of security for identification of images in various fields viz. banking, police records, biometric etc. other than an individual's thumb and documented identification proofs. Till date for efficient net banking to be initiated, one has to provide the appropriate user name and password for purpose of authentication. This project introduces a vehicle to take a step forward in easy and more reliable authentication of an individual by providing Face Image along with User Name and Password to the system. In this an individual's face is identified by biometric authentication support with which, only a person whose account is, can access it. However while transferring this sensitive data of user image, from client machine to bank server it has to be protected from hackers and intruders from manhandling it, hence it is transferred using covert communication called Wavelet Decomposition based steganography. As face images are affected by different expressions, poses, occlusions, illuminations and aging over a period of time and it differs from the same person than those from different ones is the main difficult task in face recognition. Whenever image information is jointly co-ordinated in three aspects viz. image space, scale and orientation domains they carry much higher clues than seen in each domain individually. In the proposed method combination of Local Binary Pattern (LBP) and Gabor features are used to increase the face recognition performance significantly to compare individual's face presentations. Hence face recognition and representation of Gabor faces are done using E-GV-LBP and CMI-LDA based feature recognition method. Gabor faces uses space, scale and orientation to support accurate face recognition, making net banking easier, authentic, reliable and user friendly.
{"title":"A new SAFR tool for face recognition using EGVLBP-CMI-LDA wrapped with secured DWT based steganography","authors":"S. Jhodge, G. Chiddarwar, G. Shinde","doi":"10.1109/IADCC.2013.6514370","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514370","url":null,"abstract":"Face recognition technique nowadays is emerging as the most significant and challenging aspects in terms of security for identification of images in various fields viz. banking, police records, biometric etc. other than an individual's thumb and documented identification proofs. Till date for efficient net banking to be initiated, one has to provide the appropriate user name and password for purpose of authentication. This project introduces a vehicle to take a step forward in easy and more reliable authentication of an individual by providing Face Image along with User Name and Password to the system. In this an individual's face is identified by biometric authentication support with which, only a person whose account is, can access it. However while transferring this sensitive data of user image, from client machine to bank server it has to be protected from hackers and intruders from manhandling it, hence it is transferred using covert communication called Wavelet Decomposition based steganography. As face images are affected by different expressions, poses, occlusions, illuminations and aging over a period of time and it differs from the same person than those from different ones is the main difficult task in face recognition. Whenever image information is jointly co-ordinated in three aspects viz. image space, scale and orientation domains they carry much higher clues than seen in each domain individually. In the proposed method combination of Local Binary Pattern (LBP) and Gabor features are used to increase the face recognition performance significantly to compare individual's face presentations. Hence face recognition and representation of Gabor faces are done using E-GV-LBP and CMI-LDA based feature recognition method. Gabor faces uses space, scale and orientation to support accurate face recognition, making net banking easier, authentic, reliable and user friendly.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039799","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514421
M. Potey, Dhanashri A. Patel, P. K. Sinha
Query log is the pouch of valuable information that records user's search queries and related actions on the internet. By mining the recorded information, it is possible to exploit the user's underlying goals, preferences, interests, search behaviors and implicit feedback. The wealth of mined information can be used in many applications such as query log analysis, query recommendation, query reformulation, query intent identification and many more to improve performance of search engine by providing more relevant results. Over the past decade, there has been tremendous work done for improving search engine results to flourish the users for searching. This paper reviews and compares some of the available methods to give an insight into the area of query log processing for information retrieval. Our approach classifies web query intent based on knowledge extraction from query log analysis.
{"title":"A survey of query log processing techniques and evaluation of web query intent identification","authors":"M. Potey, Dhanashri A. Patel, P. K. Sinha","doi":"10.1109/IADCC.2013.6514421","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514421","url":null,"abstract":"Query log is the pouch of valuable information that records user's search queries and related actions on the internet. By mining the recorded information, it is possible to exploit the user's underlying goals, preferences, interests, search behaviors and implicit feedback. The wealth of mined information can be used in many applications such as query log analysis, query recommendation, query reformulation, query intent identification and many more to improve performance of search engine by providing more relevant results. Over the past decade, there has been tremendous work done for improving search engine results to flourish the users for searching. This paper reviews and compares some of the available methods to give an insight into the area of query log processing for information retrieval. Our approach classifies web query intent based on knowledge extraction from query log analysis.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126864188","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514218
Komal Barhate, C. Jaidhar
In today's technology, new attacks are emerging day by day which makes the systems insecure even the system wrapped with number of security measures. Intrusion Detection System (IDS) is used to detect the intrusion. Its prime function is to detect the intrusion and respond in timely manner. In other words, IDS function is limited to detection as well as response. The IDS is unable to capture the state of the system when an intrusion is detected. Hence, it fails to preserve the evidences against the attack in original form. To maintain the completeness and reliability of evidence for later examination, new security strategy is very much needed. In this research work, automated Digital Forensic Technique with Intrusion Detection System is proposed. Once an IDS detects an intrusion, it sends an alert message to administrator followed by invoke the digital forensic tool to capture the state of the system. Captured image can be used as evidence in the court of law to prove the damage.
{"title":"Automated digital forensic technique with intrusion detection systems","authors":"Komal Barhate, C. Jaidhar","doi":"10.1109/IADCC.2013.6514218","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514218","url":null,"abstract":"In today's technology, new attacks are emerging day by day which makes the systems insecure even the system wrapped with number of security measures. Intrusion Detection System (IDS) is used to detect the intrusion. Its prime function is to detect the intrusion and respond in timely manner. In other words, IDS function is limited to detection as well as response. The IDS is unable to capture the state of the system when an intrusion is detected. Hence, it fails to preserve the evidences against the attack in original form. To maintain the completeness and reliability of evidence for later examination, new security strategy is very much needed. In this research work, automated Digital Forensic Technique with Intrusion Detection System is proposed. Once an IDS detects an intrusion, it sends an alert message to administrator followed by invoke the digital forensic tool to capture the state of the system. Captured image can be used as evidence in the court of law to prove the damage.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130206803","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514300
S. Dash, S. Dehuri, S. Rayaguru
In this paper, a parallel genetic based association rule mining method is proposed to discover interesting rules from a large biological database. Apriori algorithms and its variants for association rule mining rely on two user specified threshold parameters such as minimum support and minimum confidence which is obviously an issue to be resolved. In addition, there are other issues like large search space and local optimality attracts many researchers to use heuristic mechanism. In the presence of large biological databases and with an aim to circumvent these problems, genetic algorithm may be taken as a suitable tool, but its computational cost is the main bottle-neck. Therefore, we choose parallel genetic algorithms to get relief from the pain of computational cost. The experimental result is promising and encouraging to do further research especially in the domain of biological science.
{"title":"Discovering interesting rules from biological data using parallel genetic algorithm","authors":"S. Dash, S. Dehuri, S. Rayaguru","doi":"10.1109/IADCC.2013.6514300","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514300","url":null,"abstract":"In this paper, a parallel genetic based association rule mining method is proposed to discover interesting rules from a large biological database. Apriori algorithms and its variants for association rule mining rely on two user specified threshold parameters such as minimum support and minimum confidence which is obviously an issue to be resolved. In addition, there are other issues like large search space and local optimality attracts many researchers to use heuristic mechanism. In the presence of large biological databases and with an aim to circumvent these problems, genetic algorithm may be taken as a suitable tool, but its computational cost is the main bottle-neck. Therefore, we choose parallel genetic algorithms to get relief from the pain of computational cost. The experimental result is promising and encouraging to do further research especially in the domain of biological science.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133475894","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514245
V. Pal, G. Singh, R. Yadav
Energy efficiency is main design issue for protocols of wireless sensor networks. Node clustering is an energy efficient approach for sensor networks. In clustering algorithms, nodes are grouped into independent clusters and each cluster has a cluster head. Data units gathered at base station depends upon lifetime of network. Cluster head selection is an important issue for energy efficiency of clustering schemes. Intra cluster communication distance depends upon position of cluster head in cluster. In this paper, a new cluster head selection scheme is proposed. Proposed scheme can be implemented with any distributed clustering scheme. In proposed scheme, network area is divided into two parts: border area and inner area. Scheme restricts cluster head selection to only inner area nodes. Scheme is implemented and simulated with LEACH in NS-2. Simulation shows that proposed scheme significantly outperform LEACH for network lifetime and data gathering rate.
{"title":"Cluster head selection scheme for data centric wireless sensor networks","authors":"V. Pal, G. Singh, R. Yadav","doi":"10.1109/IADCC.2013.6514245","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514245","url":null,"abstract":"Energy efficiency is main design issue for protocols of wireless sensor networks. Node clustering is an energy efficient approach for sensor networks. In clustering algorithms, nodes are grouped into independent clusters and each cluster has a cluster head. Data units gathered at base station depends upon lifetime of network. Cluster head selection is an important issue for energy efficiency of clustering schemes. Intra cluster communication distance depends upon position of cluster head in cluster. In this paper, a new cluster head selection scheme is proposed. Proposed scheme can be implemented with any distributed clustering scheme. In proposed scheme, network area is divided into two parts: border area and inner area. Scheme restricts cluster head selection to only inner area nodes. Scheme is implemented and simulated with LEACH in NS-2. Simulation shows that proposed scheme significantly outperform LEACH for network lifetime and data gathering rate.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123978514","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
扫码关注我们
求助内容：
应助结果提醒方式：