Sciweavers

364 search results - page 28 / 73
» Shortest-path network interdiction
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
MFCS
2000
Springer
13 years 11 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
INFOCOM
2011
IEEE
12 years 11 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
IWQOS
2005
Springer
14 years 1 months ago
Privacy and Reliability by Dispersive Routing
— The traditional single (shortest) path routing paradigm leaves sessions vulnerable to a variety of security threats, especially eavesdropping. We propose to overcome this via d...
Haim Zlatokrilov, Hanoch Levy
TWC
2011
291views more  TWC 2011»
13 years 2 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...