Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 2003 | Published
Book Section - Chapter Open

Packets distribution algorithms for sensor networks

Abstract

In this paper, we study, via simple discrete mathematical models, the problems of data distribution and data collection in wireless sensor networks. The work that follows continues the work presented by the authors in (C. Florens et al., 2002) where the focus was on sensor networks equipped with unidirectional antenna elements. Here we shift our interest to networks equipped with omnidirectional antenna elements. In particular we show how the data distribution and collection tasks can be performed optimally (with respect to time) on tree networks and give the corresponding time performances of those strategies. We also present a strategy for general graph networks that performs within a factor of 3 of the optimal performance. Finally we compare the performance of a network equipped with omnidirectional antenna elements with one equipped with unidirectional antenna elements. We show the latter outperforms the former by 33% at most in tree networks. To that purpose we included relevant results on directional antenna sensor networks, partly obtained in (C.Florens et al., 2002).

Additional Information

© 2003 IEEE. Reprinted with permission. Posted online: 2003-07-09. This work was performed at Caltech and supported by The Lee Center for Networking.

Attached Files

Published - FLOinfocom03.pdf

Files

FLOinfocom03.pdf
Files (396.2 kB)
Name Size Download all
md5:42238524b9d20ee9dd9f4bf969bfaf79
396.2 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023