Please use this identifier to cite or link to this item:
Title: Efficient and robust localization for wireless networks
Authors: Guan, Ming Tao.
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Issue Date: 2010
Abstract: Interfacing the location of a source (Mobile Station) and a set of physical sensors (Base Stations) empowers the study of wireless localization algorithms, with the goal of performing more precise and sustainable detections. Conventional localization methodologies utilize various models to estimate the location of the source node, including Angle of Arrival (AoA), Time of Arrival (ToA), Time Difference of Arrival (TDoA), and Received Signal Strength (RSS). Those methodologies have their own advantages and drawbacks, thus, a combined method is proposed by adding memory assistance (used in RSS) into TDoA localization system to enhance detection robustness. Moreover, source station and sensor stations communicate on transmit-receive basis in wireless networks, which makes the geometric setup of detection sensors important. An efficient algorithm is proposed to convert stationary source stations into temporary sensors, in order to maintain the detection area but save energy. Trilateration, least squares, and bounding boxes algorithms are also studied and utilized to gain a complete localization sequence. Last but not the least, Ant Colony Optimization (ACO) is studied to glue the robust memory assisted method and the efficient geometric algorithm together, with a synchronized weighted system. MATLAB simulations are conducted to support proposed methods, with basic investigations on the Monte Carlo (MC) technique and the Cramer Rao Lower Bound (CRLB).
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
756.69 kBAdobe PDFView/Open

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.