TU Berlin

Main document

Literature Database Entry


Benjamin Gröbner, "Effizienzbetrachtung von Peer-to-Peer-Techniken in drahtlosen Sensornetzen," Master's Thesis, Department of Computer Science, Friedrich–Alexander University of Erlangen–Nuremberg (FAU), March 2007. (Advisors: Abdalkarim Awad and Falko Dressler)


Without doubt peer-to-peer systems have reached a very important relevance for many different applications on the internet in the last years. But apart of there, the use of peer-to-peer techniques has not been specifically analysed so far in the importance winning field of wireless and mobile communication networks, with often explicit less available resources of computing power, memory capacity and low data transfer rates for the communication. This is however required to survey the applicability of peer-to-peer systems for potential applications even under such terms. For this purpose different structured peer-to-peer systems like Chord, Pastry or Kademlia, which are all based on distributed hash tables, were closely examined and finally a simulation model of Chord in a realistic wireless network was created. The OMNeT++ environment for discrete event simulation was used there, whereas the implementation of Chord was realised in C++ as a module for OMNeT++. Different scenarios of networks were so verified and analysed for appearing latencies, loss ratios, fairness and utilisation with regard to variable parameters. While the applicability in networks with about 50 nodes was no problem, bad scalability as a result of heavy load with obvious larger networks was discovered. This attributes not only to Chord alone, but also to load created by routing and affords altogether opportunities for potential improvements.

Quick access

BibTeX BibTeX


Benjamin Gröbner

BibTeX reference

    author = {Gr{\"{o}}bner, Benjamin},
    title = {{Effizienzbetrachtung von Peer-to-Peer-Techniken in drahtlosen Sensornetzen}},
    advisor = {Awad, Abdalkarim and Dressler, Falko},
    institution = {Department of Computer Science},
    location = {Erlangen, Germany},
    month = {3},
    school = {Friedrich--Alexander University of Erlangen--Nuremberg (FAU)},
    type = {Master's Thesis},
    year = {2007},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.