A novel beaconless routing algorithm based on EBGR algorithm for wireless sensor networks

The purpose of energy-efficient beaconless geographic routing (EBGR) algorithm is to reduce power consumption in the network. But it cannot select the best relay node in all conditions. Also, in the EBGR algorithm, the relay nodes send their data after receiving them, which creates an overhead in the network and decrease spectral efficiency in the network. We introduce an improved method to improve the performance of the EBGR algorithm. In our proposed method, we have divided the space into several subspaces. Each node prioritises the data transmission to the node that is located beneath its own space and along the source-to-destination direction. In order to reduce the slag on the grid, we have also considered adaptive delay. The advantage of this method is that if the network is ideal, the data arrives with the least delay and if the network has a lot of overhead, the delay rate will also increase.