Algorithms for coverage mapping and optimizing beacon placement in a hybrid indoor positioning system

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/254898
Download file(s):
File Description SizeFormat 
254898.pdfFulltext2.21 MBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Algorithms for coverage mapping and optimizing beacon placement in a hybrid indoor positioning system
Authors: Sjöberg, Johannes
Johansson, Anton
Abstract: This thesis considers a new analytical approach based on modeling indoor positioning as an coverage optimization problem. Over the recent years there has been extensive research in the subject of indoor positioning. Recent research commonly considers promising solutions by deploying new infrastructure, how ever, it does not often make use of already deployed infrastructure. The analytical approach proposed in this thesis considers the indoor environment and make use of meta heuristics to suggest how to extend existing infrastructure to create an reliable indoor positioning system. A prototype system has been implemented and several experiments have been performed at the expansion of existing Wi-Fi infrastructure with a Bluetooth low energy extension. The results showed that the system produces a reliable and affordable deployment design which uses very few reference nodes. How ever, this approach considers static environmental models and adaptors should be aware that this is best suited for indoor environments which are not subject to major refurbishments or renovations. Keywords:
Keywords: Data- och informationsvetenskap;Computer and Information Science
Issue Date: 2018
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/254898
Collection:Examensarbeten för masterexamen // Master Theses



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