Paper
26 May 2005 A cluster-based routing algorithm for wireless sensor networks
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xin-Ming Huang and Jing Ma "A cluster-based routing algorithm for wireless sensor networks", Proc. SPIE 5820, Defense Transformation and Network-Centric Systems, (26 May 2005); https://doi.org/10.1117/12.604266
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensor networks

Sensors

Nomenclature

Cardiovascular magnetic resonance imaging

Head

Algorithm development

Tolerancing

Back to Top