Sciweavers

14 search results - page 3 / 3
» A stochastic analysis of greedy routing in a spatially-depen...
Sort
View
TON
2010
147views more  TON 2010»
13 years 4 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
IPSN
2009
Springer
14 years 1 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
SPAA
1996
ACM
13 years 10 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
ADHOC
2007
122views more  ADHOC 2007»
13 years 6 months ago
Modeling and analyzing the correctness of geographic face routing under realistic conditions
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Karim Seada, Ahmed Helmy, Ramesh Govindan