Literature Database Entry

dressler2015protocol


Falko Dressler, Bastian Bloessl, Martin Hierold, Chia-Yu Hsieh, Thorsten Nowak, Robert Weigel and Alexander Koelpin, "Protocol Design for Ultra-Low Power Wake-Up Systems for Tracking Bats in the Wild," Proceedings of IEEE International Conference on Communications (ICC 2015), London, UK, June 2015, pp. 6345-6350.

Abstract

We present a novel concept for a wake-up system based ultra-low power communication protocol for sensor net- works. The main application field is monitoring contacts and even tracks of bats in the wild. Our sensor nodes can weigh at most 2g out of which 1g remains for the battery. We investigate a novel communication protocol design applicable to these systems and also showing great potentials for other ultra- low power sensor networks. In particular, we investigate the bat to ground communication by combining duty cycling with a multi-stage wake-up receiver. We employ Binary Offset Carrier (BOC) modulated signals that allow to accurately localize and track the bats while transmitting data in parallel. In a first step, we evaluated the conceptual design using a software-defined radio system to demonstrate the feasibility of the protocol design.

Quick access

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

Contact

Falko Dressler
Bastian Bloessl
Martin Hierold
Chia-Yu Hsieh
Thorsten Nowak
Robert Weigel
Alexander Koelpin

BibTeX reference

@inproceedings{dressler2015protocol,
    author = {Dressler, Falko and Bloessl, Bastian and Hierold, Martin and Hsieh, Chia-Yu and Nowak, Thorsten and Weigel, Robert and Koelpin, Alexander},
    title = {{Protocol Design for Ultra-Low Power Wake-Up Systems for Tracking Bats in the Wild}},
    booktitle = {IEEE International Conference on Communications (ICC 2015)},
    pages = {6345-6350},
    year = {2015},
    month = {June},
    address = {London, UK},
    publisher = {IEEE},
    doi = {10.1109/ICC.2015.7249335},
   }
   
   

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 proceeedings 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.