Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 2014 | public
Journal Article

Multicast Capacity With Max-Min Fairness for Heterogeneous Networks

Abstract

In this paper, we investigate the multicast capacity for static ad hoc networks with heterogeneous clusters. We study the effect of heterogeneous cluster traffic (HCT) on the achievable capacity. HCT means cluster clients are more likely to appear near the cluster head instead of being uniformly distributed across the network. Such a property is commonly found in real networks. By adopting max-min fairness, the minimum among all individual multicast capacities of clusters can be maximized. Since this minimal individual multicast capacity will not be maximized unlimitedly, our work focuses on deriving the upper bound of the minimum individual multicast capacity (we refer it as minimum capacity for simplicity) in HCT, which provides the best performance for the minimum multicast capacity to attain in the whole network. We find that HCT increases minimum capacity for ad hoc networks. Furthermore, the multicast capacity achieving scheme is provided to justify the derived asymptotic upper bound for the minimum capacity. Our work can generalize various results obtained under non heterogeneous networks in previous literature.

Additional Information

© 2013 IEEE. Manuscript received October 29, 2012; revised March 16, 2013; accepted March 19, 2013; approved by IEEE/ACM TRANSACTIONS ON NETWORKING, Editor S. Ramasubramanian. Date of publication April 25, 2013; date of current version April 14, 2014. This work was supported by National Fundamental Research Grant No. 2011CB302701, NSF China under Grant No.61271219, 61202373, Shanghai Basic Research Key Project No. 11JC1405100; the China Ministry of Education Fok Ying Tung Fund under Grant No. 122002, and the China Ministry of Education New Century Excellent Talent under Grant No. NCET-10-0580.

Additional details

Created:
August 20, 2023
Modified:
October 17, 2023