Multi-jump wireless self-organizing network construction method based on partition tree

Abstract

The invention discloses a partition tree based multihop wireless self-organizing networking method, including the deterministic process for all partition root nodes, the interconnecting process between root nodes, the interconnecting route maintenance process between root nodes, the creation process for the partition tree, the dynamic maintenance process for the partition tree and the partition tree based routing process. Compared with the prior wireless network technology, the novel multihop wireless self-organizing networking method of the invention has the advantages of good expansibility, controllable network structure scale, little system overhead and high routing efficiency, thereby effectively improving network transmission efficiency and network performance.

Description

technical field [0001] The invention belongs to the technical field of wireless communication networks, and in particular relates to a construction method and routing technology of a multi-hop wireless self-organizing network. Background technique [0002] There are two types of network structures in wireless communication systems: networks with infrastructure and networks without infrastructure. The infrastructure network structure is usually an extension of the wired communication network. The wired network is used as the backbone network and connected to a special wired / wireless transfer point, that is, the base station BS (Base Station) or the access point AP (Access Point ), they are responsible for coordinating the mobile nodes in the coverage area to access the network through one or more transmission channels. The transmission channel may be a certain frequency band in FDMA (Frequency-Division Multiple Access), or a certain time slot in TDMA (Time Division Multiple ...

AI Technical Summary

Problems solved by technology

[0014] Among the above technologies, (1) it is suitable for networks with relatively dense nodes, but in the case of too many drifting nodes and isolated nodes, the control and storage overhead of the protocol is relatively large; (2) the routing area of ​​nodes can be adjusted according to the characteristics of the network The radius is adjusted to minimize the overall routing overhead of the system, but the method of adjusting the radius of the routing area has a greater impact on its performance; (3) Although it is beneficial to provide QoS guarantees for communication services, nodes move in the network When the speed is high, the overhead of maintaining virtual base stations and routing is relatively large; (4) data packets can be efficiently transmitted by using the cluster leader-gateway sequence, but because the transmission of the limited packet must pass through the cluster leader gateway sequence, there are A non-optimal path may be generated; (5) The protocol is more complicated, and the obtained path may be a non-optimal path. When the moving speed of nodes in the network is high, the routing overhead is relatively large

These existing network layered construction methods cannot well meet the requirements of multi-hop wireless ad hoc networks in terms of reliability, overhead control, effectiveness, and complexity.

Images