326 search results - page 17 / 66 » Topology-Transparent Distributed Scheduling in Multi-Hop Wir... |
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...