Sciweavers

63 search results - page 10 / 13
» Greedy Routing with Bounded Stretch
Sort
View
JSAC
2006
88views more  JSAC 2006»
13 years 9 months ago
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
Nina Skorin-Kapov
ISPAN
2005
IEEE
14 years 3 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
TPDS
2010
222views more  TPDS 2010»
13 years 8 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen
MOBIHOC
2001
ACM
14 years 9 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ALGOSENSORS
2009
Springer
14 years 1 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...