Sciweavers

38 search results - page 1 / 8
» Distributed Link Scheduling with Constant Overhead
Sort
View
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 5 months ago
Distributed Link Scheduling with Constant Overhead
This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple loc...
Sujay Sanghavi, Loc Bui, R. Srikant
ICDCSW
2008
IEEE
13 years 11 months ago
Fast Link Assessment in Wireless Mesh Networks by Using Non-Constant Weight Code
Abstract— The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the...
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu
ICC
2008
IEEE
142views Communications» more  ICC 2008»
13 years 11 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun
PDPTA
2003
13 years 6 months ago
Improving Distributed OS Performance by Flexible Incremental Linking
Abstract Distributed Systems suffer from the enormous performance gap between local and remote operation. To bridge this gap a general purpose distributed operating system must pr...
Markus Pizka
MOBIHOC
2006
ACM
14 years 4 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
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...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu