GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Parametric probabilistic sensor network routing
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A wireless sensor network For structural monitoring
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
| Hi-index | 0.00 |
Included in the performance goal of most wireless sensor network applications are both spatial coverage and extended network lifetime. Pure energy efficient routing protocols,such as Shortest Path, cannot satisfy this need, since sensor nodes along the data path may have their energy levels drained very quickly, leading to loss of spatial coverage. Motivated by this necessity to incorporate longevity in the design of routing protocols for sensor networks, we proposed a probabilistic routing protocol called Probabilistic Flowbased Spreading (PFS), in which the intermediate nodes forward packets with a probability based on neighboring nodes' traffic load. In this paper we propose evaluating our protocol under scenarios which are representative of some typical traffic patterns that are likely to be encountered by sensor networks. We also study the performance of another protocol for sensor networks, GPSR, under the same scenarios for comparison purposes. We use the metric Lifetime -- Packets Received in order to evaluate the performance of the protocols both in the space and the time domains, and we show that our protocol consistently outperforms GPSR in all scenarios, reaching at the highest double the performance of GPSR.