Sciweavers

137 search results - page 19 / 28
» Optimising Node Coordinates for the Shortest Path Problem
Sort
View
PERCOM
2007
ACM
14 years 7 months ago
Static Path Planning for Mobile Beacons to Localize Sensor Networks
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...
Rui Huang, Gergely V. Záruba
INFOCOM
2009
IEEE
14 years 2 months ago
MARA: Maximum Alternative Routing Algorithm
—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...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
ICNP
2006
IEEE
14 years 1 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— 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 ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
PODC
2006
ACM
14 years 1 months ago
Optimal-stretch name-independent compact routing in doubling metrics
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...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
INFOCOM
2002
IEEE
14 years 8 days ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
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 ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman