| C edric Florens and Robert McEliece, "Scheduling algorithms for wireless ad-hoc sensor networks," in Proceedings of the IEEE Global Telecommunications Conference 2002. |
....California, USA E mail: florens, rjm systems.caltech.edu 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 [1] 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 ....
....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 [1]. I. INTRODUCTION The advancement of Very Large Scale Integration (VLSI) technology has contributed much to the development of micro sensor systems. Such systems can combine signal processing, data storage, wireless communication capabilities and energy sources on a single chip. Possibly ....
[Article contains additional citation context not shown here]
C. Florens and R. McEliece, "Scheduling algorithms for wireless ad-hoc sensor networks.," Proceedings of the IEEE Global Telecommunications Conference 2002.
No context found.
C edric Florens and Robert McEliece, "Scheduling algorithms for wireless ad-hoc sensor networks," in Proceedings of the IEEE Global Telecommunications Conference 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC