CN115767736B - Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network - Google Patents
Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network Download PDFInfo
- Publication number
- CN115767736B CN115767736B CN202211420805.2A CN202211420805A CN115767736B CN 115767736 B CN115767736 B CN 115767736B CN 202211420805 A CN202211420805 A CN 202211420805A CN 115767736 B CN115767736 B CN 115767736B
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- state table
- time
- reapplication
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 230000003993 interaction Effects 0.000 claims abstract description 64
- 230000000977 initiatory effect Effects 0.000 claims description 4
- 230000011664 signaling Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 14
- 238000004590 computer program Methods 0.000 description 6
- 230000002452 interceptive effect Effects 0.000 description 5
- 108700026140 MAC combination Proteins 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a continuous time frame reservation method based on a hybrid TDMA wireless ad hoc network, which comprises the following steps: each node broadcasts a respective time slot statement to neighboring nodes; the time slot declaration comprises a time slot declaration of the node; each node updates the local time slot state table according to the received time slot statement; each node generates interaction information according to the respective local time slot state table, and broadcasts the interaction information to the neighbor nodes; each node updates the local time slot state table according to the received interaction information; each node transmits data according to its local slot state table. The invention also discloses a continuous time frame reservation system based on the hybrid TDMA wireless ad hoc network. Aiming at the working characteristics of low time delay and multiple services of multimedia services, the invention solves the problem of single-node multi-time slot reservation on the basis of not introducing new signaling overhead.
Description
Technical Field
The invention belongs to the technical field of wireless ad hoc networks, and relates to a continuous time frame reservation method and system based on a hybrid TDMA wireless ad hoc network.
Background
For the wireless ad hoc network, channel resources are flexibly and reasonably allocated according to node service requirements and network topology changes, so that the wireless ad hoc network is a main purpose of an MAC protocol, and the distributed reservation MAC channel access protocol has strong adaptability to network topology changes and high channel utilization rate and is widely applied to wireless communication systems.
Typical distributed reservation protocols are the Unified Slot Allocation Protocol (USAP) and the five-step reservation protocol (FPRP). The USAP protocol adopts a mode of applying for reservation, each node in the network periodically performs time slot update (application) and release, and the maintenance of a time slot state table of the protocol is too complex. The FPRP uses a handshake contention mechanism to contend with other nodes to acquire TDMA slots, which is very cumbersome to signal interactions. And the data terminal with successful reservation of the protocol can only use the information time slot in the current frame, and a long message can be transmitted only by reserving for a plurality of times, so that the data delay is larger.
The traditional reservation MAC protocol adopts a continuous occupation mode to realize reservation of a plurality of time slots, and after communication is finished, occupied resources are released by sending withdrawal signaling. When the data traffic is large, the continuous occupation for a long time cannot adapt to the network topology change.
With the popularity of voice and multimedia services in ad hoc networks, the conventional distributed reservation MAC protocol has failed to meet the requirements.
Disclosure of Invention
The invention aims to provide a continuous time frame reservation method and a continuous time frame reservation system based on a hybrid TDMA wireless ad hoc network, which solve the problem of single-node multi-time slot reservation on the basis of not introducing new signaling overhead aiming at the working characteristics of low time delay and multiple services of multimedia services.
In order to solve the technical problems, the invention provides a continuous time frame reservation method based on a hybrid TDMA wireless ad hoc network, which comprises the following steps:
each node broadcasts the respective time slot declaration to the neighbor nodes in the declaration time slots;
each node updates the local time slot state table according to the received time slot statement;
each node generates interaction information according to the respective local time slot state table, and broadcasts the interaction information to the neighbor nodes in the interaction time slots;
each node updates the local time slot state table according to the received interaction information;
each node judges whether node competition exists according to the respective local time slot state table;
if node competition exists, carrying out time slot competition according to a local time slot state table to obtain a competition result; updating the local time slot state table of the corresponding node according to the competition result; the node sends data according to the local time slot state table;
if there is no node competition, the node transmits data according to its local time slot state table.
Preferably, the method further comprises the following steps:
when the node does not occupy the subsequent time frame any more, the node releases the time slot at the end of the present time frame.
Preferably, each node broadcasts a respective time slot declaration to neighboring nodes in a declaration time slot, specifically comprising the steps of:
judging whether each node initiates an application for the first time;
if the node initiates the application for the first time, generating a time slot statement according to a corresponding local time slot state table, and broadcasting the time slot statement to neighbor nodes;
if the node is not the first initiation application, judging whether the node continuously occupies the time frame according to the corresponding local time slot state table; if the node does not continuously occupy the time frame, generating a time slot statement according to the corresponding local time slot state table, and broadcasting the time slot statement to the neighbor node.
Preferably, each node updates its own local time slot state table according to the received time slot declaration; the method specifically comprises the following steps:
each node judges whether the corresponding sending node is a reapplication according to the received time slot statement;
if the sending node is reapplied, the sending node checks the current occupied number n of the remaining time slots, and the sending node obtains reapplied occupied number k according to the time slot statement; in a local time slot state table of a receiving node, updating the occupied time slot of k time frames from the (n+1) th time frame;
if the sending node is not reapplied, the receiving node updates the local time slot state table according to the corresponding time slot statement.
Preferably, each node generates interaction information according to the respective local time slot state table, and broadcasts the interaction information to neighboring nodes in the interaction time slot, specifically comprising the following steps:
each node judges whether the node continuously occupies the time frame according to the respective local time slot state table;
if the node continuously occupies the time frame, judging whether the node is reapplied according to the corresponding local time slot state table; if the request is reapplied, generating interaction information according to the corresponding local time slot state table, and broadcasting the interaction information to the neighbor nodes;
if the node does not occupy the time frame continuously, generating interaction information according to the corresponding local time slot state table, and broadcasting the interaction information to the neighbor nodes.
Preferably, the time slot declaration includes a source node number, a reapplication identifier, a flag bit and a occupation number;
the interaction information comprises a source node number, a reapplication identifier, a flag bit and occupation times.
Preferably, each node determines whether the corresponding transmitting node is a reapplication according to the received time slot statement, and specifically includes the following steps:
judging whether the corresponding sending node is reapplied according to the reapplication identifier in the time slot statement;
if the state of the reapplication identifier in the time slot statement is the reapplication state, judging that the corresponding sending node is reapplication;
if the state of the reapplication identifier in the time slot statement is the non-reapplication state, judging that the corresponding sending node is the non-reapplication.
Preferably, each node updates its own local time slot state table according to the received interaction information, and specifically includes the following steps:
each node judges whether the corresponding sending node is a reapplication according to the received interaction information;
if the sending node is reapplied, the sending node checks the occupied number n of the current remaining time slot, and the sending node obtains reapplied occupied number k according to the interaction information; in a local time slot state table of a receiving node, updating the occupied time slot of k time frames from the (n+1) th time frame;
if the sending node is not applied again, the receiving node updates the local time slot state table according to the corresponding interaction information.
The invention also provides a continuous time frame reservation system based on the hybrid TDMA wireless ad hoc network, which comprises the following steps:
the time slot declaration broadcasting module is used for broadcasting the respective time slot declaration to the neighbor nodes in the declaration time slots;
the updating module is used for updating the local time slot state tables of the nodes according to the received time slot statement; the method is also used for updating the local time slot state tables of the nodes according to the received interaction information; the local time slot state table of the corresponding node is updated according to the competition result;
the interactive information broadcasting module is used for generating interactive information according to the local time slot state tables of the nodes and broadcasting the interactive information to the neighbor nodes in the interactive time slots;
the judging module is used for judging whether node competition exists or not according to the local time slot state tables of the nodes;
the competition module is used for carrying out time slot competition according to the local time slot state table to obtain a competition result;
and the sending module is used for sending data according to the local time slot state table of each node.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a continuous time frame reservation method of a wireless ad hoc network based on a hybrid HP-TDMA protocol, solves the problems that the current reservation MAC protocol has large time delay and cannot adapt to a dynamic network, and realizes continuous and sectional reservation of time slot resources. Aiming at the working characteristics of low time delay and multiple services of multimedia services, the invention solves the problem of single-node multi-time slot reservation on the basis of not introducing new signaling overhead.
Drawings
The following describes the embodiments of the present invention in further detail with reference to the accompanying drawings.
FIG. 1 is a schematic diagram of a declaration phase flow;
FIG. 2 is a schematic diagram of a network topology;
FIG. 3 is a schematic diagram of a protocol frame structure;
FIG. 4 is a diagram illustrating a control information frame structure;
FIG. 5 is a schematic diagram of a time slot declaration message for each node of time frame 1;
FIG. 6 is a schematic diagram of a time frame 1 in which nodes interact with information messages;
FIG. 7 is a schematic diagram of a time slot declaration message for each node of time frame 2;
FIG. 8 is a schematic diagram of a time frame 2 in which nodes interact with information messages;
FIG. 9 is a schematic diagram of a time slot declaration message for each node of time frame 4;
FIG. 10 is a schematic diagram of a time frame 4 in which nodes interact with information messages;
fig. 11 is a flowchart of a continuous time frame reservation method based on a hybrid TDMA wireless ad hoc network according to the present invention.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. The present invention may be embodied in many other forms than those herein described, and those skilled in the art will readily appreciate that the present invention may be similarly embodied without departing from the spirit or essential characteristics thereof, and therefore the present invention is not limited to the specific embodiments disclosed below.
The terminology used in the one or more embodiments of the specification is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of the specification. As used in this specification, one or more embodiments and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used in one or more embodiments of the present specification refers to and encompasses any or all possible combinations of one or more of the associated listed items.
It should be understood that, although the terms first, second, etc. may be used in one or more embodiments of this specification to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, a first may also be referred to as a second, and similarly, a second may also be referred to as a first, without departing from the scope of one or more embodiments of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.
The invention is described in further detail below with reference to fig. 1-11:
as shown in fig. 11, the present invention provides a continuous time frame reservation method based on a hybrid TDMA wireless ad hoc network, comprising the steps of:
each node broadcasts the respective time slot declaration to the neighbor nodes in the declaration time slots;
each node updates the local time slot state table according to the received time slot statement;
each node generates interaction information according to the respective local time slot state table, and broadcasts the interaction information to the neighbor nodes in the interaction time slots;
each node updates the local time slot state table according to the received interaction information;
each node judges whether node competition exists according to the respective local time slot state table;
if node competition exists, carrying out time slot competition according to a local time slot state table to obtain a competition result; updating the local time slot state table of the corresponding node according to the competition result; each node transmits data according to the local time slot state table;
if there is no node competition, each node transmits data according to its local time slot state table.
Preferably, one embodiment further comprises the steps of:
when the node does not occupy the subsequent time frame any more, the node releases the time slot at the end of the present time frame.
Preferably, in one embodiment, the slot declaration includes a source node number, a reapplication identifier, a flag bit, and a number of occupancies.
In a preferred embodiment, each node broadcasts a respective time slot statement to neighboring nodes, specifically comprising the steps of:
judging whether each node initiates an application for the first time;
if the node initiates the application for the first time, generating a time slot statement according to a corresponding local time slot state table, and broadcasting the time slot statement to neighbor nodes;
if the node is not the first initiation application, judging whether the node continuously occupies the time frame according to the corresponding local time slot state table; if the node does not continuously occupy the time frame, generating a time slot statement according to the corresponding local time slot state table, and broadcasting the time slot statement to the neighbor node.
In this embodiment, in particular:
a) The first initiation of an application requires a slot declaration (including re-application);
b) Unnecessary refilling of slot declarations for time frames in successive occupancies;
c) The first contended time slot of the nodes that continuously occupy the time frame needs to be declared in the next time frame.
In a preferred embodiment, each node updates its own local slot state table according to the received slot declaration; the method specifically comprises the following steps:
each node judges whether the corresponding sending node is a reapplication according to the received time slot statement;
if the sending node is reapplied, the sending node checks the current occupied number n of the remaining time slots, and the sending node obtains reapplied occupied number k according to the time slot statement; in a local time slot state table of a receiving node, updating the occupied time slot of k time frames from the (n+1) th time frame;
if the sending node is not reapplied, the receiving node updates the local time slot state table according to the corresponding time slot statement.
In this embodiment, after each node receives the slot declaration, the local slot state table is updated according to the received slot declaration, and the number of slot state tables to be maintained by the node is 2 times of the maximum occupation number, where the maximum occupation number should support dynamic change of network topology, and specifically updating the slot state table is as follows: the time slot flag bit and the occupied times are recorded, and the time slot state table of the time frame is sequentially updated according to the occupied times (the occupied times are sequentially decreased). For the nodes of the continuous occupied time frames, the nodes need to record the number of the frames which are currently continuously occupied.
In a preferred embodiment, the interaction information includes a source node number, a reapplication identifier, a flag bit, and a number of times of occupation.
In a preferred embodiment, each node generates interaction information according to the respective local time slot state table and broadcasts the interaction information to neighboring nodes; the method specifically comprises the following steps:
each node judges whether the node continuously occupies the time frame according to the respective local time slot state table;
if the node continuously occupies the time frame, judging whether the node is reapplied according to the corresponding local time slot state table; if the request is reapplied, generating interaction information according to the corresponding local time slot state table, and broadcasting the interaction information to the neighbor nodes;
if the node does not occupy the time frame continuously, generating interaction information according to the corresponding local time slot state table, and broadcasting the interaction information to the neighbor nodes.
In this embodiment, in particular:
a) Nodes in the continuous occupied time frames do not need to be filled with interaction information again;
b) And the interactive information is filled in the reapplied requirement.
If the node already applies for occupying part of time slots, judging that the current remaining time slots can not transmit data, and needing to apply for more time slots, the node actively initiates reapplication and marks in a time slot statement, and the application is reapplication.
In a preferred embodiment, each node determines whether the corresponding transmitting node is a reapplication according to the received slot declaration, and specifically includes the following steps:
judging whether the corresponding sending node is reapplied according to the reapplication identifier in the time slot statement;
if the state of the reapplication identifier in the time slot statement is the reapplication state, judging that the corresponding sending node is reapplication;
if the state of the reapplication identifier in the time slot statement is the non-reapplication state, judging that the corresponding sending node is the non-reapplication.
In a preferred embodiment, each node updates its own local time slot state table according to the received interaction information, and specifically includes the following steps:
judging whether the corresponding sending node is a reapplication or not according to the interaction information;
if the sending node is a reapplication, checking the occupied times n of the remaining time slots of the node, and obtaining reapplication occupied times k according to the interaction information; in a local time slot state table of a receiving node, updating the occupied time slot of k time frames from the (n+1) th time frame;
if the receiving node is not applied again, the local time slot state table is updated according to the corresponding interaction information.
In this embodiment, the interaction phase is the same as the declaration phase flow.
Preferably, in one embodiment, after the information interaction is completed;
if the node competition exists in the time frame, the node performs time slot competition according to the local time slot state table, and finally the time slot occupation condition of each node is determined;
if the reapplied time slot state exists, time slot competition is needed to be carried out in the reapplied time frame;
when the time slot status is continuous, the competition needs to be completed in the corresponding time frame time slot status table.
The invention also provides a continuous time frame reservation system based on the hybrid TDMA wireless ad hoc network, which comprises the following steps:
the time slot statement broadcasting module is used for broadcasting respective time slot statement to the neighbor nodes by each node;
the updating module is used for updating the local time slot state tables of the nodes according to the received time slot statement; the method is also used for updating the local time slot state tables of the nodes according to the received interaction information; the local time slot state table of the corresponding node is updated according to the competition result;
the interaction information broadcasting module is used for generating interaction information according to the respective local time slot state tables by each node and broadcasting the interaction information to the neighbor nodes;
the judging module is used for judging whether node competition exists or not according to the local time slot state tables of the nodes;
the competition module is used for carrying out time slot competition according to the local time slot state table to obtain a competition result;
and the sending module is used for sending data according to the local time slot state table of each node.
An example of a continuous time frame reservation based on a hybrid TDMA wireless ad hoc network is given below, which will explain in detail the embodiments of the present invention. The set example known condition elements are as follows:
the system in this example is a wireless ad hoc network and the slot allocation procedure is described below in terms of a network topology as shown in fig. 2.
The service scene is as follows: 1. the node 4 only needs to use the main time slot of the time frame 1; 2. the 6 and 7 nodes need to compete for additional time slots, the 2 and 6 nodes need to occupy time slots in 2 time frames continuously, the 7 node needs to occupy time slots in 4 time frames continuously, the 6 and 7 nodes start to occupy from the time frame 1, the node 2 starts to occupy from the time frame 4, the 7 nodes initiate reapplication in the time frame 2, and the reapplication quantity is 2 time frames. As shown in the following table;
| node | Time frame 1 | Time frame 2 | Time frame 3 | Time frame 4 | Time frame 5 | Time frame 6 |
| 1 | Occupancy of | |||||
| 2 | Occupancy of | Occupancy of | ||||
| 4 | Occupancy of | |||||
| 6 | Occupancy of | Occupancy of | ||||
| 7 | Occupancy of | Initiate reapplication | Occupancy of | Occupancy of | Occupation of reapplication | Occupation of reapplication |
The present example is based on the HP-TDMA protocol, employing a fixed allocation and contention scheme to occupy time slots.
Each part of the time frame is divided into 7 sub-slots, corresponding to 7 nodes in the network. Each sub-slot of the information transmission stage is called a master slot of each node. As shown in fig. 3;
the control information frame structure is as shown in fig. 4, and includes:
(1) Type (2): "0" means "slot declaration", "1" means "interaction information";
(2) Source node number: for identifying the source node number;
(3) And then applying for identification: the bit number of the bit is 2,
00: non-reapplication;
01: occupying after 1 time frame;
10: occupying after 2 time frames;
11: occupied after 3 time frames.
(4) The flag bit: the node time slot demand condition is declared,
00: no time slots need to be used;
01: only the primary slot is used;
10: contention slots are required.
(5) The number of occupied times: the number of time slots that a node contends for to occupy is declared.
00: only occupying the time slot in the time frame;
01: the time slots in 2 time frames are occupied;
10: the time slots in 3 time frames are occupied;
11: the time slots in 4 time frames are occupied.
Under the above scenario, the specific flow of continuous time frame reservation is as follows:
time frame 1:
(1) Declaration phase
After the state of using each node time slot, the time slot condition of the node is informed to the neighbor node. The contents sent by the nodes 1, 4, 6, 7 at the declaration node are as shown in fig. 5 (2, 3, 5 are abbreviated):
table 1 State table-time frame 1 of each node after completion of the declaration phase
(2) Interaction phase
Through the declaration phase, the node obtains the time slot use condition of the adjacent node. After interaction, the time slot use state of each node, namely, the time slot occupation condition of the node is informed to the two-hop node. As shown in fig. 6;
table 2 time slot status table-time frame 1 for each node after completion of the interaction phase
(III) Competition stage
Through the information interaction stage, each node in the two-hop range can compete for using the time slot of the node without time slot resource and the time slot of each node outside the two-hop range. In this stage, any algorithm with better fairness is used for competition, which is not the focus of the present invention, and will not be described here again, assuming that node 6 finally competes for time slot 1, and node 7 competes for time slot 3.
(IV) Release/continuous occupancy
Before entering the declaration stage of the time frame 2, the node which only needs to occupy a time frame releases the time slot after completing data transmission; the node which needs to be occupied continuously keeps the occupied state and updates the occupied times.
Table 3 time frame 1 release/continuous occupied time slot state table
Time frame 2:
(1) A declaration phase, as shown in FIG. 7;
table 4 states table of time slots of nodes after completion of declaration phase-time frame 2
And the node receives the reapplication and updates the corresponding time frame.
Table 5 states table of time slots of nodes after completion of declaration phase-time frame 5
(2) An interaction phase, as shown in fig. 8;
table 6 time slot State Table-time frame 2 for each node after completion of the interaction phase
Table 7 time slot status table for each node after completion of the interaction phase-time frame 5
(3) Competition stage
For the time frame 2, the time slots in continuous occupation are all adopted, and no competition is needed; for time frame 5, the first receipt of the reapplication requires contention slots, assuming that node 7 again continuously occupies contention slots of 2.
(4) Release/continuous occupancy
Table 8 time frame 2 release/continuous occupancy time slot state table
The time frame 3 has no new application and is omitted;
time frame 4:
(1) A declaration phase, as shown in fig. 9;
table 9 states table of time slots of nodes after completion of declaration phase-time frame 4
Table 10 states table of time slots of nodes after completion of declaration phase-time frame 5
(2) An interaction phase, as shown in fig. 10;
table 11 time slot status table-time frame 4 for each node after completion of the interaction phase
Table 12 time slot status table-time frame 5 for each node after completion of the interaction phase
In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and the division of modules, or units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units, modules, or components may be combined or integrated into another apparatus, or some features may be omitted, or not performed.
The units may or may not be physically separate, and the components shown as units may be one physical unit or a plurality of physical units, may be located in one place, or may be distributed in a plurality of different places. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such embodiments, the computer program may be downloaded and installed from a network via a communication portion, and/or installed from a removable medium. The above-described functions defined in the method of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU). The computer readable medium of the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The foregoing is merely illustrative of specific embodiments of the present invention, and the scope of the present invention is not limited thereto, but any changes or substitutions within the technical scope of the present invention should be covered by the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (3)
1. The continuous time frame reservation method based on the hybrid TDMA wireless ad hoc network is characterized by comprising the following steps of:
each node broadcasts the respective time slot declaration to the neighbor nodes in the declaration time slots;
judging whether each node initiates an application for the first time;
if the node initiates the application for the first time, generating a time slot statement according to a corresponding local time slot state table, and broadcasting the time slot statement to neighbor nodes;
if the node is not the first initiation application, judging whether the node continuously occupies the time frame according to the corresponding local time slot state table; if the node does not occupy the time frame continuously, generating a time slot statement according to the corresponding local time slot state table, and broadcasting the time slot statement to the neighbor node; the time slot declaration comprises a source node number, a reapplication identifier, a flag bit and occupation times;
judging whether the corresponding sending node is reapplied according to the reapplication identifier in the time slot statement; if the state of the reapplication identifier in the time slot statement is the reapplication state, judging that the corresponding sending node is reapplication; if the state of the reapplication identifier in the time slot statement is a non-reapplication state, judging that the corresponding sending node is a non-reapplication;
if the sending node is reapplied, the sending node checks the current occupied number n of the remaining time slots, and the sending node obtains reapplied occupied number k according to the time slot statement; in a local time slot state table of a receiving node, updating the occupied time slot of k time frames from the (n+1) th time frame;
if the sending node is not reapplied, the receiving node updates a local time slot state table according to the corresponding time slot statement;
each node judges whether the node continuously occupies the time frame according to the respective local time slot state table;
if the node continuously occupies the time frame, judging whether the node is reapplied according to the corresponding local time slot state table; if the request is reapplied, generating interaction information according to the corresponding local time slot state table, and broadcasting the interaction information to the neighbor nodes; the interaction information comprises a source node number, a reapplication identifier, a flag bit and occupation times;
if the node does not occupy the time frame continuously, generating interaction information according to the corresponding local time slot state table, and broadcasting the interaction information to the neighbor node;
each node updates the local time slot state table according to the received interaction information;
each node judges whether node competition exists according to the respective local time slot state table;
if node competition exists, carrying out time slot competition according to a local time slot state table to obtain a competition result; updating the local time slot state table of the corresponding node according to the competition result; the node sends data according to the local time slot state table;
if there is no node competition, the node transmits data according to its local time slot state table.
2. A continuous time frame reservation method based on a hybrid TDMA wireless ad hoc network according to claim 1, further comprising the steps of:
when the node does not occupy the subsequent time frame any more, the node releases the time slot at the end of the present time frame.
3. The continuous time frame reservation method based on the hybrid TDMA wireless ad hoc network according to claim 1, wherein each node updates its own local time slot state table according to the received interaction information, specifically comprising the steps of:
each node judges whether the corresponding sending node is a reapplication according to the received interaction information;
if the sending node is reapplied, the sending node checks the occupied number n of the current remaining time slot, and the sending node obtains reapplied occupied number k according to the interaction information; in a local time slot state table of a receiving node, updating the occupied time slot of k time frames from the (n+1) th time frame;
if the sending node is not applied again, the receiving node updates the local time slot state table according to the corresponding interaction information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211420805.2A CN115767736B (en) | 2022-11-11 | 2022-11-11 | Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211420805.2A CN115767736B (en) | 2022-11-11 | 2022-11-11 | Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115767736A CN115767736A (en) | 2023-03-07 |
| CN115767736B true CN115767736B (en) | 2024-02-27 |
Family
ID=85370241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211420805.2A Active CN115767736B (en) | 2022-11-11 | 2022-11-11 | Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115767736B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105050186A (en) * | 2015-06-23 | 2015-11-11 | 闽南师范大学 | Broadband wireless ad hoc network MAC-layer protocol method based on TDMA |
| CN107018551A (en) * | 2017-03-07 | 2017-08-04 | 上海交通大学 | The time slot reservation method of TDMA frame structure based on orientation multibeam antenna |
| CN108430111A (en) * | 2018-01-26 | 2018-08-21 | 西安电子科技大学 | Mixed type time slot reservation method in Distributed T DMA agreements |
| CN110225593A (en) * | 2019-07-15 | 2019-09-10 | 桂林电子科技大学 | A kind of random number in Distributed T DMA agreement is left unused slot contention method |
| CN113037937A (en) * | 2019-12-25 | 2021-06-25 | 鹤壁天海电子信息系统有限公司 | Voice conference communication method and device based on centerless ad hoc network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104144024B (en) * | 2013-05-09 | 2017-08-11 | 电信科学技术研究院 | Time slot state update method and equipment |
-
2022
- 2022-11-11 CN CN202211420805.2A patent/CN115767736B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105050186A (en) * | 2015-06-23 | 2015-11-11 | 闽南师范大学 | Broadband wireless ad hoc network MAC-layer protocol method based on TDMA |
| CN107018551A (en) * | 2017-03-07 | 2017-08-04 | 上海交通大学 | The time slot reservation method of TDMA frame structure based on orientation multibeam antenna |
| CN108430111A (en) * | 2018-01-26 | 2018-08-21 | 西安电子科技大学 | Mixed type time slot reservation method in Distributed T DMA agreements |
| CN110225593A (en) * | 2019-07-15 | 2019-09-10 | 桂林电子科技大学 | A kind of random number in Distributed T DMA agreement is left unused slot contention method |
| CN113037937A (en) * | 2019-12-25 | 2021-06-25 | 鹤壁天海电子信息系统有限公司 | Voice conference communication method and device based on centerless ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115767736A (en) | 2023-03-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7447180B2 (en) | Wireless media access method | |
| KR100479865B1 (en) | Method for resolving collision in communication system using media access control based of contention | |
| CN104994583A (en) | Multi-channel MAC protocol method based on cluster mechanism in vehicular Ad hoc network | |
| CN100534068C (en) | Non-confliction on-demand multi-address access method | |
| CN110225593B (en) | Random number idle time slot competition method in distributed TDMA protocol | |
| CN111836404B (en) | End-to-end communication link establishment method, access point and station | |
| EP0720310B1 (en) | Random access system for mobile communication | |
| CN104735159A (en) | Vehicle-mounted network access method based on self-adaptive time slot allocation | |
| CN108632866A (en) | The processing method of resource occupation conflict and base station | |
| JP3433859B2 (en) | Control for multimedia communication over local access cable | |
| CN115767736B (en) | Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network | |
| EP1048153B1 (en) | System for establishing a transmission sequence for plural terminals in a wireless network | |
| KR20150015264A (en) | Method and apparatus for distributed association of wireless networks | |
| CN112543480B (en) | Voice time slot distribution and voice data transmission method based on virtual link | |
| CN113541991B (en) | Train network control system and communication control method based on time sensitive network | |
| CN101517971A (en) | Wireless network with contention and contention-free periods | |
| CN115767731A (en) | Dynamic time slot networking method, device, equipment and storage medium | |
| CN110856141A (en) | Reliable and effective vehicle-mounted self-organizing network multi-channel MAC protocol | |
| CN101384080B (en) | Network accessing method | |
| WO2023236145A1 (en) | Communication method and apparatus | |
| CN110138683B (en) | QoS-supported Internet of things data transmission method and system | |
| KR100226660B1 (en) | Method for controlling multiple access in wireless data communication network | |
| CN112672358B (en) | Time slot scheduling method based on mobile ad hoc network | |
| Peng et al. | A TDMA-like access scheme with splitting request and transmission for vehicular networks | |
| CN112969241B (en) | Multi-user competition communication method |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |