In this talk I describe Beacon Vector Routing (BVR), a practical and scalable technique for routing in wireless sensor networks. We assign coordinates to nodes based on the vector of distances (hop count) to a small set of beacons, and then defines a distance metric on these coordinates. Packets are routed greedily, being forwarded to the next hop that is the closest (according to this beacon vector distance metric) to the destination. I show some results of the evaluation through both simulation and a prototype implementation on motes.