A Dynamic Clustering-Based Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSN) have recently emerged as a hot research topic. One of the most important concerns for WSN is energy. To obtain long lifetime, one potential method is to use clustering algorithm. Moreover, WSN should meet various requirements for quality of service (QoS). Accordingly, this paper presents an energy-aware QoS routing algorithm for WSN, which can also run efficiently with best-effort traffic. Furthermore, our work differs from existing algorithms in two ways: (1) improve the first order energy consumption model with dynamic clustering; (2) use clustering to build the multi-objectives programming model to support QoS. Simulations and comparisons with some typical route algorithms show that our algorithm is robust and effective.