Serried Forwarder Routing (SFR): A Query-Driven Routing Algorithm for a Wireless Sensor Network with High Density of Nodes

In a wireless sensor network with high density of nodes, for finding short routes to the sensor nodes satisfying the route request query committed by any sensor node while keeping the route discovery traffic to a low level, a query-driven routing algorithm called Serried Forwarder Routing (SFR) is proposed. SFR introduces a kind of quasi-unicasting mechanism for reducing the unnecessary route discovery traffic, and in virtue of the historical route searching results stored in the path table of each sensor node, SFR can find relatively short paths to the nodes satisfying the route request. Experiments show that in a wireless sensor network with high density of nodes, SFR greatly reduces the unnecessary route discovery traffic in comparison with flooding-based routing algorithms.