Along & across algorithm for routing events and queries in wireless sensor networks
Tat Wing Chim · 2005
In this paper, we investigate efficient strategies for routing events and queries in a wireless sensor network where energy is a major concern. Our along & across algorithm makes use of a hop tree structure. Event attributes are routed along hop levels while queries are routed across hop levels to seek for match. Location information is not assumed. Simulation results show that our algorithm yields much higher hitting probability between event attributes and queries than a previously proposed algorithm, rumor routing algorithm in a moderate-traffic environment. As a result, our algorithm consumes up to 72.6% less transmission overhead. As such, our along & across algorithm is sound and should be very useful to wireless sensor network developers.