Abstract
This paper describes the Chord Ad-Hoc Routing
Protocol, which is a multi-hop, ad-hoc networking
protocol that provides the Chord Distributed Hash Table
(DHT) abstraction to the network. Nodes form a spanning
tree among themselves, which forms a cycle that becomes
the Chord overlay network. By coupling naming,
location, and routing, the CARP protocol provides
ecient data access for many types of applications, such
as sensor networks. The protocol is evaluated as an
ns-2 simulation, and results of that simulation are
discussed. Proposed optimisations and future work then
described
Users
Please
log in to take part in the discussion (add own reviews or comments).