Minimum energy routing algorithms in multi-hop wireless networks

Abstract

Until now, many methods for reducing energy consumption in multi-hop wireless networks are proposed in the literature. But, there is few works about routing algorithms with explicit delay constraint and cross-layer optimization between the MAC layer and the network layer. Also, previous works do not consider the upper bound of the performance of the routing protocols mathematically, and the multi-rate capability of the physical (PHY) layer protocols. To solve the problems, we study and propose minimum energy routing algorithms for multi-hop wireless networks in this dissertation. We consider three different network environments. First, we propose a new routing algorithm for delay-constrained service in power-controlled multi-hop wireless access networks, on the assumption that the end-to-end packet transmission delay is proportional to the number of hops of a path. The proposed scheme does not require any modification of the MAC layer and outperforms Ad hoc On-demand Distance Vector (AODV) routing with respect to the average total consumed power and the average consumed power per node, while maintaining a similar average success rate. Moreover, the proposed scheme can support delay-sensitive traffic more efficiently than can AODV, and approximates the optimal solution by adjusting its parameters. Second, we state the necessity of cross-layer design for power-efficient routing in power-controlled multi-hop wireless networks, and propose new MAC and network layer algorithms. By using interactions between layers, the proposed scheme can approximate the optimal solution. Computer simulations show that our proposed scheme, Timer-based MAC+MCPR (Minimum Consumed Power Routing), outperforms CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance)+AODV and CSMA/CA+MCPR with respect to the average total consumed power and the average consumed power per node, while maintaining a similar average success rate. Moreover, it is scalable, since each node operates in...