Sciweavers

2642 search results - page 191 / 529
» Robust node localization for wireless sensor networks
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 3 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
120
Voted
AHSWN
2007
116views more  AHSWN 2007»
15 years 3 months ago
On the Lifetime of Large Wireless Sensor Networks with Multiple Battery Levels
Large wireless sensor networks promise to revolutionize the way we sense and control the physical world. In large networks the nodes within the range of the base station forward d...
Mihail L. Sichitiu, Rudra Dutta
120
Voted
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 5 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
SENSYS
2004
ACM
15 years 9 months ago
Practical and robust geographic routing in wireless networks
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
149
Voted
CONEXT
2005
ACM
15 years 5 months ago
Path key establishment using multiple secured paths in wireless sensor networks
Random key Pre-distribution scheme has been proposed to overcome the memory, computation and energy limits of individual sensor in wireless sensor networks. In this scheme, a ring...
Guanfeng Li, Hui Ling, Taieb Znati