[P2PSIP] comments on using DHTs in wireless ad hoc networks

Hi all,
In "draft-bryan-p2psip-app-scenarios-00.txt", section 4.2 and 4.2.1.
identifies  "Ad-Hoc and Ephemeral Groups" application scenarios, and
can be read:

"Examples of such environment are isolated wireless ad-hoc networks
with no connection to the Internet or ad-hoc networks with limited
connectivity to the Internet in situations like outdoor public events,
emergencies, and battlefields."

In "draft-ietf-p2psip-concepts-01", section 5.1 describes "The
Distributed Database Function", and can be read:

"A class of algorithms known as Distributed Hash Tables
<http://en.wikipedia.org/wiki/P2P_overlay> are one way to implement
the Distributed Database.  In particular, both the Chord and Bamboo
algorithms have been suggested as good choices for the distributed
database algorithm.  However, no decision has been taken so far."

Problem of implementing a distributed hash table in wireless ad hoc
networks is well-known. Scarceness of resources and node mobility turn
routing into a problem.

Is there a consensus on using the same type of "Distributed Database
Function" (e.g. DHT) in all application scenarios? Are other solutions
or DHT adaptations (e.g. CHR) considered depending on application
scenario requirements?

Thanks and sorry if this was already discussed,
-- 
Victor Pascual Ávila