Grid-based autonomous geographic routing in wireless sensor networks

In this paper, a grid-base autonomous geographic routing is proposed to decrease end-to-end delay and improve network capability for wireless sensor networks. After numbering grids in sequence, every grid has a unique ID. In this case, any node can utilize local decision to figure out which neighboring grid is closest to the center nodes. Since it is not needed to establish a routing in advance, this algorithm is very suitable for dynamic networks, real-time traffics and burst communications. By Matlab and Ns-2 simulation, the novel routing algorithm exhibits excellent performance in packet delivery fraction, end-to-end delay, protocol overhead, and path length.