A Chain-based Clustering Routing Algorithm In Wireless Sensor Network

Wireless sensor network, which combines sensor, embedded system, distributed processing and wireless communication technology, is a grand-new information retrieving and processing technology. Its routing algorithm is different from traditional wire network and ad hoc network due to energy constraint of sensor nodes. Therefore, research on routing algorithm that can reduce transmission delay, save energy and extend the whole network lifetime has become of great importance to improve network performance. The main contributions and novelty of this dissertation are:(1) Analyze and conclude the characteristics of cluster-based routing algorithm LEACH and chain-based routing algorithm PEGASIS and give out the related improvement methodology.(2) Propose a chain-based clustering routing algorithm CBC based on the advantages of LEACH and PEGASIS. And with the second order radio model,this article theoretically analyze that CBC outperforms LEACH and PEGASIS on the (energy delay) per round metrics. In the end, The SWAN stimulation results testify the former theory analysis and show that in a 50m 50m sensor network with 100 randomly deployed nodes, CBC routing algorithm outperforms LEACH by 74% and PEGASIS by 72%. And in a 100m 0m sensor network with 100 randomly deployed nodes, CBC routing algorithm outperforms LEACH by 77.9% and PEGASIS by 66.2%.(3) Apply CBC algorithm to the water-electricity degree collection Scenario and analyze the practical flow and good effects in the specified scenario.