Abstract
Previous work in wireless ad-hoc network routing has given rise to dynamic power controlled routing, which in turn enables variable-range transmissions. However, one limitation found in such protocols is the inclusion of at most one redirector in the route at each iteration. The work presented here introduces a redirector discovery algorithm which reaches the final route in less iterations, by including the possibility of adding two redirectors in each iterations. With this faster route convergence, greater power savings may be achieved, with the corresponding advantages this brings.
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.
