Sciweavers

DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
14 years 2 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
DIALM
2005
ACM
81views Algorithms» more  DIALM 2005»
14 years 2 months ago
Local approximation schemes for ad hoc and sensor networks
Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger...
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
14 years 2 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
DIALM
2005
ACM
203views Algorithms» more  DIALM 2005»
14 years 2 months ago
Topological hole detection in wireless sensor networks and its applications
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
Stefan Funke
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 2 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
14 years 2 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt