Research On Heterogeneous Network Clustering Routing Algorithm For Wireless Sensor

In order to achieve balanced network energy consumption and prolong the network lifetime, clustering routing, an important approach in topology control, has been attracted much attention in the literature. In a wireless sensor network with cluster routing, each sensor node periodically plays a role as a cluster head, and transmits the data gathered from its managed cluster members directly to a base station far away.In this paper, we first introduce the wireless sensor network, including the overview, its heterogeneity and clustering routing algorithm, and then introduce LEACH and SEP algorithm in homogeneous network and energy heterogeneous network, respectively, and compare their performance by simulation. The main work of this paper can be viewed as an improvement or generalization of these two existing algorithms, and include the following two aspects.(1) For a power heterogeneous network model which considers that sensor nodes may have different RF power, we proposed a P-LEACH algorithm aiming to balance the energy consumption on heterogeneous nodes. Simulation results show that the algorithm significantly improve the lifetime and throughput performance of the network, compared with LEACH.(2) For a channel access heterogeneous network mode which considers that sensor nodes may have different channel access scheme, we propose an A-LEACH algorithm based on collisions and retransmissions, and investigate its performance by simulation.