Design and Implementation of Routing Based on Minimum Hops

Based on the RF power of the node is finite, reducing the number of communication can reduce energy consumption of the node. We proposed an algorithm based on minimum hop path named ROMH. The routing path is easy to be found actively from sink node to target node with minimum hops, and optimal routing for query tasks on WSN or event-based real-time message response can be provided. Compared to the classic routing algorithms, ROMH has the least hops to reduce the number of communications, so it can cuts down energy consumption of communications observably. We test the routing algorithm in an actual network constructed by the TelosB nodes. The experiment result shows that ROMH is easy to implement, costs fewer resources, runs efficiently, and adapts to the changes of network topology well.