Sciweavers

166 search results - page 22 / 34
» Interference Functionals in Poisson Networks
Sort
View
MOBICOM
2004
ACM
14 years 1 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
CORR
2007
Springer
176views Education» more  CORR 2007»
13 years 7 months ago
Crystallization in large wireless networks
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
Veniamin I. Morgenshtern, Helmut Bölcskei
EOR
2006
107views more  EOR 2006»
13 years 7 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
INFOCOM
2000
IEEE
13 years 11 months ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li
IMC
2004
ACM
14 years 1 months ago
A pragmatic approach to dealing with high-variability in network measurements
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
Walter Willinger, David Alderson, Lun Li