Wireless self-organizing network fusing routing generation method based on node characteristics

Abstract

A wireless self-organizing network fusing routing generation method based on node characteristics comprises the steps that first a source node sends out a communication request to a target node, and communication is directly started if routing information to the target node exists; otherwise, the source node generates a main routing detecting bag and broadcasts the main routing detecting bag to an adjacent node; and a node receiving the main routing detecting bag responds to a detecting message, the target node replies to the message, multiple path information which is not intersected from the source node to the target node is searched, then a main movable node detects and backups the next node, and therefore, the fusing protection routing from the source node to the target node is generated. Compared with the existing routing generation, the generation method achieves the structure of the back-up of the next node and for transmitting the data on the basis of inheriting advantages of the distributed routing algorithm, can ensure that the data can be transmitted continuously under the condition that a linkage or the nodes lose efficacy, avoids flood of control bags in a whole network by introducing a dynamic transistor-transistor logic (TTL) and clock control mechanism, and has the advantages of being simple and convenient to implement and low in algorithm complexity.

Description

technical field [0001] The invention relates to the technical field of wireless ad hoc networks, and is suitable for generating routes in the application environment of wireless ad hoc networks, in particular to a method for generating fault-tolerant routes in wireless ad hoc networks based on node characteristics. Background technique [0002] The wireless ad hoc network is composed of devices with transceiver devices. The establishment of communication depends on the forwarding of data packets by nodes, and its routing mechanism is required to adapt to topology changes and node failures in time. Therefore, the wireless ad hoc network routing mechanism should have Distributed and adaptive features. Common wireless ad hoc network routing mechanisms can be divided into preset (Proactive routing), reactive (reactive or on demand routing) and hybrid (hybrid routing). Preset routing requires all nodes to store and maintain a routing table containing the entire network informati...

AI Technical Summary

Problems solved by technology

AOMDV provides an algorithm for finding multiple disjoint paths in the search phase, combined with the retransmission mechanism of intermediate nodes, it improves the response efficiency of AODV to link failures; O2 guarantees that any node has at least two links to the same destination. The path of nodes gives an easy-to-implement multi-path routing algorithm, which is difficult to apply to wireless ad-hoc networks because it depends on the distribution density of nodes; Marina (2006) analyzed and proved the performance of multi-path routing in terms of availability and security , which theoretically shows that multi-path routing is generally better than single-path routing, but designing a more efficient multi-path protocol is still the focus of research

Images