A distributed algorithm for min-max tree and max-min cut problems in communication networks

IEEE/ACM Transactions on Networking

Volumn 18, Issue 4, 2010, Pages 1067-1076

  Guo, Song ^a   Leung, Victor C M ^b  

^a UNIVERSITY OF AIZU   (Japan)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Communication complexity; distributed algorithm; min max tree; Steiner tree

Indexed keywords

AVERAGE NUMBERS; COMMUNICATION COMPLEXITY; COMMUNICATION NETWORKS; DATA NETWORKING; DESTINATION NODES; DISTRIBUTED ALGORITHM; EULER CONSTANT; MAX-MIN; MIN-MAX; MULTICAST TREE; MULTICASTS; MULTIHOP WIRELESS NETWORK; OPTIMIZATION PROBLEMS; RANDOM NETWORK; SOURCE NODES; STEINER TREES;

ALGORITHMS; COMMUNICATION; GRAPH THEORY; MULTICASTING; OPTIMIZATION; WIRELESS SENSOR NETWORKS;

TREES (MATHEMATICS);

EID: 77955742491     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2038998     Document Type: Article

References (24)

1. R. Guerin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Trans. Netw., vol.10, no.5, pp. 613-620, Oct. 2002.
2. M. X. Cheng et al., "Energy-efficient broadcast and multicast routing in ad hoc wireless networks," in Proc. IEEE IPCCC, Phoenix, AZ, Apr. 2003, pp. 87-94.
3. I. Papadimitriou and L. Georgiadis, "Energy-aware broadcast trees in wireless networks," Mobile Netw. Appl., vol.9, no.6, pp. 567-581, Dec. 2004.
4. J. Edmonds and R. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol.19, no.2, pp. 248-264, Apr. 1972.
5. P. M. Camerini, "The min-max spanning tree problem and some extensions," Inf. Process. Lett., vol.7, no.1, pp. 10-14, Jan. 1978.
6. C. W. Duin and A. Volgenant, "The partial sum criterion for Steiner trees in graphs and shortest paths," Eur. J. Oper. Res., vol.97, no.1, pp. 172-182, Feb. 1997.
7. H. N. Gabow and R. E. Tarjan, "Algorithms for two optimization problems," J. Algor., vol.9, no.3, pp. 411-417, Sep. 1988.
8. L. Georgiadis, "Bottleneck multicast trees in linear time," IEEE Commun. Lett., vol.7, no.11, pp. 564-566, Nov. 2003.
9. I. Kang and R. Poovendran, "Maximizing static network lifetime of wireless broadcast adhoc networks," in Proc. IEEE ICC, May 2003, pp. 2256-2261.
10. A. K. Das, R. J. Marks, II, M. A. El-Sharkawi, P. Arabshahi, and A. Gray, "MDLT: A polynomial time optimal algorithm for maximization of time-to-first-failure in energy-constrained broadcast wireless networks," in Proc. IEEE Globecom, San Francisco, CA, Dec. 2003, pp. 362-366.
11. S. Guo and O. Yang, "A framework for the multicast lifetime maximization problem in energy-constrained wireless ad-hoc networks," ACM Wireless Netw. J., vol.15, no.3, pp. 313-332, Apr. 2009.
12. B. Floréen et al., "Multicast time maximization in energy constrained wireless networks," in Proc. ACM Joint Workshop Found. Mobile Comput., San Diego, CA, Sep. 2003, pp. 50-58.
13. S. Guo and O. Yang, "Multicast lifetime maximization for energy-constrained wireless ad-hoc networks with directional antennas," in Proc. IEEE Globecom, Dallas, TX, Dec. 2004, pp. 4120-4124. (Pubitemid 40610830)
14. S. Guo, V. Leung, and O. Yang, "Improving scalability for longest-lived multicast using localized operations in WANETs," in Proc. IEEE SECON, San Diego, CA, Jun. 2007, pp. 243-252.
15. R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum weight spanning trees," ACM Trans. Program. Lang. Syst., vol.5, no.1, pp. 66-77, 1983.
16. M. Faloutsos and M. Molle, "A linear-time optimal-message distributed algorithm for minimum spanning trees," Distrib. Comput., vol.17, pp. 151-170, 2004.
17. R. C. Prim, "Shortest connection networks and some generalisations," Bell Syst. Tech. J., vol.36, pp. 1389-1401, 1957.
18. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol.1, pp. 269-271, 1959.
19. S. Guo and O. Yang, "Formulation of optimal tree construction for maximum lifetime multicasting in wireless ad hoc networks with adaptive antennas," in Proc. IEEE ICC, Seoul, Korea, May 2005, pp. 3370-3374.
20. Y. T. Hou, Y. Shi, H. D. Sherali, and J. E. Wieselthier, "Online lifetime-centric multicast routing for ad hoc networks with directional antennas," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 761-772.
21. S. Guo, O. Yang, and V. Leung, "Approximation algorithms for longest-lived directional multicast communications in wanets," in Proc. ACM MobiHoc, Montreal, QC, Canada, Sep. 2007, pp. 190-198.
22. P. M. Ruiz and A. F. Gomez-Skarmeta, "Approximating optimal multicast trees in wireless multihop networks," in Proc. IEEE ISCC, Cartagena, Spain, Jun. 2005, pp. 686-691.
23. P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, "Minimum-energy multicast routingin static ad hoc wireless networks," IEEE/ACM Trans. Netw., vol.12, no.3, pp. 507-514, Jun. 2004.
24. B. Bollobas, Graph Theory, an Introduction Course. New York: Springer-Verlag, 1979.