CN114828300A - Ad hoc network method, processor and device based on two-dimensional Markov chain model - Google Patents
Ad hoc network method, processor and device based on two-dimensional Markov chain model Download PDFInfo
- Publication number
- CN114828300A CN114828300A CN202210301256.0A CN202210301256A CN114828300A CN 114828300 A CN114828300 A CN 114828300A CN 202210301256 A CN202210301256 A CN 202210301256A CN 114828300 A CN114828300 A CN 114828300A
- Authority
- CN
- China
- Prior art keywords
- original message
- priority
- message
- sent
- processor
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000006855 networking Effects 0.000 claims description 14
- 238000004891 communication Methods 0.000 abstract description 16
- 238000010586 diagram Methods 0.000 description 11
- 238000004590 computer program Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 9
- 230000006870 function Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/29—Graphical models, e.g. Bayesian networks
- G06F18/295—Markov models or related models, e.g. semi-Markov models; Markov random fields; Networks embedding Markov models
-
- 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
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application relates to the field of communication, in particular to an ad hoc network method, a processor and a device based on a two-dimensional Markov chain model. The ad hoc network method comprises the following steps: determining the priority of an original message to be sent and determining the competition parameter of each priority; setting the counting duration of a backoff counter of each priority through a two-dimensional Markov chain model, wherein the counting duration of the backoff counter of each priority is determined according to the competition parameter of each priority; and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message. According to the technical scheme, the corresponding priority is set for each original message to be sent, and the backoff duration of each message is determined according to the priority, so that when the messages compete internally, the backoff duration is set for the messages according to the priorities of the messages, message collision is avoided, and the communication efficiency is improved.
Description
Technical Field
The application relates to the field of communication, in particular to an ad hoc network method, a processor and a device based on a two-dimensional Markov chain model.
Background
The power line carrier communication mode depends on a power line for data transmission, and when the power line carrier communication mode is combined with a micropower wireless technology, higher bandwidth and higher communication efficiency can be brought. Meanwhile, communication between communication modules needs to adopt a more complex underlying protocol to realize an access protocol of the modules so as to ensure different requirements under network topology change and different communication service scenes, and an MAC layer networking strategy plays an important role in solving the problems.
The existing networking strategy cannot well meet the requirements of frequent changes of network topology and communication performance under different service scenes. When the traditional networking protocol adopts a CSMA/CD protocol, the current communication channel is blocked when the message transmission is collided, and the collider is allowed to compete for the channel, thereby reducing the communication efficiency to a certain extent.
Disclosure of Invention
The embodiment of the application aims to provide an ad hoc network method, a processor and a device based on a two-dimensional Markov chain model, which are used for improving communication efficiency.
In order to achieve the above object, a first aspect of the present application provides an ad hoc network method based on a two-dimensional markov chain model, where the ad hoc network method includes:
determining the priority of an original message to be sent and determining the competition parameter of each priority;
setting the counting duration of a backoff counter of each priority through a two-dimensional Markov chain model, wherein the counting duration of the backoff counter of each priority is determined according to the competition parameter of each priority;
and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
In an embodiment of the present application, after the waiting duration of the original message of each priority reaches the counting duration corresponding to the priority, sending the original message includes: detecting the channel state of the message when the original message reaches the message sending time point; under the condition that a message channel is in a busy state, determining that the original message cannot be sent currently; determining the counting duration of the backoff counter of the original message again according to the competition parameters of the original message; and under the condition that the waiting time length of the original message reaches the counting time length, the original message is sent again.
In the embodiment of the application, after the original message is sent, the counting duration corresponding to the original message which is sent successfully is set as the minimum competition parameter corresponding to the priority of the original message.
In an embodiment of the present application, in a case that the number of original messages to be sent is multiple, the ad hoc network method further includes: receiving a new original message to be sent; re-determining the priority of the new original message and the original message which is not sent; and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
In the embodiment of the application, after the original message is sent, whether feedback information corresponding to the original message is received or not is detected; under the condition that feedback information is received within preset time, the original message is determined to be successfully sent; and determining that the original message fails to be sent under the condition that the feedback information is not received within the preset time.
In the embodiment of the application, under the condition that the original message is determined to be failed to be sent, obtaining the arbitration frame interval time corresponding to the priority of the original message; and after the waiting time of the original message reaches the arbitration frame interval time, retransmitting the original message.
In the embodiment of the application, the counting duration of the backoff counter corresponding to the original message is cleared when the original message is determined to be successfully sent.
In the embodiment of the application, the message type of the original message is determined under the condition that the original message fails to be sent; and recording the information of the message sending failure according to the message type of the original message.
A second aspect of the application provides a processor configured to perform the two-dimensional markov chain model based ad hoc network method of any one of the above.
The third aspect of the present application provides an apparatus for an ad hoc network based on a two-dimensional markov chain model, which includes the above processor.
According to the technical scheme, the corresponding priority is set for each original message to be sent, and the back-off duration of each message is determined according to the priority, so that when the messages compete internally, the back-off duration is set for the messages according to the priorities of the messages, message collision is avoided, and the communication efficiency is improved.
Additional features and advantages of embodiments of the present application will be described in detail in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the embodiments of the disclosure, but are not intended to limit the embodiments of the disclosure. In the drawings:
figure 1 schematically illustrates a flow diagram of an ad hoc network method based on a two-dimensional markov chain model according to an embodiment of the present application;
fig. 2 schematically shows an internal structure diagram of a computer device according to an embodiment of the present application.
Detailed Description
The following detailed description of embodiments of the present application will be made with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present application, are given by way of illustration and explanation only, and are not intended to limit the present application.
It should be noted that if directional indications (such as up, down, left, right, front, and back … …) are referred to in the embodiments of the present application, the directional indications are only used to explain the relative positional relationship between the components, the movement situation, and the like in a specific posture (as shown in the drawings), and if the specific posture is changed, the directional indications are changed accordingly.
In addition, if there is a description of "first", "second", etc. in the embodiments of the present application, the description of "first", "second", etc. is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
Fig. 1 schematically shows a flowchart of an ad hoc network method based on a two-dimensional markov chain model according to an embodiment of the present application. As shown in fig. 1, in an embodiment of the present application, there is provided an ad hoc network method based on a two-dimensional markov chain model, including the following steps:
In power carrier and micropower wireless application scenarios, each device can switch back and forth between a control signal and one service channel, but cannot use two different signals at the same time. For the original message to be sent, the operator may determine the priority of each original message to be sent according to the specific message content. For original messages, the original messages to be sent can be firstly classified into eight business categories by referring to the EDCA algorithm to help operators to confirm the priority of the messages. After confirming the priority of the original message to be sent, the operator can input the priority of the original message to be sent to the processor. The processor may determine the relevant contention parameter for each priority level according to the priority level of the received original message to be transmitted.
The processor may determine the relevant contention parameters for each priority level according to the EDCA mechanism, which may include a minimum contention window, a maximum contention window, and an arbitration interval frame time. For example, if the operator sets 4 priorities for the original message to be sent, the processor may determine the contention parameters corresponding to the four set priorities, i.e., the minimum contention window, the maximum contention window, and the arbitration frame interval time corresponding to each priority. Wherein the smaller the minimum contention window value, the higher its priority. The smaller the maximum contention window value, the higher its priority.
And 102, setting the counting duration of the backoff counter of each priority through a two-dimensional Markov chain model, wherein the counting duration of the backoff counter of each priority is determined according to the competition parameter of each priority.
After determining the priority of an original message to be sent and the competition parameter corresponding to each priority, the processor can set the counting duration of the backoff counter of each priority through a two-dimensional Markov chain model, wherein the technical duration of the backoff counter of each priority is determined according to the competition parameter of each priority.
Each priority has a minimum contention window and a maximum contention window corresponding thereto. After the minimum contention window and the maximum contention window corresponding to each priority are determined, the two-dimensional Markov chain model can select a numerical value between the minimum contention window and the maximum contention window as the counting duration of the backoff counter corresponding to the original message of the priority.
And 103, after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
And after the processor sets the counting time of the backoff counter corresponding to the original message of each priority through the two-dimensional Markov chain model, the original message of each priority is sent after waiting for the counting time corresponding to the priority.
In one embodiment, after the waiting duration of the original message of each priority reaches the counting duration corresponding to the priority, the sending the original message comprises: detecting the channel state of the message when the original message reaches the message sending time point; under the condition that a message channel is in a busy state, determining that the original message cannot be sent currently; determining the counting duration of the backoff counter of the original message again according to the competition parameters of the original message; and under the condition that the waiting time length of the original message reaches the counting time length, the original message is sent again.
After the processor sets the counting duration of the backoff counter of each priority through the two-dimensional Markov chain model, the original message of each priority needs to be sent after the waiting duration reaches the counting duration corresponding to the priority. The processor may detect the state of the message channel when the original message completion waiting duration reaches the message transmission time point. When the status of the message channel is in a normal transmittable state, the processor may transmit a message completing the wait duration. When the processor detects the message channel and determines that the message channel is in a busy state, the processor cannot send the original message. The busy message channel may be a message being sent in the message channel or a bad channel network.
When the processor determines that the message channel is in a busy state by detecting the message channel, so that the original message cannot be sent currently, the processor will return the original message which cannot be sent to the state when the message is just received, so that the original message which cannot be sent performs internal competition again. The processor can confirm the priority of the original message which cannot be sent again, and determines the counting duration of the backoff counter of the original message again according to the competition parameter of the priority of the original message through the two-dimensional Markov chain model. And when the waiting time of the original message reaches the re-determined counting time, sending the original message.
In one embodiment, the ad hoc network method further comprises: after the original message is sent, the counting duration corresponding to the original message which is successfully sent is set as the minimum competition parameter corresponding to the priority of the original message.
After the original message waits for the counting time corresponding to the priority, and the processor determines that the message channel is in a normal state, the processor can send the original message on time, and after the processor finishes sending, the processor can set the counting duration corresponding to the original message which is successfully sent as the minimum competition parameter corresponding to the priority of the original message, namely the minimum competition window.
In one embodiment, in the case that the number of the original messages to be sent is multiple, the ad hoc network method further includes: receiving a new original message to be sent; re-determining the priority of the new original message and the original message which is not sent; and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
When the processor determines that the number of the original messages to be sent is multiple, the processor can determine the counting time of the backoff counter corresponding to each message through the two-dimensional Markov chain model according to the priority of each original message, so that each message is sent after waiting for the corresponding counting time.
If the plurality of messages are waiting to be sent according to the corresponding counting time, and the processor receives a new original message to be sent again, the processor can determine the priority of each message again according to the received new original message to be sent and the original message not yet sent, determine the counting time of the corresponding backoff counter according to the determined priority, and send the original message after the waiting time of the original message of each priority reaches the corresponding counting time.
For example, assuming that there are messages with the first priority and the third priority to be sent at this time, the processor sets the counting time of the backoff counter of each message according to the priority corresponding to each message through the two-dimensional markov chain model. Assuming that the message of the first priority needs to wait for 1 second, and the message of the third priority needs to wait for 3 seconds, when the message of the first priority waits for one second, the message of the first priority is successfully sent, and at this time, the message of the third priority is still waiting. Assuming that the processor receives a new message with a first priority and a second priority while the message with a third priority is waiting, the processor will determine the priority of the message to be sent at this time, and the message to be sent includes the message with the third priority which is not sent, the message with the first priority which is newly received, and the message with the second priority. The processor may again determine the count time of the back-off counter for each message via a two-dimensional markov chain model. Each message may be sent after waiting for the new count time to be determined. That is, each time a new message is received, the processor reconfirms the count time of all unsent messages so that the message is sent according to the priority of the message.
In one embodiment, after sending the original message, detecting whether feedback information corresponding to the original message is received; under the condition that feedback information is received within preset time, the original message is determined to be successfully sent; and determining that the original message fails to be sent under the condition that the feedback information is not received within the preset time.
After the original message is sent, the processor may detect whether feedback information corresponding to the original message is received, where the feedback information may be a response performed after the terminal receives the message. If the processor receives the feedback information corresponding to the original message within the preset time, the processor can determine that the original message is successfully sent. If the processor does not receive the feedback information of the terminal corresponding to the original message within the preset time, the processor may determine that the original message is failed to be transmitted.
In one embodiment, in the case that it is determined that the original message fails to be transmitted, obtaining an arbitration frame interval time corresponding to a priority of the original message; and after the waiting time of the original message reaches the arbitration frame interval time, retransmitting the original message.
When the processor determines that the original message is completely transmitted but feedback information of the terminal corresponding to the original message is not received within a preset time, the processor may determine that the original message is failed to be transmitted, and at this time, the processor may determine an arbitration interval time corresponding to a priority of the original message, and make the original message retransmit the original message after waiting for the arbitration frame interval time. For example, the processor determines the relevant contention parameters for each priority according to the EDCA mechanism, i.e., the enhanced distributed channel access mechanism, and the contention parameters for the priority may include a minimum contention window, a maximum contention window, and an arbitration interval frame time. If the processor does not receive feedback information of a terminal response corresponding to the message within a preset time set by the processor after the message with the third priority level is sent, the processor may determine that the message is failed to be sent, determine an arbitration interval frame time corresponding to the third priority level, and resend the message with the third priority level, where the message with the third priority level is failed to be sent again after waiting for the arbitration interval frame time corresponding to the third priority level, and determine the counting time of the corresponding backoff counter again through the two-dimensional markov chain model according to the priority level of the message. And send the message after waiting the count time.
Further, after the processor determines that the message is failed to be sent and waits for the arbitration interval frame time of the priority corresponding to the message, and when the processor re-determines the counting time of the corresponding backoff counter, if the counting time determined by the two-dimensional markov chain model is equal to the maximum contention window value corresponding to the priority, the counting time is not changed, and if the counting time is less than the maximum contention window value corresponding to the priority, the processor re-determines the counting time: CW Finally, the product is processed ＝(CW Model (model) + 1). times.2-1, wherein CW Finally, the product is processed Count time, CW, determined for the final processor Model (model) A count time determined by the processor via a two-dimensional markov chain model.
In one embodiment, in the case that the original message is determined to be successfully sent, the counting duration of the backoff counter corresponding to the original message is cleared.
After the processor sends the original message and receives the feedback information corresponding to the original message within the preset time, the processor may determine that the original message is successfully sent, and clear the counting duration of the backoff counter corresponding to the original message when it is determined that the original message is successfully sent.
In one embodiment, in the case of failure of original message transmission, determining a message type of the original message; and recording the information of the message sending failure according to the message type of the original message.
The processor may set the message type according to the size of the message, e.g., the processor may set the message length, determine that the message is less than the length as a short frame message, and determine that the message is greater than or equal to the length as a long frame message. When the processor determines that the original message fails to be sent, the type of the original message which fails to be sent can be determined according to the size of the original message which fails to be sent. And recording the message type of the original message which fails to be sent, thereby determining the packet loss rate of the message transmission.
In one embodiment, a processor is provided that is configured to perform the two-dimensional markov chain model based ad hoc networking method described above.
For an original message to be sent, the original message to be sent may be first classified into eight service categories with reference to the EDCA algorithm, so as to help an operator to confirm the priority of the message. The operator can determine the priority of each original message to be sent according to the specific message content, and after determining the priority of the original message to be sent, the priority of the original message to be sent can be input into the processor. The processor may determine the relevant contention parameters for each priority level according to the EDCA mechanism, which may include a minimum contention window, a maximum contention window, and an arbitration interval frame time. Thereby determining the relevant competition parameters of the priority corresponding to the received original message to be sent.
After determining the priority of an original message to be sent and the competition parameter corresponding to each priority, the processor can set the counting duration of the backoff counter of each priority through a two-dimensional Markov chain model, wherein the technical duration of the backoff counter of each priority is determined according to the competition parameter of each priority. Each priority has a minimum contention window and a maximum contention window corresponding thereto. After the minimum contention window and the maximum contention window corresponding to each priority are determined, the two-dimensional Markov chain model can select a numerical value between the minimum contention window and the maximum contention window as the counting duration of the backoff counter corresponding to the original message of the priority.
After the processor sets the counting duration of the backoff counter of each priority through the two-dimensional Markov chain model, the original message of each priority needs to be sent after the waiting duration reaches the counting duration corresponding to the priority. The processor may detect the state of the message channel when the original message completion waiting duration reaches the message transmission time point. When the state of the message channel is in a normal transmittable state, the processor may transmit the message of which the waiting time duration is completed, and after the transmission of the message channel is completed, the processor may set the counting time duration corresponding to the original message that is successfully transmitted as the minimum contention parameter corresponding to the priority of the original message, that is, the minimum contention window.
When the processor detects the message channel and determines that the message channel is in a busy state, the processor cannot send the original message. The busy message channel may be a message being sent in the message channel or a bad channel network. When the processor determines that the message channel is in a busy state by detecting the message channel, so that the original message cannot be sent currently, the processor will return the original message which cannot be sent to the state when the message is just received, so that the original message which cannot be sent performs internal competition again. The processor can confirm the priority of the original message which cannot be sent again, and determines the counting duration of the backoff counter of the original message again according to the competition parameter of the priority of the original message through the two-dimensional Markov chain model. And when the waiting time of the original message reaches the re-determined counting time, sending the original message. For example, assuming a message of a second priority cannot be sent because the message channel is busy, the processor may roll back the message to the state when the processor just received the message, thereby re-prioritizing the message by the processor and re-determining the count time corresponding to the priority for the message by the two-dimensional markov chain model.
When the processor determines that the number of the original messages to be sent is multiple, the processor can determine the counting time of the backoff counter corresponding to each message through the two-dimensional Markov chain model according to the priority of each original message, so that each message is sent after waiting for the corresponding counting time.
If the processor receives a new original message to be sent when a plurality of messages are waiting to be sent according to the corresponding counting time, the processor can determine the priority of each message again according to the received new original message to be sent and the original message which is not sent yet, and determines the counting time of the corresponding back-off counter according to the determined priority through a two-dimensional Markov chain model, after determining the count time of the corresponding backoff counter according to the determined priority through the vismarkov chain model, the processor may confirm that the determined count time of the backoff counter is equal to a maximum contention window value corresponding to the priority if the count time determined by the two-dimensional markov chain model is equal to the maximum contention window value, if the counting time is smaller than the maximum competition window value corresponding to the priority, the processor reconfirms the counting time: CW Finally, the product is processed ＝(CW Model (model) + 1). times.2-1, wherein CW Finally, the product is processed Count time, CW, determined for the final processor Model (model) A count time determined by the processor via a two-dimensional markov chain model. And after the waiting time of the original message of each priority reaches the corresponding counting time, sending the original message.
After the original message is sent, the processor may detect whether feedback information corresponding to the original message is received, where the feedback information may be a response performed after the terminal receives the message. If the processor receives the feedback information corresponding to the original message within the preset time, the processor can determine that the original message is successfully sent. And clearing the counting duration of a backoff counter corresponding to the original message when the original message is determined to be successfully sent.
If the processor does not receive the feedback information of the terminal corresponding to the original message within the preset time, the processor may determine that the original message is failed to be transmitted. The processor may then determine an arbitration interval corresponding to the priority of the original message and cause the original message to be resent after waiting for the arbitration frame interval. And after the processor determines that the message is failed to be sent and waits for the arbitration interval frame time of the priority corresponding to the message, when the processor re-determines the counting time of the corresponding backoff counter, if the counting time determined by the two-dimensional Markov chain model is equal to the maximum contention window value corresponding to the priority, the counting time is unchanged, and if the counting time is less than the maximum contention window value corresponding to the priority, the processor re-determines the counting time: CW Finally, the product is processed ＝(CW Model (model) + 1). times.2-1, wherein CW Finally, the product is processed Count time, CW, determined for the final processor Model (model) A count time determined by the processor via a two-dimensional markov chain model. And the processor determines the message type of the original message which fails to be sent according to the preset message type under the condition that the original message fails to be sent; and recording the information of the message sending failure according to the message type of the original message, thereby determining the packet loss rate of the message.
According to the technical scheme, the corresponding priority is set for each original message to be sent, and the back-off duration of each message is determined according to the priority, so that when the messages compete internally, the back-off duration is set for the messages according to the priorities of the messages, message collision is avoided, and the communication efficiency is improved.
In one embodiment, an apparatus for an ad hoc network based on a two-dimensional markov chain model is provided, which includes the processor described above.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. The kernel can be set to be one or more, and the self-networking method based on the two-dimensional Markov chain model is realized by adjusting the kernel parameters.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
An embodiment of the present application provides a storage medium, on which a program is stored, and when the program is executed by a processor, the ad hoc network method based on a two-dimensional markov chain model is implemented.
The embodiment of the application provides a processor, wherein the processor is used for running a program, and the self-networking method based on the two-dimensional Markov chain model is executed when the program runs.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 2. The computer device includes a processor a01, a network interface a02, a memory (not shown), and a database (not shown) connected by a system bus. Wherein processor a01 of the computer device is used to provide computing and control capabilities. The memory of the computer device comprises an internal memory a03 and a non-volatile storage medium a 04. The nonvolatile storage medium a04 stores an operating system B01, a computer program B02, and a database (not shown in the figure). The internal memory a03 provides an environment for the operation of the operating system B01 and the computer programs B02 in the non-volatile storage medium a 04. The database of the computer device is used for storing relevant data preset by an operator. The network interface a02 of the computer device is used for communication with an external terminal through a network connection. The computer program B02 is such that when being executed by the processor a01 it realizes an ad hoc network method based on a two dimensional markov chain model.
Those skilled in the art will appreciate that the architecture shown in fig. 2 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
Fig. 1 is a schematic flowchart of an ad hoc network method based on a two-dimensional markov chain model in an embodiment. It should be understood that, although the steps in the flowchart of fig. 1 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in fig. 1 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
The embodiment of the application provides equipment, the equipment comprises a processor, a memory and a program which is stored on the memory and can run on the processor, and the following steps are realized when the processor executes the program: determining the priority of an original message to be sent and determining the competition parameter of each priority; setting the counting duration of a backoff counter of each priority through a two-dimensional Markov chain model, wherein the counting duration of the backoff counter of each priority is determined according to the competition parameter of each priority; and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
In one embodiment, after the waiting duration of the original message of each priority reaches the counting duration corresponding to the priority, the sending the original message comprises: detecting the channel state of the message when the original message reaches the message sending time point; under the condition that a message channel is in a busy state, determining that the original message cannot be sent currently; determining the counting duration of the backoff counter of the original message again according to the competition parameters of the original message; and under the condition that the waiting time length of the original message reaches the counting time length, the original message is sent again.
In one embodiment, after the original message is sent, the counting duration corresponding to the original message which is successfully sent is set as the minimum contention parameter corresponding to the priority of the original message.
In one embodiment, in the case that the number of the original messages to be sent is multiple, the ad hoc network method further includes: receiving a new original message to be sent; re-determining the priority of the new original message and the original message which is not sent; and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
In one embodiment, after sending the original message, detecting whether feedback information corresponding to the original message is received; under the condition that feedback information is received within preset time, the original message is determined to be successfully sent; and determining that the original message fails to be sent under the condition that the feedback information is not received within the preset time.
In one embodiment, in the case that it is determined that the original message fails to be transmitted, obtaining an arbitration frame interval time corresponding to a priority of the original message; and after the waiting time of the original message reaches the arbitration frame interval time, retransmitting the original message.
In one embodiment, in the case that the original message is determined to be successfully sent, the counting duration of the backoff counter corresponding to the original message is cleared.
In one embodiment, in the case of failure of original message transmission, determining a message type of the original message; and recording the information of the message sending failure according to the message type of the original message.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. An ad hoc network method based on a two-dimensional Markov chain model is characterized by comprising the following steps:
determining the priority of an original message to be sent and determining the competition parameter of each priority;
setting the counting duration of a backoff counter of each priority through a two-dimensional Markov chain model, wherein the counting duration of the backoff counter of each priority is determined according to the competition parameter of each priority;
and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
2. The ad-hoc network method based on the two-dimensional markov chain model according to claim 1, wherein said sending the original message after the waiting duration of the original message of each priority reaches the counting duration corresponding to the priority comprises:
detecting a message channel state when the original message reaches a message sending time point;
determining that the original message cannot be sent currently under the condition that the message channel is in a busy state;
determining the counting duration of a backoff counter of the original message again according to the competition parameters of the original message;
and under the condition that the waiting time of the original message reaches the counting time, the original message is sent again.
3. The ad-hoc networking method based on the two-dimensional markov chain model according to claim 1, wherein the ad-hoc networking method further comprises:
and after the original message is sent, setting the counting duration corresponding to the original message which is successfully sent as the minimum competition parameter corresponding to the priority of the original message.
4. The ad-hoc network method based on the two-dimensional markov chain model according to claim 1, wherein in case that the number of original messages to be transmitted is plural, the ad-hoc network method further comprises:
receiving a new original message to be sent;
re-determining the priority of the new original message and the original message which is not sent;
and after the waiting time of the original message of each priority reaches the counting time corresponding to the priority, sending the original message.
5. The ad-hoc networking method based on the two-dimensional markov chain model according to claim 1, wherein the ad-hoc networking method further comprises:
after the original message is sent, detecting whether feedback information corresponding to the original message is received;
under the condition that feedback information is received within preset time, the original message is determined to be successfully sent;
and determining that the original message fails to be sent under the condition that the feedback information is not received within the preset time.
6. The ad-hoc networking method based on the two-dimensional markov chain model of claim 5, wherein the ad-hoc networking method further comprises:
under the condition that the original message is determined to be failed to be sent, obtaining arbitration frame interval time corresponding to the priority of the original message;
and after the waiting time of the original message reaches the arbitration frame interval time, retransmitting the original message.
7. The ad-hoc networking method based on the two-dimensional markov chain model of claim 5, wherein the ad-hoc networking method further comprises:
and clearing the counting duration of a backoff counter corresponding to the original message when the original message is determined to be successfully sent.
8. The ad-hoc networking method based on the two-dimensional markov chain model of claim 5, wherein the ad-hoc networking method further comprises:
determining the message type of the original message under the condition that the original message fails to be sent;
and recording the information of the message sending failure according to the message type of the original message.
9. A processor, characterized in that the processor is configured to perform the two-dimensional markov chain model based ad hoc network method according to any one of claims 1 to 8.
10. An apparatus of an ad-hoc network based on a two-dimensional markov chain model, comprising the processor of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210301256.0A CN114828300A (en) | 2022-03-24 | 2022-03-24 | Ad hoc network method, processor and device based on two-dimensional Markov chain model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210301256.0A CN114828300A (en) | 2022-03-24 | 2022-03-24 | Ad hoc network method, processor and device based on two-dimensional Markov chain model |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114828300A true CN114828300A (en) | 2022-07-29 |
Family
ID=82531362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210301256.0A Pending CN114828300A (en) | 2022-03-24 | 2022-03-24 | Ad hoc network method, processor and device based on two-dimensional Markov chain model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114828300A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030103521A1 (en) * | 2001-06-18 | 2003-06-05 | Itran Communications Ltd. | Channel access method for powerline carrier based media access control protocol |
| US20100195664A1 (en) * | 2009-01-30 | 2010-08-05 | Texas Instruments Inc. | Smart Adjustment of Backoff Counter and Contention Window for Improved Random Access |
| CN105007596A (en) * | 2015-08-13 | 2015-10-28 | 重庆大学 | Method for designing WSANs (Wireless Sensor and Actuator Networks) packet loss decision device based on QoS (Quality of Service) |
| CN105163394A (en) * | 2015-09-30 | 2015-12-16 | 河南科技大学 | Method for realizing service perception of SQ-MAC protocol for wireless sensor network |
| KR101664280B1 (en) * | 2015-06-04 | 2016-10-11 | 한림대학교 산학협력단 | The method and apparatus for transmitting and receiving in mmWave wireless network |
| CN108601067A (en) * | 2018-01-11 | 2018-09-28 | 南京华讯方舟通信设备有限公司 | A kind of wireless self-networking carrier wave detection channel access method kept out of the way based on time/power two-dimensional |
| CN112437498A (en) * | 2020-11-10 | 2021-03-02 | 中国人民解放军海军航空大学航空作战勤务学院 | Data link protocol back-off algorithm based on channel state judgment and priority |
| CN112437497A (en) * | 2020-11-10 | 2021-03-02 | 中国人民解放军海军航空大学航空作战勤务学院 | Back-off mode design method for data link random access protocol |
| CN112911723A (en) * | 2021-01-29 | 2021-06-04 | 中国人民解放军国防科技大学 | Unmanned aerial vehicle cluster ad hoc network channel access method based on interference priority |
-
2022
- 2022-03-24 CN CN202210301256.0A patent/CN114828300A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030103521A1 (en) * | 2001-06-18 | 2003-06-05 | Itran Communications Ltd. | Channel access method for powerline carrier based media access control protocol |
| US20100195664A1 (en) * | 2009-01-30 | 2010-08-05 | Texas Instruments Inc. | Smart Adjustment of Backoff Counter and Contention Window for Improved Random Access |
| KR101664280B1 (en) * | 2015-06-04 | 2016-10-11 | 한림대학교 산학협력단 | The method and apparatus for transmitting and receiving in mmWave wireless network |
| CN105007596A (en) * | 2015-08-13 | 2015-10-28 | 重庆大学 | Method for designing WSANs (Wireless Sensor and Actuator Networks) packet loss decision device based on QoS (Quality of Service) |
| CN105163394A (en) * | 2015-09-30 | 2015-12-16 | 河南科技大学 | Method for realizing service perception of SQ-MAC protocol for wireless sensor network |
| CN108601067A (en) * | 2018-01-11 | 2018-09-28 | 南京华讯方舟通信设备有限公司 | A kind of wireless self-networking carrier wave detection channel access method kept out of the way based on time/power two-dimensional |
| CN112437498A (en) * | 2020-11-10 | 2021-03-02 | 中国人民解放军海军航空大学航空作战勤务学院 | Data link protocol back-off algorithm based on channel state judgment and priority |
| CN112437497A (en) * | 2020-11-10 | 2021-03-02 | 中国人民解放军海军航空大学航空作战勤务学院 | Back-off mode design method for data link random access protocol |
| CN112911723A (en) * | 2021-01-29 | 2021-06-04 | 中国人民解放军国防科技大学 | Unmanned aerial vehicle cluster ad hoc network channel access method based on interference priority |
Non-Patent Citations (3)
| Title |
|---|
| "《无人机集群协同机会路由与瞬时饱和吞吐量建模研究》", 中国优秀硕士学位论文全文数据库, no. 2021, 15 July 2021 (2021-07-15) * |
| GIUSEPPE BIANCHI: "Performance Analysis of the IEEE 802.11 Distributed Coordination Function", IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, vol. 18, no. 3, 1 March 2020 (2020-03-01) * |
| 邓皓文: "《基于EDCA 机制的无线局域网QoS 性能研究》", 中国优秀硕士学位论文全文数据库, no. 2020, 15 August 2020 (2020-08-15), pages 2 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI629912B (en) | System and method for reducing collisions in wireless networks | |
| CN109699089B (en) | Channel access method and device | |
| TW201010321A (en) | Systems and methods for providing a separate contention window allowing allocations for pending uplink SDMA transmission opportunities | |
| US10313906B2 (en) | Method and device for sending information | |
| US20230262775A1 (en) | Method and apparatus for implementing collision detection in data transmission | |
| US20220295562A1 (en) | Early backoff termination for longest-waiting users in 5g/6g messaging | |
| US11956817B2 (en) | Communication method, apparatus and system in unlicensed spectrums | |
| CN116074972A (en) | Communication method, communication device, computer readable medium and electronic equipment | |
| CN112134763A (en) | Method, system, equipment and medium for transmitting layered messages among cluster nodes | |
| US20220346141A1 (en) | Communication link determining method and apparatus, and device and storage medium | |
| CN105474570A (en) | Data transmission method and device | |
| CN106060962A (en) | Communication method and device | |
| WO2023197782A1 (en) | Channel access method and apparatus, device, and storage medium | |
| CN114828300A (en) | Ad hoc network method, processor and device based on two-dimensional Markov chain model | |
| KR101372455B1 (en) | Method and Data Transmission System Using Overlay Media Access Control Device | |
| CN113542150B (en) | Data transmission method and device and central end network bridge | |
| KR20200079099A (en) | Method and apparatus for selective energy transmission in wireless network | |
| KR100644582B1 (en) | Collision protection protocol using backoff algorithm in consideration of the communication priority | |
| US11606816B2 (en) | Method, node, and system for reducing collisions in a time-synchronized channel hopping network | |
| CN111586644B (en) | Multi-node anti-collision method and device based on narrow-band communication of Internet of things | |
| CN112752296B (en) | Data transmission method and device and electronic equipment | |
| CN107926061A (en) | A kind of back-off method, transmission message approach and device | |
| US9408234B2 (en) | Method for transmitting data by using reverse order implied information obtained by competition by means of distributed coordination function in wireless LAN, and wireless communication device for transmitting data by using the same | |
| WO2021139793A1 (en) | Channel access method and related product | |
| WO2023050160A1 (en) | Method and apparatus for updating random access parameter, and device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |