Research Article
A Dynamic-Clustering Reactive Routing Algorithm for Wireless Sensor Networks
@INPROCEEDINGS{10.1109/CHINACOM.2006.344818, author={Bin Guo and Zhe Li and Yan Meng}, title={A Dynamic-Clustering Reactive Routing Algorithm for Wireless Sensor Networks}, proceedings={1st International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2007}, month={4}, keywords={}, doi={10.1109/CHINACOM.2006.344818} }- Bin Guo
Zhe Li
Yan Meng
Year: 2007
A Dynamic-Clustering Reactive Routing Algorithm for Wireless Sensor Networks
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344818
Abstract
The wireless sensor network is quite similar to neural network of human beings, which is a cluster of firmly related individual units and performs a special function. In this paper we propose a dynamic-clustering reactive routing algorithm based on neural structure (DCRR) according to the architecture and principle of neural network. The nodes in the network are driven by events. Temporary cluster-head is selected by nodes according to the similarity and isochronism of local on-the-spot data, then it is up to the temporary cluster-head to merge the data, by doing this the redundant messages are decreased efficiently as soon as possible. At the same time, we let the inspecting thresholds of each node change with data automatically. We compare the performance of DCRR with another reactive clustering algorithm, TEEN. The simulation results verify that the DCRR algorithm achieves significantly better balance in the battery power distribution and extends the network's lifetime considerably.
