Sciweavers

114 search results - page 3 / 23
» Random access transport capacity
Sort
View
SENSYS
2003
ACM
13 years 10 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
INFOCOM
2011
IEEE
12 years 8 months ago
Aggregation capacity of wireless sensor networks: Extended network case
—A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a s...
Cheng Wang, Changjun Jiang, Yunhao Liu, Xiang-Yang...
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
13 years 10 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
MMNS
2001
151views Multimedia» more  MMNS 2001»
13 years 6 months ago
Analysis of Random Access Protocol under Bursty Traffic
Aloha-type random-access protocols have been employed as access control protocols in wireline and wireless, stationary and mobile, multiple-access communications networks. They are...
Jianbo Gao, Izhak Rubin
TIT
1998
89views more  TIT 1998»
13 years 5 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam