Sciweavers

2294 search results - page 176 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
MSN
2007
Springer
15 years 4 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
IJRR
2002
126views more  IJRR 2002»
14 years 9 months ago
Sensor-based Coverage of Unknown Environments
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
Ercan U. Acar, Howie Choset
STACS
2010
Springer
15 years 5 months ago
Relaxed Spanners for Directed Disk Graphs
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
David Peleg, Liam Roditty
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 3 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
NETWORKS
2007
14 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu