This hotspot issue also appears in many other energy efficient routing algorithms or protocols like those described in [6�C8], etc.To effectively alleviate the hotspot problem, we need to balance energy consumption among all sensors by considering factors like manner of transmission, traffic patterns, hop number and distance, EPZ-5676 DOT1L etc. Based on our previous work in [5], we find that the final residual energy is still not well balanced when the first node dies, even though the energy consumption is largely reduced and the network lifetime is extended. The main reason is that in [5] we tried to minimize the total energy consumption on each route so that some nodes close to sink node are overused, which causes a hotspot problem.

In order to alleviate the hotspot problem, we study the energy consumption under different energy and traffic models and aim to let all sensor nodes consume their energy at similar rate. In other words, we are not trying to Min(��i=1nEi) for the n-hop route but rather to equalize E1 �� Inhibitors,Modulators,Libraries E2 �� �� En for the involved intermediate n nodes with proper individual distance di. Here, Ei is the energy consumption for each individual node.The main objective in this paper is to prolong network lifetime via an energy efficient and balancing routing algorithm and our contributions are listed as below:Given the source to sink node distance d, the optimal multi-hop number and the corresponding individual distance di can be determined based on the theoretical analysis of energy consumption under event based and time based traffic model.

Based on (1), a Distance-based Energy Aware Routing (DEAR) algorithm is proposed which consists of route setup and route maintenance phases. The distance factor Inhibitors,Modulators,Libraries is treated as the first parameter during the routing process and the residual energy factor is the second parameter to be considered. The DEAR algorithm can balance energy Inhibitors,Modulators,Libraries consumption for all sensor nodes and consequently prolong the network lifetime.Simulation results and comparisons are provided with discussion details.The rest of the paper is organized as follows. Section 2 introduces some related work of energy efficient routing algorithms. In Section 3 we present relevant network, traffic and energy models. In Section 4, the details of our DEAR algorithm are described based Inhibitors,Modulators,Libraries the theoretical deduction and numerical analysis under different models.

Performance evaluation and comparison are given in Section 5 and Section 6 concludes this paper.2.?Related WorkUp to now, many techniques have been Batimastat proposed to improve the selleck Brefeldin A energy efficiency in different layers of WSNs. For example, the technique of coding in the PHY layer, the scheduling mechanism of ��active/idle/sleeping�� in the MAC layer as well as cross-layer optimization methods can reduce energy consumption to a certain degree. In this paper, we focus on energy efficient routing in the network layer.