Cross-Layer Strategies for Throughput Maximization in a Data Aggregating Wireless Network
The authors consider an ad-hoc wireless network where all nodes have data to send to a single destination node called the sink. They consider a linear placement of the wireless nodes with the sink at one end. They assume that the wireless nodes transfer data to the sink using single hop direct transmission and that the nodes are scheduled one at a time by a central scheduler (possibly the sink). In this setup, they assume that the wireless nodes are power limited and their network objective (notion of fairness) is to maximize the minimum throughput of a node subject to the individual node power constraints.