Reading PAGE

Peer Evaluation activity

Downloads 11
Views 38

Total impact ?

    Send a

    Klaus has...

    Trusted 0
    Reviewed 0
    Emailed 0
    Shared/re-used 0
    Discussed 0
    Invited 0
    Collected 0

     

    This was brought to you by:

    block this user Klaus Wehrle Trusted member

    Professor

    Computer Science, RWTH Aachen University, Aachen

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

    Export to Mendeley

    Recently, Distributed Hash Tables evolved to a preferred approach for de- centralized data management in widely distributed systems. Due to their crucial char- acteristics namely scalability, flexibility, and resilience they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concern- ing 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 ef- fects 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.

    Oh la laClose

    Your session has expired but don’t worry, your message
    has been saved.Please log in and we’ll bring you back
    to this page. You’ll just need to click “Send”.

    Your evaluation is of great value to our authors and readers. Many thanks for your time.

    Review Close

    Short review
    Select a comment
    Select a grade
    You and the author
    Anonymity My review is anonymous( Log in  or  Register )
    publish
    Close

    When you're done, click "publish"

    Only blue fields are mandatory.

    Relation to the author*
    Overall Comment*
    Anonymity* My review is anonymous( Log in  or  Register )
     

    Focus & Objectives*

    Have the objectives and the central topic been clearly introduced?

    Novelty & Originality*

    Do you consider this work to be an interesting contribution to knowledge?

    Arrangement, Transition and Logic

    Are the different sections of this work well arranged and distributed?

    Methodology & Results

    Is the author's methodology relevant to both the objectives and the results?

    Data Settings & Figures

    Were tables and figures appropriate and well conceived?

    References and bibliography

    Is this work well documented and has the bibliography been properly established?

    Writing

    Is this work well written, checked and edited?

    Write Your Review (you can paste text as well)
    Please be civil and constructive. Thank you.


    Grade (optional, N/A by default)

    N/A 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6 6.5 7 7.5 8 8.5 9 9.5 10
    Close

    Your mailing list is currently empty.
    It will build up as you send messages
    and links to your peers.

     No one besides you has access to this list.
    Close
    Enter the e-mail addresses of your recipients in the box below.  Note: Peer Evaluation will NOT store these email addresses   log in
    Your recipients

    Your message:

    Your email : Your email address will not be stored or shared with others.

    Your message has been sent.

    Description

    Title : On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios
    Author(s) : Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon Rieche, Klaus Wehrle
    Abstract : Recently, Distributed Hash Tables evolved to a preferred approach for de- centralized data management in widely distributed systems. Due to their crucial char- acteristics namely scalability, flexibility, and resilience they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concern- ing 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 ef- fects 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.
    Subject : unspecified
    Area : Other
    Language : English
    Year : 2004

    Affiliations Computer Science, RWTH Aachen University, Aachen
    Journal : Proceedings of the 34Jahrestagung der Gesellschaft fur Informati
    Volume : 2
    Publisher : Citeseer
    Pages : 239–244
    Url : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.59.5838&rep=rep1&type=pdf

    Leave a comment

    This contribution has not been reviewed yet. review?

    You may receive the Trusted member label after :

    • Reviewing 10 uploads, whatever the media type.
    • Being trusted by 10 peers.
    • If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.

    Does this seem fair to you? Please make your suggestions.

    Please select an affiliation to sign your evaluation:

    Cancel Evaluation Save

    Please select an affiliation:

    Cancel   Save

    Klaus's Peer Evaluation activity

    Downloads 11
    Views 38

    Klaus has...

    Trusted 0
    Reviewed 0
    Emailed 0
    Shared/re-used 0
    Discussed 0
    Invited 0
    Collected 0
    Invite this peer to...
    Title
    Start date (dd/mm/aaaa)
    Location
    URL
    Message
    send
    Close

    Full Text request

    Your request will be sent.

    Please enter your email address to be notified
    when this article becomes available

    Your email


     
    Your email address will not be shared or spammed.