7 search results - page 1 / 2 » dialm 2005 |
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
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...
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
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 ...
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
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...