Published November 2002
| Published
Book Section - Chapter
Open
Scheduling algorithms for wireless ad-hoc sensor networks
- Creators
- Florens, Cédric
- McEliece, Robert
Chicago
Abstract
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.
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.Attached Files
Published - FLOglobecom02.pdf
Files
FLOglobecom02.pdf
Files
(365.6 kB)
Name | Size | Download all |
---|---|---|
md5:c52d6dcdeb093c7b7a9fcac61f39b710
|
365.6 kB | Preview Download |
Additional details
- Eprint ID
- 27577
- Resolver ID
- CaltechAUTHORS:20111102-092635109
- Created
-
2011-11-04Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field