BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing

C. Y. Márquez; I. Lopez-Yáñez; O. C. Nieto; A. J.A. Cruz

doi:10.1109/TLA.2013.6502868

BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing

C. Y. Márquez, I. Lopez-Yáñez, O. C. Nieto, A. J.A. Cruz

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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.

Original language	English
Article number	6502868
Pages (from-to)	600-601
Number of pages	2
Journal	IEEE Latin America Transactions
Volume	11
Issue number	1
DOIs	https://doi.org/10.1109/TLA.2013.6502868
State	Published - 2013
Externally published	Yes

Keywords

Binary Decision Diagrams
Minimum Spanning Trees
Networking
Routing
Variable-Range Transmission
Wireless ad hoc Networks

Access to Document

10.1109/TLA.2013.6502868

Cite this

@article{25b4071b673241418a398efe117a2b01,

title = "BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing",

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.",

keywords = "Binary Decision Diagrams, Minimum Spanning Trees, Networking, Routing, Variable-Range Transmission, Wireless ad hoc Networks",

author = "M{\'a}rquez, {C. Y.} and I. Lopez-Y{\'a}{\~n}ez and Nieto, {O. C.} and Cruz, {A. J.A.}",

year = "2013",

doi = "10.1109/TLA.2013.6502868",

language = "Ingl{\'e}s",

volume = "11",

pages = "600--601",

journal = "IEEE Latin America Transactions",

issn = "1548-0992",

number = "1",

}

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 -

BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this