Share Email Print

Proceedings Paper

A cluster-based routing algorithm for wireless sensor networks
Author(s): Xin-Ming Huang; Jing Ma
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

While most of the routing protocols of wireless sensor networks try to minimize the energy consumptions to extend the system life-time, it is also critical to design a protocol that is scalable and fault-tolerant. In this paper, we introduce a clusterhead multihop routing algorithm for meshed wireless sensor networks. Each identified junction node in the mesh network is selected as a clusterhead. The routing decisions are only made at the clusterheads. A simplified link-state routing algorithm is used to find the shortest routing path among all available clusterheads in the network. This algorithm exploits the feasibility and fault tolerance of routing protocol, while coping with the severe energy constraint and the requirement for network scalability. Time division multiple access technique is employed in the medium access control layer for further reduction of energy consumption. Multiple-level cluster hierarchy approach is also discussed for more complicated meshed sensor networks.

Paper Details

Date Published: 26 May 2005
PDF: 9 pages
Proc. SPIE 5820, Defense Transformation and Network-Centric Systems, (26 May 2005); doi: 10.1117/12.604266
Show Author Affiliations
Xin-Ming Huang, Univ. of New Orleans (United States)
Jing Ma, Univ. of New Orleans (United States)

Published in SPIE Proceedings Vol. 5820:
Defense Transformation and Network-Centric Systems
Raja Suresh, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?