A survey of throughput versus complexity tradeoffs in wireless networks

Authors:
Saswati Sarkar
Affiliations:
Department of Electrical and Systems Engineering, University of Pennsylvania, Sophia, Antipolis
Venue:
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Year:
2007

Citing 1
Cited 0

Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Attaining stability guarantees using distributed scheduling policies is an important design goal in multi-hop wireless networks. Several recent results have recently characterized tradeoffs tradeoffs between computation times and stability guarantees in multi-hop wireless networks. We summarize existing results that have substantially advanced the state of the art in this context, and discuss problems that remain open.