A cluster-based routine algorithm for wireless sensor networks

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 routine, decisions are only made at the clusterheads. A simplified link-state routine, algorithm is used to find the shortest routine, 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.