TY - JOUR
T1 - BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing
AU - Márquez, C. Y.
AU - Lopez-Yáñez, I.
AU - Nieto, O. C.
AU - Cruz, A. J.A.
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Binary Decision Diagrams
KW - Minimum Spanning Trees
KW - Networking
KW - Routing
KW - Variable-Range Transmission
KW - Wireless ad hoc Networks
UR - http://www.scopus.com/inward/record.url?scp=84876794149&partnerID=8YFLogxK
U2 - 10.1109/TLA.2013.6502868
DO - 10.1109/TLA.2013.6502868
M3 - Artículo
SN - 1548-0992
VL - 11
SP - 600
EP - 601
JO - IEEE Latin America Transactions
JF - IEEE Latin America Transactions
IS - 1
M1 - 6502868
ER -