Sciweavers

552 search results - page 18 / 111
» Routing complexity of faulty networks
Sort
View
P2P
2007
IEEE
165views Communications» more  P2P 2007»
14 years 3 months ago
An Information-Theoretic Framework for Analyzing Leak of Privacy in Distributed Hash Tables
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...
Souvik Ray, Zhao Zhang
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
14 years 1 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
INFOCOM
2007
IEEE
14 years 3 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
MOBICOM
2005
ACM
14 years 2 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
INFOCOM
2009
IEEE
14 years 3 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter