Sciweavers

612 search results - page 93 / 123
» Scheduling Data Transfers in a Network and the Set Schedulin...
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
MOBICOM
2004
ACM
14 years 25 days ago
Initializing newly deployed ad hoc and sensor networks
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IPL
2010
112views more  IPL 2010»
13 years 5 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
PIMRC
2008
IEEE
14 years 1 months ago
Fair resource allocation under Rayleigh and/or Rician fading environments
—Proportional fair scheduling (PFS) provides good balance between throughput and fairness via multi-user diversity and game-theoretic equilibrium. Very little analytical work exi...
Erwu Liu, Kin K. Leung
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri