Sciweavers

364 search results - page 62 / 73
» Shortest-path network interdiction
Sort
View
MOBICOM
2003
ACM
14 years 28 days ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
BMCBI
2007
80views more  BMCBI 2007»
13 years 7 months ago
A network perspective on the topological importance of enzymes and their phylogenetic conservation
Background: A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many ...
Wei-chung Liu, Wen-hsien Lin, Andrew J. Davis, Fer...
WIOPT
2010
IEEE
13 years 6 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 1 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
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...