Abstract
This letter investigates a communication node relative localization problem based on time-of-arrival (TOA), where both the distances in direct signal paths and reflecting signal paths are measured. A wireless sensor network model of distance measurements and node locations is established, and a new two-step localization iterative algorithm is proposed. Simulation results illustrate the performance of the proposed algorithm, which is compared with Cramer–Rao lower bounds (CRLBs) and genetic algorithm (GA)-based algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
