Sciweavers

48 search results - page 10 / 10
» The Mathematics of Routing in Massively Dense Ad-Hoc Network...
Sort
View
SPAA
2006
ACM
13 years 11 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
CN
2006
145views more  CN 2006»
13 years 5 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
IPSN
2005
Springer
13 years 10 months ago
QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
Morteza Maleki, Massoud Pedram