Algoritmo Basado en BDD para el Minimum Spanning Tree en el Ruteo de Redes Inalámbicas Ad-hoc
(BDD-based Algorithm for the Minimum Spanning Tree in Wireless Ad-hoc Network Routing)
Cornelio Yáñez-Márquez (firstname.lastname@example.org), Itzamá López-Yáñez (email@example.com), Oscar Camacho-Nieto (firstname.lastname@example.org), Amadeo José Argüelles-Cruz (email@example.com)
Instituto Politécnico Nacional
This paper appears in: Revista IEEE América Latina
Publication Date: Feb. 2013
Volume: 11, Issue: 1
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.
Networking, Wireless ad hoc Networks, Variable-Range Transmission, Routing, Minimum Spanning Trees, Binary Decision Diagrams
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (161)]