169 search results - page 12 / 34 » A Heuristic Routing Mechanism Using a New Addressing Scheme |
160
click to vote
ADHOCNOW
2005
Springer
15 years 11 months ago
2005
Springer
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
179
click to vote
MOBIHOC
2005
ACM
16 years 5 months ago
2005
ACM
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
160
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
206
click to vote
CN
2004
15 years 5 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
226
click to vote
SIGCOMM
1997
ACM
15 years 10 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...