Abstract
Self-tracking of mobile nodes in wireless networks has the potential to revolutionize the wireless communications industry. This letter presents a cooperative self-tracking algorithm for mobile nodes in wireless networks. The presented algorithm is fully distributed and cooperative. It is derived using network factor graphs (Net-FGs) and results in the sum-product algorithm over a wireless network (SPAWN). Numerical results show that it is robust and can significantly outperform conventional non- cooperative self-tracking techniques.
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.
