Abstract
We consider the problem to reconfigure synchronously a group of mobile nodes in ad-hoc networks without central control. The reconfiguration can enhance or update software on all communication layers, which means that communication during reconfigurations may not be possible. Furthermore, we consider the dynamic nature of ad-hoc networks, where nodes can join or leave at any time. We propose a novel, time-out based algorithm for synchronous reconfigurations for a group of terminals for these requirements. The algorithm achieves some basic consistency properties, where connected groups have the same configuration afterwards (old or new). We discuss the correctness of the algorithm and present variations depending on failure assumptions. Several applications for reconfigurations in ad-hoc networks are discussed.
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.
