Energy Efficient Clustering Algorithm with Direct Path Supports

Mona Shemshaki, Hadi Shahriar Shahhoseini · 2009

Wireless sensor networks are simple, high speed and inexpensive networks that include large number of sensors. These networks are able to monitor a parameter where the coverage is impossible via wired networks. Since clustering improves energy consumption, clustering algorithms aim at this improvement. In this paper, an energy efficient algorithm entitled EECDP (energy efficient clustering with direct paths) is presented for wireless sensor networks. EECDP employs the wireless sensor network's characteristics. Simulation results illustrate that network's lifetime has been optimized to 18.5% in clustered sensor networks.

Read the paper · More papers on PaperTik