Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless downlink data channels: user performance and cell dimensioning
Proceedings of the 9th annual international conference on Mobile computing and networking
UCAN: a unified cellular and ad-hoc network architecture
Proceedings of the 9th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Two-hop-relay architecture for next-generation WWAN/WLAN integration
IEEE Wireless Communications
Performance of cellular networks with relays and centralized scheduling
IEEE Transactions on Wireless Communications
Binary Power Control for Sum Rate Maximization over Multiple Interfering Links
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Integrated cellular and ad hoc relaying systems: iCAR
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the downlink of a cellular network supporting data traffic in which each user is equipped with the same type of IEEE 802.11-like WLAN or WPAN interface used to relay packets to further users. We are interested in the design guidelines for such networks and how much capacity improvements the additional relay layer can bring. A first objective is to provide a scheduling/relay strategy that maximizes the network capacity. Using theoretical analysis, numerical evaluation, and simulations, we find that when the number of active users is large, the capacity-achieving strategy divides the cell into two areas: one closer to the base station where the relay layer is always saturated and some nodes receive traffic through both direct and relay links, and the farther one where the relay is never saturated and the direct traffic is almost nonexistent. We also show that it is approximately optimal to use fixed relay link lengths, and we derive this length. We show that the obtained capacity is independent of the cell size (unlike in traditional cellular networks). Based on our findings, we propose simple decentralized routing and scheduling protocols. We show that in a fully saturated network our optimized protocol substantially improves performance over the protocols that use naive relay-only or direct-only policies.