Method for avoiding routing loop by adopting tree topology relationship

Abstract

The invention provides a method for avoiding a routing loop by adopting a tree topology relationship. A tree network is established, a topology sequence number is distributed to a node, branched topology sequence information is created in the tree network, and the routing loop is avoided in the method. The method comprises the following steps of: broadcasting routing request (RREQ) message by a source node, and searching the branched topology sequence information by the node receiving the RREQ message; judging whether the source node is an ancestor node of the node receiving the RREQ message; if no, responding the RREQ message by the node receiving the RREQ message; and if yes, not responding the RREQ message by the node receiving the RREQ message. The method prevents the possibility of the routing loop by analyzing the topology level relationship among the nodes.

Description

technical field [0001] The invention relates to a routing method for a wireless sensor network. More specifically, the present invention relates to a wireless sensor network routing method using a tree topology relationship to avoid routing loops. Background technique [0002] Wireless Sensor Networks (WSNs) technology is an important part of modern communication technology and computer network technology. self-organizing network. The sensor nodes cooperate to perceive the object information in the physical world (such as: temperature, humidity, acceleration, light intensity, etc.), and finally gather and fuse the data information to the server and observer. [0003] In recent years, with the rise and development of the Internet of Things, wireless sensor network technology has received more attention, and it has gradually become an important guarantee for the integration of the physical world and the information world. At the same time, with the development of wireless s...

AI Technical Summary

Problems solved by technology

However, this route still includes Node B, which is no longer working, and is actually still an invalid route

Subsequently, node E also found that a large number of packets were lost in the process of sending data, so it initiated the broadcast RREQ process. At this time, node C has updated the route, and node B is no longer considered invalid by node C, so when node C receives After the RREQ sent by node E, reply RREP to it, so that node E has a new route that becomes E→C→E→B→A, whether the route provided by node C to node E still includes node E itself, Node C cannot judge before providing the route, so this process will continue to reciprocate, causing the user's data packets to be sent cyclically on the network, and the number of hops is getting larger and larger, resulting in a serious waste of network resources

Images