Article in Proceedings INPROC-2007-01

BibliographyLachenmann, Andreas; Marrón, Pedro José; Minder, Daniel; Saukh, Olga; Gauger, Matthias; Rothermel, Kurt: Versatile Support for Efficient Neighborhood Data Sharing.
In: Langendoen, Koen (ed.); Voigt, Thiemo (ed.): Proceedings of the 4th European Conference on Wireless Sensor Networks (EWSN 2007).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
Lecture Notes in Computer Science; 4373, pp. 1-16, english.
Springer-Verlag, January 2007.
Article in Proceedings (Conference Paper).
CR-SchemaC.2.2 (Network Protocols)
C.3 (Special-Purpose and Application-Based Systems)
D.3.3 (Programming Language Constructs and Features)
Keywordswireless sensor networks; neighborhood data sharing; polite gossiping
Abstract

Many applications in wireless sensor networks rely on data from neighboring nodes. However, the effort for developing efficient solutions for sharing data in the neighborhood is often substantial. Therefore, we present a general-purpose algorithm for this task that makes use of the broadcast nature of radio transmission to reduce the number of packets. We have integrated this algorithm into TinyXXL, a programming language extension for data exchange. This combined system offers seamless support both for data exchange among the components of a single node and for efficient neighborhood data sharing. We show that compared to existing solutions, such as Hood, our approach further reduces the work of the application developer and provides greater efficiency.

Full text and
other links
PDF (345643 Bytes)
TinyCubus project
Springer LNCS
Copyright(c) Springer-Verlag Berlin Heidelberg 2007
Department(s)University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems
Project(s)TinyCubus
Entry dateDecember 19, 2006
   Publ. Institute   Publ. Computer Science