Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141442
Anil Yadav, Raghuraj Singh, A. K. Singh
Mobile Ad Hoc Networks (MANET) are wireless mobile nodes that cooperatively form a network without infrastructure. Because there is no coordination or configuration prior to setup of a MANET, there are several challenges. These challenges include routing packets in an environment where the topology is changing frequently, wireless communications issues, and resource issues such as limited power and storage. Wireless ad hoc network enable new and exciting applications, such as decision making in the battlefield, emergency, search-and-rescue operations, but also pose significant technical challenges. Topology control problems are concerned with which node is able/allowed to communicate with which other nodes. Topology control needs to maintain invariants, e.g., connectivity. This paper considers such problems via minimizing the maximum power and minimizing the total power. In this paper we give a brief overview of topology (arrangement of devices) control problem in wireless ad hoc networks, up to some extent.
{"title":"A novel approach for energy management in wireless Ad Hoc Network by topology control","authors":"Anil Yadav, Raghuraj Singh, A. K. Singh","doi":"10.1109/WICT.2011.6141442","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141442","url":null,"abstract":"Mobile Ad Hoc Networks (MANET) are wireless mobile nodes that cooperatively form a network without infrastructure. Because there is no coordination or configuration prior to setup of a MANET, there are several challenges. These challenges include routing packets in an environment where the topology is changing frequently, wireless communications issues, and resource issues such as limited power and storage. Wireless ad hoc network enable new and exciting applications, such as decision making in the battlefield, emergency, search-and-rescue operations, but also pose significant technical challenges. Topology control problems are concerned with which node is able/allowed to communicate with which other nodes. Topology control needs to maintain invariants, e.g., connectivity. This paper considers such problems via minimizing the maximum power and minimizing the total power. In this paper we give a brief overview of topology (arrangement of devices) control problem in wireless ad hoc networks, up to some extent.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130893816","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-12-01DOI: 10.1109/WICT.2011.6141353
Gagandeep Kaur
In this paper a second order multi-mode allpass filter is proposed. The main feature of this configuration is that, it can be used in current mode (CM), voltage mode (VM), transimpedance mode (TIM) and transadmittance mode (TAM) without changing the configuration. This filter uses a single current differencing buffered amplifier (CDBA) and a total of five/six passive components. The validity of the proposed filter is verified through PSPICE simulations and results are in good agreement with theoretical one.
{"title":"Second order multi-mode allpass filter using single current differencing buffered amplifier","authors":"Gagandeep Kaur","doi":"10.1109/WICT.2011.6141353","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141353","url":null,"abstract":"In this paper a second order multi-mode allpass filter is proposed. The main feature of this configuration is that, it can be used in current mode (CM), voltage mode (VM), transimpedance mode (TIM) and transadmittance mode (TAM) without changing the configuration. This filter uses a single current differencing buffered amplifier (CDBA) and a total of five/six passive components. The validity of the proposed filter is verified through PSPICE simulations and results are in good agreement with theoretical one.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130952154","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-12-01DOI: 10.1109/WICT.2011.6141275
S. Roomi, D. Kalaiyarasi, N.Kasturi Rangan
Synthetic aperture radar (SAR) images are inherently affected by multiplicative speckle noise, which is due to the coherent nature of scattering phenomena. To preserve the sharp features and details of the SAR image effectively when despeckling, a new method of speckle reduction in wavelet domain has been presented. In this proposed method ‘symlet’ wavelet is used for despeckling process. This proposed algorithm uses new improved thresholding and polynomial soft thresholding function to threshold the non-edge component present in the corrupted image. The proposed work has been simulated using Matlab 7.0 and the experimental results demonstrate that the new method shows better result compared with various other despeckling techniques.
{"title":"Discrete wavelet transform based despeckling for SAR images","authors":"S. Roomi, D. Kalaiyarasi, N.Kasturi Rangan","doi":"10.1109/WICT.2011.6141275","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141275","url":null,"abstract":"Synthetic aperture radar (SAR) images are inherently affected by multiplicative speckle noise, which is due to the coherent nature of scattering phenomena. To preserve the sharp features and details of the SAR image effectively when despeckling, a new method of speckle reduction in wavelet domain has been presented. In this proposed method ‘symlet’ wavelet is used for despeckling process. This proposed algorithm uses new improved thresholding and polynomial soft thresholding function to threshold the non-edge component present in the corrupted image. The proposed work has been simulated using Matlab 7.0 and the experimental results demonstrate that the new method shows better result compared with various other despeckling techniques.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127913887","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-12-01DOI: 10.1109/WICT.2011.6141339
Sneha Rathor, D. Acharya, Srihari Gude, P. Mishra
An attempt is made to examine the effective application of artificial bee colony algorithm to optimize the parameters in load frequency control (LFC) of a two area interconnected thermal system. The proportional gains (Kp) and integral gains (Ki) have been optimized to ensure best performance of the system, minimizing the tie-line deviation and frequency deviations of both the areas. The settling time of the deviations have also been considered and the solution that gives best possible settling times for best possible fitness value has been accepted.
{"title":"Application of artificial bee colony optimization for load frequency control","authors":"Sneha Rathor, D. Acharya, Srihari Gude, P. Mishra","doi":"10.1109/WICT.2011.6141339","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141339","url":null,"abstract":"An attempt is made to examine the effective application of artificial bee colony algorithm to optimize the parameters in load frequency control (LFC) of a two area interconnected thermal system. The proportional gains (Kp) and integral gains (Ki) have been optimized to ensure best performance of the system, minimizing the tie-line deviation and frequency deviations of both the areas. The settling time of the deviations have also been considered and the solution that gives best possible settling times for best possible fitness value has been accepted.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125597792","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-12-01DOI: 10.1109/WICT.2011.6141286
Shaik Sahil Babu, Arnab Raha, M. K. Naskar
The Wireless Sensor Network (WSN) nodes are high-volume in number, and their deployment environment may be hazardous, unattended and/or hostile and sometimes dangerous. The traditional cryptographic and security mechanisms in WSNs cannot detect the node physical capture, and due to the malicious or selfish nodes even total breakdown of network may take place. Also, the traditional security mechanisms in WSNs requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth at node. Hence, they are not sufficient for secure routing of message from source to destination in WSNs. Alternatively, trust management schemes consist a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). In this paper, we propose a new geometric mean based trust management system by evaluating direct trust from the QoS characteristics (trust metrics) and indirect trust from recommendations by neighbour nodes, which allows for trusted nodes only to participate in routing.
{"title":"Geometric mean based trust management system for WSNs (GMTMS)","authors":"Shaik Sahil Babu, Arnab Raha, M. K. Naskar","doi":"10.1109/WICT.2011.6141286","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141286","url":null,"abstract":"The Wireless Sensor Network (WSN) nodes are high-volume in number, and their deployment environment may be hazardous, unattended and/or hostile and sometimes dangerous. The traditional cryptographic and security mechanisms in WSNs cannot detect the node physical capture, and due to the malicious or selfish nodes even total breakdown of network may take place. Also, the traditional security mechanisms in WSNs requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth at node. Hence, they are not sufficient for secure routing of message from source to destination in WSNs. Alternatively, trust management schemes consist a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). In this paper, we propose a new geometric mean based trust management system by evaluating direct trust from the QoS characteristics (trust metrics) and indirect trust from recommendations by neighbour nodes, which allows for trusted nodes only to participate in routing.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126214002","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-12-01DOI: 10.1109/WICT.2011.6141299
A.V. Pradeep Kumar, C. Prashanth, G. Kavitha
This paper proposes a method to segment the exudates and lesions in retinal fundus images and classify using selective brightness feature. The exudates are segmented from background and their size is also measured. The segmentation is done by extraction of pixels which fall in the color range of the spots. The essential features inferred from the segmented image include the count of the exudates, maximum size, percentage affected, color intensity of the spot, average size and the area affected by haemorrhages. The diagnosis is supported by error-boost feature selection technique. This technique classifies the retinal images as normal or abnormal based on the features obtained from the segmented image. The abnormal images are further classified as mild, moderate or severe and there is an additional classification based on non-proliferative and severe proliferative diabetic retinopathy. The diagnosis parameter ranges for each feature are set prior to the severity classification. The error boost feature selection algorithm selects the key features which classifies the retinopathy more accurately. The obtained results seem to be clinically relevant.
{"title":"Segmentation and grading of diabetic retinopathic exudates using error-boost feature selection method","authors":"A.V. Pradeep Kumar, C. Prashanth, G. Kavitha","doi":"10.1109/WICT.2011.6141299","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141299","url":null,"abstract":"This paper proposes a method to segment the exudates and lesions in retinal fundus images and classify using selective brightness feature. The exudates are segmented from background and their size is also measured. The segmentation is done by extraction of pixels which fall in the color range of the spots. The essential features inferred from the segmented image include the count of the exudates, maximum size, percentage affected, color intensity of the spot, average size and the area affected by haemorrhages. The diagnosis is supported by error-boost feature selection technique. This technique classifies the retinal images as normal or abnormal based on the features obtained from the segmented image. The abnormal images are further classified as mild, moderate or severe and there is an additional classification based on non-proliferative and severe proliferative diabetic retinopathy. The diagnosis parameter ranges for each feature are set prior to the severity classification. The error boost feature selection algorithm selects the key features which classifies the retinopathy more accurately. The obtained results seem to be clinically relevant.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122291325","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-12-01DOI: 10.1109/WICT.2011.6141388
Sudhakar Putheti, S. Edara, Sai Alekya Edara
The aim of this paper is to increase the success rate of CBIR system with low computational complexity. The success rate of CBIR system depends on localization of the image to be retrieved. This can be achieved by using textons of R, G, B planes of the image which describes the shape. This paper proposes 3 × 3 grids to extract the textons with low computational complexity. The proposed method is based on the texels (low level features) of textons extracted from R,G,B channels of an image as chromatic changes also give shape information. The proposed method is tested on Corel database with more than 1000 natural images. The results demonstrate that it is more efficient than texton co-occurrence matrix, texton multi histogram methods. It has good discrimination power of color, texture and shape features when compared to that of TCM and TMH methods.
{"title":"CBIR using texels of RGB colour textons","authors":"Sudhakar Putheti, S. Edara, Sai Alekya Edara","doi":"10.1109/WICT.2011.6141388","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141388","url":null,"abstract":"The aim of this paper is to increase the success rate of CBIR system with low computational complexity. The success rate of CBIR system depends on localization of the image to be retrieved. This can be achieved by using textons of R, G, B planes of the image which describes the shape. This paper proposes 3 × 3 grids to extract the textons with low computational complexity. The proposed method is based on the texels (low level features) of textons extracted from R,G,B channels of an image as chromatic changes also give shape information. The proposed method is tested on Corel database with more than 1000 natural images. The results demonstrate that it is more efficient than texton co-occurrence matrix, texton multi histogram methods. It has good discrimination power of color, texture and shape features when compared to that of TCM and TMH methods.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"40 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120910627","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-12-01DOI: 10.1109/WICT.2011.6141309
Poulami Das, A. Chandra
The present wireless networks aim to make anywhere and anytime communication possible. The operations which allow networks to achieve this goal have drawn tremendous attention over the recent past. Location management (LM) is one such operation that aims to determine the exact location of mobile devices. LM facilitates the searching or paging process that is performed during the downlink channel acquisition. Various strategies for LM have been proposed so far with each having their own merits and demerits. Specifically, the cost incurred for LM may be traded off against two major design parameters, namely computational overhead and implementation complexity. Before adopting a scheme for future generation wireless standards, these performance metrics needs to be thoroughly compared. We begin with a description of the wireless architecture that is required for understanding basics of LM. Next, variants of the two primary components of LM, location update (LU) and paging, are surveyed.
{"title":"Location management in wireless networks: A survey","authors":"Poulami Das, A. Chandra","doi":"10.1109/WICT.2011.6141309","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141309","url":null,"abstract":"The present wireless networks aim to make anywhere and anytime communication possible. The operations which allow networks to achieve this goal have drawn tremendous attention over the recent past. Location management (LM) is one such operation that aims to determine the exact location of mobile devices. LM facilitates the searching or paging process that is performed during the downlink channel acquisition. Various strategies for LM have been proposed so far with each having their own merits and demerits. Specifically, the cost incurred for LM may be traded off against two major design parameters, namely computational overhead and implementation complexity. Before adopting a scheme for future generation wireless standards, these performance metrics needs to be thoroughly compared. We begin with a description of the wireless architecture that is required for understanding basics of LM. Next, variants of the two primary components of LM, location update (LU) and paging, are surveyed.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121867059","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-12-01DOI: 10.1109/WICT.2011.6141347
M. Paul, G. Sanyal
Cloud technologies promise to change the way organizations tackle complex computational problems. Here millions of user share cloud resources by submitting their computing task to the cloud system. So Scheduling these millions of task is a challenge to cloud computing environment. In this paper we have proposed a methodology by using assignment to assign these jobs to the suitable resources so as to minimize the whole completion time. The cost matrix is generated by using credit of a task to be assigned to a particular resource. The task having more credit carries more chance to assign to the best fitted resource. The proposed method has been established in homogeneous cloud environment.
{"title":"Survey and analysis of optimal scheduling strategies in cloud environment","authors":"M. Paul, G. Sanyal","doi":"10.1109/WICT.2011.6141347","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141347","url":null,"abstract":"Cloud technologies promise to change the way organizations tackle complex computational problems. Here millions of user share cloud resources by submitting their computing task to the cloud system. So Scheduling these millions of task is a challenge to cloud computing environment. In this paper we have proposed a methodology by using assignment to assign these jobs to the suitable resources so as to minimize the whole completion time. The cost matrix is generated by using credit of a task to be assigned to a particular resource. The task having more credit carries more chance to assign to the best fitted resource. The proposed method has been established in homogeneous cloud environment.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127796719","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-12-01DOI: 10.1109/WICT.2011.6141227
D. Sukheja, U. Singh
Database systems have been essential for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in small projects. At the other hand, database management systems tend to be static in terms of size and performance, which makes scaling a difficult and expensive task. Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distributed across different servers for better performance. In this paper, we focus on complex queries whose evaluation tends to be time-consuming and design the secured share nothing clustering architecture to improve the performance of application and also assure to the user to availability of the data. The proposed architecture is very helpful towards a two phase query optimizer. In the first phase, the synchroniz and decomposes a query into subqueries and transfer them to appropriate cluster nodes. In the second phase, each cluster node optimizes and evaluates its subquery locally
{"title":"Design of shared-nothing cluster architecture for fast accessing and highly availability of data in heterogeneous database environment","authors":"D. Sukheja, U. Singh","doi":"10.1109/WICT.2011.6141227","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141227","url":null,"abstract":"Database systems have been essential for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in small projects. At the other hand, database management systems tend to be static in terms of size and performance, which makes scaling a difficult and expensive task. Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distributed across different servers for better performance. In this paper, we focus on complex queries whose evaluation tends to be time-consuming and design the secured share nothing clustering architecture to improve the performance of application and also assure to the user to availability of the data. The proposed architecture is very helpful towards a two phase query optimizer. In the first phase, the synchroniz and decomposes a query into subqueries and transfer them to appropriate cluster nodes. In the second phase, each cluster node optimizes and evaluates its subquery locally","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134191809","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
扫码关注我们
求助内容：
应助结果提醒方式：