137 search results - page 19 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
138
click to vote
PERCOM
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
141
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
140
Voted
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
173
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
143
Voted
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...