Scheduling algorithms for wireless ad-hoc sensor networks

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.