Literature Database Entry

kerschbaum2007erstellung


Sven Kerschbaum, "Erstellung eines Simulationsmodells für den RAC (reliable authenticated communication) Algorithmus für sichere Kommunikation in Ad-Hoc Netzwerken," Master's Thesis (Diplomarbeit), Department of Computer Sciences, University of Erlangen-Nuremberg, January 2007. (Advisor: Falko Dressler)

Abstract

In the last years ad hoc networks increasingly gained in popularity and importance. A typical characteristic of ad hoc networks is the error-proneness and, therefore, the unreliability of communication paths. Furthermore typical ad hoc network nodes merely possess limited resources such as storage, processing power and energy. Consequently ad hoc networks bring numerous new challenges for transport layer protocols along. This thesis deals with secure and reliable communication in general and concentrates in particular on the RAC algorithm which was developed by the Department of Computer Science 7 of the University of Erlangen-Nuremberg. It has the goal of implementing and afterwards of examining the RAC algorithm. For this purpose a simulation model using the simulation environment OMNeT++ was developed and appropriate test models were defined. Subsequently, the performance of the RAC algorithm and the effects on the entire ad hoc network were analyzed and evaluated. The measured results demonstrated that the RAC algorithm is stingy in terms of the requirements to resources of nodes. Additionally the RAC algorithm ensures the data integrity and message authentication. Therefore the RAC algorithm is particularly well suitable for the employment in wireless ad hoc networks.

Quick access

BibTeX BibTeX

Contact

Sven Kerschbaum

BibTeX reference

@phdthesis{kerschbaum2007erstellung,
    author = {Kerschbaum, Sven},
    advisor = {Dressler, Falko},
    title = {{Erstellung eines Simulationsmodells f{\"{u}}r den RAC (reliable authenticated communication) Algorithmus f{\"{u}}r sichere Kommunikation in Ad-Hoc Netzwerken}},
    institution = {Department of Computer Sciences},
    year = {2007},
    month = {January},
    school = {University of Erlangen-Nuremberg},
    type = {Master's Thesis (Diplomarbeit)},
   }
   
   

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.