Literature Database Entry

dressler2006weighted


Falko Dressler, "Weighted Probabilistic Data Dissemination (WPDD)," University of Erlangen, Dept. of Computer Science 7, Technical Report, 05/06, December 2006.

Abstract

Most routing methods for wireless sensor networks (WSN) are based on general-purpose ad hoc routing techniques. Usually, on-demand path determination based on unambiguous addresses is used to control and manage the current network topology. In WSN, such address-based approaches often lead to severe problems due to several issues: node mobility, energy-saving long sleep-cycles due to infrequent message exchange, and the more general problem of dynamic addressing. Data-centric routing schemes such as flooding or gossiping solve these problems but may lead to congestion or starvation. In this paper, we propose a new data-centric forwarding technique, named weighted probabilistic data dissemination (WPDD), which is based on gossiping. In contrast to other proposals, this method includes an inherent adaptation to changing network conditions. Based on several priorities and probabilities, congestion control is supported as well as prioritized data communication. This paper outlines the working behavior of WPDD and its additional features. A simulation model was created to analyze the approach. The results promise an efficient deployment in different scenarios.

Quick access

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

Contact

Falko Dressler

BibTeX reference

@techreport{dressler2006weighted,
    author = {Dressler, Falko},
    title = {{Weighted Probabilistic Data Dissemination (WPDD)}},
    year = {2006},
    month = {December},
    institution = {University of Erlangen, Dept. of Computer Science 7},
    number = {05/06},
    type = {Technical Report},
   }
   
   

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.