Abstract
This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the problem, namely Minimum Weight-Based Algorithm (MWBA) and Nearest Neighbour Augmentation Algorithm (NNAA) and prove that the former is a 4k approximation and the latter is a (k + 4) approximation. Through simulations, we evaluate the average performance of these two algorithms and find that MWBA is slightly better than NNAA in terms of the total power consumption.
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.
