Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2008 | Volume: 7 | Issue: 4 | Page No.: 694-697
DOI: 10.3923/itj.2008.694.697
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

A Dynamic Clustering-Based Routing Algorithm for Wireless Senor Networks

Kai Zhou, Limin Meng, Zhijiang Xu, Gang Li and Jingyu Hua

Abstract:
Wireless sensor networks (WSN) is an energy limited system, thus this study presents an energy-aware quality of service (QoS) routing algorithm for it, which can also run efficiently with best-effort traffic. Furthermore, our work differs from existing algorithms in two ways: (1) We improve the first order energy consumption model with dynamic clustering; (2) We 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.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    A Dependable Model for Attaining Maximum Authentication Security Procedure in a Grid Based Environment
  •    UDCA: Energy Optimization in Wireless Sensor Networks Using Uniform Distributed Clustering Algorithms
  •    An Energy Equilibrium Routing Algorithm Based on Cluster-head Prediction for Wireless Sensor Networks
How to cite this article:

Kai Zhou, Limin Meng, Zhijiang Xu, Gang Li and Jingyu Hua, 2008. A Dynamic Clustering-Based Routing Algorithm for Wireless Senor Networks. Information Technology Journal, 7: 694-697.

DOI: 10.3923/itj.2008.694.697

URL: https://scialert.net/abstract/?doi=itj.2008.694.697

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom