A Self-Adaptive and Energy Efficient Routing Approach for Wireless Sensor Network

This paper proposes a self-adaptive and energy efficient routing approach for a wireless sensor network. In our approach, every sensor node maintains a table of neighbor nodes´ attributes, including energy left, least hop count toward sink node and current state, a sensor node chooses neighbor nodes as data relay nodes according to energy left, hop count and failure rate factors, and a sensor node sleeps when idle for saving energy. In order to guarantee the QoS of the whole network, acknowledgement and retry mechanism are used to make sure data is sent successfully. Furthermore, a sink node collects and evaluates failure rate of the network regularly to support slow mobility. When the failure rate is above the threshold that is determined by different application situation, the network topology will be rebuilt. The simulation experiment shows that our adaptive algorithm is scalable and efficient.