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

IEEE Latin America Transactions

Volumn 11, Issue 1, 2013, Pages 600-601

  Marquez C Y ^a   Lopez Yanez I ^b   Nieto, O C ^c   Cruz, A J A ^a  

^a National Polytechnic Institute CIC IPN   (Mexico)

^b National Polytechnics Institute (IPN UPIITA)   (Mexico)

^c National Polytechnics Institute (IPN CIDETEC)   (Mexico)

Author keywords

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

Indexed keywords

DESTINATION NODES; DYNAMIC POWER; EFFICIENT POWER MANAGEMENTS; ITERATIVE PROCEDURES; LOW COMPLEXITY ALGORITHM; MINIMUM SPANNING TREES; NETWORKING; ROUTING;

BINARY DECISION DIAGRAMS; ENERGY MANAGEMENT; ITERATIVE METHODS;

WIRELESS AD HOC NETWORKS;

EID: 84876794149     PISSN: 15480992     EISSN: None     Source Type: Journal    
DOI: 10.1109/TLA.2013.6502868     Document Type: Article

References (14)

1. C. Toh, "Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks", IEEE Communications Magazine, vol. 21, no. 4, 2001, pp. 138-147. (Pubitemid 32583321)
2. P. Gupta, P. Kumar "Critical Power for Asymptotic Connectivity", 37th IEEE Conference on Decision and Control, 1998, pp. 1106-1110.
3. P. Gupta, P. Kumar, "The Capacity of Wireless Networks", IEEE Transaction on Information Theory, vol. IT-46, no. 2, 2000, pp. 388-404.
4. F. Xue, P. Kumar, "The number of neighbors needed for connectivity of wireless networks", Wireless Networks, vol. 10, no. 2, 2004, pp. 169-181.
5. J. Gomez, A. Campbell, "Using Variable-Range Transmission Power Control in Wireless Ad Hoc Networks", IEEE Transaction on Mobile Computing, vol. 46, no. 1, 2007, pp. 87-99. (Pubitemid 44955816)
6. J. Gomez, A. Campbell, "PARO: Supporting Dynamic Power Controlled Routing in Wireless Ad Hoc Networks", Wireless Networks, vol. 9, no. 5, 2003, pp. 443-460.
7. A. Frieze, "On the value of a random minimum spanning tree problem", Discrete Applied Mathematics, vol. 10, no. 1, 1985, pp. 47-56. (Pubitemid 15475454)
8. J. Steele, "Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted Edges Coverage", The Annals of Probability, vol. 16, no. 4, 1988, pp. 1767-1787.
9. F. Avram, D. Bertsimas, "The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model; A Unified Approach", The Annals of Applied Probability, vol. 2, no. 1, 1992, pp. 113-130.
10. K. Khamforoosh "Clustered Balanced Minimum Spanning Tree for Routing and Energy", 2011 Symposium on Wireless Technology and Applications (ISWTA), 2011, pp. 56-59.
11. I, López, C. Yáñez, O. Camacho, Binary Decision Diagrams, CIDETEC Series, IPN, Mexico, 2007, pp. 12-29.
12. R. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation", Transactions on Computers, vol. C-35, no. 8, 1986, pp. 677-691. (Pubitemid 16629996)
13. R. Sangireddy, A.K. Somani, "High-speed IP routing with binary decision diagrams based hardware address lookup engine", IEEE Journal on Selected Areas in Communications, vol. 21, no. 4, 2003, pp. 513-521.
14. B. Bolling, "On symbolic OBDD-based algorithms for the minimum spanning tree problem", Theoretical Computer Science, vol. 447, no. 17, 2012, pp. 2-12.