Wireless sensor routing method based on routing table node energy

Abstract

The invention discloses a wireless sensor routing method based on routing table node energy, and the method comprises the steps: calculating a node with the minimum energy use time on the way and the energy use time of the node in a processing of building a routing broadcast; reducing the transmission times in a given timing transmission mode, and enabling the node to have time in gathering the routing information of peripheral nodes; and carrying out the multiple transmission of a broadcast package, and building node-destination multipath information. The invention also proposes a method for calculating path priority according to the minimum energy use time and distance. The method gives full consideration to a hop number and the information of a node with the minimum residual energy use time in a path, finds out the optimal path, is more reasonable in routing selection, and prolongs the life cycle of the whole wireless sensor network.

Description

technical field [0001] The invention relates to a wireless sensor network routing method, in particular to a wireless sensor network routing method based on node energy of a routing table, belonging to the technical field of data transmission. Background technique [0002] The routing method is the focus of wireless sensor network (WSN) research. Its main goal is to find and establish an energy-efficient path and a safe and reliable data transmission method from sensor nodes to receiving nodes to form a routing protocol, so as to ensure data safety and reliability. To maximize the life cycle of the entire network. [0003] Routing protocols for wireless sensor networks can be divided into Proactive routing protocols and Reactive routing protocols. The a priori routing protocol is also called the routing table-driven routing protocol. Each node maintains a routing table containing routing information to other nodes. When a change in the network topology is detected, the node...

AI Technical Summary

Problems solved by technology

[0007] Central China Normal University's dissertation "Research on Routing Algorithms for Wireless Sensor Networks Based on Routing Tables" disclosed "Routing Protocols for Wireless Sensor Networks Based on Routing Tables", the relationship between average energy consumption and nodes, the average energy consumption of nodes and the number of rounds The relationship between the network, the number of live nodes in the network life cycle, and the time when the first node dies in the network life cycle are all better than the basic Flooding and DD algorithms, but the protocol can only consider the next hop.

[0008] Some researchers have combined network congestion factors into the routing table for overall consideration, but the high frequency of network congestion causes frequent changes in the routing table, which is not conducive to the management of the routing table. Usually, it should be based on a relatively stable routing table. The congestion situation temporarily corrects the selection of the path, and the routing table cannot be accompanied by its frequent changes

Images