Literature Database Entry

dressler2008authenticated


Falko Dressler, "Authenticated Reliable and Semi-reliable Communication in Wireless Sensor Networks," International Journal of Network Security (IJNS), vol. 7 (1), pp. 62–69, July 2008.


Abstract

Secure communication in wireless ad hoc sensor networks is a major research concern in the networking community. Especially the few available resources in terms of processing power and available memory are challenging factors. Additionally, a typical characteristic of wireless ad hoc sensor networks is the error-proneness and, therefore, the unreliability of communication paths. In this paper we describe a new approach and an according protocol for usage in ad hoc networks that provides reliable as well as semi-reliable communication services in combination with security services. Thus, the proposed methodology allows to ensure data integrity and message authentication. The main aspects during the development were the limitations of typical sensor nodes used in ad hoc networks in terms of available storage, processing power, and energy. Our solution provides the capability of acknowledging correct receptions as well as the check of data integrity and message authentication in a single step. Therefore, a low overhead solution applicable to wireless sensor networks was created providing all the mentioned communication goals.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Falko Dressler

BibTeX reference

@article{dressler2008authenticated,
    author = {Dressler, Falko},
    title = {{Authenticated Reliable and Semi-reliable Communication in Wireless Sensor Networks}},
    pages = {62--69},
    journal = {International Journal of Network Security (IJNS)},
    publisher = {International Society for Horticultural Science (ISHS)},
    month = {7},
    number = {1},
    volume = {7},
    year = {2008},
   }
   
   

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.

Last modified: 2024-03-28