Sciweavers

2732 search results - page 27 / 547
» Fast and Distributed Computation of Schedules in Wireless Ne...
Sort
View
MOBIHOC
2006
ACM
15 years 9 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...
PPPJ
2003
ACM
15 years 2 months ago
Multi-tiered distributed computing platform
A simple programmable Java platform-independent distributed computation system has been developed to exploit the free resources on computers linked together by a network. It is a ...
Andrew J. Page, Thomas M. Keane, Richard Allen, Th...
MOBIHOC
2008
ACM
15 years 9 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
WICON
2008
14 years 11 months ago
Exploiting parallel networks using dynamic channel scheduling
Many researchers have been focusing on the outcomes and consequences of the rapid increase and proliferation of mobile wireless technologies. If it is not already the case, it wil...
Lara B. Deek, Kevin C. Almeroth, Mike P. Wittie, K...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Noncooperative power control and transmission scheduling in wireless collision channels
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
Ishai Menache, Nahum Shimkin