Abstract
In this paper, we propose novel algorithms for source localization problem in wireless sensor networks. Under the log-normal and Gaussian models for received-signal-strength (RSS) and time-of-arrival (TOA) measurements, the maximum likelihood (ML) estimation problems have been widely studied. However, these traditional ML estimation problems are highly nonconvex. In this paper, by applying convex relaxation technique, the ML estimation problem for the RSS case is transformed into a second-order cone programming (SOCP) problem. In the case of TOA, the ML estimation problem is more complex. An iterative procedure is thereby introduced. At each iteration, the similar convex relaxation technique is also employed to formulate the ML estimation problem in an SOCP form. The proposed algorithms can be readily extended to localization problems in the minimax sense for both RSS and TOA cases.
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.
