Sciweavers

1243 search results - page 90 / 249
» On the locality of bounded growth
Sort
View
PERCOM
2008
ACM
14 years 9 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
INFOCOM
2009
IEEE
14 years 4 months ago
Spatial Distribution in Routing Table Design for Sensor Networks
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Rik Sarkar, Xianjin Zhu, Jie Gao
BDA
2003
13 years 11 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
13 years 11 months ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 10 months ago
On Certain Large Random Hermitian Jacobi Matrices with Applications to Wireless Communications
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeit...