An improved opportunistic routing protocol in ad-hoc network

In Ad-Hoc Network, Energy savings optimization becomes one of the major concerns as most nodes are equipped with the limited non-rechargeable battery power. In this paper, we focus on minimizing energy consumption and maximizing network lifetime for data relay in one-dimensional (1-D) queue network and the nodes which are not in forwarder set and which are behind forwarder set are taken as idle nodes. The principle of opportunistic routing theory is that multihop relay decision to optimize the network energy efficiency is made based on the differences among nodes, in terms of both their distance to sink and the residual energy of each other. Specifically, an Energy Saving via Opportunistic Routing algorithms designed to ensure minimum power cost during data relay and protect the nodes with relatively low residual energy. Simulations and real results show that the proposed solution can significantly improve the network performance on energy saving and wireless connectivity in comparison with other existing routing schemes.