68 search results - page 13 / 14 » Lower Bounds for Noisy Wireless Networks using Sampling Algo... |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
TON
2008
13 years 7 months ago
2008
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...