Adaptive Hierarchical Topology And Routing Algorithm For Wireless Sensor Networks

This paper studies the topology and routing algorithm for wireless sensor networks, andpropose a new set of solutions. First introduce an overview of smart wireless sensors, andconcept and characteristics, research and development as well as applications and trends ofwireless sensor networks. Then, introduce flat topology and hierarchical topology of WSN,and their representative algorithm in detail. This article divides routing protocol into threetypes, including unicast, broadcast and multicast as well as location-based routing protocol.And representative algorithms are also introduced for each class of routing protocols. Thesolution proposed in this paper called local-location-based distributed model(ALLDM), itcontains topology and routing algorithm. ALLDM constructs a hierarchical clusterd topology,its key algorithms include distributed clustering algorithm and global connectivity algorithm.This paper also uses graph theory to prove the connectivity of the ALLDM topology. ALLDMrouting algorithm is local-location-based, and the routing decisions of nodes are distributedwithout centralized computing. This article describes the regional tree as routing principle,also designs the routing rules, and proposes a method to eliminate the routing loop and dataredundancy. Simulation implements the ALLDM, RNG and LEACH algorithm, and achieve acomparative analysis. The simulation includes clustering, average length of edges in clusters,node survival situation, energy analysis and network lifetime. The experimental results showthat ALLDM achieves uniform clustering, forms a global connectivity topology, consumeslower energy and has a longer lifetime. More important, the scope of ALLDM’s monitoringcan be larger, away from the limit of the communication radius of Sink node.