Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A protocol independent energy saving technique for mobile ad hoc networks
International Journal of High Performance Computing and Networking
| Hi-index | 0.00 |
The operation of sensor networks places special requirements on routing algorithms. These requirements stem from the unique nature of these networks. For example, the algorithm needs to be data-oriented and it should impose the smallest possible overhead on the resource-constrained nodes of the network. It has been long claimed that algorithms designed for mobile ad hoc networks (MANET) should not be considered for sensor networks for several reasons. Most important of these reasons is their heavy operation overhead. In this study, we examine this claim by comparing two of the sensor network specific algorithms, directed diffusion and TTDD, with two MANET algorithms, AODV and OLSR which belong to the reactive and proactive routing categories, respectively. We run experiments with realistic sensor network scenarios. We show that MANET protocols perform significantly better than their sensor-specific counterparts. Finally, we offer suggestions for future research based on the results of our study.