Literature Database Entry

mutschlechner2014reliable


Margit Mutschlechner, Florian Klingler, Felix Erlacher, Florian Hagenauer, Marcel Kiessling and Falko Dressler, "Reliable Communication using Erasure Codes for Monitoring Bats in the Wild," Proceedings of 33rd IEEE Conference on Computer Communications (INFOCOM 2014), Poster Session, Toronto, Canada, April 2014, pp. 189–190.


Abstract

We show the feasibility of using Erasure Codes (ECs) for reliable communication in strongly energy-constrained sensor network applications. In particular, we aim at observing group dynamics of bats in their natural habitat. Bats are to be equipped with ultra-light sensor nodes to continuously monitor contacts between each other and to track their flights. This data needs to be uploaded to a stationary ground network whenever a bat comes into communication range. As the quality of this communication link is fluctuating, reliability improvement techniques need to be implemented. ECs allow to enhance the reliability of data transmissions with only a marginal overhead. After showing the improvements using ECs in simulation, we now implemented the full system using a prototype platform to study the general feasibility in a more realistic environment.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Margit Mutschlechner
Florian Klingler
Felix Erlacher
Florian Hagenauer
Marcel Kiessling
Falko Dressler

BibTeX reference

@inproceedings{mutschlechner2014reliable,
    author = {Mutschlechner, Margit and Klingler, Florian and Erlacher, Felix and Hagenauer, Florian and Kiessling, Marcel and Dressler, Falko},
    doi = {10.1109/INFCOMW.2014.6849219},
    title = {{Reliable Communication using Erasure Codes for Monitoring Bats in the Wild}},
    pages = {189--190},
    publisher = {IEEE},
    address = {Toronto, Canada},
    booktitle = {33rd IEEE Conference on Computer Communications (INFOCOM 2014), Poster Session},
    month = {4},
    year = {2014},
   }
   
   

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-29