A Small-World Routing Protocol for Wireless Sensor Networks

In this work, we propose a new routing protocol-the small-world routing protocol. With the idea originating from the small-world theory, the proposed protocol finds paths between the queries and events through recurrent propagations of weak and strong links. The operation of the protocol is simple and does not require much computational power. We evaluate the performance of the proposed protocol through extensive simulations. The results indicate that the proposed protocol, when compared to rumor routing protocol, can find much shorter paths (and thus lower power consumption during data delivery) with much higher successful rate.