CN116074979A - Wireless self-organizing network channel access method based on node grading - Google Patents

Wireless self-organizing network channel access method based on node grading Download PDF

Info

Publication number
CN116074979A
CN116074979A CN202310104998.9A CN202310104998A CN116074979A CN 116074979 A CN116074979 A CN 116074979A CN 202310104998 A CN202310104998 A CN 202310104998A CN 116074979 A CN116074979 A CN 116074979A
Authority
CN
China
Prior art keywords
node
reservation
frame
network
data
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
CN202310104998.9A
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.)
Chongqing University
Original Assignee
Chongqing University
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 Chongqing University filed Critical Chongqing University
Priority to CN202310104998.9A priority Critical patent/CN116074979A/en
Publication of CN116074979A publication Critical patent/CN116074979A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
    • H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
    • 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
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to the technical field of mobile communication, and particularly discloses a wireless self-organizing network channel access method based on node grading, which combines the network grading result of network terminal nodes, adopts the maximum multiplexing structure of access (beacon), priority reservation, reply and layered circulation data time slots on a TDMA frame structure, so that the self-organizing network longitudinally carries out conflict avoidance by the network grading and solves the hidden terminal problem by reservation application transversely; the method adopts a mode that one reservation can occupy a plurality of time slots on the control overhead, and the data sub-frames and the network level are utilized to divide the data time slots so as to effectively improve the utilization rate of time slot resources; considering the influence of node service class on channel access probability in a channel access algorithm, dividing priority reservation time slots to meet the differentiated service quality requirements of different terminal services. The method can effectively improve the utilization rate of the wireless self-organizing network channel resources, avoid frequent data conflict of each terminal node and meet the low-delay requirement of the network.

Description

Wireless self-organizing network channel access method based on node grading
Technical Field
The invention relates to the technical field of mobile communication, in particular to a wireless self-organizing network channel access method based on node grading.
Background
The wireless self-organizing network has the characteristics of high expansibility, rapid networking, support of dynamic topology change, multi-hop transmission and the like, is a special peer-to-peer network, and requires each node to perform distributed peer-to-peer operation, namely requires network nodes to perform distributed negotiation on link resources so as to avoid transmission conflicts. The wireless self-organizing network does not have a centralized control center, so each node can only negotiate and regulate channel resources according to local information mastered by nodes in the neighborhood, and therefore, designing an efficient MAC access mechanism to independently allocate and manage limited channel resources is a key ring for guaranteeing network performance. In addition, for a large-scale distributed network, multi-hop transmission necessarily depends on a relay node to forward, and exposed terminals, hidden terminals, isolated node deadlocks and channel resource multiplexing caused by multi-hop transmission often become one of difficulties of a single-channel MAC access mechanism. In addition, the wireless self-organizing network node can access to the network, withdraw from the network or move at any time, which is easy to cause the highly dynamic change of the network topology, how to make the MAC access mechanism adapt to the change rapidly, ensures that the resource occupation relationship is not conflicted, and maintains excellent network performance is also a key problem for designing the MAC access mechanism.
Currently, wireless ad hoc network MAC access protocols are classified into contention-based and scheduling-based MAC protocols according to different reservation modes for channel resources. The CSMA/CA used by the IEEE802.11 based on the classical MAC access protocol in the wireless network uses a random contention access channel, and the delay caused by data collision increases exponentially with the increase of network nodes and transmission loads, so that the data transmission efficiency is obviously reduced; the typical distributed MAC access protocol based on scheduling is FPRP, the FPRP is based on TDMA, channels are divided into two parts of reserved channels and service channels, the low-conflict-probability TDMA service time slot allocation in the two-hop range is completed through 5-way handshake of the reserved channels, but once conflict occurs in the reserved period, all nodes can exit the reservation of the service time slot at the same time, the success rate of node reservation and the convergence rate of the reservation process are reduced to a certain extent, the FPRP reservation probability is set to be relatively monotonous, and different requirements of multi-type service nodes on time slot resources and service quality are not considered.
Therefore, the MAC access mechanism which is efficient, reliable and distributed according to needs is researched, the terminal node can realize the distributed control and management of the limited channel resources, the differentiated service quality requirements of different terminal services are met, the multiplexing problem of hidden terminals and channel resources attached to multi-hop transmission is solved, the utilization rate of wireless self-organizing network channel resources is effectively improved, frequent data collision of each terminal node is avoided, the low-delay requirement of the network is met, and the overall performance of the network is greatly optimized.
Disclosure of Invention
The invention provides a wireless self-organizing network channel access method based on node grading, which solves the technical problems that: how to realize the distributed control and management of the terminal node to the limited channel resources, meet the different service quality requirements of different terminal services and solve the multiplexing problem of hidden terminals and channel resources attached to multi-hop transmission.
In order to solve the technical problems, the invention provides a wireless self-organizing network channel access method based on node grading, which comprises the following steps:
s1, dividing a TDMA time slot resource into a plurality of TDMA time frame periods with equal intervals, and dividing each TDMA time frame period into a beacon subframe and a plurality of identical data subframes according to time according to a network function;
s2, under the distributed network, arbitrarily designating one terminal node as a network initial reference station, and carrying out network grading on other terminal nodes according to the maximum transmission distance of the network initial reference station; the step S2 specifically includes the steps of:
s21, arbitrarily selecting a terminal node from the whole distributed network as a network initial reference station, wherein the network grade is 0;
s22, after the network initial reference station is on the network, broadcasting a beacon frame with the frame level of 0 in a reference beacon subframe of a TDMA time frame period, wherein the frame level corresponds to the network level of a source node of the beacon frame;
s23, in the maximum transmission distance of a network initial reference station, terminal nodes which receive a 0-level beacon frame firstly perform network synchronization to acquire network initial time slot division, then broadcast the frame level +1 of the beacon frame downwards in a node beacon subframe of a level corresponding to the network level of the terminal node, and meanwhile, the network level of the terminal node is 1;
s24, the undetermined terminal node receives the beacon frame with the frame level more than or equal to 1, starts a timer to count after network synchronization, and counts the time T at the timing time 0 In the method, the network grading of the terminal node which is not graded is the received smaller frame grade +1, and the node beacon sub-frames which are in the grade corresponding to the network grade of the self node continue to broadcast downwards after the frame grade +1 of the beacon frame sent by the logic superior node;
s3, the rated terminal node calculates the reservation probability p of the current data subframe according to the service priority;
s4, the rated terminal node initiates reservation occupation of the current data subframe according to the reservation probability p, if reservation is successful, the data time slot corresponding to the network level of the node is occupied for service transmission, if reservation is failed, the reservation probability p' of the next data subframe is calculated, and reservation occupation is restarted;
s5, counting the services transmitted in one TDMA time frame period, and if the number of the services transmitted in the last TDMA time frame period is smaller than the number of the messages cached in the current queue, prioritizing all the services in the current queue by +1; if the number of the services sent in the previous TDMA time frame period is greater than the number of the services cached in the queue, the priority of all the services in the current queue is set to-1, and the step S3 is returned.
Further, the step S2 further includes:
after receiving the beacon frame of the logical upper node, the rated terminal node forwards the beacon frame downwards in the node beacon subframe of the level corresponding to the network level of the self node;
if the rated terminal node is at time T c If the beacon frame of the logic superior node is not received, the node is disconnected with the logic superior node, and the received beacon frame of the peer node is transmitted in the node beacon subframe of the level corresponding to the network level of the node;
if the rated terminal node is at time T c If the beacon frame of any peer or logic upper node is not received, the node is isolated by the peer and the upper node and continues waiting for T c ' time, if the conditions are the same, giving up the node network level, waiting for the beacon frame of the lower node to re-level;
if the rated terminal node receives the beacon frame which is smaller than the network level of the self node by more than 1 level, modifying the network level of the node to be the frame level +1 of the received beacon frame, and forwarding the beacon frame corresponding to the network level of the self node downwards.
Further, in step S2, the timing time T of the timer 0 For the duration of one TDMA time frame period; in step S26, T c For a duration of 4 TDMA time frame periods, T c ' is the duration of 2 TDMA time frame periods.
Further, in step S1, the beacon subframe is divided into a reference beacon subframe and a plurality of node beacon subframes according to time sequence, where each node beacon subframe includes a (1+3×n) level node beacon subframe, a (2+3×n) level node beacon subframe, a (3+3×n) level node beacon subframe, and n∈ {0,1,2. }; and the network initial reference station occupies the reference beacon subframe to downwards transmit a beacon frame, and the rated terminal node occupies the node beacon subframe of the level corresponding to the network rating to downwards transmit the beacon frame.
Further, in step S1, each data subframe is divided into a data reservation subframe and a data transmission subframe according to time sequence; the data reservation sub-frame is divided into a priority reservation time slot, a reservation application time slot, a reservation forwarding time slot and a reservation reply time slot according to time sequence, and the data transmission sub-frame is divided into a cyclic high-level data time slot, a middle-level data time slot and a low-level data time slot according to time sequence.
Further, in step S3, the data subframe reservation probability p is calculated by:
Figure BDA0004085561440000041
wherein n is c P is the number of data sub-frame contention failures in the TDMA time frame period ri The index represents all the service levels under the classification label of the service, and max { P } ri The I index represents the maximum service level under the classification label of the service, the min { } represents the minimum value taking all values, the alpha represents the reservation probability parameter and the alpha is less than 1, p max Representing the maximum value of reservation probability of a data subframe, p max ＝1。
Further, in step S4, the rated terminal node initiates reservation occupation of the current data subframe with a reservation probability p, specifically including the steps of:
s41, if the service of the terminal node is urgent, the service is in the highest priority, and the data reservation frame is broadcast to the neighborhood nodes in the priority reservation time slot of the data reservation subframe according to the reservation probability p;
s42, if the service of the terminal node is time delay sensitive or best effort, broadcasting a data reservation frame to the neighborhood node in a reservation application time slot of the data reservation subframe according to the reservation probability p;
s43, if the terminal node receives the data reservation frame only in the priority reservation time slot, broadcasting the reservation reply frame in the reservation reply time slot;
s44 if the terminal node receives the data reservation frame in the reservation application slot, and if the data reservation frame is not received in the priority reservation time slot, broadcasting the reservation reply frame in the reservation reply time slot;
s45, if the terminal node receives the data reservation frame in the reservation forwarding time slot, the terminal node does not process the data reservation frame;
and S46, after receiving the reservation reply frame, the terminal node firstly judges whether the reply node of the reservation reply frame is the node, and if so, occupies a data time slot corresponding to the node level in the corresponding data transmission subframe to send a message.
Further, in step S4, successful reservation means that a reservation reply frame corresponding to the data reservation frame is received in the reservation reply time slot of the data reservation subframe, and failed reservation means that no reservation reply frame of the node is received in the reservation reply time slot of the data reservation subframe.
Further, in step S5, if the node traffic is already at the highest priority or the lowest priority, the traffic class remains unchanged when the priority is updated.
Further, network traffic class P ri Is divided into 1,2, 3, 4, 5, 6, wherein P ri When not less than 5, the task is a best effort task, P ri Corresponding labels of (c) are: index=low; p (P) ri Emergency task when less than or equal to 2, P ri Corresponding labels of (c) are: index=high; 2 < P ri Time delay sensitive task when less than 5, P ri The corresponding label of (c) is index=middle.
The invention provides a wireless self-organizing network channel access method based on node grading, which combines the network grading result of network terminal nodes, adopts the maximum multiplexing structure of access (beacon), priority reservation, reply and layered circulation data time slot on a TDMA frame structure, so that the wireless self-organizing network can avoid conflict longitudinally by network grading and solve the hidden terminal problem transversely by reservation application; the method adopts a mode that one reservation can occupy a plurality of time slots on the control overhead, and the data sub-frames and the network level are utilized to divide the data time slots so as to effectively improve the utilization rate of time slot resources; considering the influence of node service class on channel access probability in a channel access algorithm, dividing priority reservation time slots to meet the differentiated service quality requirements of different terminal services. Compared with the prior art, the method has more intelligence, can effectively improve the utilization rate of the wireless self-organizing network channel resources, avoid frequent data conflict of each terminal node, meet the low-delay requirement of the network, and greatly optimize the overall performance of the network.
Drawings
Fig. 1 is a flowchart of a wireless ad hoc network channel access method based on node grading according to an embodiment of the present invention;
fig. 2 is a time frame structure of maximum multiplexing division of time slot resources according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of non-collision principle analysis provided by an embodiment of the present invention;
FIG. 4 is a schematic diagram of a network grading principle provided by an embodiment of the present invention;
fig. 5 is a situation analysis diagram of a node receiving a data reservation frame according to an embodiment of the present invention.
Detailed Description
The following examples are given for the purpose of illustration only and are not to be construed as limiting the invention, including the drawings for reference and description only, and are not to be construed as limiting the scope of the invention as many variations thereof are possible without departing from the spirit and scope of the invention.
The embodiment of the invention provides a wireless self-organizing network channel access method based on node grading, as shown in fig. 1, in the embodiment, the method specifically comprises steps S1-S5.
S1, dividing a TDMA time slot resource into a plurality of TDMA time frame periods with equal intervals, and dividing each TDMA time frame period into a beacon subframe and a plurality of identical data subframes according to time according to a network function.
In this step S1, as shown in fig. 2, the beacon subframe is divided into a reference beacon subframe and a plurality of node beacon subframes according to time sequence, where each node beacon subframe includes a (1+3×n) level node beacon subframe, a (2+3×n) level node beacon subframe, and a (3+3×n) level node beacon subframe, where n∈ {0,1,2. }; wherein the network initial reference station transmits a beacon frame downward with reference to the reference beacon subframe. The rated terminal node occupies the node beacon subframe of the level corresponding to the network rating and transmits the beacon frame downwards, for example, if the network node is rated as 1 and 4, the node can be classified as a (1+3) level node, and the node transmits the beacon frame in the (1+3) level node beacon subframe; the network node is rated 2, 5, which may be classified as a (2+3 x n) level node that transmits beacon frames within a (2+3 x n) level node beacon subframe. K in FIG. 2 is the number of time slots in a beacon subframe of a node of a certain level, and can be adjusted according to the actual situation of the network. The role of the beacon subframe is for the node to send a beacon frame, which is a concept of time slot structure, which is a message, and for network synchronization and network grading.
As shown in fig. 2, each data subframe is divided into a priority reservation slot (First Reservation, FR), a reservation application slot (Reservation Request, RR), a reservation forwarding slot (Reservation Forward, RF), and a reservation reply slot (Reservation Answer, RA) in time sequence. The Data transmission time frame is divided into a plurality of identical Data transmission subframes according to time sequence, and each Data transmission subframe is divided into a cyclic High-level Data time slot (Data High, DH), a Middle-level Data (Data Middle, DM) and a Low-level Data time slot (Data Low, DL) according to time sequence. The high-level data slots refer to (1+3×n) layers, the middle-level data slots refer to (2+3×n) layers, and the low-level data slots refer to (3+3×n) layers, where N e {0,1,2.
In this embodiment, the time frame period is divided according to a non-collision principle and a network layer, where the non-collision principle specifically means that a terminal node cannot receive messages from multiple nodes in a certain time slot, as shown in fig. 3, a node with one hop interval transmits data simultaneously, an intermediate node receives error codes due to data collision, and a node with two hops distance transmits data simultaneously, and the intermediate node has limited receiving range due to distance limitation, so that correct data reception can be ensured, so that in order to ensure that the time slots can be multiplexed to the greatest extent and no collision occurs, the node distance using the same time slot must be located outside two hops, and the same time slot can be used in combination with the network layer, i.e., layer N and layer (n+3). The network levels of nodes are in one-to-one correspondence with the levels of the slot structure, and only the nodes corresponding to the corresponding network levels can use the slots of the corresponding levels.
S2, under the distributed network, one terminal node is arbitrarily designated as a network initial reference station, and network grading is carried out on other terminal nodes according to the maximum transmission distance of the network initial reference station.
The step S2 specifically includes the steps of:
s21, arbitrarily selecting a terminal node from the whole distributed network as a network initial reference station, wherein the network grade is 0;
s22, after the network initial reference station is on the network, broadcasting a beacon frame with the frame level of 0 in a reference beacon subframe of a TDMA time frame period, wherein the frame level corresponds to the network level of a source node of the beacon frame;
s23, in the maximum transmission distance of a network initial reference station, terminal nodes which receive a 0-level beacon frame firstly perform network synchronization to acquire network initial time slot division, then broadcast the frame level +1 of the beacon frame downwards in a node beacon subframe of a level corresponding to the network level of the terminal node, and meanwhile, the network level of the terminal node is 1;
s24, the undetermined terminal node receives the beacon frame with the frame level more than or equal to 1, starts a timer to count after network synchronization, and counts the time T at the timing time 0 In the method, the network grading of the terminal node which is not graded is the received smaller frame grade +1, and the node beacon sub-frames which are in the grade corresponding to the network grade of the self node continue to broadcast downwards after the frame grade +1 of the beacon frame sent by the logic superior node;
as shown in fig. 4, step S2 further includes:
as shown in fig. 4- (1), after receiving the beacon frame of the logically superior node, the rated terminal node forwards the beacon frame downwards in the node beacon subframe of the level corresponding to the network level of the own node;
as shown in fig. 4- (2), if the rated end node is at time T c If the beacon frame of the logic superior node is not received, the node is disconnected with the logic superior node, and the received beacon frame of the peer node is transmitted in the node beacon subframe of the level corresponding to the network level of the node;
as shown in fig. 4- (3), if the rated end node is at time T c If the beacon frame of any peer or logic upper node is not received, the node is isolated by the peer and the upper node and continues waiting for T c ' time, if the conditions are the same, giving up the node network level, waiting for the beacon frame of the lower node to re-level;
as shown in fig. 4- (4), if the rated terminal node receives a beacon frame which is more than 1 level smaller than the own node network level, the node network level is modified to be the frame level +1 of the received beacon frame, and the beacon frame corresponding to the own node network level is forwarded downwards.
The beacon frame mainly comprises a time slot resource maximum multiplexing division result and a beacon frame series. Timing time T of timer 0 For the duration of one TDMA time frame period; in step S26, T c For a duration of 4 TDMA time frame periods, T c ' is the duration of 2 TDMA time frame periods.
In this example, the time slot structure is divided first, a beacon subframe and a data subframe are divided in one TDMA time frame period, the beacon subframes which can be used by different level nodes are divided in the beacon subframe, and the data transmission time slots which can be used by different level nodes, namely the mentioned high level data time slot, middle level data time slot and low level data time slot, are divided in the data subframe.
The network structure is divided in the node grading process, in short, in the initial stage of the network, all nodes wait to receive the message, the reference node (the network grading is 0) firstly transmits the beacon frame, and the node capable of receiving the message is called a 1-level node, namely the network node grading is 1. The level 1 node continues to forward downwards after receiving the beacon frame, the node receiving the beacon frame is rated as level 2, and the like. After each network node receives the beacon frame, network synchronization is automatically performed, and network initial time slot division as shown in fig. 2 is obtained.
S3, the rated terminal node calculates the reservation probability p of the current data time frame according to the service priority.
As an example, the terminal node service includes a monitoring and early warning message, a session message, and a regular log file reporting message, where the monitoring and early warning message is an urgent task, the session message is a delay sensitive task, and the regular log file reporting is a best effort task. Network service class P ri Is divided into 1,2, 3, 4, 5, 6, wherein P ri When not less than 5, the task is a best effort task, P ri Corresponding labels of (c) are: index=low; p (P) ri Emergency task when less than or equal to 2, P ri Corresponding labels of (c) are: index=High；2＜P ri Time delay sensitive task when less than 5, P ri The corresponding label of (c) is index=middle.
The data subframe reservation probability p is calculated by the following formula:
Figure BDA0004085561440000091
wherein n is c P is the number of data sub-frame contention failures in the TDMA time frame period ri The index represents all the service classes, P, under the classification label of the service ri Represents the level of network traffic, max { P ] ri The I index represents the maximum service level under the classification label of the service, the min { } represents the minimum value taking all values, the alpha represents the reservation probability parameter and the alpha is less than 1, p max Representing the maximum value of reservation probability of a data subframe, p max =1. A plurality of data subframes exist in one time frame period, each data subframe can be applied for by a node in a competition mode, the node can reserve a certain data subframe in a competition mode, the competition failure time refers to the accumulated reservation failure time in one time frame, the more the competition failure time is, the more the nodes needing to reserve time slots in the time frame period are, and in order to avoid congestion, the reservation application probability of the node is reduced.
S4, the rated terminal node initiates reservation occupation of the current data sub-frame with reservation probability p, if reservation is successful, the data time slot corresponding to the node level is occupied for service transmission, if reservation is failed, the reservation probability p' of the next data sub-frame is calculated, and reservation occupation is restarted.
In step S4, the rated terminal node initiates reservation occupation of the current data subframe with a reservation probability p, and specifically includes the steps of:
s41, if the service of the terminal node is urgent, the service is in the highest priority, and the data reservation frame is broadcast to the neighborhood nodes in the priority reservation time slot of the data reservation subframe according to the reservation probability p;
s42, if the service of the terminal node is time delay sensitive or best effort, broadcasting a data reservation frame to the neighborhood node in a reservation application time slot of the data reservation subframe according to the reservation probability p;
s43, if the terminal node receives the data reservation frame in the priority reservation time slot, broadcasting the reservation reply frame in the reservation reply time slot;
s44, if the terminal node receives the data reservation frame in the reservation application time slot and does not receive the data reservation frame in the priority reservation time slot, broadcasting the reservation reply frame in the reservation reply time slot;
s45, if the terminal node receives the data reservation frame in the reservation forwarding time slot, the terminal node does not process the data reservation frame;
and S46, after receiving the reservation reply frame, the terminal node firstly judges whether the reply node of the reservation reply frame is the node, and if so, occupies a data time slot corresponding to the node level in the corresponding data transmission subframe to send a message. The successful reservation refers to the receipt of a reservation reply frame corresponding to the data reservation frame within the reservation reply time slot of the data reservation subframe. The reservation failure refers to that no reservation reply frame of the node is received in a reservation reply time slot of the data reservation subframe, and specifically comprises two cases: firstly, no reservation reply frame is received in the reservation reply time slot; and secondly, receiving reservation reply frames of other nodes in the reservation reply time slot.
As shown in fig. 5, after going through the reservation application time slot, the terminal node may receive two data reservation frames, and normally will not receive three data reservation frames, because the node only needs to receive a data reservation frame in the priority reservation time slot or the reservation application time slot, and then broadcasts one data reservation frame in the reservation forwarding time slot, and collides with the data reservation frame forwarded by other nodes; and in response to the service demand of the node's traffic priority, the node will choose to forward the data reservation frame received in the priority reservation slot.
S5, counting the services transmitted in one TDMA time frame period, and if the number of the services transmitted in the last TDMA time frame period is smaller than the number of the messages cached in the current queue, prioritizing all the services in the current queue by +1; if the number of the services sent in the previous TDMA time frame period is greater than the number of the services cached in the queue, the priority of all the services in the current queue is set to-1, and the step S3 is returned.
In this step S5, if the node task is already at the highest priority or the lowest priority, the traffic class remains unchanged when the priority is updated, i.e. when the traffic class is 7, the number of messages sent in the previous TDMA time frame period is smaller than the number of queue cache messages, the traffic class should be +1, but the traffic has reached the highest class, so it remains unchanged, and the same is true when the traffic class is 1. In addition, in the whole service queue, the service sequence is determined by the service class and the generation time of the service, as an example, the generation time of the service A with class 5 is t 1 And class 7 service B generation time t 2 Service C generation time of class 5 is t 3 Wherein t is 1 ＜t 2 ＜t 3 The traffic in the entire traffic queue is ordered B, A, C.
In summary, the embodiment of the invention provides a wireless self-organizing network channel access method based on node grading, which combines the network grading result of network terminal nodes, adopts the maximum multiplexing structure of access (beacon), priority reservation, reply and layered circulation data time slots on a TDMA frame structure, so that the self-organizing network longitudinally performs conflict avoidance by network grading and transversely solves the hidden terminal problem by reservation application; the method adopts a mode that one reservation can occupy a plurality of time slots on the control overhead, and the data sub-frames and the network level are utilized to divide the data time slots so as to effectively improve the utilization rate of time slot resources; considering the influence of node service class on channel access probability in a channel access algorithm, dividing priority reservation time slots to meet the differentiated service quality requirements of different terminal services. Compared with the prior art, the method has more intelligence, can effectively improve the utilization rate of the wireless self-organizing network channel resources, avoid frequent data conflict of each terminal node, meet the low-delay requirement of the network, and greatly optimize the overall performance of the network.
The above examples are preferred embodiments of the present invention, but the embodiments of the present invention are not limited to the above examples, and any other changes, modifications, substitutions, combinations, and simplifications that do not depart from the spirit and principle of the present invention should be made in the equivalent manner, and the embodiments are included in the protection scope of the present invention.

Claims (10)

1. The wireless self-organizing network channel access method based on node grading is characterized by comprising the following steps:
s1, dividing a TDMA time slot resource into a plurality of TDMA time frame periods with equal intervals, and dividing each TDMA time frame period into a beacon subframe and a plurality of identical data subframes according to time according to a network function;
s2, under the distributed network, arbitrarily designating one terminal node as a network initial reference station, and carrying out network grading on other terminal nodes according to the maximum transmission distance of the network initial reference station; the step S2 specifically includes the steps of:
s21, arbitrarily selecting a terminal node from the whole distributed network as a network initial reference station, wherein the network grade is 0;
s22, after the network initial reference station is on the network, broadcasting a beacon frame with the frame level of 0 in a reference beacon subframe of a TDMA time frame period, wherein the frame level corresponds to the network level of a source node of the beacon frame;
s23, in the maximum transmission distance of a network initial reference station, terminal nodes which receive a 0-level beacon frame firstly perform network synchronization to acquire network initial time slot division, then broadcast the frame level +1 of the beacon frame downwards in a node beacon subframe of a level corresponding to the network level of the terminal node, and meanwhile, the network level of the terminal node is 1;
s24, the undetermined terminal node receives the beacon frame with the frame level more than or equal to 1, starts a timer to count after network synchronization, and counts the time T at the timing time 0 In the method, the network grading of the terminal node which is not graded is the received smaller frame grade +1, and the node beacon sub-frames which are in the grade corresponding to the network grade of the self node continue to broadcast downwards after the frame grade +1 of the beacon frame sent by the logic superior node;
s3, the rated terminal node calculates the reservation probability p of the current data subframe according to the service priority;
s4, the rated terminal node initiates reservation occupation of the current data subframe according to the reservation probability p, if reservation is successful, the data time slot corresponding to the network level of the node is occupied for service transmission, if reservation is failed, the reservation probability p' of the next data subframe is calculated, and reservation occupation is restarted;
s5, counting the services transmitted in one TDMA time frame period, and if the number of the services transmitted in the last TDMA time frame period is smaller than the number of the messages cached in the current queue, prioritizing all the services in the current queue by +1; if the number of the services sent in the previous TDMA time frame period is greater than the number of the services cached in the queue, the priority of all the services in the current queue is set to-1, and the step S3 is returned.
2. The method for wireless ad hoc network channel access based on node grading according to claim 1, wherein said step S2 further comprises:
after receiving the beacon frame of the logical upper node, the rated terminal node forwards the beacon frame downwards in the node beacon subframe of the level corresponding to the network level of the self node;
if the rated terminal node is at time T c If the beacon frame of the logic superior node is not received, the node is disconnected with the logic superior node, and the received beacon frame of the peer node is transmitted in the node beacon subframe of the level corresponding to the network level of the node;
if the rated terminal node is at time T c If the beacon frame of any peer or logic upper node is not received, the node is isolated by the peer and the upper node and continues waiting for T c ' time, if the conditions are the same, giving up the node network level, waiting for the beacon frame of the lower node to re-level;
if the rated terminal node receives the beacon frame which is smaller than the network level of the self node by more than 1 level, modifying the network level of the node to be the frame level +1 of the received beacon frame, and forwarding the beacon frame corresponding to the network level of the self node downwards.
3. Node-ranking based wireless ad hoc network as claimed in claim 2The network channel access method is characterized in that: in step S2, the timing time T of the timer 0 For the duration of one TDMA time frame period; in step S26, T c For a duration of 4 TDMA time frame periods, T c ' is the duration of 2 TDMA time frame periods.
4. A method of wireless ad hoc network channel access based on node grading according to claim 3, wherein in step S1, said beacon subframes are time-sequentially divided into a reference beacon subframe and a plurality of node beacon subframes, each of said node beacon subframes comprising (1+3 x N) level node beacon subframes, (2+3 x N) level node beacon subframes, (3+3 x N) level node beacon subframes, N e {0,1,2. }; and the network initial reference station occupies the reference beacon subframe to downwards transmit a beacon frame, and the rated terminal node occupies the node beacon subframe of the level corresponding to the network rating to downwards transmit the beacon frame.
5. The node-grading based wireless ad hoc network channel access method of claim 4, wherein: in step S1, each data subframe is divided into a data reservation subframe and a data transmission subframe according to time sequence; the data reservation sub-frame is divided into a priority reservation time slot, a reservation application time slot, a reservation forwarding time slot and a reservation reply time slot according to time sequence, and the data transmission sub-frame is divided into a cyclic high-level data time slot, a middle-level data time slot and a low-level data time slot according to time sequence.
6. The node-grading-based wireless ad hoc network channel access method according to claim 5, wherein in step S3, the data subframe reservation probability p is calculated by:
Figure FDA0004085561420000031
wherein n is c For the number of time frame periods of the TDMAP according to the number of sub-frame contention failures ri The index represents all the service levels under the classification label of the service, and max { P } ri The I index represents the maximum service level under the classification label of the service, the min { } represents the minimum value taking all values, the alpha represents the reservation probability parameter and the alpha is less than 1, p max Representing the maximum value of reservation probability of a data subframe, p max ＝1。
7. The node-ranking based wireless ad hoc network channel access method of claim 6, wherein in step S4, the ranked terminal node initiates reservation occupancy of the current data subframe with a reservation probability p, comprising the steps of:
s41, if the service of the terminal node is urgent, the service is in the highest priority, and the data reservation frame is broadcast to the neighborhood nodes in the priority reservation time slot of the data reservation subframe according to the reservation probability p;
s42, if the service of the terminal node is time delay sensitive or best effort, broadcasting a data reservation frame to the neighborhood node in a reservation application time slot of the data reservation subframe according to the reservation probability p;
s43, if the terminal node receives the data reservation frame only in the priority reservation time slot, broadcasting the reservation reply frame in the reservation reply time slot;
s44, if the terminal node receives the data reservation frame in the reservation application time slot and does not receive the data reservation frame in the priority reservation time slot, broadcasting the reservation reply frame in the reservation reply time slot;
s45, if the terminal node receives the data reservation frame in the reservation forwarding time slot, the terminal node does not process the data reservation frame;
and S46, after receiving the reservation reply frame, the terminal node firstly judges whether the reply node of the reservation reply frame is the node, and if so, occupies a data time slot corresponding to the node level in the corresponding data transmission subframe to send a message.
8. The node-grading based wireless ad hoc network channel access method of claim 7, wherein: in step S4, successful reservation means that a reservation reply frame corresponding to the data reservation frame is received in the reservation reply time slot of the data reservation subframe, and failed reservation means that no reservation reply frame of the node is received in the reservation reply time slot of the data reservation subframe.
9. The node-grading based wireless ad hoc network channel access method of claim 8, wherein: in step S5, if the node traffic is already at the highest priority or the lowest priority, the traffic class remains unchanged while the priority is updated.
10. The node-grading-based wireless ad hoc network channel access method of claim 9, wherein the network traffic grade P ri Is divided into 1,2, 3, 4, 5, 6, wherein P ri When not less than 5, the task is a best effort task, P ri Corresponding labels of (c) are: index=low; p (P) ri Emergency task when less than or equal to 2, P ri Corresponding labels of (c) are: index=high; 2 < P ri Time delay sensitive task when less than 5, P ri The corresponding label of (c) is index=middle.
CN202310104998.9A 2023-02-13 2023-02-13 Wireless self-organizing network channel access method based on node grading Pending CN116074979A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310104998.9A CN116074979A (en) 2023-02-13 2023-02-13 Wireless self-organizing network channel access method based on node grading

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310104998.9A CN116074979A (en) 2023-02-13 2023-02-13 Wireless self-organizing network channel access method based on node grading

Publications (1)

Publication Number Publication Date
CN116074979A true CN116074979A (en) 2023-05-05

Family

ID=86183521

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310104998.9A Pending CN116074979A (en) 2023-02-13 2023-02-13 Wireless self-organizing network channel access method based on node grading

Country Status (1)

Country Link
CN (1) CN116074979A (en)

Similar Documents

Publication Publication Date Title
CN108430111B (en) Mixed type time slot reservation method in distributed TDMA protocol
Tang et al. A protocol for topology-dependent transmission scheduling in wireless networks
US8068454B2 (en) System for enabling mobile coverage extension and peer-to-peer communications in an ad hoc network and method of operation therefor
CN110809324B (en) MAC transmission method based on distributed TDMA and wireless self-organizing network system
US10305781B2 (en) Content centric cross-layer scheduling for industrial applications
US8155006B2 (en) Method, device, and communication system for adjusting data rates in a network
WO2009018251A1 (en) System and method of resource allocation within a communication system
US10326581B2 (en) Communicating a high priority message in a communication channel of a wireless communication network based on a TDMA protocol
CN106793128A (en) A kind of channel wireless radio multi Mesh network TDMA resource allocation methods
CN110519845B (en) Unmanned aerial vehicle ad hoc network multi-hop TDMA access method based on time slot auxiliary allocation and use
CN108990157A (en) Chain time gap distribution method of the self-organizing TDMA network based on conflict buffer area
JP2009501489A (en) Method and system for wireless communication between devices
Cheng et al. Taming collisions for delay reduction in low-duty-cycle wireless sensor networks
KR101093616B1 (en) Frequency Diversity based MAC Architecture for Wireless Sensor Network, and operating method for the same
Soldo et al. Streaming media distribution in VANETs
CN114449589A (en) Time slot resource reservation system and method
CN116131927A (en) Multi-hop TDMA time slot allocation method suitable for unmanned aerial vehicle ad hoc network
Guo et al. An adaptive and reliable MAC mechanism for IEEE 1609.4 and 802.11 p VANETs
CN114585103B (en) Intelligent channel access control method for service perception
Deng et al. Distributed resource allocation based on timeslot reservation in high-density VANETs
CN116074979A (en) Wireless self-organizing network channel access method based on node grading
CN111371483B (en) Beam scheduling method, device and system
Balador et al. DTB-MAC: Dynamic Token-Based MAC Protocol for reliable and efficient beacon broadcasting in VANETs
CN115002844A (en) Method and system for realizing resource reservation based on dynamic TDMA (time division multiple address) resource allocation ad hoc network
JP5260648B2 (en) Media reservation announcement

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