109 search results - page 20 / 22 » Faulty Random Geometric Networks |
107
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
111
Voted
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
140
click to vote
MOBIHOC
2007
ACM
16 years 7 days ago
2007
ACM
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
106
Voted
SASO
2008
IEEE
15 years 7 months ago
2008
IEEE
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
106
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...