Pub Date : 2012-12-01DOI: 10.1109/ICOAC.2012.6416830
R. Surendran, B. Varthini
Dynamic Grid computing is a process of Share the grid balanced resources and services in a large-scale worldwide distributed Environment with fault free run time application. Resource management technique (RMT) jointly works with grid broker for an elastic grid computing. Broker that acts as a middle man to the stock exchange and place trade on behalf of clients. Special care must be taken when using broker in shopping application. Broker based Resource Management (BRM) have a lot of intelligent techniques like Request Deployment, Job Handle, Grid Resource Discovery, Match making, Optimization, Job Migration, Job scheduling, Middleware supports, Meta brokers, Resource brokers, Dispatcher. In BRM, Broker keeps track of information about all the Resource in its resource pool, including their availability, load, network accessibility, usage models, capabilities, and pricing information and the range of computational tasks that they can perform. The resource broker provides pairing services between the service requester (Buyer) and the service provider (supplier). The resource broker selects the best scheduler for the resource execution job, and collaborates with the scheduler to execute the multi tasks. Agents are only responsible for the timely and accurate processing of forms. Its works for some limited agency certified based company that is Agents are working for some particular service provider's company only. But broker work for all companies (all service providers). From the broker's service, all types of services requester (variety of different purchaser) is benefited. Example: Product requester detects the all brands of the particular products details displayed through broker, but agent display only agencies certified company's product details only. Broker is an agent that heads the whole hierarchy, maintaining all service information of the system. Consumers are searching the products from their related Image or text or video through broker based on linear programming solution. Benefits of this shopping system are save the price and get a quality product through broker's suggestion based shopping and location via product ranking based shopping.
{"title":"Integration based large scale broker's resource management on friendly shopping application in Dynamic Grid computing","authors":"R. Surendran, B. Varthini","doi":"10.1109/ICOAC.2012.6416830","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416830","url":null,"abstract":"Dynamic Grid computing is a process of Share the grid balanced resources and services in a large-scale worldwide distributed Environment with fault free run time application. Resource management technique (RMT) jointly works with grid broker for an elastic grid computing. Broker that acts as a middle man to the stock exchange and place trade on behalf of clients. Special care must be taken when using broker in shopping application. Broker based Resource Management (BRM) have a lot of intelligent techniques like Request Deployment, Job Handle, Grid Resource Discovery, Match making, Optimization, Job Migration, Job scheduling, Middleware supports, Meta brokers, Resource brokers, Dispatcher. In BRM, Broker keeps track of information about all the Resource in its resource pool, including their availability, load, network accessibility, usage models, capabilities, and pricing information and the range of computational tasks that they can perform. The resource broker provides pairing services between the service requester (Buyer) and the service provider (supplier). The resource broker selects the best scheduler for the resource execution job, and collaborates with the scheduler to execute the multi tasks. Agents are only responsible for the timely and accurate processing of forms. Its works for some limited agency certified based company that is Agents are working for some particular service provider's company only. But broker work for all companies (all service providers). From the broker's service, all types of services requester (variety of different purchaser) is benefited. Example: Product requester detects the all brands of the particular products details displayed through broker, but agent display only agencies certified company's product details only. Broker is an agent that heads the whole hierarchy, maintaining all service information of the system. Consumers are searching the products from their related Image or text or video through broker based on linear programming solution. Benefits of this shopping system are save the price and get a quality product through broker's suggestion based shopping and location via product ranking based shopping.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828214","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416860
L. Bhagyalakshmi, S. Suman, K. Murugan
In a Wireless sensor network, the energy hole problem is a severe issue that forces the nodes near the sink to exhaust their energy sooner than the nodes deployed in the outer region, resulting the reduced the network lifetime. To overcome this problem, a novel clustering scheme with load balancing is proposed for a corona model network, where the coronas are divided into sector and form homogenous clusters. In the homogenous cluster, some nodes inside the circular centroid region (CR) forms cluster head (CH) to control network operation. It is important that the Load handled by the cluster heads are to be balanced by means of mixed routing strategy together with data aggregation. It is seen that this technique balances the energy in the network. The simulation result shows that this technique out performs other clustering scheme in terms of network lifetime and energy dissipation.
{"title":"Corona based clustering with mixed routing and data aggregation to avoid energy hole problem in wireless sensor network","authors":"L. Bhagyalakshmi, S. Suman, K. Murugan","doi":"10.1109/ICOAC.2012.6416860","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416860","url":null,"abstract":"In a Wireless sensor network, the energy hole problem is a severe issue that forces the nodes near the sink to exhaust their energy sooner than the nodes deployed in the outer region, resulting the reduced the network lifetime. To overcome this problem, a novel clustering scheme with load balancing is proposed for a corona model network, where the coronas are divided into sector and form homogenous clusters. In the homogenous cluster, some nodes inside the circular centroid region (CR) forms cluster head (CH) to control network operation. It is important that the Load handled by the cluster heads are to be balanced by means of mixed routing strategy together with data aggregation. It is seen that this technique balances the energy in the network. The simulation result shows that this technique out performs other clustering scheme in terms of network lifetime and energy dissipation.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126061291","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416800
G. Vinothkumar, G. Ramya, A. Rengarajan
In wireless sensor network one of the most security threat is the reactive jammer because of the mass destruction to the sensor communication and it is difficult to disclose. So we have to deactivate the reactive jammers by identifying all the trigger nodes, because the transmission invokes the jammer. Such a trigger identification procedure can work as an application-layer service and benefit many existing reactive jamming defending schemes. In this paper, on the one hand, we leverage several optimization problems to provide a complete trigger-identification service framework for unreliable wireless sensor networks. On the other hand, we provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios. theoretical analysis and simulation results are included to validate the performance of this framework.
{"title":"Lightweight decentralized algorithm for localizing reactive jammers in wireless sensor network","authors":"G. Vinothkumar, G. Ramya, A. Rengarajan","doi":"10.1109/ICOAC.2012.6416800","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416800","url":null,"abstract":"In wireless sensor network one of the most security threat is the reactive jammer because of the mass destruction to the sensor communication and it is difficult to disclose. So we have to deactivate the reactive jammers by identifying all the trigger nodes, because the transmission invokes the jammer. Such a trigger identification procedure can work as an application-layer service and benefit many existing reactive jamming defending schemes. In this paper, on the one hand, we leverage several optimization problems to provide a complete trigger-identification service framework for unreliable wireless sensor networks. On the other hand, we provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios. theoretical analysis and simulation results are included to validate the performance of this framework.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127156873","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416841
S. Padmavathi, P. Rajeshwari, P. Pradheeba, R. Mythili
Caching has become the key technology used for bridging the performance gap across memory hierarchies via temporal or spatial localities; in particular, the effect is prominent in disk storage systems. Applications that involve heavy I/O activities, which are common in the cloud, probably benefit the most from caching. The use of local volatile memory as cache might be a natural alternative, but many well-known restrictions, such as capacity and the utilization of host machines, hinder its effective use. We present the cache as a service (CaaS) model as an optional service to typical infrastructure service offerings. Specifically, the cloud provider sets aside a large pool of memory that can be dynamically partitioned and allocated to standard infrastructure services as disk cache. We first investigate the feasibility of providing CaaS with the proof-of-concept elastic cache system (using dedicated remote memory servers) built and validated on the actual system, and practical benefits of CaaS for both users and providers (i.e., performance and profit, respectively) are thoroughly studied with a novel pricing scheme. Our CaaS model helps to leverage the cloud economy greatly in that 1) the extra user cost for I/O performance gain is minimal if ever exists, and 2) the provider's profit increases due to improvements in server consolidation resulting from that performance gain. Through extensive experiments with eight resource allocation strategies, we show that our CaaS model can be a promising cost-efficient solution for both users and providers.
{"title":"Achieving cost efficiency using CaaS model in the cloud","authors":"S. Padmavathi, P. Rajeshwari, P. Pradheeba, R. Mythili","doi":"10.1109/ICOAC.2012.6416841","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416841","url":null,"abstract":"Caching has become the key technology used for bridging the performance gap across memory hierarchies via temporal or spatial localities; in particular, the effect is prominent in disk storage systems. Applications that involve heavy I/O activities, which are common in the cloud, probably benefit the most from caching. The use of local volatile memory as cache might be a natural alternative, but many well-known restrictions, such as capacity and the utilization of host machines, hinder its effective use. We present the cache as a service (CaaS) model as an optional service to typical infrastructure service offerings. Specifically, the cloud provider sets aside a large pool of memory that can be dynamically partitioned and allocated to standard infrastructure services as disk cache. We first investigate the feasibility of providing CaaS with the proof-of-concept elastic cache system (using dedicated remote memory servers) built and validated on the actual system, and practical benefits of CaaS for both users and providers (i.e., performance and profit, respectively) are thoroughly studied with a novel pricing scheme. Our CaaS model helps to leverage the cloud economy greatly in that 1) the extra user cost for I/O performance gain is minimal if ever exists, and 2) the provider's profit increases due to improvements in server consolidation resulting from that performance gain. Through extensive experiments with eight resource allocation strategies, we show that our CaaS model can be a promising cost-efficient solution for both users and providers.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128015732","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416797
V. Saravanan, A. Sumathi
In wireless network, mobile nodes frequently perform layer 2 and layer 3 handoffs. The handoff may occur due to many factors like signal strength, load balancing, number of connections and frequencies engaged...etc. This frequent handoff may disturb the services of real-time applications such as voice over IP. Normally few milliseconds of interrupt will happen during the handoff process. This delay should be minimized for smooth performance. Information exchange between mobile nodes and network monitoring has to be done to achieve seamless layer 2 and layer 3 handoff. Increasing in packet loss rates and heavy traffic will initiate incorrect handoff. We propose a method for avoiding unbeneficial handoffs and to eliminate unwanted traffic.
{"title":"Dynamic handoff decision based on current traffic level and neighbor information in wireless data networks","authors":"V. Saravanan, A. Sumathi","doi":"10.1109/ICOAC.2012.6416797","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416797","url":null,"abstract":"In wireless network, mobile nodes frequently perform layer 2 and layer 3 handoffs. The handoff may occur due to many factors like signal strength, load balancing, number of connections and frequencies engaged...etc. This frequent handoff may disturb the services of real-time applications such as voice over IP. Normally few milliseconds of interrupt will happen during the handoff process. This delay should be minimized for smooth performance. Information exchange between mobile nodes and network monitoring has to be done to achieve seamless layer 2 and layer 3 handoff. Increasing in packet loss rates and heavy traffic will initiate incorrect handoff. We propose a method for avoiding unbeneficial handoffs and to eliminate unwanted traffic.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134159190","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416827
K. Sangeetha, R. Priyadharsini, A. Anbuelaveni, R. Sivaranjani
Wireless Mesh network plays a significant role in enhancement of various techniques in wireless communication. The primary goal of wireless mesh networking is to achieve high system throughput. As the topology of the network is unpredictable in a wireless medium due to its mobile nature and hence the routing with high throughput becomes more difficult. Interference is the major cause for performance degradation of any wireless network. In this paper, we provide an comparative study based on the unique features of different interference aware routing metrics and a survey about how interference level is estimated using those metrics.
{"title":"Comparative study on different interference aware routing metrics in WMN: A survey","authors":"K. Sangeetha, R. Priyadharsini, A. Anbuelaveni, R. Sivaranjani","doi":"10.1109/ICOAC.2012.6416827","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416827","url":null,"abstract":"Wireless Mesh network plays a significant role in enhancement of various techniques in wireless communication. The primary goal of wireless mesh networking is to achieve high system throughput. As the topology of the network is unpredictable in a wireless medium due to its mobile nature and hence the routing with high throughput becomes more difficult. Interference is the major cause for performance degradation of any wireless network. In this paper, we provide an comparative study based on the unique features of different interference aware routing metrics and a survey about how interference level is estimated using those metrics.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611710","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416799
R. Murugesh
The main objective of this system is to make ATM transactions as secure as possible. This system replaces the conventional ATM card with Fingerprint. Therefore, users don't have to carry a plastic card to withdraw money. The Fingerprint and the phone number of all users are stored in the system database during Registration. Fingerprints are used to identify a Person's genuinity. A Fingerprint scanner is used to get the fingerprint of the user, after which the system requests for the PIN (Personal Identification Number). Once the user enters the PIN, the user is prompted to enter the OTP (One Time Password) which is a 4-digit random password sent by the server to the user's registered mobile number. On cross verification with the data stored in the system database, the user is allowed to make a transaction. The underlying mechanism involves combining the concepts of Cryptography and Steganography. The PIN and OTP are encrypted using AES 256. Then the encrypted data is steganographed with the fingerprint image which acts as the BASE image. The Steganographed image is sent to the server, where it is de-steganographed and verified with the data available in the system database.
{"title":"Advanced biometric ATM machine with AES 256 and steganography implementation","authors":"R. Murugesh","doi":"10.1109/ICOAC.2012.6416799","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416799","url":null,"abstract":"The main objective of this system is to make ATM transactions as secure as possible. This system replaces the conventional ATM card with Fingerprint. Therefore, users don't have to carry a plastic card to withdraw money. The Fingerprint and the phone number of all users are stored in the system database during Registration. Fingerprints are used to identify a Person's genuinity. A Fingerprint scanner is used to get the fingerprint of the user, after which the system requests for the PIN (Personal Identification Number). Once the user enters the PIN, the user is prompted to enter the OTP (One Time Password) which is a 4-digit random password sent by the server to the user's registered mobile number. On cross verification with the data stored in the system database, the user is allowed to make a transaction. The underlying mechanism involves combining the concepts of Cryptography and Steganography. The PIN and OTP are encrypted using AES 256. Then the encrypted data is steganographed with the fingerprint image which acts as the BASE image. The Steganographed image is sent to the server, where it is de-steganographed and verified with the data available in the system database.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115176259","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416856
S. Verma, A. Singh
Podslurping is the intentional or unintentional use of a portable USB mass storage device, such as a USB flash drive (or “thumb drive”), to illicitly download and store confidential and proprietary data from network endpoint [1]. There are many establishments and organization that are unaware of, or choose to remain ignorant about the threat that can be caused by portable devices in their network setting until some events that can be from a minor unfortunate incident to a complete catastrophe. In the information age, cybercrime and information leakage increase, because endpoints are an easy target [2]. The key to managing portable devices in business environment is to give administrator direct control over what devices are in use on your network. In this paper we present the implementation of access and identity management for endpoint protection and data security from USB devices to maintain information security and data theft prevention in a corporate environment.
{"title":"Data theft prevention & endpoint protection from unauthorized USB devices — Implementation","authors":"S. Verma, A. Singh","doi":"10.1109/ICOAC.2012.6416856","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416856","url":null,"abstract":"Podslurping is the intentional or unintentional use of a portable USB mass storage device, such as a USB flash drive (or “thumb drive”), to illicitly download and store confidential and proprietary data from network endpoint [1]. There are many establishments and organization that are unaware of, or choose to remain ignorant about the threat that can be caused by portable devices in their network setting until some events that can be from a minor unfortunate incident to a complete catastrophe. In the information age, cybercrime and information leakage increase, because endpoints are an easy target [2]. The key to managing portable devices in business environment is to give administrator direct control over what devices are in use on your network. In this paper we present the implementation of access and identity management for endpoint protection and data security from USB devices to maintain information security and data theft prevention in a corporate environment.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"630 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116180948","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416858
V. Nithya, B. Ramachandran, V. Bhaskar
This paper addresses the performance analysis of Zigbee transceiver using IEEE 802.15.4 standard under 2.4 GHz frequency band in terms of Energy and Error over various fading channel conditions. Energy is a critical aspect in Wireless Sensor Network (WSN) for improved network lifetime. The multipath nature of the wireless sensor network channel imposes adverse effect on the received signal characteristics. These unreliable links increases the error level to a greater extent and hence, degrades battery life. In this paper, we investigate the energy efficiency of a Zigbee transceiver using Direct Sequence Spread Spectrum- Offset Quadrature Phase Shift Keying (DSSS-OQPSK) modulation under 2.4 GHz frequency band in a WSN. The Symbol Error Rate (SER) is computed for a Zigbee transceiver, and an expression for energy efficiency measurement is obtained. Simulation results on SER are obtained for AWGN, Rayleigh and Rician fading channels and used in energy efficiency computation. It is found that the energy efficiency of Zigbee transceivers is as low as 10% for Rayleigh channels, but it is over 90% for AWGN channels, when the received SNR is 10 dB, whereas, for Rician channels, it lies in between Rayleigh and AWGN, depending upon the fading level.
{"title":"Energy and error analysis of IEEE 802.15.4 Zigbee RF transceiver under various fading channels in Wireless Sensor Network","authors":"V. Nithya, B. Ramachandran, V. Bhaskar","doi":"10.1109/ICOAC.2012.6416858","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416858","url":null,"abstract":"This paper addresses the performance analysis of Zigbee transceiver using IEEE 802.15.4 standard under 2.4 GHz frequency band in terms of Energy and Error over various fading channel conditions. Energy is a critical aspect in Wireless Sensor Network (WSN) for improved network lifetime. The multipath nature of the wireless sensor network channel imposes adverse effect on the received signal characteristics. These unreliable links increases the error level to a greater extent and hence, degrades battery life. In this paper, we investigate the energy efficiency of a Zigbee transceiver using Direct Sequence Spread Spectrum- Offset Quadrature Phase Shift Keying (DSSS-OQPSK) modulation under 2.4 GHz frequency band in a WSN. The Symbol Error Rate (SER) is computed for a Zigbee transceiver, and an expression for energy efficiency measurement is obtained. Simulation results on SER are obtained for AWGN, Rayleigh and Rician fading channels and used in energy efficiency computation. It is found that the energy efficiency of Zigbee transceivers is as low as 10% for Rayleigh channels, but it is over 90% for AWGN channels, when the received SNR is 10 dB, whereas, for Rician channels, it lies in between Rayleigh and AWGN, depending upon the fading level.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128777164","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416839
J. S. Nayak, M. Indiramma
Face recognition is identifying a person based on facial characteristics. Automated face recognition is identifying a given query face called probe from a target population known as gallery. The face recognition algorithms perform well when the interpersonal images have more discriminating features than intra personal images. The changes in the face bring down the similarity of the intrapersonal images. The variations in the face can be due to pose, expression, illumination changes and aging of a person. Face recognition accuracy is largely influenced by the age related changes in face. Aging effects on face are not uniform and depend on both intrinsic as well as external factors like geographic location, race, food habits etc. The facial changes are exclusive for each person in spite of aging being an apparent phenomenon among all individuals. Hence there are many challenges still open in compensating age related variations. In this paper we have proposed a novel self-PCA based approach in order to consider distinctiveness of the effects of aging of a person for age invariant face recognition. The region around the eyes is used as the input feature instead of the entire face as it is more stable part of the face with respect to aging and also requires less space. The proposed approach is tested using the images of the FG-NET database.
{"title":"Efficient face recognition with compensation for aging variations","authors":"J. S. Nayak, M. Indiramma","doi":"10.1109/ICOAC.2012.6416839","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416839","url":null,"abstract":"Face recognition is identifying a person based on facial characteristics. Automated face recognition is identifying a given query face called probe from a target population known as gallery. The face recognition algorithms perform well when the interpersonal images have more discriminating features than intra personal images. The changes in the face bring down the similarity of the intrapersonal images. The variations in the face can be due to pose, expression, illumination changes and aging of a person. Face recognition accuracy is largely influenced by the age related changes in face. Aging effects on face are not uniform and depend on both intrinsic as well as external factors like geographic location, race, food habits etc. The facial changes are exclusive for each person in spite of aging being an apparent phenomenon among all individuals. Hence there are many challenges still open in compensating age related variations. In this paper we have proposed a novel self-PCA based approach in order to consider distinctiveness of the effects of aging of a person for age invariant face recognition. The region around the eyes is used as the input feature instead of the entire face as it is more stable part of the face with respect to aging and also requires less space. The proposed approach is tested using the images of the FG-NET database.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117070953","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
扫码关注我们
求助内容：
应助结果提醒方式：