Rapid construction method for centerless ad hoc network

Abstract

The invention provides a rapid construction method for a centerless self-organizing network, which comprises the following steps: generating a reference node in a random competition mode, establishing a time slot network by other nodes by taking the reference node as a time reference, spontaneously carrying out identity binding, and occupying wireless channel resources according to the same time slot allocation algorithm. According to the method, the nodes are prevented from waiting for a long time, the waste of time resources is reduced, the network control function of the main node is dispersed, the network self-organizing performance is improved, all the nodes achieve conflict-free occupation of network resources through behavior interaction, and wireless network self-organizing construction is achieved under the conditions of multiple nodes and damage resistance. The technical problem that an existing centralized network networking mode cannot be suitable for temporary network establishment, platform emergency release and application occasions with survivability requirements can be solved.

Description

Technical Field

[0001] The present invention relates to the field of radio communication technology, and in particular to a method for quickly constructing a centerless self-organizing network. Background Art

[0002] In the absence of infrastructure assistance, the existing networking method pre-plans wireless channel resources and selects a designated platform as the network center. Network members obtain the channel resources required for communication through centralized allocation of the central node.

[0003] In a centralized network configuration mode, when the central node serving as the network benchmark runs out of energy or is destroyed, the entire network will be paralyzed. This makes it unsuitable for temporary network formation, emergency platform deployment, and applications with anti-destruction requirements. Summary of the invention

[0004] The present invention provides a method for quickly constructing a centerless self-organizing network, which can solve the technical problem that the existing centralized network networking method is not suitable for temporary network formation, emergency platform deployment and application scenarios with anti-destruction requirements.

[0005] The present invention provides a method for quickly constructing a centerless self-organizing network, the method comprising:

[0006] S10, constructing a network frame structure, wherein a plurality of time frames are set in the network, each time frame includes a plurality of communication cycles, a reference node broadcast time reference information, and network member information set in chronological order, each communication cycle includes a plurality of nodes, and each node is a host for sending and receiving information;

[0007] S20, all nodes make reference node declarations with the node declaration probability under the maximum throughput, wherein the nodes making reference node declarations proceed to S30, and the nodes not making reference node declarations proceed to S70;

[0008] S30, the node making the reference node declaration determines whether it has received the network access application, if so, proceeds to S40; otherwise, proceeds to S50;

[0009] S40, taking itself as the reference node, adding the member information of the node corresponding to the received network access application in the broadcast, periodically broadcasting network information, and completing the identity confirmation of the current node, wherein the network information includes time reference information and member information;

[0010] S50, the node making the reference node declaration determines whether it has received the network access application within the preset delay time, if so, it goes to S40; otherwise, it monitors the channel and goes to S60;

[0011] S60, the node making the reference node declaration determines whether it has heard the reference node declaration of other networks, if so, it takes itself as the application node and goes to S70; otherwise, it goes to S20;

[0012] S70, after receiving the broadcasted network information, the node that has not made a reference node declaration uses the time reference information of the reference node as the network time reference for time synchronization;

[0013] S80, the node performing time synchronization sends a network access application to the reference node;

[0014] S90, determining whether the node performing time synchronization has received a response from the reference node, if so, performing data transmission in the allocated time slot to complete the identity confirmation of the current node; otherwise, going to S20.

[0015] Preferably, the node declaration probability under maximum throughput is obtained by the following formula:

[0016]

[0017] In the formula, p max is the node declaration probability at maximum throughput, and N is the number of nodes.

[0018] By applying the technical solution of the present invention, a reference node is generated by random competition, and other nodes establish a time slot network with the reference node as the time reference, spontaneously perform identity binding, and occupy wireless channel resources according to the same time slot allocation algorithm. The present invention avoids nodes from being in a long-term waiting state, reduces the waste of time resources, disperses the network control function of the main node, improves the network self-organization performance, and all nodes realize conflict-free occupation of network resources through behavioral interaction, and realizes the self-organization construction of a wireless network under multi-node and anti-damage conditions. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The included drawings are used to provide a further understanding of the embodiments of the present invention, which constitute a part of the specification, are used to illustrate the embodiments of the present invention, and together with the text description, explain the principles of the present invention. Obviously, the drawings in the following description are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 A network frame structure diagram provided according to an embodiment of the present invention is shown;

[0021] Figure 2 A time reference node competition flow chart provided according to an embodiment of the present invention is shown;

[0022] Figure 3A member node state transition diagram provided according to an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0023] It should be noted that, in the absence of conflict, the embodiments in this application and the features in the embodiments can be combined with each other. The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. The following description of at least one exemplary embodiment is actually only illustrative and is by no means intended to limit the present invention and its application or use. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0024] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit the exemplary embodiments according to the present application. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should be understood that when the terms "comprise" and / or "include" are used in this specification, it indicates the presence of features, steps, operations, devices, components and / or combinations thereof.

[0025] Unless otherwise specifically stated, the relative arrangement of the parts and steps described in these embodiments, numerical expressions and numerical values ​​do not limit the scope of the present invention. At the same time, it should be understood that, for ease of description, the sizes of the various parts shown in the accompanying drawings are not drawn according to the actual proportional relationship. The technology, method and equipment known to ordinary technicians in the relevant field may not be discussed in detail, but in appropriate cases, the technology, method and equipment should be regarded as a part of the authorization specification. In all examples shown and discussed here, any specific value should be interpreted as being merely exemplary, rather than as a limitation. Therefore, other examples of exemplary embodiments may have different values. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once a certain item is defined in an accompanying drawing, it does not need to be further discussed in subsequent drawings.

[0026] The present invention provides a method for quickly constructing a centerless self-organizing network, the method comprising:

[0027] S10, constructing a network frame structure, wherein a plurality of time frames are set in the network, each time frame includes a plurality of communication cycles, a reference node broadcast time reference information, and network member information set in chronological order, each communication cycle includes a plurality of nodes, and each node is a host for sending and receiving information;

[0028] S20, all nodes make reference node declarations with the node declaration probability under the maximum throughput, wherein the nodes making reference node declarations proceed to S30, and the nodes not making reference node declarations proceed to S70;

[0029] S30, the node making the reference node declaration determines whether it has received the network access application, if so, proceeds to S40; otherwise, proceeds to S50;

[0030] S40, taking itself as the reference node, adding the member information of the node corresponding to the received network access application in the broadcast, periodically broadcasting network information, and completing the identity confirmation of the current node, wherein the network information includes time reference information and member information;

[0031] That is, when a node applies for network access, the time reference node records the communication time slot according to the application information and broadcasts it in the next network information; each application node transmits data in the recorded time slot;

[0032] S50, the node making the reference node declaration determines whether it has received the network access application within the preset delay time, if so, it goes to S40; otherwise, it monitors the channel and goes to S60;

[0033] S60, the node making the reference node declaration determines whether it has heard the reference node declaration of other networks, if so, it takes itself as the application node and goes to S70; otherwise, it goes to S20;

[0034] S70, after receiving the broadcast network information, the node that has not made the reference node declaration uses the time reference information of the reference node as the network time reference for time synchronization; at this time, the current node enters the synchronization state from the idle state;

[0035] S80, the node performing time synchronization sends a network access application to the reference node; at this time, the current node enters an identity-undetermined state from a synchronization state;

[0036] S90, determine whether the node performing time synchronization receives a response from the reference node. If so, perform data transmission in the allocated time slot to complete the identity confirmation of the current node. At this time, the current node enters the identity confirmation state from the identity uncertain state; otherwise, go to S20.

[0037] Among them, completing the identity confirmation of all nodes means completing the construction of a decentralized self-organizing network.

[0038] The present invention generates a reference node by random competition, and other nodes establish a time slot network with the reference node as the time reference, spontaneously perform identity binding, and occupy wireless channel resources according to the same time slot allocation algorithm. The present invention avoids nodes from being in a long-term waiting state, reduces the waste of time resources, disperses the network control function of the main node, improves the network self-organization performance, and all nodes realize conflict-free occupation of network resources through behavioral interaction, and realizes the self-organization construction of wireless networks under multi-node and anti-damage conditions.

[0039] In order to further understand the present invention, the following Figure 1-Figure 3 The method for quickly constructing a centerless self-organizing network of the present invention is described in detail.

[0040] In the present invention, the behavior interaction follows the principle of "network access if there is a network, network construction if there is no network", and the basic process is as follows:

[0041] 1) Monitor the channel. If network information is received in the channel, it will join the network as a member of the network. If no network exists in the channel, it will declare itself as a network member.

[0042] 2) If data transmission is received from other nodes in the network after the network declaration, it indicates that a transmission link has been established between the nodes and a network has been formed.

[0043] The present invention first generates time reference nodes in a competitive manner, then forms a network in a TDMA manner, obtains network wireless channel resources through behavioral interaction, and realizes rapid construction of a wireless self-organizing network; wherein, each node in the network is functionally equivalent, and generates a network time reference through probabilistic events under distributed conditions, thereby accelerating network generation time and improving channel utilization; in addition, the network does not require centralized scheduling by a network center, and all nodes spontaneously perform identity binding, thereby improving network anti-destruction and network access flexibility. Each node timely updates the information of the entire network through perception of the environment and data interaction with each other, thereby forming a unified situation and realizing effective information integration. Specifically, the method for rapidly constructing a centerless self-organizing network includes the following steps:

[0044] Step 1: Determine the network frame structure:

[0045] The network frame structure is as follows Figure 1 As shown in the figure, the data link system adopts TDMA (Time Division Multiple Access) mode, which can support 16 nodes for networking. The length of each time slot is set to 1ms, and a complete broadcast cycle (a time frame) is 50ms. The first 48ms is three communication cycles, and the last 2ms is broadcast by the network time reference node to broadcast the time reference information and network member information. Each node in the network is a host for sending and receiving information.

[0046] Step 2: Determine the network time reference node:

[0047] The throughput of the network is affected by the load rate and has a fixed peak value. Under single-channel conditions, the transmission time of the data packet is used as the time unit, and the throughput represents the number of data packets successfully transmitted per unit time. By controlling the load rate, the success rate of data packet transmission can be improved, and the time to generate the time base node can be reduced.

[0048] The value of the load rate mainly comes from two aspects: the number of nodes in the network and the probability of the node itself transmitting data. When the number of nodes is large and the transmission probability is small, the Poisson distribution can be approximated as a binomial distribution, which can be expressed as:

[0049] S=Np(1-p) 2N-2

[0050] Where S is the throughput, N is the number of nodes, and p is the node declaration probability.

[0051] Taking the node declaration probability of the above formula as the independent variable and taking derivative, we can get the node declaration probability p when the network reaches the maximum throughput: max :

[0052]

[0053] Thus, the maximum throughput S can be obtained. max :

[0054]

[0055] The node declaration probability p at the maximum throughput rate max As the probability of time reference node identity declaration, increasing the probability of node declaration can speed up the generation of time reference nodes, but it also increases data conflicts, which may cause the reference node information to not be correctly received. Figure 2 As shown in the figure, all nodes declare the time reference node with the node declaration probability 1 / (2N-1) under the maximum throughput. When other nodes receive the reference node declaration, they send a network access application to it. After receiving the network access application, the node that sends the reference node declaration takes itself as the reference node and adds the member information in the broadcast, so that there will be no identity conflict when the members in the network bind themselves.

[0056] If no network access application is received from any other node within a certain time limit, the node monitors the channel, otherwise it continues to send time reference node declarations. If it monitors the existence of other networks, it will use itself as the application node, otherwise it will continue to send time reference node declarations.

[0057] Step 3: Network members obtain wireless channel resources:

[0058] The node access process is actually a process in which the node sends an access application to the reference node and is recorded in the broadcast information of the reference node. In this process, the node status can be divided into three types: synchronization status, undetermined status and determined status. Figure 3 The node access selects the reference node as the networking node to receive and process the network access application of the new node.

[0059] After the node monitors the network information, it uses the clock of the reference node as the network time reference for time synchronization and enters the synchronization state. After the network time synchronization, the node sends an application for network access. If it receives a response from the reference node, it changes its identity to a member node and transmits data in the allocated time slot. If it does not receive a response from the reference node within a certain time limit, it returns to the idle state.

[0060] In summary, the present invention provides a method for rapidly constructing a centerless self-organizing network. Aiming at the needs of self-organizing network construction under multi-platform and anti-damage conditions, a time reference node self-generation algorithm is designed to achieve rapid network establishment. Compared with the traditional method of binding network node identities and entering the network in sequence, the centerless self-organizing network rapid construction algorithm realizes self-organizing binding of node identities and self-organizing network entry, and supports multi-platform task collaboration.

[0061] For ease of description, spatially relative terms such as "above", "above", "on the upper surface of", "above", etc. may be used here to describe the spatial positional relationship between a device or feature and other devices or features as shown in the figure. It should be understood that spatially relative terms are intended to include different orientations of the device in use or operation in addition to the orientation described in the figure. For example, if the device in the accompanying drawings is inverted, the device described as "above other devices or structures" or "above other devices or structures" will be positioned as "below other devices or structures" or "below other devices or structures". Thus, the exemplary term "above" can include both "above" and "below". The device can also be positioned in other different ways (rotated 90 degrees or in other orientations), and the spatially relative descriptions used here are interpreted accordingly.

[0062] In addition, it should be noted that the use of terms such as "first" and "second" to limit components is only for the convenience of distinguishing the corresponding components. If not otherwise stated, the above terms have no special meaning and therefore cannot be understood as limiting the scope of protection of the present invention.

[0063] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for rapidly constructing a centerless self-organizing network, characterized in that: The method comprises: S10, constructing a network frame structure, wherein a plurality of time frames are set in the network, each time frame includes a plurality of communication cycles, a reference node broadcast time reference information, and network member information set in chronological order, each communication cycle includes a plurality of nodes, and each node is a host for sending and receiving information; S20, all nodes make reference node declarations with the node declaration probability under the maximum throughput, wherein the nodes making reference node declarations proceed to S30, and the nodes not making reference node declarations proceed to S70; S30, the node making the reference node declaration determines whether it has received the network access application, if so, proceeds to S40; otherwise, proceeds to S50; S40, taking itself as the reference node, adding the member information of the node corresponding to the received network access application in the broadcast, periodically broadcasting network information, and completing the identity confirmation of the current node, wherein the network information includes time reference information and member information; S50, the node making the reference node declaration determines whether it has received the network access application within the preset delay time, if so, it goes to S40; otherwise, it monitors the channel and goes to S60; S60, the node making the reference node declaration determines whether it has heard the reference node declaration of other networks, if so, it takes itself as the application node and goes to S70; otherwise, it goes to S20; S70, after receiving the broadcasted network information, the node that has not made a reference node declaration uses the time reference information of the reference node as the network time reference for time synchronization; S80, the node performing time synchronization sends a network access application to the reference node; S90, determining whether the node performing time synchronization has received a response from the reference node, if so, performing data transmission in the allocated time slot to complete the identity confirmation of the current node; otherwise, going to S20.

2. The method according to claim 1, characterized in that The node declaration probability under maximum throughput is obtained by the following formula: In the formula, p max is the node declaration probability at maximum throughput, and N is the number of nodes.

Images