Abstract
Dynamic power controlled routing has become a viable alternative to traditional routing protocols in wireless ad hoc networks, particularly with the goal of making a more efficient power management. The existing schemes in this approach tend to converge to a route comprised of a minimum spanning tree between the source and destination nodes. However, this final route is found by an iterative procedure. In the current paper, a proposal is made which builds the final route in one step, by calculating the corresponding minimum spanning tree using a low complexity algorithm based on BDDs.
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.
