Wireless sensor nodes can organize themselves after deployment in a large scale ad hoc network topology. Some traditional Ad hoc routing protocols do not take into account that a sensor node has limited capacities, e.g. energy. Therefore, they try to perform the sensing task regardless of the maximum hops and duration it takes. In wireless sensor networks (WSNs), this routing solution is unrealistic; therefore we derive from the distributed hash table (DHT) an overlay routing for WSNs called ScatterDHT as a routing solution, develop a prototype implementation and apply it over ScatterWeb sensor nodes. This paper describes the ScatterDHT overlay routing protocol and figures out the performance evaluation of the implemented prototype over real-world sensor nodes regarding to two metrics (a) memory utilization and (b) power consumption.