Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14774
Title: DISTRIBUTED LOCALIZATION IN WIRELESS SENSOR NETWORKS USING BAT ALGORITHM
Authors: BALHARA, PRIYANKA
Keywords: BAT ALGORITHM
GLOBAL POSITIONING SYSTEM
ANCHOR NODES
TARGET NODES
FLIP AMBIGUITY
WANs
Issue Date: May-2016
Series/Report no.: TD NO.2070;
Abstract: With the rapid development of Wireless Sensor Networks (WSNs), location information becomes critically essential and indispensable since WSNs are intended to provide spatial-temporal information about the characteristics of the physical world. Hence, it becomes important to associate sensed data with location information, thus, making data geographically meaningful. So, one of the fundamental challenges in WSNs is the localization of nodes. Localization means assigning geographical coordinates to each device with unknown position in the deployment region. It is required in WSN to report the origin of events, routing, assisting group querying of sensors and to answer questions on the network coverage. In WSN, there will be sensor nodes densely deployed at positions which may or may not be predetermined. Global Positioning System (GPS) is not practical to be used in every sensor node because it will be costly. Moreover, there are energy constraints due to nodes being battery powered. Also, GPS is not accessible in some environments (like dense forests, under-ground) due to non-availability of signals in confined environment. Therefore, only some nodes are equipped with GPS known as anchor nodes. The other nodes known as target nodes, try to localize themselves using the location information obtained from anchor nodes within their range. In this dissertation, we developed a distributed localization technique which uses Bat algorithm to find the optimum locations of target nodes. It incorporates solutions to the problem of flip ambiguity which frequently occurs in localization. Flip ambiguity occurs when the number of anchors are less and are collinear. We have shown that our approach removes flip ambiguity problem and performs better than the approaches which do not include any measures to deal with it. We have compared our approach with the Bat algorithm approach without any measures to deal with flip ambiguity problem and shown the improvement in localization error. We have also compared our approach with the localization using Particle Swarm algorithm.
URI: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14774
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
priyanka front.pdf80.26 kBAdobe PDFView/Open
priyanka.pdf1.19 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.