Resource allocation using multiple edge-sharing multicast trees

IEEE Transactions on Vehicular Technology

Volumn 57, Issue 5, 2008, Pages 3178-3186

  Patil, Abhishek ^a   Esfahanian, Abdol Hossein ^b   Liu, Yunhao ^c   Xiao, Li ^b  

^a Kiyon Inc   (United States)

^b Michigan State University   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Fair resource allocation; Minimum spanning tree (MST); Mobile ad hoc networks (MANETs); Multicast

Indexed keywords

AD HOC NETWORKS; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; PLANNING; RESOURCE ALLOCATION; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

FAIR RESOURCE ALLOCATION; MINIMUM SPANNING TREE (MST); MOBILE AD HOC NETWORKS (MANETS); MULTICAST;

MULTICASTING;

EID: 53149101320     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2007.913183     Document Type: Article

References (13)

1. R. C. Prim, "Shortest connection networks and some generalisations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, Nov. 1957.
2. 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, Jan. 1983.
3. B. Awerbuch, "Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems," in Proc. 19th Annu. ACM Conf. Theory Comput., 1987, pp. 230-240.
4. G. Singh and A. J. Bernstein, "A highly asynchronous minimum spanning tree protocol," Distrib. Comput., vol. 8, no. 3, pp. 151-161, Mar. 1995.
5. M. Faloutsos and M. Molle, "What features really make distributed minimum spanning tree algorithms efficient?" in Proc. ICPADS, 1996, p. 106.
6. D. K. Gifford, J. Jannotti, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole, "Overcast: Reliable multicasting with an overlay network," in Proc. 4th Symp. OSDI, San Diego, CA, Oct. 2000, pp. 197-212.
7. P. Antoniadis and C. Courcoubis, "Market models for P2P content distribution," in Proc. 1st Int. Workshop AP2PC, 2002, pp. 138-143.
8. S. Lee, R. Sherwood, and B. Bhattacharjee, "Cooperative peer groups in NICE," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 2003, pp. 1272-1282.
9. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-bandwidth multicast in a cooperative environments," in Proc. 19th ACM SOSP, Lake George, NY, Oct. 2003, pp. 298-313.
10. L. Xiao, A. Paul, Y. Liu, L. M. Ni, and A.-H. Esfahanian, "Prioritized overlay multicast in ad-hoc environments," IEEE Comput. Mag., vol. 37, no. 2, pp. 67-74, Feb. 2004.
11. A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, and R. Y. Wang, "Overlay mesh construction using interleaved spanning trees," in Proc. INFOCOM, Hong Kong, Mar. 2004, pp. 396-407.
12. A. Patil, Y. Liu, L. Xiao, A.-H. Esfahanian, and L. M. Ni, "SOLONet: Sub-optimal location-aided overlay network for MANETs," in Proc. IEEE Int. Conf. MASS, Fort Lauderdale, FL, Oct. 2004, pp. 324-333.
13. A. Patil, A.-H. Esfahanian, Y. Liu, and L. Xiao, "Resource allocation using multiple edge-sharing multicast trees," in Proc. IEEE Int. Conf. MASS, Washington, DC, Nov. 2005, p. 371.