36 search results - page 7 / 8 » Nonpreemptive Constrained Link Scheduling in Wireless Mesh N... |
MOBICOM
2009
ACM
14 years 1 days ago
2009
ACM
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
MOBIHOC
2006
ACM
14 years 5 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...
MOBIHOC
2009
ACM
14 years 6 months ago
2009
ACM
Sectorized antennas can increase wireless network capacity through greater spatial reuse. Despite their increasing popularity, their real-world performance characteristics in dens...
IMC
2004
ACM
13 years 11 months ago
2004
ACM
There has been much work on developing techniques for estimating the capacity and the available bandwidth of network paths based on end-point measurements. The focus has primarily...
SECON
2008
IEEE
13 years 12 months ago
2008
IEEE
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...