Multi-Hop Deterministic Cluster Routing in Wireless Sensor Networks

We investigate the effects of applying multi-hop forwarding to deterministic cluster routing on energy efficiency. The base station node constructs a deterministic multi-hop routing tree by comparing energy expenses between direct single-hop forwarding and multi-hop relaying. Considering the whole-path energy expense for multi-hop routing, we adopt a dynamic programming to achieve energy efficiency based on global optimization. Our deterministic multi-hop relaying improves existing deterministic cluster routing in terms of network lifespan, which is shown by simulations.