CN117395780A - Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment - Google Patents

Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment Download PDF

Info

Publication number
CN117395780A
CN117395780A CN202311629706.XA CN202311629706A CN117395780A CN 117395780 A CN117395780 A CN 117395780A CN 202311629706 A CN202311629706 A CN 202311629706A CN 117395780 A CN117395780 A CN 117395780A
Authority
CN
China
Prior art keywords
time slot
node
dynamic
network
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311629706.XA
Other languages
Chinese (zh)
Inventor
彭弘铭
陈亚伟
张文柱
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian University of Architecture and Technology
Original Assignee
Xian University of Architecture and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian University of Architecture and Technology filed Critical Xian University of Architecture and Technology
Priority to CN202311629706.XA priority Critical patent/CN117395780A/en
Publication of CN117395780A publication Critical patent/CN117395780A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/25—Control channels or signalling for resource management between terminals via a wireless link, e.g. sidelink
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/002—Transmission of channel access control information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The invention discloses a dynamic time slot allocation method and related equipment suitable for a high-dynamic self-organizing network, belonging to the technical field of mobile self-organizing network communication, and the method provides a node rapid network access strategy; meanwhile, after a new node is accessed to the network, the updated time slot allocation table allocates the current idle time slot for each node, and accesses the data time slot, so that the two-hop neighbor nodes of each time slot can perform data transmission without conflict, the channel space division multiplexing is realized, and the throughput of the network is improved.

Description

Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment
Technical Field
The invention belongs to the technical field of mobile self-organizing network communication, in particular relates to the field of target detection, and particularly relates to a dynamic time slot allocation method and related equipment suitable for a high-dynamic self-organizing network.
Background
The high dynamic wireless self-organizing network refers to the situation that the nodes in the network face frequent access and exit from the network. Such topology changes are often faced in earthquake relief, military battlefield scenarios. The topology change of the network affects the expressive power such as throughput of the network, unlike static and low-dynamic networks, the MAC layer protocol of the high-dynamic network needs to have adaptability, i.e. stable throughput under the condition that the number of nodes in the network is variable. In this context, research and design of the performance of the MAC layer protocol in the highly dynamic network is significant for the development of the wireless ad hoc network.
Currently, many TDMA-based dynamic Medium Access Control (MAC) schemes have been proposed for ad hoc networks, such as USAP, which are designed based on a fixed number of network users, without considering the specific problem of new node network access, and thus, no method for allocating time slots to new network access nodes is given. USAP-MA is an extension of USAP, dynamically changing frame length and time frame period with adaptive broadcast periods. However, USAP-MA neither specifies how or when to change the frame length, nor how to select the time slot allocated to the new node. In ASAP and EASAP based USAP concepts, the frame length is defined as a power of 2, which can be dynamically changed, but ASAP does not reduce the frame length that is increased due to high traffic demand. If no free slots are available for allocation to the newly arrived node, the frame length is doubled to create free slots. While the frame length may be dynamically increased to cope with higher traffic, it cannot be subsequently reduced, resulting in a decrease in network performance.
Therefore, the conventional slot allocation method has a problem that it is difficult to allocate slots for newly-accessed nodes in a short time and throughput is low in a high dynamic network environment.
Disclosure of Invention
In order to overcome the defects of the technology, the invention provides a dynamic time slot allocation method and related equipment suitable for a high-dynamic self-organizing network, which can solve the technical problem that the prior time slot allocation mode is difficult to allocate time slots for newly-accessed nodes in a short time under the condition of ensuring that the performance of a network model is not reduced.
In order to achieve the above purpose, the invention adopts the following technical scheme:
a dynamic time slot allocation method suitable for a highly dynamic ad hoc network, comprising:
constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes;
based on the constructed time frame, each node performs control information interaction, and updates a time slot allocation table corresponding to each node according to the network access condition of the new node;
and based on the updated time slot allocation table, allocating a current idle time slot for each node so that each node can send service information in the corresponding data time slot.
Further, the time frame comprises a control part and a data part, wherein the control part comprises a plurality of control time slots, and the control time slots comprise an access request time slot, a message time slot, an announcement reservation time slot and an acknowledgement time slot; the data portion includes a plurality of data slots; the total number of information slots in each time frame is equal to the total number of data slots.
Further, when the new node is pre-joined to the network, request information is sent in a network access request time slot, neighbor node information of the new node is collected in a subsequent information time slot, a self reservation result is broadcast in an announcement reservation time slot, finally, collision is detected through the neighbor node, and the network access condition of the new node is determined in a confirmation time slot.
Further, the specific steps of the new node network access are as follows:
the new node completes the initial time synchronization of the time frame before sending the network access request, broadcasts request information to the network in the network access request time slot in the control subframe, and then monitors; in the next information time slot, the neighbor node broadcasts node information in its own corresponding control time slot; after receiving the broadcasted node information, the new node updates the neighbor node information table and the time slot allocation table of the new node; when the information time slot is finished, the new node collects the relevant information of the neighbors of the two-hop part around the new node;
the new node randomly selects an unoccupied time slot as a reservation time slot according to the related information of the neighboring nodes of the two surrounding hops, and then broadcasts own reservation information to the neighboring nodes in the notification reservation time slot; if no signal is sent back on the confirmation time slot, the notification reservation time slot is approved to be used by all neighbor nodes, the new node accesses the network, and each node updates the information table of the neighbor node and the time slot allocation table; otherwise, the new node will re-attempt to access the network using a different time slot in the next control subframe until the current advertised reserved time slot is approved for use by all neighbor nodes.
Further, based on the updated time slot allocation table and in combination with the idle time slot allocation method, the current idle time slot is allocated to each node.
Further, the specific steps of allocating the current idle time slot to each node by adopting the idle time slot allocation method include:
selecting a node corresponding to the maximum transmission priority from all nodes in the competition area, and distributing a current idle time slot for the node; the transmission priority is obtained according to exclusive OR operation of the unique identity of the node and the number of the data time slot.
Further, the network model is obtained by constructing a plurality of nodes, and the time slot occupied by the initial node is initialized based on a time frame aiming at the constructed network model, so that the construction of the neighbor node information table and the time slot allocation table of each node is completed.
A dynamic time slot allocation system suitable for a high-dynamic self-organizing network, which is used for realizing the steps of the dynamic time slot allocation method suitable for the high-dynamic self-organizing network, comprising the following steps:
the time frame construction module is used for constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes;
the information interaction module is used for carrying out control information interaction on each node based on the constructed time frame and updating a time slot allocation table corresponding to each node according to the network access condition of the new node;
and the idle time slot allocation module is used for allocating the current idle time slot for each node based on the updated time slot allocation table so that each node can send service information in the corresponding data time slot.
An apparatus, comprising:
a memory for storing a computer program;
and the processor is used for realizing the steps of the dynamic time slot allocation method applicable to the high-dynamic self-organizing network when executing the computer program.
A computer readable storage medium storing a computer program for implementing the steps of the dynamic time slot allocation method described above for a highly dynamic ad hoc network when executed by a processor.
Compared with the prior art, the invention has the following beneficial effects:
the invention also provides a dynamic time slot allocation method suitable for the high-dynamic self-organizing network, and provides a node rapid network access strategy, the method sets up a plurality of control subframes in one time frame, each control subframe is used for the network access of a new node and the broadcasting of dynamic information of nodes in partial network, thereby reducing the network access time delay of the new node and meeting the rapid network access requirement of the high-dynamic self-organizing network node; meanwhile, after a new node is accessed to the network, the updated time slot allocation table allocates the current idle time slot for each node, and accesses the data time slot, so that the two-hop neighbor nodes of each time slot can perform data transmission without conflict, the channel space division multiplexing is realized, and the throughput of the network is improved.
Preferably, in the present invention, an idle time slot allocation method is also provided, and the current idle time slot is allocated according to the transmission priority, so as to ensure the channel space division multiplexing without collision, and further ensure the improvement of the throughput of the network.
Drawings
Fig. 1 is a schematic diagram of a time frame structure of a dynamic timeslot allocation method suitable for a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 2 is a neighbor node information table of a dynamic time slot allocation method applicable to a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 3 is a slot allocation table of a dynamic slot allocation method suitable for a high dynamic ad hoc network according to an embodiment of the present invention;
fig. 4 is a packet structure sent by node interaction information in a dynamic timeslot allocation method suitable for a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 5 is a schematic diagram of an initial network topology in a dynamic timeslot allocation method suitable for a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 6 is a schematic diagram of node network access in a dynamic timeslot allocation method suitable for a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 7 is a schematic diagram of data slot occupation in a dynamic slot allocation method applicable to a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 8 is a flowchart of a dynamic timeslot allocation method suitable for a high-dynamic ad hoc network according to an embodiment of the present invention;
fig. 9 is a flowchart of a dynamic timeslot allocation method suitable for a high dynamic ad hoc network according to the present invention;
fig. 10 is a schematic structural diagram of a dynamic timeslot allocation system suitable for a high-dynamic ad hoc network according to the present invention;
fig. 11 is a schematic diagram of a time frame structure of a network model according to an embodiment of the present invention.
Detailed Description
The invention provides a dynamic time slot allocation method suitable for a high dynamic self-organizing network, as shown in fig. 9, comprising the following steps:
s1, constructing a time frame of a network model, wherein the time frame comprises a plurality of control subframes.
Specifically, the time frame comprises a control part and a data part, wherein the control part comprises a plurality of control time slots, and the control time slots comprise a network access request time slot, a message time slot, an announcement reservation time slot and an acknowledgement time slot; the data portion includes a plurality of data slots; the total number of information slots in each time frame is equal to the total number of data slots.
The network model is obtained by constructing a plurality of nodes, and the time slot occupied by the initial node is initialized based on a time frame aiming at the constructed network model, so that the construction of the neighbor node information table and the time slot allocation table of each node is completed.
And S2, based on the constructed time frame, each node performs control information interaction, and updates a time slot allocation table corresponding to each node according to the network access condition of the new node. Specifically, when a new node is pre-joined to the network, request information is sent in a network access request time slot, neighbor node information of the new node is collected in a subsequent information time slot, a self reservation result is broadcast in an announcement reservation time slot, finally, collision is detected through the neighbor node, and the network access condition of the new node is determined in a confirmation time slot.
The specific steps of the new node network access are as follows:
the new node completes the initial time synchronization of the time frame before sending the network access request, broadcasts request information to the network in the network access request time slot in the control subframe, and then monitors; in the next information time slot, the neighbor node broadcasts node information in its own corresponding control time slot; after receiving the broadcasted node information, the new node updates the neighbor node information table and the time slot allocation table of the new node; when the information time slot is finished, the new node collects the relevant information of the neighbors of the two-hop part around the new node;
the new node randomly selects an unoccupied time slot as a reservation time slot according to the related information of the neighboring nodes of the two surrounding hops, and then broadcasts own reservation information to the neighboring nodes in the notification reservation time slot; if no signal is sent back on the confirmation time slot, the notification reservation time slot is approved to be used by all neighbor nodes, the new node accesses the network, and each node updates the information table of the neighbor node and the time slot allocation table; otherwise, the new node will re-attempt to access the network using a different time slot in the next control subframe until the current advertised reserved time slot is approved for use by all neighbor nodes.
And S3, distributing the current idle time slot for each node based on the updated time slot distribution table so as to enable each node to send service information in the corresponding data time slot.
Here, the current free time slot is allocated to each node based on the updated time slot allocation table in combination with the free time slot allocation method.
The method for allocating the current idle time slot for each node by adopting the idle time slot allocation method comprises the following specific steps:
selecting a node corresponding to the maximum transmission priority from all nodes in the competition area, and distributing a current idle time slot for the node; the transmission priority is obtained according to exclusive OR operation of the unique identity of the node and the number of the data time slot.
As shown in fig. 10, the present invention further provides a dynamic time slot allocation system suitable for a high dynamic ad hoc network, including: the time frame construction module is used for constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes; the information interaction module is used for carrying out control information interaction on each node based on the constructed time frame and updating a time slot allocation table corresponding to each node according to the network access condition of the new node; and the idle time slot allocation module is used for allocating the current idle time slot for each node based on the updated time slot allocation table so that each node can send service information in the corresponding data time slot.
The invention also provides an apparatus comprising: a memory for storing a computer program; and the processor is used for realizing the steps of the dynamic time slot allocation method suitable for the high-dynamic self-organizing network when executing the computer program.
The processor, when executing the computer program, implements the steps of dynamic time slot allocation described above for a highly dynamic ad hoc network, for example: constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes; based on the constructed time frame, each node performs control information interaction, and updates a time slot allocation table corresponding to each node according to the network access condition of the new node; and based on the updated time slot allocation table, allocating a current idle time slot for each node so that each node can send service information in the corresponding data time slot.
Alternatively, the processor may implement functions of each module in the above system when executing the computer program, for example: the time frame construction module is used for constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes; the information interaction module is used for carrying out control information interaction on each node based on the constructed time frame and updating a time slot allocation table corresponding to each node according to the network access condition of the new node; and the idle time slot allocation module is used for allocating the current idle time slot for each node based on the updated time slot allocation table so that each node can send service information in the corresponding data time slot.
The computer program may be divided into one or more modules/units, which are stored in the memory and executed by the processor to accomplish the present invention, for example. The one or more modules/units may be a series of computer program instruction segments capable of performing a predetermined function, said instruction segments describing the execution of the computer program in the dynamic time slot allocation apparatus adapted for a highly dynamic ad hoc network. For example, the computer program may be partitioned into a time frame construction module, an information interaction module, and an idle slot allocation module; the specific functions of each module are as follows: the time frame construction module is used for constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes; the information interaction module is used for carrying out control information interaction on each node based on the constructed time frame and updating a time slot allocation table corresponding to each node according to the network access condition of the new node; and the idle time slot allocation module is used for allocating the current idle time slot for each node based on the updated time slot allocation table so that each node can send service information in the corresponding data time slot.
The dynamic time slot allocation device suitable for the high-dynamic self-organizing network can be a computing device such as a desktop computer, a notebook computer, a palm computer and a cloud server. The dynamic time slot allocation apparatus suitable for the high dynamic ad hoc network may include, but is not limited to, a processor, a memory. It will be appreciated by those skilled in the art that the foregoing is an example of a dynamic time slot allocation apparatus suitable for a high dynamic ad hoc network, and is not limiting, and may include more components than those described above, or may combine some components, or different components, e.g., the dynamic time slot allocation apparatus suitable for a high dynamic ad hoc network may further include an input/output apparatus, a network access apparatus, a bus, etc.
The processor may be a central processing unit (Central Processing Unit, CPU), other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor, etc., and the processor is the control center for dynamic time slot allocation suitable for the high dynamic ad hoc network, and uses various interfaces and lines to connect various parts of the dynamic time slot allocation device that is entirely suitable for the high dynamic ad hoc network.
The memory may be used to store the computer program and/or the module, and the processor may implement the various functions of the dynamic time slot allocation apparatus suitable for the high dynamic ad hoc network by running or executing the computer program and/or the module stored in the memory and invoking data stored in the memory.
The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, memory, plug-in hard disk, smart Media Card (SMC), secure Digital (SD) Card, flash Card (Flash Card), at least one disk storage device, flash memory device, or other volatile solid-state storage device.
The present invention also provides a computer readable storage medium storing a computer program which when executed by a processor implements the steps of a dynamic time slot allocation method suitable for a highly dynamic ad hoc network.
The modules/units integrated into the dynamic time slot allocation system suitable for the high dynamic ad hoc network may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as independent products.
Based on such understanding, the present invention implements all or part of the above-mentioned flow in the dynamic timeslot allocation method applicable to the high-dynamic ad hoc network, or may be implemented by instructing related hardware through a computer program, where the computer program may be stored in a computer readable storage medium, and the computer program may implement the steps of the above-mentioned dynamic timeslot allocation method applicable to the high-dynamic ad hoc network when executed by a processor. The computer program comprises computer program code, and the computer program code can be in a source code form, an object code form, an executable file or a preset intermediate form and the like.
The computer readable storage medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth.
It should be noted that the computer readable storage medium may include content that is subject to appropriate increases and decreases as required by jurisdictions and by jurisdictions in which such computer readable storage medium does not include electrical carrier signals and telecommunications signals.
The invention is further illustrated by the following examples in conjunction with the accompanying drawings:
examples
As described in the background, the conventional slot allocation method is difficult to allocate slots for new network nodes in a short time and has low throughput in a high dynamic network environment.
In order to solve the above problems, the present implementation provides a dynamic time slot allocation method suitable for a high dynamic ad hoc network, which can quickly allocate time slots for newly-accessed nodes on the premise of ensuring network performance; the system performance is effectively improved, the nodes are rapidly connected to the network, the time slots are fully utilized, and the high-dynamic network has stable throughput.
As shown in fig. 8, the present embodiment provides a dynamic timeslot allocation method suitable for a high dynamic ad hoc network, which specifically includes the following steps:
s1: constructing a network model by utilizing multiple nodes, and determining a time frame (namely a communication frame in the network model) structure;
in the time frame structural design scheme, as shown in fig. 1, time-domain resource division is performed by taking a superframe as a unit time element, one superframe is divided into a plurality of time frames, and each time frame consists of a control part and a data part; the control part forms K control subframes, each control subframe consists of M+3 time slots, and comprises REQ, INF, RES and CON four control time slots, which are mainly used for maintaining topology information. The data part consists of N time slots, the size of N depends on the maximum number of nodes existing in the network in the competition area, the N is priori knowledge of the network, the N is not changed along with the topology change of the network, and the N can be preset according to the actual requirement of the network. The number of data time slots in each time frame is the same as the number of INF information time slots and corresponds to one another, namely, k×m=n, and the occupied control time slots occupy the corresponding data time slots.
REQ slot (request for access slot): the time slot is used for the new node to send a network access application and inform surrounding neighbor nodes to request network access.
INF slot (information slot): each control subframe comprises M INF time slots, and the INF time slots are used for transmitting the ID information of the identity of the node and the surrounding one-hop neighbor nodes and the time slot occupation condition.
RES slot (reservation announcement slot): the time slot is used for the new node to announce the control time slot and the data time slot reserved by the new node (the control time slot corresponds to the data time slot one by one).
CON slot (acknowledgement slot): the time slot is mainly used for confirming a time slot selection result, and if surrounding neighbor nodes find that the time slot reserved by the network access node conflicts with the time slot allocation of the nodes in the network, a FALSE signal is sent to carry out notification in the CON time slot. Otherwise, no message is sent in the CON slot.
S2: aiming at the network model constructed in the last step, initializing the time slot occupied by the initial node, and completing construction of the neighbor node information table and the time slot allocation table of each node;
as shown in fig. 2, each node in the network maintains a neighbor node information table and a time slot allocation table, wherein the neighbor node information table includes node IDs, hop counts (one hop/two hops), and time slot occupancy; as shown in fig. 3, the slot allocation table includes all slot numbers and node IDs of corresponding occupied slots, where if the node IDs are empty, it indicates that the corresponding slots are unoccupied, indicating that the current slot is an idle slot.
S3: based on the set time frame, each node carries out control information interaction, judges the network access condition of the new node and the network withdrawal condition of the model node, and updates the neighbor node information table and the time slot allocation table of each node;
the specific steps of the new node network access are as follows:
the new node completes the frame starting time synchronization before sending the network access request, broadcasts the network access request information to the network in the REQ time slot in the control subframe, and then monitors. In the next M INF timeslots, the neighbor node broadcasts node information in its corresponding INF timeslot, as shown in fig. 4, including information of itself and one-hop neighbors, and after receiving the new node, updates its own neighbor node information table and time slot allocation table, wherein for the neighbor node information table, the hop count of "self ID", "self timeslot" in the received node information is recorded as 1, the hop count of all other "neighbor IDs", "neighbor timeslots" is recorded as 2, and in the subsequent continuous reception message, the hop count 2 may be updated as hop count 1. When the M INF slots end, the new node gathers information about its surrounding two-hop partial neighbors. Here, the partial neighbor information is because there are a plurality of control subframes in the time frame, and each control subframe only includes partial node time slots in two hops, but since each neighbor node transmits not only own information but also information of one hop neighbor node, a new node can grasp the allocation situation of the whole network time slots in two hop ranges of the new node through broadcast information of the partial neighbor node.
After grasping the time slot occupation condition of the neighboring nodes of the two hops around the new node, the new node randomly selects an unoccupied time slot as a reservation time slot, and then broadcasts self reservation information to the neighboring nodes in the RES time slot. It should be noted that this reserved time slot may not be the most suitable because it is based on incomplete information. Therefore, additional checks are required to ensure that the reserved slots do not collide within 2 hops.
The new node broadcasts a reservation message to neighbors on RES slots and if any neighbors detect a collision, they send a "FALSE" signal back on CON slots. Note that the new node can negotiate with all its neighbors at the same time, thereby greatly reducing the time required for slot allocation. If no signal is sent back on the confirmed time slot, the reserved time slot is approved to be used by all neighbors, and each node updates the own neighbor node information table and the time slot allocation table; otherwise, the new node will retry using a different slot in the next control subframe. The new node accumulates additional node information in each control subframe, so as the number of retries increases, the probability of successful slot allocation increases. If the new node fails to acquire one slot in consecutive K control subframes, the new node will delay allocating slots and retry later since there is no slot currently idle. This will occur when the number of nodes within a 2-hop distance reaches a preset maximum number of nodes N.
The specific steps of node network withdrawal are as follows:
when the node is ready to leave the network, the node does not need to interact with additional control information and leaves directly. In the control time slot of the next frame period of the node leaving, the neighbor node does not receive the node information sent by the node, so that the ID and the corresponding information of the neighbor node are deleted from the neighbor node information table and the time slot allocation table, and the neighbor node leaving the node finishes updating the leaving information after the last control time slot of the next period is finished, and the network is removed.
S4: after the node is accessed to the network, according to the self time slot occupation and idle time slot access algorithm, service information is sent in the corresponding data time slot, and then the next cycle is entered;
in this protocol, the nodes perform time slot access in two ways, and the first is to transmit according to a fixed time slot selected when they access the network, and since our frame length is greater than the maximum number of nodes that may exist in the contention area of the network, some idle time slots may exist. In the second approach, the nodes compete for data information slots according to a priority algorithm. Each node in the network calculates the priority I of all nodes in the idle time slot according to the following formula prio : the specific formula is
Wherein i represents the unique identity ID of the node, t represents the number of the data time slot, and in the algorithm, the value range of t is the number set of all the current idle time slots. All nodes have different priorities in different data information time slots through exclusive OR operation of the node ID numbers and t, and the priorities of all nodes in the same data information time slot are different from each other. The calculation of the priority is independently performed in each node, and the global network topology is not required to be mastered. The method is applied to ensure that all nodes are consistent in priority calculation.
To sum up, after the node is connected to the network, we use the following time slot access algorithm: the node checks the state of the current data slot, and can be divided into the following three cases:
(1) If the current time slot is allocated to other nodes in the competition area, maintaining a monitoring state;
(2) If the current time slot is the self-assigned time slot, carrying out data transmission;
(3) If the current time slot is an idle time slot, adopting a formula (1) to calculate the self transmission priority I prio And calculates the priority value set P of all nodes in the competition area prio If (if)Accessing the current time slot, otherwise, keeping monitoringStatus of the device.
The dynamic time slot allocation method provided in this embodiment is specifically implemented as follows:
as shown in fig. 5, step 1, constructing a network model by using multiple nodes, and determining a time frame structure; assuming that the inherent node topology structure in the network model is as shown in solid line connection, the numbers in the nodes represent the IDs allocated to the nodes, and the maximum number n=8 of nodes in the contention range (two-hop range) is assumed, and the number k=2 of control subframes, the number m=4 of INF slots in one control subframe, and the frame length is (4+3) ×2+8=22, and the specific structure is shown in fig. 11;
step 2, as shown in fig. 5, for the network model constructed in the previous step, initializing the time slot occupied by the initial node to complete the construction of the neighbor node information table and the time slot allocation table of each node; for initial nodes 1-4 in the network, initializing the occupied time slot, and constructing an own time slot allocation table by using bracketed numbers in the nodes to represent the time slot occupied by the initialization.
And then, according to the initial topological structure of the network, each node completes updating neighbor information and constructs an own neighbor node information table.
As shown in fig. 6 and step 3, it is assumed that the node 5 completes the start time synchronization of the frame before the first control subframe, transmits a network access request at the REQ slot of the first control subframe, and then listens. In the INF 1 and INF 2 time slots of the first control subframe, the node 1 and the node 4 broadcast time slot occupation information of their own and one-hop neighbors respectively, specifically, the node 1 broadcasts ID and time slot occupation conditions of the node 1 and the node 2, and the node 4 broadcasts ID and time slot occupation conditions of the node 4 and the node 2. However, since the node 4 is not a neighboring node of the node 5 and cannot directly communicate with the node 5, the node 5 actually only receives the information broadcast by the node 1, so after the first control subframe INF time slot, the neighbor node information table and the time slot allocation table of the node 5 are shown in table 1 and table 2:
TABLE 1 Adjacent node information Table A
Neighboring point ID Number of hops Occupied time slot
1 1 1
2 2 5
TABLE 2 time slot Allocation Table A
Time slot number Time slot 1 Time slot 2 Time slot 3 Time slot 4 Time slot 5 Time slot 6 Time slot 7 Time slot 8
Node ID 1 2
The node 5 finds that the slots 2, 3, 4, 6, 7, 8 are unoccupied according to the slot allocation table a, randomly selects one slot to occupy, for example slot 2, and then broadcasts its own reserved slot on the RES slot. After receiving the reservation information broadcast by the node 5, all the neighbor nodes (nodes 1, 2 and 3) compare the reservation time slot with the time slot occupied by the node and the one-hop neighbor, wherein the node 2 finds that the reservation time slot conflicts with the time slot occupied by the node 4 (both are time slots 2), then a 'FALSE' signal is sent in the CON time slot, the node 5 stops network access after receiving the signal, and a network access request is resent in the REQ time slot of the next control subframe, namely the second control subframe. Then, in INF5, INF6 time slots, node 2 and node 3 broadcast their own and one-hop neighbor time slot occupancy information, respectively. Specifically, the node 2 broadcasts the ID and the time slot occupation conditions of the node 2, the node 1, the node 3 and the node 4, and the node 3 broadcasts the ID and the time slot occupation conditions of the node 3 and the node 2; after the second control subframe INF slot, the neighbor node information table and the slot allocation table of the node 5 are shown in tables 3 and 4:
TABLE 3 neighbor node information Table B
Neighboring point ID Number of hops Occupied time slot
1 1 1
2 1 5
3 1 6
4 2 2
TABLE 4 time slot Allocation Table B
Time slot number Time slot 1 Time slot 2 Time slot 3 Time slot 4 Time slot 5 Time slot 6 Time slot 7 Time slot 8
Node ID 1 4 2 3
The node 5 finds that the slots 3, 4, 7, 8 are unoccupied according to the slot allocation table B, randomly selects one slot to occupy, for example slot 3, and then broadcasts its own reserved slot on the RES slot. All the neighbor nodes (nodes 1, 2 and 3) do not detect any conflict after receiving the broadcast information of the node 5, and do not send any signal in CON time slots; node 5 does not receive the signal at CON and the network access is successful.
If it is assumed that the node 5 completes frame start time synchronization before the second control subframe, it sends a network access request in the REQ slot of the second control subframe, then in INF5 and INF6 slots, the node 2 and the node 3 broadcast their own and one-hop neighbor slot occupancy information respectively, after the INF slot of the second control subframe, the neighbor node information table and the slot occupancy table of the node 5 are shown in tables 3 and 4, and then the procedure is the same as above, and network access is successful.
As shown in fig. 7 and step 5, the arrival data slot stage, according to the node slot occupancy, the nodes 1, 2, 3, 4, 5 will transmit in the assigned slots 1, 5, 6, 2, 3, respectively. In addition, for unoccupied slots 4, 7, 8, nodes 1-5 calculate priority values according to equation (1), the calculation result priority table of which is as follows:
TABLE 5 priority of time slots for nodes
As can be seen from table 5, node 1 has a higher priority in time slot 8 than other competing nodes, so node 1 obtains access to time slot 8; similarly, node 4 obtains access to time slot 4 and node 5 obtains access to time slot 7.
In summary, the present invention provides a dynamic time slot allocation method suitable for a high dynamic ad hoc network, which has the following advantages compared with the existing allocation method:
firstly, the method provides a node quick network access strategy, and a plurality of control subframes are set in one frame, and each control subframe is used for network access of a new node and broadcasting dynamic information of partial nodes in the network, so that the network access time delay of the new node is reduced, and the quick network access requirement of the high-dynamic self-organizing network node is met.
Secondly, the method provides a time slot access algorithm, and accesses the data time slots through the fixed time slots selected when each node accesses the network and the self transmission priority calculated in the idle time slots, so that the two-hop neighbor nodes of each time slot can perform data transmission without conflict, the channel space division multiplexing is realized, and the throughput of the network is improved.
The above embodiment is only one of the implementation manners capable of implementing the technical solution of the present invention, and the scope of the claimed invention is not limited to the embodiment, but also includes any changes, substitutions and other implementation manners easily recognized by those skilled in the art within the technical scope of the present invention.

Claims (10)

1. A dynamic time slot allocation method suitable for a highly dynamic ad hoc network, comprising:
constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes;
based on the constructed time frame, each node performs control information interaction, and updates a time slot allocation table corresponding to each node according to the network access condition of the new node;
and based on the updated time slot allocation table, allocating a current idle time slot for each node so that each node can send service information in the corresponding data time slot.
2. The method for dynamic time slot allocation for a highly dynamic ad hoc network according to claim 1, wherein said time frame comprises a control portion and a data portion, wherein the control portion comprises a plurality of control time slots, said control time slots comprising an access request time slot, a message time slot, an announcement reservation time slot and an acknowledgement time slot; the data portion includes a plurality of data slots; the total number of information slots in each time frame is equal to the total number of data slots.
3. The dynamic time slot allocation method for a high dynamic ad hoc network according to claim 2, wherein when a new node is pre-joined to the network, request information is transmitted in an access request time slot, neighbor node information of the new node is collected in a subsequent information time slot, self reservation results are broadcast in an announcement reservation time slot, and finally, collision is detected through the neighbor node, and the access condition of the new node is determined in a confirmation time slot.
4. A method for dynamic time slot allocation for a highly dynamic ad hoc network according to claim 3, wherein the specific steps of the new node network access are as follows:
the new node completes the initial time synchronization of the time frame before sending the network access request, broadcasts request information to the network in the network access request time slot in the control subframe, and then monitors; in the next information time slot, the neighbor node broadcasts node information in its own corresponding control time slot; after receiving the broadcasted node information, the new node updates the neighbor node information table and the time slot allocation table of the new node; when the information time slot is finished, the new node collects the relevant information of the neighbors of the two-hop part around the new node;
the new node randomly selects an unoccupied time slot as a reservation time slot according to the related information of the neighboring nodes of the two surrounding hops, and then broadcasts own reservation information to the neighboring nodes in the notification reservation time slot; if no signal is sent back on the confirmation time slot, the notification reservation time slot is approved to be used by all neighbor nodes, the new node accesses the network, and each node updates the information table of the neighbor node and the time slot allocation table; otherwise, the new node will re-attempt to access the network using a different time slot in the next control subframe until the current advertised reserved time slot is approved for use by all neighbor nodes.
5. The method for dynamic slot allocation for a high dynamic ad hoc network according to claim 1, wherein the current free slot is allocated to each node based on the updated slot allocation table in combination with the free slot allocation method.
6. The method for allocating dynamic timeslots suitable for a high dynamic ad hoc network as claimed in claim 5, wherein the step of allocating the current free timeslots for each node by using the free timeslot allocation method comprises the steps of:
selecting a node corresponding to the maximum transmission priority from all nodes in the competition area, and distributing a current idle time slot for the node; the transmission priority is obtained according to exclusive OR operation of the unique identity of the node and the number of the data time slot.
7. The method for allocating dynamic time slots for a high dynamic self-organizing network according to claim 1, wherein the network model is obtained by constructing a plurality of nodes, and for the constructed network model, the time slot occupied by an initial node is initialized based on a time frame, so that the construction of the neighbor node information table and the time slot allocation table of each node is completed.
8. A dynamic time slot allocation system adapted for use in a highly dynamic ad hoc network, for implementing the steps of the dynamic time slot allocation method adapted for use in a highly dynamic ad hoc network as claimed in any one of claims 1-7, comprising:
the time frame construction module is used for constructing a time frame of the network model, wherein the time frame comprises a plurality of control subframes;
the information interaction module is used for carrying out control information interaction on each node based on the constructed time frame and updating a time slot allocation table corresponding to each node according to the network access condition of the new node;
and the idle time slot allocation module is used for allocating the current idle time slot for each node based on the updated time slot allocation table so that each node can send service information in the corresponding data time slot.
9. An apparatus, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the dynamic time slot allocation method for a highly dynamic ad hoc network according to any of the claims 1-7 when executing said computer program.
10. A computer readable storage medium storing a computer program, characterized in that the computer program is executed by a processor for implementing the steps of the dynamic time slot allocation method for a high dynamic ad hoc network according to any one of claims 1-7.
CN202311629706.XA 2023-11-30 2023-11-30 Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment Pending CN117395780A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311629706.XA CN117395780A (en) 2023-11-30 2023-11-30 Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311629706.XA CN117395780A (en) 2023-11-30 2023-11-30 Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment

Publications (1)

Publication Number Publication Date
CN117395780A true CN117395780A (en) 2024-01-12

Family

ID=89437625

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311629706.XA Pending CN117395780A (en) 2023-11-30 2023-11-30 Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment

Country Status (1)

Country Link
CN (1) CN117395780A (en)

Similar Documents

Publication Publication Date Title
CN108024367B (en) Method, device, equipment and storage medium for dynamically allocating time slot
US9814042B2 (en) Fast wireless local area network communication method and apparatus using multiple transfer rate partitioning and cooperative transmission
KR101413777B1 (en) TDMA frame structure of Ad-Hoc network and dynamic time slot assignment method using the same
CN110225593B (en) Random number idle time slot competition method in distributed TDMA protocol
CN104640172A (en) D2D (device to device) discovery signal transmitting method and D2D discovery signal transmitting device
CN108366393B (en) Wireless network communication system, network communication method and communication equipment
CN100559738C (en) The multi-address access method according to requirement that the band conflict is decomposed
EP1936870B1 (en) Distributed scheduling access in a wireless network
CN114448549A (en) Ad hoc network dynamic TDMA control time slot allocation method based on adjacent node information
KR102049047B1 (en) Method of data transmitting and receiving in the talk-around direct communication network
WO2012021131A1 (en) Common control channel design and coexistence mechanism for tv white space
CN102118832B (en) Dynamic time slot allocation access method for networking of frequency-hopping radio station
EP4106459A1 (en) On demand data delivery in a wireless network
US6781967B1 (en) Scheduling techniques for receiver directed broadcast applications
US20160014670A1 (en) Method for generating network route using tv white space
CN117395780A (en) Dynamic time slot allocation method suitable for high dynamic self-organizing network and related equipment
CN111491320B (en) Network resource processing method and device and electronic equipment
CN108471640B (en) Dynamic and static mixed time slot allocation method and system
US7397810B1 (en) Artery nodes
CN112672358B (en) Time slot scheduling method based on mobile ad hoc network
Hsu et al. A multi-channel mac protocol using maximal matching for ad hoc networks
US20240114492A1 (en) Wireless resource scheduling method, electronic device, and storage medium
CN110190873B (en) Wired communication method supporting multiple users
CN107690194B (en) Method and equipment for configuring network beacon in wireless sensor network
CN116406005A (en) Wireless resource scheduling method, device and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination