Sciweavers

4 search results - page 1 / 1
» Topology control meets SINR: : the scheduling complexity of ...
Sort
View
MOBIHOC
2006
ACM
14 years 3 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
INFOCOM
2009
IEEE
13 years 10 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
PIMRC
2010
IEEE
13 years 1 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
DATE
1997
IEEE
133views Hardware» more  DATE 1997»
13 years 7 months ago
Hierarchical scheduling and allocation of multirate systems on heterogeneous multiprocessors
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
Yanbing Li, Wayne Wolf