Abstract
It is important for wireless sensor networks (WSNs) to determine whether hubs can be restricted, called localizability recognition. This progression is important for confining hubs, achieving minimal organizations of effort and distinguishing critical in field-based applications. Because of their high calculation and communication costs, centralized graph algorithms are meaningless to an asset-restricted WSN, whereas distributed methodologies can skip a large number of hypothetically locatable hubs in a resource-limited WSN. In this document we are proposing a efficient and successful distributed methodology to solve that address of issue. In addition, we demonstrate our calculation accuracy and analyze the reasons why our calculation will discover increasingly localizable hubs while requiring less established area hubs. The paper introduces a new RSSI-based localization approach triangle as well as centroid placement, utilizing triangle as well as centroid approach to minimize RSSI measurement error. Modelling simulations show that this algorithm can significantly increase the precision of the location compared to the trilateration.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
