Design of Layered and Heterogeneous Network Routing Algorithm for Field Observation Instruments

Field stations and observation systems in cold and arid areas are mostly distributed in harsh natural environments which lead to problems such as the poor real-time data collection, transmission and processing, lower accuracy of data and failure to form integrated network observation, etc. To solve these problems which severely restrict scientific monitoring and research in these areas, a Layered and Heterogeneous Clustering routing algorithm LHC is proposed for field observation instrument networks based on the classical clustering routing algorithm LEACH. First, the LHC algorithm adopts the mechanism of heterogeneous node energy to divide nodes into advanced nodes and normal nodes. The advanced nodes have more initial energy than normal nodes, which increases their probability to be elected as cluster heads (CHs). Then, a hierarchical structure is used to divide the network into several layers, each layer elects a fixed number of CHs, and the distribution of CHs is improved. Finally, by analyzing the influence of the residual energy of the node and the distance between the node and the base station (BS) of the network, the mechanism based on energy and distance factors is introduced into each round of CH election to improve the CH election method. In Matlab experiments, the improved LHC algorithm was compared with LEACH, SEP, and DEEC through analysis and comparison from the aspects of network life cycle, energy consumption and CH number. The experimental results show that the LHC algorithm has the advantages of uniform CH distribution and balanced node energy consumption which effectively improve the energy efficiency and data transmission capacity, and prolong the life cycle of the observing instrument network. The LHC algorithm provides an important routing protocol for observing instrument network and real-time reliable data transmission.

Abstract licence: CC BY-NC-ND

40 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.