Sciweavers

254 search results - page 13 / 51
» A Novel Multi-path Routing Protocol
Sort
View
MOBIHOC
2003
ACM
14 years 7 months ago
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
Jiejun Kong, Xiaoyan Hong
GLOBECOM
2007
IEEE
14 years 1 months ago
A Novel Distributed Scheduling Algorithm for Wireless Mesh Networks
— Wireless multi-hop, mesh networks are being considered as a candidate to backhaul data traffic from access networks to the wired Internet. These mesh networks are referred to a...
Yun Hou, Kin K. Leung
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
13 years 11 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
CONEXT
2008
ACM
13 years 9 months ago
AS alliance: cooperatively improving resilience of intra-alliance communication
The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowlyconverging route calculation. This paper proposes a novel approa...
Yuichiro Hei, Akihiro Nakao, Toru Hasegawa, Tomohi...
MOBICOM
1999
ACM
13 years 11 months ago
Scenario-Based Performance Analysis of Routing Protocols for Mobile ad-hoc Networks
This study is a comparison of three routing protocols proposed for wireless mobile ad-hoc networks. The protocols are: Destination Sequenced Distance Vector (DSDV), Ad-hoc On dema...
Per Johansson, Tony Larsson, Nicklas Hedman, Barto...