EconPapers    
Economics at your fingertips  
 

Infuse: A TDMA Based Data Dissemination Protocol for Sensor Networks

Sandeep S. Kulkarni and Mahesh Arumugam

International Journal of Distributed Sensor Networks, 2006, vol. 2, issue 1, 55-78

Abstract: Reliable dissemination of bulk data is one of the important problems in sensor networks. For example, programming or upgrading the software in sensors at run-time requires reliable dissemination of a new program across the network. In this paper, we present Infuse , a time division multiple access (TDMA) based reliable data dissemination protocol. Infuse takes two input parameters: the choice of the recovery algorithm (from one of two presented in this paper) to deal with unexpected channel errors (e.g., message corruption, varying signal strength), and whether a sensor should listen only to a subset of its neighbors to reduce the amount of active radio time. Based on these parameters, we obtain four possible versions of Infuse. We compare the performance of these versions to assist a designer in selecting the appropriate version based on the network characteristics. Furthermore, we demonstrate Infuse in the context of network programming.

Keywords: Data dissemination; Network programming; Time division multiple access (TDMA); Implicit acknowledgments; Sensor networks (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1080/15501320500330760 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:2:y:2006:i:1:p:55-78

DOI: 10.1080/15501320500330760

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().

 
Page updated 2025-03-19
Handle: RePEc:sae:intdis:v:2:y:2006:i:1:p:55-78