Chenhui Hu

Multicast performance with hierarchical cooperation

It has been shown in a previous version of this paper that hierarchical cooperation achieves a linear throughput scaling for unicast traffic, which is due to the advantage of long-range concurrent transmissions and the technique of distributed multiple-input-multiple-output (MIMO). In this paper, we investigate the scaling law for multicast traffic with hierarchical cooperation, where each of the <i>n</i> nodes communicates with <i>k</i> randomly chosen destination nodes. Specifically, we propose a new class of scheduling policies for multicast traffic. By utilizing the hierarchical cooperative MIMO transmission, our new policies can obtain an aggregate throughput of Ω(( [( <i>n</i>)/( <i>k</i>)])^1-ε) for any ε >; 0. This achieves a gain of nearly √{[( <i>n</i>)/( <i>k</i>)]} compared to the noncooperative scheme in Li s work (Proc. ACM MobiCom, 2007, pp. 266-277). Among all four cooperative strategies proposed in our paper, one is superior in terms of the three performance metrics: throughput, delay, and energy consumption. Two factors contribute to the optimal performance: multihop MIMO transmission and converge-based scheduling. Compared to the single-hop MIMO transmission strategy, the multihop strategy achieves a throughput gain of ( [( <i>n</i>)/( <i>k</i>)])^[(<i>h</i>-1)/( <i>h</i>(2<i>h</i>-1))] and meanwhile reduces the energy consumption by <i>k</i>^{[( α-2)/ 2]} times approximately, where <i>h</i> >; 1 is the number of the hierarchical layers, and α >; 2 is the path-loss exponent. Moreover, to schedule the traffic with the converge multicast instead of the pure multicast strategy, we can dramatically reduce the delay by a factor of about ( [( <i>n</i>)/( <i>k</i>)])^[(<i>h</i>)/ 2]. Our optimal cooperative strategy achieves an approximate delay-throughput tradeoff <i>D</i>(<i>n</i>,<i>k</i>)/<i>T</i>(<i>n</i>,<i>k</i>)=Θ(<i>k</i>) when <i>h</i>→ ∞. This tradeoff ratio is identical to that of noncooperative scheme, while the throughput is greatly improved.

Multicast Scaling Laws with Hierarchical Cooperation

A new class of scheduling policies for multicast traffic are proposed in this paper. By utilizing hierarchical cooperative MIMO transmission, our new policies can obtain an aggregate throughput of

A graph theoretical regression model for brain connectivity learning of Alzheimer'S disease

\Omega\big((\frac{n}{k})^{1-\epsilon}\big)

Matched signal detection on graphs: Theory and application to brain imaging data classification

for any

A Spectral Graph Regression Model for Learning Brain Connectivity of Alzheimer’s Disease

\epsilon>0

Graph-based regularization for color image demosaicking

. This achieves a gain of nearly

Localizing Sources of Brain Disease Progression with Network Diffusion Model

\sqrt{\frac{n}{k}}

Matched signal detection on graphs: theory and application to brain network classification

compared with non-cooperative scheme in \cite{paper:MulticastCapacityXYLi}. Between the two cooperative strategies in our paper, the converge-based one is superior to the other on delay, while the throughput and energy consumption performances are nearly the same. Moreover, to schedule the traffic in a converge multicast manner instead of the simple multicast, we can dramatically reduce the delay by a factor nearly

Adaptive time-sequential binary sensing for high dynamic range imaging

(\frac{n}{k})^\frac{h}{2}

Inferring Sources of Dementia Progression with Network Diffusion Model

, where