← Back to VOLUME 2, ISSUE 10, OCTOBER 2013
This work is licensed under a Creative Commons Attribution 4.0 International License.
Fingerprint Recognition Scheme using Assembling Invariant Moments and SVM
SUPRIYA WABLE, CHAITALI LAULKAR Department of Computer Engineering, Sinhgad College of Engineering, Pune, India
Downloads: Download PDF
π 38 viewsπ₯ 0 downloads
Abstract: In wireless sensor networks, physical damage, battery drainage leads to decrease in number of sensors deployed with respect to time, resulting in performance degradation. Further to improve the sensing quality, actors are used to allocate the spare sensors to Deficient Regions (DR) and relocate the sensors from Bountiful Regions (BR) to DR. In this paper, we propose the concept of Information Tables (IT) and threshold limits for both the allocation and relocation process to improve the performance of the wireless sensor networks. Allocation and relocation of sensor nodes can be made with the help of Greedy Algorithm (GA). In GA the IT is considered as a key factor. This new proposed approach, GA-IT avoids the dead node problem. Thus the results show that the performance is increased significantly. Simulation results are provided to demonstrate the performance increase in wireless sensor networks.
Keywords: Sensing Quality, Allocation, Relocation, Information Tables (IT)
Keywords: Sensing Quality, Allocation, Relocation, Information Tables (IT)
How to Cite:
[1] SUPRIYA WABLE, CHAITALI LAULKAR Department of Computer Engineering, Sinhgad College of Engineering, Pune, India, βFingerprint Recognition Scheme using Assembling Invariant Moments and SVM,β International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
