Adaptive access duration method, device, equipment and product based on situation awareness

Abstract

Disclosed are a situation awareness-based adaptive access duration method, apparatus, device and product, which relate to the technical field of wireless communications, the method comprising: constructing and initializing an information entry library of nodes, the information entry library comprising situation information of each node; based on the situation information of each node, acquiring first adjacent situation information and the situation information of the own node, and packaging to generate a plurality of information packets; transmitting the plurality of information packets to an information entry library of the node through broadcasting, and obtaining second proximity situation information; the continuous transmission duration of channel transmission of all the nodes is calculated based on the situation information of the adjacent nodes and the situation information of the nodes per se, the situation information of the adjacent nodes comprises the first adjacent situation information and the second adjacent situation information, the neighborhood information is sensed through the method, full utilization of link resources is guaranteed, and further, the transmission efficiency is improved. The transmission efficiency is improved, and the problem of high time delay in data transmission in the wireless ad hoc network is solved.

Description

Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to a situational awareness-based adaptive access duration method, device, equipment and product. Background Art

[0002] Wireless ad hoc network (MANET) is a mobile communication network without infrastructure, which has the characteristics of being centerless, self-organized, and multi-hop. In order to achieve end-to-end reliable transmission in a MANET, there are currently two main types of transmission mechanisms. One is the traditional end-to-end transmission mechanism, which is mainly used in typical mobile communication networks; the other is the hop-by-hop transmission mechanism, the key of which is to utilize the data encoding characteristics of the intermediate nodes of the MANET. In a wireless ad hoc network, the communication services between nodes are usually generated irregularly, and multiple nodes need to relay and cooperate to complete the transmission. Due to the influence of factors such as the transmission capacity of the node and the density of the neighborhood, each service node in the network usually has a differentiated queue status. Therefore, in order to ensure the overall service quality in the wireless ad hoc network, it is necessary to design an efficient and reliable dynamic transmission duration method to alleviate the queue congestion of the busy service nodes, achieve the balance of the whole network traffic and increase the number of available nodes.

[0003] In the prior art, data transmission is achieved through a hop-by-hop reliable data transmission system, but its data transmission delay is relatively high.

[0004] Therefore, how to reduce data transmission delay is a problem that needs to be solved urgently.

[0005] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention

[0006] The main purpose of this application is to provide a situational awareness-based adaptive access duration method, device, equipment and product, aiming to solve the technical problem of high data transmission delay.

[0007] To achieve the above object, the present application proposes a situation awareness-based adaptive access duration method, the method comprising:

[0008] Constructing and initializing an information entry library of a node, wherein the information entry library includes situation information of each node;

[0009] Based on the situation information of each node, obtain the first neighboring situation information and the situation information of the own node, and pack them to generate multiple information packets;

[0010] Transmitting the plurality of information packets to the information entry library of the node by broadcasting to obtain second neighboring situation information;

[0011] Based on the situation information of the neighboring nodes and the situation information of the own node, the continuous transmission duration of the channel transmission of all nodes is calculated, and the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

[0013] In one embodiment, the step of constructing and initializing an information entry library of each node, wherein the information entry library includes the situation information of each node, comprises:

[0014] Constructing an information entry row for each node, wherein the information entry row includes the situation information of each node;

[0015] The information entry library of the node is determined according to the information entry row of each node, and the situation information of the corresponding node is stored in each entry row.

[0016] In one embodiment, the step of transmitting the plurality of information packets to the information entry library of the node by broadcasting to obtain the second neighboring situation information comprises:

[0017] Transmitting the plurality of information packets to the information entry row of each node by broadcasting to obtain an updated information entry row;

[0018] Based on the updated information entry row, the second neighboring situation information of each node is acquired according to the first neighboring situation information of each node.

[0019] In one embodiment, the step of calculating the continuous transmission duration of channel transmission for all nodes based on the situation information of neighboring nodes and the situation information of the own node includes:

[0020] Based on the situation information of the neighboring nodes and the situation information of the own node, a complete information package is obtained by integration;

[0021] Calculate the queuing volume ratio of the current node and the nodes two hops adjacent to the node according to the complete information packet;

[0022] The continuous transmission duration for all nodes to perform channel transmission is determined according to the queuing volume ratio.

[0023] In one embodiment, the step of determining the continuous transmission duration of channel transmission for all nodes according to the queuing volume ratio includes:

[0024] If the queuing volume ratio is less than the first preset value, the continuous transmission duration is defined as the ratio of the average message length of the media access control layer to the average transmission rate of the node;

[0025] If the queuing volume ratio is greater than the first preset value and less than the second preset value, the continuous transmission duration is defined as the queuing volume ratio;

[0026] If the queuing volume ratio is greater than a second preset value, the continuous transmission duration is defined as a maximum continuous transmission duration.

[0027] In one embodiment, the step of integrating the situation information of the neighboring nodes and the situation information of the own node to obtain a complete information packet includes:

[0028] Based on the situation information of the neighboring nodes and the situation information of the own node, entries are added, merged and deleted from the local information entry library to obtain a complete information package.

[0029] In addition, to achieve the above purpose, the present application also proposes an adaptive access duration device based on situation awareness, and the adaptive access duration device based on situation awareness includes:

[0030] A situation information building module, used to build and initialize a node information entry library, wherein the information entry library includes situation information of each node;

[0031] A first information acquisition module, used for acquiring first neighboring situation information and situation information of the own node based on the situation information of each node, and packaging and generating multiple information packets;

[0032] A second information acquisition module, configured to transmit the plurality of information packets to the information entry library of the node by broadcasting, and acquire second neighboring situation information;

[0033] The transmission duration calculation module is used to calculate the continuous transmission duration of channel transmission of all nodes based on the situation information of neighboring nodes and the situation information of the own node. The situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

[0034] In addition, to achieve the above-mentioned purpose, the present application also proposes an adaptive access duration device based on situational awareness, the device comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the adaptive access duration method based on situational awareness as described above.

[0035] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by the processor, the steps of the adaptive access duration method based on situational awareness as described above are implemented.

[0036] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program. When the computer program is executed by a processor, the steps of the adaptive access duration method based on situational awareness as described above are implemented.

[0037] One or more technical solutions proposed in this application have at least the following technical effects:

[0038] Construct and initialize the node's information entry library, the information entry library includes the situation information of each node; based on the situation information of each node, obtain the first neighboring situation information and the situation information of the own node, and pack them to generate multiple information packets; transmit the multiple information packets to the node's information entry library by broadcasting to obtain the second neighboring situation information; based on the situation information of the neighboring nodes and the situation information of the own node, calculate the continuous transmission time of all nodes for channel transmission, the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information. The neighborhood information is perceived by the above method, which enhances the accurate control of the node access time each time, thereby ensuring the full utilization of link resources, further improving the transmission efficiency, and solving the problems of high delay and low efficiency faced by reliable data transmission in wireless ad hoc networks. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0040] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0041] Figure 1 This is a flow chart of the first embodiment of the situation awareness-based adaptive access duration method of the present application;

[0042] Figure 2 This is a flow chart of the second embodiment of the method for adaptive access duration based on situation awareness of the present application;

[0043] Figure 3 This is a flow chart of the third embodiment of the method for adaptive access duration based on situation awareness of the present application;

[0044] Figure 4 A random topology diagram of nodes in an embodiment of the present application;

[0045] Figure 5 A comparison chart of the network throughput of various methods in the embodiments of the present application;

[0046] Figure 6 This is a schematic diagram of the queue occupancy status of the entire network corresponding to the CSMA / CA method in an embodiment of the present application;

[0047] Figure 7 A schematic diagram of the queue occupancy status of the entire network corresponding to the dynamic sending duration method in an embodiment of the present application;

[0048] Figure 8 A schematic diagram of a random topology of 100 nodes according to an embodiment of the present application;

[0049] Fig. 9 A comparison chart of the network throughput of various methods in the embodiments of the present application;

[0050] Fig.10 A schematic diagram of the remaining amount of the whole network queue corresponding to the CSMA / CA access method according to the embodiment of the present application;

[0051] Fig.11 A schematic diagram of the remaining amount of the whole network queue corresponding to the dynamic sending duration method of the embodiment of the present application;

[0052] Fig.12 This is a schematic diagram of the module structure of the situation awareness-based adaptive access duration device according to an embodiment of the present application;

[0053] Fig.13 This is a schematic diagram of the device structure of the hardware operating environment involved in the situation awareness-based adaptive access duration method in the embodiment of the present application.

[0054] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0055] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0056] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0057] In order to achieve end-to-end reliable transmission in self-organizing networks, there are currently two main types of transmission mechanisms. One is the traditional end-to-end transmission mechanism, which is mainly used in typical mobile communication networks; the other is the hop-by-hop transmission mechanism, the key of which is to utilize the data encoding characteristics of the intermediate nodes of the self-organizing network. In wireless self-organizing networks, communication services between nodes are usually generated irregularly, and multiple nodes need to relay and cooperate to complete the transmission. Due to the influence of factors such as the transmission capacity of the node and the density of the neighborhood, each service node in the network usually has a differentiated queue status. Based on the DCF protocol, the IEEE 802.11 working group further launched the EDCA (Enhanced Distributed Channel Access) protocol, and achieved full network traffic balance through its TXOP (Transmit Opportunity) mechanism. The TXOP mechanism is mainly used to grant nodes a period of non-competitive continuous transmission time (i.e., TXOP time) after successfully obtaining the channel occupancy right, so that data packets can be directly transmitted without performing a backoff process for each data packet transmission. However, the fixed TXOP duration value limits the ability of a node to adaptively adjust the duration of continuous transmission after occupying a channel according to characteristics such as the topological structure and transmission load in its neighborhood.

[0058] The present application provides a solution, which is based on the fountain code module and performs re-encoding on each node. Specifically, the node information entry library is constructed and initialized, and the information entry library includes the situation information of each node; based on the situation information of each node, the first neighboring situation information and the situation information of the own node are obtained, and multiple information packets are packaged to generate; the multiple information packets are transmitted to the node information entry library through broadcasting to obtain the second neighboring situation information; based on the situation information of the neighboring nodes and the situation information of the own node, the continuous transmission time of all nodes for channel transmission is calculated, and the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information. The neighborhood information is perceived by the above method, which can ensure the full utilization of link resources.

[0059] Based on this, the embodiment of the present application provides an adaptive access duration method based on situation awareness, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the situation awareness-based adaptive access duration method of the present application.

[0060] In this embodiment, the situation awareness-based adaptive access duration method includes steps S10 to S50:

[0061] Step S10, constructing and initializing the node information entry library, the information entry library includes the situation information of each node.

[0062] It should be noted that the information entry library can be understood as the situation information corresponding to a single node, and the situation information of each node can be node status, queue volume and timestamp. The node status includes the unique identification of the node, battery power, computing resource usage, whether it is online, etc. This information can help the network understand the health status and availability of the node. The queue volume indicates the amount of data currently waiting to be transmitted by the node. The queue information is very important for determining the transmission priority of the node and avoiding network congestion. The timestamp records the time when the situation information was last updated. The timestamp can help the network determine the timeliness of the information and make decisions accordingly. It can be understood that the situation information of each node can also include neighboring relationships and other statistical information. The neighboring relationship is used to describe the connection relationship between the node and its neighboring nodes (within one or two hops). Other statistical information can be such as the node's transmission rate, receiving rate, packet loss rate, etc. These statistical information can provide more details about network performance and node behavior.

[0063] It should be noted that step S10 includes: constructing an information entry row for each node, the information entry row including the situation information of each node; determining the information entry library of the node according to the information entry row of each node, and storing the situation information of the corresponding node in each entry row. Exemplarily, each node includes an information entry library, and each situation information stored in the information entry library includes a node identifier and a corresponding queue amount.

[0064] Step S20: based on the situation information of each node, obtain the first neighboring situation information and the situation information of the own node, and package them to generate multiple information packets.

[0065] It should be noted that the first neighboring situation information can be understood as the situation information of the neighboring one-hop node, and the own node can be understood as the current packaging node, that is, the node is collecting and packaging its own situation information and the situation information of its neighboring nodes. Each information packet may contain part of the situation information, or contain a specific type of information (such as only the first neighboring situation information and the situation information of its own node).

[0066] Step S30: Transmit multiple information packets to the information entry library of the node by broadcasting to obtain second neighboring situation information.

[0067] It should be noted that the second neighboring situation information can be understood as the situation information of the neighboring two-hop nodes. It can be understood that the information entry library at this time contains multiple information packets, and each information packet is stored in the information entry row corresponding to each node. Exemplarily, the information entry library contains multiple information entry rows corresponding to nodes, and each information entry row contains the situation information of its own node and the first neighboring situation information. The second neighboring situation information corresponding to each node can be obtained through the information packets in each information entry row.

[0068] Step S40, based on the situation information of the neighboring nodes and the situation information of the own node, calculate the continuous transmission duration of the channel transmission of all nodes, the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

[0069] In this embodiment, an information entry library of a node is constructed and initialized, and the information entry library includes the situation information of each node; based on the situation information of each node, first neighboring situation information and the situation information of the own node are obtained, and packaged to generate multiple information packets; the multiple information packets are transmitted to the information entry library of the node by broadcasting to obtain second neighboring situation information; based on the situation information of the neighboring nodes and the situation information of the own node, the continuous transmission duration of channel transmission for all nodes is calculated, and the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information. The neighborhood information is perceived by the above method, which enhances the accurate control of the access duration of each node, thereby ensuring the full utilization of link resources, further improving the transmission efficiency, and solving the problems of high latency and low efficiency faced by reliable data transmission in wireless ad hoc networks.

[0070] Reference Figure 2 , Figure 2 This is a flow chart of the second embodiment of the adaptive access duration method based on situation awareness of the present application, based on the above Figure 1 The first embodiment shown proposes a second embodiment of the situation awareness-based adaptive access duration method of the present application.

[0071] In the second embodiment, the step S30 includes:

[0072] Step S301: Transmit multiple information packets to the information entry row of each node by broadcasting to obtain an updated information entry row.

[0073] It should be noted that the updated information entry row includes the node's own situation information and the first neighboring situation information.

[0074] Step S302: based on the updated information entry row and according to the first neighboring situation information of each node, obtain the second neighboring situation information of each node.

[0075] For example, after a node joins the network, the node periodically broadcasts and sends information packets containing its own situation information in its information entry library. In this way, the situation information of all its one-hop neighboring nodes can be obtained. Similarly, after a node joins the network, the node periodically broadcasts and sends information packets containing its own situation information in its information entry library and its neighboring one-hop nodes. In this way, the situation information of all its neighboring two-hop nodes can be obtained.

[0076] In this embodiment, multiple information packets are transmitted to the information entry row of each node by broadcasting to obtain an updated information entry row, and based on the updated information entry row, the second neighboring situation information of each node is obtained according to the first neighboring situation information of each node, thereby realizing the perception of neighborhood information, which can be used for subsequent accurate control of the access duration of each node.

[0077] Reference Figure 3 , Figure 3 This is a flow chart of the third embodiment of the method for adaptive access duration based on situational awareness of the present application. Figure 2 The second embodiment shown proposes the third embodiment of the situation awareness-based adaptive access duration method of the present application.

[0078] In the third embodiment, the step S40 includes:

[0079] Step S401, based on the situation information of the neighboring nodes and the situation information of the own node, integrate to obtain a complete information package.

[0080] It should be noted that step S401 includes: based on the situation information of the neighboring nodes and the situation information of the own node, adding, merging and deleting entries in the local information entry library at the same time to obtain a complete information package. Exemplarily, when a node receives a broadcast packet, it will extract the various entry rows of the situation information therein, and at the same time, add, merge and delete entries in the local situation information entry library. For the same information entry row, if it is received multiple times in succession, only the entry information of the latest time is retained. At the same time, it can sense whether there are "newly joined or exited" neighboring two-hop nodes around the current node.

[0081] Step S402: Calculate the queuing volume ratio of the current node and the nodes two hops adjacent to the node according to the complete information packet.

[0082] For example, with periodic transmission and reception, each node will stably sense the queue status of all its two-hop neighbors. After each node seizes a channel, it will calculate the ratio of the queue size of the node to the average queue size of its two-hop neighbors (i.e., all nodes two hops adjacent to the node).

[0083] Step S403: determining the continuous transmission duration of channel transmission for all nodes according to the queuing volume ratio.

[0084] It should be noted that step S403 includes: if the queue volume ratio is less than a first preset value, the continuous transmission time is defined as the ratio of the average message length of the MAC layer to the average transmission rate of the node; if the queue volume ratio is greater than the first preset value and less than the second preset value, the continuous transmission time is defined as the queue volume ratio; if the queue volume ratio is greater than the second preset value, the continuous transmission time is defined as the maximum continuous transmission time.

[0085] Exemplarily, when the update of the local entry library is relatively stable, the node can obtain a relatively fixed neighbor situation information value, including the number of neighbors within its two hops and the corresponding queue volume, which are recorded as N and [Q1, Q2, ..., QN] respectively. Among them, the stable perception of the queue status of all two neighbors generally refers to the two-hop neighbors perceived by the node not changing within multiple MAC layer time frames (such as 1 time frame can be set to 100ms, 10 time frames are 1s, or the appropriate MAC layer time frame is selected according to the common sense of technicians in this field, such as 10ms, 30ms, 50ms, etc.). Calculate the ratio of its queue volume to the average queue volume of the two-hop neighbors to estimate its relative queue status (Wi) in the neighborhood. The specific calculation formula is recorded as Wi = Qi / average queue volume of the two-hop neighbors. If the relative queue status is less than 1, the TXOP duration is configured as the single packet transmission time Tpk. The single packet transmission time here is defined as the ratio of the average message length of the MAC layer to the average transmission rate of the node. If the relative queue status is a value between 1 and Wmax, the TXOP duration is configured as Wi. Here, Wmax is defined as the maximum integer that does not exceed the ratio of the maximum configuration value Tmax of the TXOP duration to the average message length of the MAC layer. If the relative queue status is greater than Wmax, the TXOP duration is configured to be Tmax. Among them, Tmax refers to the maximum configuration value of the TXOP duration in the MAC layer protocol. After successfully seizing the channel, the node will continue to occupy the channel and transmit data according to the calculated configuration TXOP duration. And during this continuous transmission time, the node no longer uses the RTS-CTS handshake mode, but directly uses the DATA-ACK mode.

[0086] In this embodiment, by integrating the situation information of neighboring nodes and the situation information of the node itself, a complete information packet is obtained to obtain neighborhood information. According to the complete information packet, the queuing volume ratio of the current node and the nodes two hops adjacent to the node is calculated. According to the queuing volume ratio, the continuous transmission time of channel transmission for all nodes is determined, which enhances the accurate control of the access time of each node. It can be used for the traffic balancing needs of wireless self-organizing networks, thereby alleviating the queue accumulation of busy nodes, rebalancing the traffic of the entire network without reducing the throughput, and enhancing the service quality assurance of the wireless self-organizing network.

[0087] In order to further illustrate the advantages of the embodiments of the present invention and other transmission methods, a simulation is performed on the method adopted in the aforementioned embodiments of the present invention.

[0088] First, we use a 15-node random topology ( Figure 4 As shown in the figure), the dynamic sending duration method was simulated and verified, and the comparison method used the CSMA / CA access method. The results are shown in Figure 5 shown. Figure 5 The two methods show the total network throughput. The horizontal axis represents the simulation time (unit: seconds), and the vertical axis represents the total network throughput (unit: bps). It can be seen that compared with the traditional CSMA / CA access method, the dynamic transmission duration method can improve the total network throughput to a certain extent.

[0089] Figure 6 and Figure 7 The figure shows the corresponding queue status of nodes in the entire network after using the two methods. The horizontal axis represents the simulation time (unit: seconds), and the vertical axis represents the occupied length of the node queue (unit: number of data packets). Figure 7 As shown in Figure 2, after using the dynamic sending duration method, the maximum queue size of the node is less than 45 packets; while after using the CSMA / CA access method, the queue size of some nodes exceeds 120 packets, such as Figure 6 Obviously, the dynamic sending duration method can effectively alleviate the queuing congestion of nodes in the entire network.

[0090] In order to further verify the effect of the embodiment, we also used 100 nodes randomly distributed topology ( Figure 8 ), the dynamic sending duration method was simulated and verified, and the comparison method used the CSMA / CA access method. The results of the full network throughput are as follows Fig. 9 As shown, the horizontal axis represents the simulation time (unit: second), and the vertical axis represents the total network throughput (unit: bps). It can be seen that compared with the CSMA / CA access and random period access methods, the addition of the dynamic sending duration method can improve the total network throughput to a certain extent.

[0091] Fig.10 and Fig.11 Demonstrates access using CSMA / CA ( Fig.10 ) and its dynamic sending duration method ( Fig.11), the remaining length of the queue of each node in the whole network is obtained. The horizontal axis represents the simulation time (unit: seconds), the vertical axis represents the remaining length of the node queue (unit: number of data packets), and the total queue length of each node is set to 2000 data packets. It can be seen that after combining the dynamic sending duration method, the accumulation phenomenon of the queues of each node in the whole network can be significantly improved, and the number of active and available nodes in the whole network is greatly increased.

[0092] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the situational awareness-based adaptive access duration method of the present application. More simple transformations based on this technical concept are all within the protection scope of the present application.

[0093] This application also provides an adaptive access duration device based on situational awareness, please refer to Fig.12 , the situation awareness-based adaptive access duration device comprises:

[0094] A situation information building module 10 is used to build and initialize a node information entry library, wherein the information entry library includes situation information of each node;

[0095] A first information acquisition module 20, configured to acquire first neighboring situation information and situation information of the own node based on the situation information of each node, and package and generate multiple information packets;

[0096] A second information acquisition module 30, configured to transmit the plurality of information packets to the information entry library of the node by broadcasting, and acquire second neighboring situation information;

[0097] The transmission duration calculation module 40 is used to calculate the continuous transmission duration of channel transmission of all nodes based on the situation information of neighboring nodes and the situation information of the own node. The situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

[0098] The adaptive access duration device based on situational awareness provided by the present application adopts the adaptive access duration method based on situational awareness in the above-mentioned embodiment, which can solve the technical problem of high data transmission delay. Compared with the prior art, the beneficial effects of the adaptive access duration device based on situational awareness provided by the present application are the same as the beneficial effects of the adaptive access duration method based on situational awareness provided by the above-mentioned embodiment, and other technical features in the adaptive access duration device based on situational awareness are the same as the features disclosed in the above-mentioned embodiment method, which will not be repeated here.

[0099] The present application provides an adaptive access duration device based on situational awareness, and the adaptive access duration device based on situational awareness includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the adaptive access duration method based on situational awareness in the above-mentioned embodiment one.

[0100] Reference below Fig.13 , which shows a schematic diagram of the structure of an adaptive access duration device based on situational awareness suitable for implementing the embodiment of the present application. The adaptive access duration device based on situational awareness in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Fig.13 The situation awareness-based adaptive access duration device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0101] like Fig.13As shown, the adaptive access duration device based on situational awareness may include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the adaptive access duration device based on situational awareness are also stored. The processing device 1001, ROM1002, and RAM1004 are connected to each other via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 can allow the situational awareness-based adaptive access duration device to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a situational awareness-based adaptive access duration device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have instead.

[0102] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0103] The situation-awareness-based adaptive access duration device provided by the present application adopts the situation-awareness-based adaptive access duration method in the above embodiment, which can solve the technical problem of high data transmission delay. Compared with the prior art, the situation-awareness-based adaptive access duration device provided by the present application has the same beneficial effects as the situation-awareness-based adaptive access duration method provided in the above embodiment, and other technical features in the situation-awareness-based adaptive access duration device are the same as the features disclosed in the previous embodiment method, which will not be repeated here.

[0104] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0105] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0106] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, and the computer-readable program instructions are used to execute the situation awareness-based adaptive access duration method in the above-mentioned embodiment.

[0107] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0108] The computer-readable storage medium may be included in the adaptive access duration device based on situation awareness; or may exist independently without being assembled into the adaptive access duration device based on situation awareness.

[0109] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the adaptive access duration device based on situation awareness, the adaptive access duration device based on situation awareness: constructs and initializes the node's information entry library, the information entry library includes the situation information of each node; based on the situation information of each node, obtains the first neighboring situation information and the situation information of its own node, and packages them to generate multiple information packets; transmits the multiple information packets to the node's information entry library through broadcasting to obtain the second neighboring situation information; based on the situation information of the neighboring nodes and the situation information of its own node, calculates the continuous transmission duration of channel transmission for all nodes, the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

[0110] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0111] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0112] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0113] The readable storage medium provided in the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned adaptive access duration method based on situational awareness, and can solve the technical problem of high data transmission delay. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in the present application are the same as the beneficial effects of the adaptive access duration method based on situational awareness provided in the above-mentioned embodiment, and will not be repeated here.

[0114] The present application also provides a computer program product, including a computer program, which implements the steps of the above-mentioned situation awareness-based adaptive access duration method when executed by a processor.

[0115] The computer program product provided by the present application can solve the technical problem of high data transmission delay. Compared with the prior art, the beneficial effects of the computer program product provided by the present application are the same as the beneficial effects of the adaptive access duration method based on situational awareness provided by the above embodiment, which will not be repeated here.

[0116] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A situation-awareness-based adaptive access duration method, characterized in that: The method includes: Constructing and initializing an information entry library of a node, wherein the information entry library includes situation information of each node; Based on the situation information of each node, obtain the first neighboring situation information and the situation information of the own node, and pack them to generate multiple information packets; Transmitting the plurality of information packets to the information entry library of the node by broadcasting to obtain second neighboring situation information; Based on the situation information of the neighboring nodes and the situation information of the own node, the continuous transmission duration of the channel transmission of all nodes is calculated, and the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

2. The method according to claim 1, characterized in that The step of constructing and initializing an information entry library of each node, wherein the information entry library includes the situation information of each node, comprises: Constructing an information entry row for each node, wherein the information entry row includes the situation information of each node; The information entry library of the node is determined according to the information entry row of each node, and the situation information of the corresponding node is stored in each entry row.

3. The method according to claim 2, characterized in that The step of transmitting the plurality of information packets to the information entry library of the node by broadcasting to obtain the second neighboring situation information comprises: Transmitting the plurality of information packets to the information entry row of each node by broadcasting to obtain an updated information entry row; Based on the updated information entry row, the second neighboring situation information of each node is acquired according to the first neighboring situation information of each node.

4. The method according to claim 3, characterized in that The step of calculating the continuous transmission duration of channel transmission for all nodes based on the situation information of neighboring nodes and the situation information of the own node includes: Based on the situation information of the neighboring nodes and the situation information of the own node, a complete information package is obtained by integration; Calculate the queuing volume ratio of the current node and the nodes two hops adjacent to the node according to the complete information packet; The continuous transmission duration for all nodes to perform channel transmission is determined according to the queuing volume ratio.

5. The method according to claim 4, characterized in that The step of determining the continuous transmission duration of channel transmission for all nodes according to the queuing volume ratio includes: If the queuing volume ratio is less than the first preset value, the continuous transmission duration is defined as the ratio of the average message length of the media access control layer to the average transmission rate of the node; If the queuing volume ratio is greater than the first preset value and less than the second preset value, the continuous transmission duration is defined as the queuing volume ratio; If the queuing volume ratio is greater than a second preset value, the continuous transmission duration is defined as a maximum continuous transmission duration.

6. The method according to claim 4, characterized in that The step of integrating the situation information of the neighboring nodes and the situation information of the own node to obtain a complete information package includes: Based on the situation information of the neighboring nodes and the situation information of the own node, entries are added, merged and deleted from the local information entry library to obtain a complete information package.

7. An adaptive access duration device based on situational awareness, characterized in that: The device comprises: A situation information building module, used to build and initialize a node information entry library, wherein the information entry library includes situation information of each node; A first information acquisition module, used for acquiring first neighboring situation information and situation information of the own node based on the situation information of each node, and packaging and generating multiple information packets; A second information acquisition module, configured to transmit the plurality of information packets to the information entry library of the node by broadcasting, and acquire second neighboring situation information; The transmission duration calculation module is used to calculate the continuous transmission duration of channel transmission of all nodes based on the situation information of neighboring nodes and the situation information of the own node. The situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information.

8. An adaptive access duration device based on situational awareness, characterized in that: The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the situation awareness-based adaptive access duration method as described in any one of claims 1 to 6.

9. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the situation awareness-based adaptive access duration method according to any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the situation awareness-based adaptive access duration method according to any one of claims 1 to 6 are implemented.

Images