Sciweavers

Share
GI
2004
Springer

On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios

12 years 7 months ago
On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics – namely scalability, flexibility, and resilience – they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concerning the applicability of Distributed Hash Tables in mobile ad-hoc scenarios: Do new problems arise when both technologies are used together? – Are there any synergy effects when both technologies are combined? – Are the results and assumptions, made for the infrastructural Internet, still true if a mobile ad-hoc network is used instead? – In this paper, we discuss these and further questions and offer some solutions for using Distributed Hash Tables in ad-hoc networks.
Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where GI
Authors Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon Rieche, Klaus Wehrle
Comments (0)
books