An energy-balanced routing protocol with greedy forwarding for WSNs in cropland
Siyu Li, Hongju Gao, Dan Wu · 2016
For wireless sensor networks in wide-area cropland environments, the routing protocol would be optimal if it is scalable for wide network coverage, energy-efficient for long network lifetime, and adaptive with frequent topology changes. In this paper, an Energy-Balanced, Greedy forwarding Routing (EBGR) protocol was proposed based on the geographical routing protocols to achieve the balanced energy consumption of routing paths, while maintaining good efficiency and scalability for a hierarchical wireless sensor network. It uses remaining hop counts instead of Euclidean distance in traditional greedy forwarding mechanism, combing with the residual energy levels of nodes, to establish the path between the origin node and the sink node. Simulation results show that compared with GPSR (Greedy Perimeter Stateless Routing) and GEAR (Geographical and Energy-Aware Routing), EBGR has longer network lifetime, and longer network latency that is still well acceptable for applications in wide-area agricultural environments. The computational complexity of EBGR is less than O(n) based on theoretical analysis, which makes it easy to be implemented on the WSN nodes with limited computing capacity.