Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14902
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKUMAR, AMIT-
dc.date.accessioned2016-07-04T04:47:23Z-
dc.date.available2016-07-04T04:47:23Z-
dc.date.issued2016-07-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/14902-
dc.description.abstractMost problematic factor in wireless network is to find exact geographical location of sensor i.e. termed as localization issue. Many works, algorithm have been done is this regard to find accurate sensor location using Sequential Monte Carlo (SMC) method. This uses Seed/Anchor node to locate other sensor nodes but this algorithm, requirement is to have high density of Seed/Anchor nodes for accurate result, and also it deals with problem related to low sampling rate. Many research are done in same line but lacks to address energy requirement. On similar scope, Bounding Box method is designed which is quite efficient in searching time of candidate samples and hence address time issue to search valid sample set faster. In said thesis, we propose Energy Efficient approach that is faster in terms of searching candidate samples and ignore invalid samples efficiently from sample space. Also it takes more samples into account and hence increases localization accuracy. We will monitor direction of movement as well as speed of sensor to predict the next valid position of sample under study and hence we can easily rule out invalid samples in each iteration and achieve high localization accuracy.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTD NO.1601;-
dc.subjectLOCALIZATIONen_US
dc.subjectWORK CARLO BOXen_US
dc.subjectSEED SENSORen_US
dc.subjectSMCen_US
dc.titleMODEL FOR ACCURATE SENSOR NODE LOCALIZATION USING MCB WITH SPEED AND DIRECTION CALCULATIONen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
Amit_final_1.pdf1.32 MBAdobe PDFView/Open


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