A Caltech Library Service

Scheduling algorithms for wireless ad-hoc sensor networks

Florens, Cédric and McEliece, Robert (2002) Scheduling algorithms for wireless ad-hoc sensor networks. In: GLOBECOM'02: IEEE Global Telecommunications Conference. IEEE , Piscataway, NJ, pp. 6-10. ISBN 0-7803-7632-3.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We define a simple discrete mathematical model for wireless ad-hoc sensor networks and study the problems of data distribution and data collection which arise in those networks. We show how those tasks can be optimally performed on tree sensor networks that use directional antennas. Furthermore we compare the performance of a network equipped with directional antenna elements with one equipped with omnidirectional antenna elements and show the former outperforms the latter by 50% at most on a line network.

Item Type:Book Section
Related URLs:
URLURL TypeDescription DOIArticle
Additional Information:© 2002 IEEE. Issue Date: 17-21 Nov. 2002. Date of Current Version: 26 March 2003. The authors would like to acknowledge the suggestions of Jeremy Thorpe.
Record Number:CaltechAUTHORS:20111102-092635109
Persistent URL:
Official Citation:Florens, C.; McEliece, R.; , "Scheduling algorithms for wireless ad-hoc sensor networks," Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE , vol.1, no., pp. 6- 10 vol.1, 17-21 Nov. 2002 doi: 10.1109/GLOCOM.2002.1188031 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:27577
Deposited By: Tony Diaz
Deposited On:04 Nov 2011 16:07
Last Modified:09 Nov 2021 16:49

Repository Staff Only: item control page