Sciweavers

364 search results - page 39 / 73
» Shortest-path network interdiction
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
JSAC
2007
119views more  JSAC 2007»
13 years 7 months ago
Cooperative routing for distributed detection in large sensor networks
— In this paper, the detection of a correlated Gaussian field using a large multi-hop sensor network is investigated. A cooperative routing strategy is proposed by introducing a...
Youngchul Sung, Saswat Misra, Lang Tong, Anthony E...
RSA
2010
89views more  RSA 2010»
13 years 6 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
SECON
2010
IEEE
13 years 5 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 2 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner