Sciweavers

2421 search results - page 323 / 485
» Approximate Flow-Aware Networking
Sort
View
NETWORKING
2007
13 years 11 months ago
Simple Models for the Performance Evaluation of a Class of Two-Hop Relay Protocols
We evaluate the performance of a class of two-hop relay protocols for mobile ad hoc networks. The interest is on the multicopy two-hop relay (MTR) protocol, where the source may ge...
Ahmad Al Hanbali, Arzad Alam Kherani, Philippe Nai...
TON
2008
99views more  TON 2008»
13 years 9 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
IPSN
2009
Springer
14 years 4 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
FOCS
1995
IEEE
14 years 1 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
ICANN
2007
Springer
14 years 3 months ago
Theoretical Analysis of Accuracy of Gaussian Belief Propagation
Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
Yu Nishiyama, Sumio Watanabe