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
%0 Generic
%1 chord
%A Kevin, George Porter
%A Lai, Kevin
%A Stoica, Ion
%A Condit, Jeremy
%D 2002
%K imported
%T The Chord Ad-hoc Routing Protocol
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.7593; http://www.cs.berkeley.edu/~gporter/cs268/carp/carp.ps
%X 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
@misc{chord,
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},
added-at = {2011-02-02T10:47:44.000+0100},
author = {Kevin, George Porter and Lai, Kevin and Stoica, Ion and Condit, Jeremy},
bibsource = {OAI-PMH server at citeseerx.ist.psu.edu},
biburl = {https://www.bibsonomy.org/bibtex/256b469f6a62ff0b34744d7ceefa24af3/hannesm},
contributor = {CiteSeerX},
interhash = {1d3838f425df19e0d95507bce2436fa9},
intrahash = {56b469f6a62ff0b34744d7ceefa24af3},
keywords = {imported},
language = {en},
oai = {oai:CiteSeerXPSU:10.1.1.9.7593},
relation = {10.1.1.105.3673; 10.1.1.19.8434; 10.1.1.132.7416;
10.1.1.113.555; 10.1.1.112.2772; 10.1.1.111.1818;
10.1.1.40.9666; 10.1.1.18.9834; 10.1.1.43.8962},
rights = {Metadata may be used without restrictions as long as
the oai identifier remains attached to it.},
subject = {Categories and Subject Descriptors; D.2.7 [Mobility;
Routing and Mobility General Terms; Chord; Spanning
Tree; Ad-hoc Networks; Mobile routing Additional Key
Words and Phrases; Sensor networks; Ad-hoc routing
protocols; Distributed Hash Tables},
timestamp = {2011-02-02T10:47:46.000+0100},
title = {The Chord Ad-hoc Routing Protocol},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.7593; http://www.cs.berkeley.edu/~gporter/cs268/carp/carp.ps},
year = 2002
}