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

Abstract

The application discloses a kind of based on situation awareness adaptive access duration method, device, equipment and product, it is related to wireless communication technical field, the method comprises: constructing and initializing the information entry library of node, information entry library includes the situation information of each node;Based on the situation information of each node, obtain the situation information of first adjacent situation information and itself node, and package generation multiple information package;Multiple information package is transmitted to the information entry library of node by broadcast, obtains second adjacent situation information;Based on the situation information of adjacent node and the situation information of itself node, the continuous transmission duration of all nodes for channel transmission is calculated, the situation information of adjacent node includes first adjacent situation information and second adjacent situation information, perceive neighborhood information by the above-mentioned method, it is guaranteed that link resource is fully utilized, further, transmission efficiency is improved, solve the high latency problem faced in data transmission in wireless ad hoc network.

Description

TECHNICAL FIELD

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

[0002] A wireless self-organizing network (MANET) is an infrastructure-free mobile communication network, which has the characteristics of no center, self-organization and multi-hop. In order to realize reliable end-to-end transmission in a self-organizing network, there are currently two types of transmission mechanisms. One is the traditional end-to-end transmission mechanism, mainly used in typical mobile communication networks; the other is the hop-by-hop transmission mechanism, which makes use of the encodable characteristics of data by intermediate nodes in a self-organizing network. In a wireless self-organizing network, communication services between nodes are usually generated irregularly, and multiple nodes need to relay and cooperate to complete transmission. Due to the influence of factors such as the transmission capacity of nodes and the density of neighborhoods, the queue status of each service node in the network is usually differentiated. Therefore, in order to guarantee the overall service quality of the wireless self-organizing network, an efficient and reliable dynamic sending duration method needs to be designed to alleviate the queue congestion status of busy nodes, achieve the balance of network traffic and increase the number of available nodes.

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

[0004] Therefore, how to reduce the data transmission delay is a problem to be solved at present.

[0005] The above content is only used to assist in understanding the technical solutions of the present application, and does not represent the acknowledgement of the above content as prior art. SUMMARY

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

[0007] In order to achieve the above purpose, the present application provides a situation awareness-based adaptive access duration method, which comprises:

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

[0009] Based on the situation information of each node, obtaining first neighboring situation information and situation information of the node itself, and packaging to generate a plurality of information packets;

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

[0011] calculating a continuous transmission duration of channel transmission of all nodes based on the situation information of the adjacent nodes and the situation information of the own node, wherein the situation information of the adjacent nodes comprises the first adjacent situation information and the second adjacent situation information.

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

[0013] constructing an information entry row of each node, wherein the information entry row comprises the situation information of the respective node;

[0014] determining the information entry library of the node according to the information entry row of each node, and saving the situation information of the corresponding node in each entry row.

[0015] In an embodiment, the step of obtaining the second adjacent situation information by broadcasting the plurality of information packets to the information entry library of the node comprises:

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

[0017] obtaining the second adjacent situation information of each node based on the first adjacent situation information of each node according to the updated information entry row.

[0018] In an embodiment, the step of calculating a continuous transmission duration of channel transmission of all nodes based on the situation information of the adjacent nodes and the situation information of the own node comprises:

[0019] integrating a complete information packet based on the situation information of the adjacent nodes and the situation information of the own node;

[0020] calculating a queue amount ratio of the current node and nodes adjacent to the node by two hops according to the complete information packet;

[0021] determining a continuous transmission duration of channel transmission of all nodes according to the queue amount ratio.

[0022] In an embodiment, the step of determining a continuous transmission duration of channel transmission of all nodes according to the queue amount ratio comprises:

[0023] if the queue amount ratio is less than a first preset value, defining the continuous transmission duration as a ratio of a medium access control layer average packet length and a node average transmission rate;

[0024] if the queue amount ratio is greater than the first preset value and less than a second preset value, defining the continuous transmission duration as the queue amount ratio.

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

[0026] In an embodiment, the step of integrating the situational information of the neighboring nodes and the situational information of the own node to obtain a complete information package comprises:

[0027] The situational information of the neighboring nodes and the situational information of the own node are used to simultaneously add, merge and delete local information entries to obtain a complete information package.

[0028] In addition, to achieve the above object, the present application further provides a situational awareness-based adaptive access duration device, which comprises:

[0029] A situational information construction module is configured to construct and initialize an information entry library of a node, wherein the information entry library comprises situational information of each node.

[0030] A first information acquisition module is configured to acquire first neighboring situational information and situational information of an own node based on the situational information of each node, and to package and generate a plurality of information packages.

[0031] A second information acquisition module is configured to broadcast the plurality of information packages to the information entry library of the node to acquire second neighboring situational information.

[0032] A transmission duration calculation module is configured to calculate a continuous transmission duration of channel transmission of all nodes based on the situational information of the neighboring nodes and the situational information of the own node, wherein the situational information of the neighboring nodes comprises the first neighboring situational information and the second neighboring situational information.

[0033] In addition, to achieve the above object, the present application further provides a situational awareness-based adaptive access duration device, which comprises a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the computer program is configured to implement the steps of the situational awareness-based adaptive access duration method as described above.

[0034] In addition, to achieve the above object, the present application further provides a storage medium, which is a computer-readable storage medium, and the storage medium stores a computer program, wherein the computer program is executable by a processor to implement the steps of the situational awareness-based adaptive access duration method as described above.

[0035] In addition, to achieve the above object, the application further provides a computer program product, which comprises a computer program, and the computer program realizes the steps of the adaptive access time length method based on situation awareness when executed by a processor.

[0036] The one or more technical solutions provided in the application have at least the following technical effects:

[0037] The information entry library of the node is constructed and initialized, and the information entry library comprises situation information of each node; based on the situation information of each node, first neighboring situation information and situation information of the self node are acquired, and a plurality of information packages are generated by packaging; the plurality of information packages are transmitted to the information entry library of the node through broadcasting to acquire second neighboring situation information; based on the situation information of the neighboring nodes and the situation information of the self node, the continuous transmission time length of all nodes for channel transmission is calculated, the situation information of the neighboring nodes comprises the first neighboring situation information and the second neighboring situation information, the neighborhood information is perceived through the above method, and the accurate control of the access time length of each node is enhanced, so that the full use of link resources is ensured, the transmission efficiency is further improved, and the problems of high latency and low efficiency in the reliable data transmission of the wireless ad hoc network are solved. BRIEF DESCRIPTION OF DRAWINGS

[0038] The accompanying drawings, which are incorporated into and form part of the specification, illustrate embodiments consistent with the application and, together with the specification, serve to explain the principles of the application.

[0039] In order to more clearly illustrate the technical solutions in the embodiments of the application or the prior art, the accompanying drawings needed to be used in the embodiments or prior art description will be briefly introduced. Obviously, for those skilled in the art, other drawings can also be obtained based on these drawings without creative labor.

[0040] Figure 1 Flowchart of the first embodiment of the adaptive access time length method based on situation awareness of the application;

[0041] Figure 2 Flowchart of the second embodiment of the adaptive access time length method based on situation awareness of the application;

[0042] Figure 3 Flowchart of the third embodiment of the adaptive access time length method based on situation awareness of the application;

[0043] Figure 4 Random topology graph of the node of the embodiment of the application;

[0044] Figure 5 Comparison graph of the whole network throughput of each method of the embodiment of the application;

[0045] Figure 6 Fig. 1 is a schematic diagram of the queue occupancy status of the whole network corresponding to the CSMA / CA method of the embodiment of the present application;

[0046] Figure 7 Fig. 2 is a schematic diagram of the queue occupancy status of the whole network corresponding to the dynamic sending time length method of the embodiment of the present application;

[0047] Figure 8 Fig. 3 is a schematic diagram of the 100-node random topology of the embodiment of the present application;

[0048] Figure 9 Fig. 4 is a comparison diagram of the whole network throughput of the methods of the embodiment of the present application;

[0049] Figure 10 Fig. 5 is a schematic diagram of the queue remaining status of the whole network corresponding to the CSMA / CA access method of the embodiment of the present application;

[0050] Figure 11 Fig. 6 is a schematic diagram of the queue remaining status of the whole network corresponding to the dynamic sending time length method of the embodiment of the present application;

[0051] Figure 12 Fig. 7 is a schematic diagram of the module structure of the adaptive access time length device based on situation awareness of the embodiment of the present application;

[0052] Figure 13 Fig. 8 is a schematic diagram of the device structure of the hardware running environment involved in the adaptive access time length method based on situation awareness of the embodiment of the present application.

[0053] The object, function features and advantages of the present application will be further explained in combination with the embodiments and with reference to the drawings. DETAILED DESCRIPTION

[0054] 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.

[0055] In order to better understand the technical solutions of the present application, the following will be described in detail in combination with the drawings of the specification and the specific embodiments.

[0056] There are two main transmission mechanisms to achieve end-to-end reliable transmission in self-organizing networks. One is the traditional end-to-end transmission mechanism, mainly used in typical mobile communication networks; the other is the hop-by-hop transmission mechanism, which takes advantage of the encodable characteristics of data in self-organizing networks. In a wireless self-organizing network, communication services between nodes are usually generated irregularly, and multiple nodes need to relay and cooperate to complete transmission. Due to the influence of factors such as the transmission capacity of nodes and the density of neighborhoods, each service node in the network usually has a differentiated queue status. The IEEE 802.11 working group further promotes the EDCA (Enhanced Distributed Channel Access) protocol based on the DCF protocol, and through its TXOP (Transmit Opportunity) mechanism, it realizes the flow balance of the whole network. The TXOP mechanism is mainly used to give the node a certain period of continuous transmission time (i.e. TXOP time) after the node successfully obtains the channel occupancy right, so that the node can directly transmit data packets without having to perform a backoff process for each data packet transmission. However, the fixed TXOP time value limits the node's ability to adaptively adjust the continuous transmission time after occupying the channel according to the characteristics of the topology and transmission load in its neighborhood.

[0057] The present application provides a solution based on a fountain code module to re-encode on each node. Specifically, an information entry library of the 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, the first neighboring situation information and the situation information of the node itself are obtained, and a plurality of information packets are packaged; the plurality of information packets are transmitted to the information entry library of the node through broadcasting to obtain the second neighboring situation information; based on the situation information of the neighboring nodes and the situation information of the node itself, 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. Through the above method, the neighborhood information can be perceived, and the full use of link resources can be ensured.

[0058] Based on this, the embodiment of the present application provides an adaptive access time method based on situation awareness, which refers to Figure 1 , Figure 1 The flowchart of the first embodiment of the adaptive access time method based on situation awareness of the present application is shown in the figure.

[0059] In this embodiment, the adaptive access time method based on situation awareness includes steps S10-S50:

[0060] Step S10, an information entry library of the node is constructed and initialized, and the information entry library includes the situation information of each node.

[0061] It should be noted that the information entry library can be understood as containing the situational information corresponding to the individual nodes, and the situational information of each node can be node state, queue size, and time stamp. The node state includes the unique identification of the node, battery power, computing resource usage, whether online, etc. These information can help the network understand the health and availability of the node. The queue size represents the amount of data currently waiting to be transmitted by the node, and the queue information is very important for determining the transmission priority of the node and avoiding network congestion. The time stamp records the last update time of the situational information, and the time stamp can help the network judge the timeliness of the information and make decisions accordingly. It can be understood that the situational information of each node can also include neighborhood relationship and other statistical information, etc. The neighborhood relationship is used to describe the connection relationship between the node and its adjacent nodes (one hop or two hops range), and the other statistical information can be, for example, the transmission rate, reception rate, and packet loss rate of the node. These statistical information can provide more details about the network performance and node behavior.

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

[0063] Step S20, based on the situational information of each node, obtaining the first adjacent situational information and the situational information of the node itself, and packaging to generate a plurality of information packets.

[0064] It should be noted that the first adjacent situational information can be understood as the situational information of the adjacent one-hop node, and the node itself can be understood as the current packaging node, i.e. the node is collecting and packaging its own situational information and the situational information of its adjacent nodes. Each information packet can contain a part of the situational information, or contain a specific type of information (such as only containing the first adjacent situational information and the situational information of the node itself).

[0065] Step S30, transmitting the plurality of information packets to the information entry library of the node through broadcast to obtain the second adjacent situational information.

[0066] It should be noted that the second adjacent situational information can be understood as the situational information of the adjacent two-hop node. It can be understood that the information entry library at this time contains a plurality of information packets, and each information packet is stored in the corresponding information entry row of each node. Exemplarily, the information entry library contains a plurality of information entry rows corresponding to the nodes, and each information entry row contains the situational information of the node itself and the first adjacent situational information. Through the information packets in each information entry row, the second adjacent situational information corresponding to each node can be obtained.

[0067] Step S40, based on the situational information of the adjacent nodes and the situational information of the node itself, calculate the continuous transmission duration of all nodes for channel transmission, the situational information of the adjacent nodes includes the first adjacent situational information and the second adjacent situational information.

[0068] In the embodiment, the information entry library of the node is constructed and initialized, the information entry library includes the situational information of each node; based on the situational information of each node, the first adjacent situational information and the situational information of the node itself are obtained, and a plurality of information packets are packaged and generated; the plurality of information packets are transmitted to the information entry library of the node through broadcasting, the second adjacent situational information is obtained; based on the situational information of the adjacent nodes and the situational information of the node itself, the continuous transmission duration of all nodes for channel transmission is calculated, the situational information of the adjacent nodes includes the first adjacent situational information and the second adjacent situational information. Through the above method, the neighborhood information is perceived, the accurate control of the access duration of the node each time is enhanced, the full use of the link resources is ensured, further, the transmission efficiency is improved, and the problems of high latency and low efficiency in the reliable data transmission of the wireless ad hoc network are solved.

[0069] Reference Figure 2 , Figure 2 The figure is a flowchart of the second embodiment of the situational awareness-based adaptive access duration method of the application, based on the first embodiment shown in the above Figure 1 The second embodiment of the situational awareness-based adaptive access duration method of the application is proposed based on the first embodiment shown in the above

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

[0071] Step S301, transmit the plurality of information packets to the information entry row of each node through broadcasting to obtain the updated information entry row.

[0072] It should be noted that the updated information entry row contains the situational information of the node itself and the first adjacent situational information.

[0073] Step S302, based on the updated information entry row, according to the first adjacent situational information of each node, obtain the second adjacent situational information of each node.

[0074] For example, after the node is accessed, the node periodically broadcasts the information packet containing the situational information of the node itself in the information entry library. In this way, the situational information of all one-hop neighbor nodes of the node can be obtained. Similarly, after the node is accessed, the node periodically broadcasts the information packet containing the situational information of the node itself and the adjacent one-hop nodes in the information entry library. In this way, the situational information of all adjacent two-hop nodes of the node can be obtained.

[0075] In the embodiment, the updated information entry row is obtained by transmitting the plurality of information packages to the information entry row of each node through broadcasting, and the second adjacent situation information of each node is obtained based on the updated information entry row and the first adjacent situation information of each node, so that the adjacent information is perceived, and the accurate control of the access duration of each node can be realized.

[0076] Referring to Figure 3 , Figure 3 FIG. 3 is a flowchart of a third embodiment of the adaptive access duration method based on situation awareness according to the present application, which is based on the second embodiment shown in FIG. 2. Figure 2

[0077] In the third embodiment, the step S40 comprises:

[0078] In step S401, the complete information package is obtained based on the situation information of the adjacent nodes and the situation information of the node itself.

[0079] It should be noted that step S401 comprises: based on the situation information of the adjacent nodes and the situation information of the node itself, the local information entry library is simultaneously subjected to entry addition, merging and deletion to obtain the complete information package. For example, when the node receives the broadcast package, the entries of the situation information are extracted, and the local situation information entry library is subjected to entry addition, merging and deletion, etc. For the same information entry row, if it is continuously received for multiple times, only the entry information of the latest time is retained, and it can be perceived whether there is a two-hop adjacent node that is newly joined or exited around the current node.

[0080] In step S402, the queue ratio of the current node and the nodes adjacent to the node is calculated based on the complete information package.

[0081] For example, with the periodic sending and receiving, each node will stably perceive the queue status of all two-hop neighbors. After each node occupies the channel, the ratio of the queue of the node to the average queue of the two-hop neighbors (i.e. all nodes adjacent to the node) is calculated.

[0082] In step S403, the continuous transmission duration of all nodes for channel transmission is determined based on the queue ratio.

[0083] ​It should be noted that step S403 comprises: if the queuing amount ratio is less than a first preset value, defining the continuous transmission duration as a ratio of a MAC layer average message length and a node average transmission rate; if the queuing amount ratio is greater than the first preset value and less than a second preset value, defining the continuous transmission duration as the queuing amount ratio; and if the queuing amount ratio is greater than the second preset value, defining the continuous transmission duration as a maximum continuous transmission duration.

[0084] For example, after the update of the local entry library is relatively stable, the node can obtain relatively fixed neighbor situation information, including the number of neighbors within two hops and the corresponding queuing amount, denoted as N and [Q1, Q2, …, QN] respectively. Generally, the stable perception of the queue status of all two-hop neighbors means that the node perceives that the two-hop neighbors do not change within multiple MAC layer time frames (for example, one time frame can be set to 100 ms, 10 time frames are 1 s, or a suitable MAC layer time frame is selected according to the common knowledge of those skilled in the art, such as 10 ms, 30 ms, 50 ms, etc.). The ratio of the queuing amount to the average queuing amount of two-hop neighbors is calculated to estimate the relative queue status (Wi) in the neighborhood. The specific calculation formula is Wi = Qi / average queuing amount of two-hop neighbors. If the relative queue status is less than 1, the TXOP duration is configured as a single packet transmission time Tpk. The single packet transmission time is defined as the ratio of the MAC layer average message length to the average transmission rate of the node. If the relative queue status is 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 TXOP duration configuration value Tmax to the MAC layer average message length. If the relative queue status is greater than Wmax, the TXOP duration is configured as Tmax. Tmax refers to the maximum TXOP duration configuration value in the MAC layer protocol. After successfully pre-empting the channel, the node will continuously occupy the channel and transmit data according to the calculated TXOP duration. Within the continuous transmission time, the node no longer uses the RTS-CTS handshake mode, but directly uses the DATA-ACK mode.

[0085] In this embodiment, the neighborhood information is obtained by integrating complete information packets based on the situation information of neighboring nodes and the situation information of the node itself. According to the complete information packets, the queuing amount ratio of the current node and the nodes within two hops of the node is calculated, and the continuous transmission duration of all nodes for channel transmission is determined according to the queuing amount ratio, which enhances the accurate control of the access duration of each node, can be used for the traffic balancing demand of the wireless self-organizing network, thereby relieving the queue accumulation condition of the busy node, rebalancing the traffic of the whole network under the premise of ensuring the throughput, and enhancing the service quality guarantee of the wireless self-organizing network.

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

[0087] First, we use a 15-node random topology ( Figure 4 As shown), 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 figure shows the network throughput obtained by the two methods. The horizontal axis represents the simulation time (in seconds) and the vertical axis represents the network throughput (in bits per second). It can be seen that compared with the traditional CSMA / CA access method, the dynamic transmission duration method can improve the network throughput to a certain extent.

[0088] Figure 6 and Figure 7 The figure shows the corresponding queue status of all network nodes 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, as shown in Figure 2. Figure 6 Obviously, the dynamic sending duration method can effectively alleviate the queuing congestion of nodes in the entire network.

[0089] 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 Figure 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.

[0090] Figure 10 and Figure 11 Demonstrates access using CSMA / CA ( Figure 10 ) and its dynamic sending duration method ( Figure 11After that, the remaining length of the queue of each node in the whole network is obtained. The abscissa represents the simulation time (unit: second), and the ordinate represents the remaining length of the queue of each node (unit: data packet). The total queue length of each node is set to 2000 data packets. It can be seen that, after the dynamic transmission time length method is used, the queue accumulation phenomenon of each node in the whole network is obviously improved, and the number of active nodes in the whole network is greatly increased.

[0091] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the adaptive access time length method based on situation awareness of the present application. More forms of simple transformation based on this technical concept are within the protection scope of the present application.

[0092] The present application also provides an adaptive access time length device based on situation awareness, which is described in detail in the following Figure 12 The adaptive access time length device based on situation awareness comprises:

[0093] A situation information construction module 10 is configured to construct and initialize an information entry library of a node, wherein the information entry library comprises situation information of each node.

[0094] A first information acquisition module 20 is configured to acquire first adjacent situation information and situation information of a self node based on the situation information of each node, and to package and generate a plurality of information packets.

[0095] A second information acquisition module 30 is configured to transmit the plurality of information packets to the information entry library of the node through broadcasting to acquire second adjacent situation information.

[0096] A transmission time length calculation module 40 is configured to calculate a continuous transmission time length of channel transmission of all nodes based on situation information of adjacent nodes and situation information of the self node, wherein the situation information of adjacent nodes comprises the first adjacent situation information and the second adjacent situation information.

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

[0098] The application provides a situation awareness-based adaptive access duration device. The situation awareness-based adaptive access duration device comprises at least one processor and a memory connected with the at least one processor in communication. The memory stores instructions executable by the at least one processor. The instructions are executed by the at least one processor to enable the at least one processor to perform the situation awareness-based adaptive access duration method in the above embodiment one.

[0099] Reference will now be made to the drawings Figure 13 which show a structural diagram of a situation awareness-based adaptive access duration device suitable for implementing the embodiments of the application. The situation awareness-based adaptive access duration device in the embodiments of the application can include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like. Figure 13 The situation awareness-based adaptive access duration device shown is only an example and should not impose any limitation on the functions and use range of the embodiments of the application.

[0100] As Figure 13As shown, the situation awareness based adaptive access duration device can include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.) that can perform various appropriate actions and processes according to programs stored in a read only memory (ROM) 1002 or loaded from a storage device 1003 into a random access memory (RAM) 1004. Various programs and data required for operation of the situation awareness based adaptive access duration device are also stored in the RAM 1004. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; the storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the situation awareness based adaptive access duration device to communicate wirelessly or wired with other devices to exchange data. Although the situation awareness based adaptive access duration device with various systems is shown in the figure, it should be understood that all the shown systems are not required to be implemented or possessed. More or less systems can be alternatively implemented or possessed.

[0101] In particular, according to embodiments of the present disclosure, the processes described above with reference to the flowcharts can be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a computer readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network through the communication device, or installed from the storage device 1003, or installed from the ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the methods of the embodiments of the present disclosure are performed.

[0102] The situation awareness based adaptive access duration device provided by the present disclosure adopts the situation awareness based adaptive access duration method in the above embodiments, and 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 disclosure has the same beneficial effects as the situation awareness based adaptive access duration method provided by the above embodiments, 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.

[0103] It is to be understood that the various parts of the present application can be implemented in 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.

[0104] The above description is merely illustrative of the application and is not intended to limit the scope of the application. Any changes and modifications that can be made to the application in light of the teachings described herein are to be encompassed by the following claims as patent agents are intended to cover any and all such changes and modifications.

[0105] The present application provides a computer readable storage medium having stored thereon computer readable program instructions (i.e., computer programs) for performing the above-mentioned situation awareness based adaptive access duration method.

[0106] The computer readable storage medium provided by the present application may, for example, be a U disk, but is not limited to an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, system, or device, or any combination of the above. More specific examples of computer readable storage media can include, but are not limited to, an electrical connection having one or more conductive wires, a portable computer diskette, 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 the present embodiment, the computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer readable storage medium can be transmitted in any suitable medium, including but not limited to electrical wire, optical cable, RF (Radio Frequency), etc., or any suitable combination of the above.

[0107] The above computer readable storage medium can be included in the situation awareness based adaptive access duration device; or can exist separately and not be assembled into the situation awareness based adaptive access duration device.

[0108] The computer readable storage medium described above carries one or more programs, when the 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 is caused to: construct and initialize an information entry library of nodes, the information entry library includes situation information of each node; based on the situation information of each node, obtain first adjacent situation information and situation information of the self node, and package to generate a plurality of information packages; transmit the plurality of information packages to the information entry library of nodes through broadcasting to obtain second adjacent situation information; based on the situation information of adjacent nodes and the situation information of the self node, calculate the continuous transmission duration of all nodes for channel transmission, the situation information of adjacent nodes includes the first adjacent situation information and the second adjacent situation information.

[0109] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can 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 the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0110] The flow diagrams and the block diagrams in the drawings are illustrations of architectures, functionalities, and operations of possible implementations of systems, methods, and computer program products according to various embodiments of present application. In this regard, each block in the flow diagrams or block diagrams can represent a module, a procedure, or a part of code, which comprises one or more executable instructions for implementing the specified logical functions. It should also be noted that in some alternative implementations, the functions noted in the blocks can occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or the blocks may

[0111] The modules described in the embodiments of the present application may be implemented in software or hardware, wherein the name of a module does not necessarily limit the unit itself.

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

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

[0114] The computer program product provided in this application can solve the technical problem of high data transmission latency. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as those of the situational awareness-based adaptive access duration method provided in the above embodiment, and will not be repeated here.

[0115] The above description is only part of the embodiments of the present application and does not limit the patent scope of the present application. All equivalent structural transformations made by using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect application in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A method for adaptive access duration based on situational awareness, characterized in that: The method includes: Constructing and initializing a node information entry library, wherein the information entry library includes situation information of each node; Based on the situation information of each node, first neighboring situation information and situation information of the own node are obtained, and the situation information is packaged to generate multiple information packets, where the first neighboring situation information is situation information of a neighboring one-hop node; Transmitting the multiple information packets to the information entry library of the node by broadcasting to obtain second neighboring situation information, where the second neighboring situation information is situation information of neighboring two-hop nodes; Calculating the continuous transmission duration of channel transmission for all nodes based on the situation information of the neighboring nodes and the situation information of the own node, wherein the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information; The step of calculating the continuous transmission duration of channel transmission for all nodes based on the situation information of the neighboring nodes and the situation information of the own node includes: Integrate the situation information of the neighboring nodes and the situation information of the own node to obtain a complete information package; Calculating, based on the complete information packet, a queuing volume ratio of a current node and a node two hops adjacent to the node; If the queuing volume ratio is less than a first preset value, the continuous transmission duration is defined as a ratio of an average message length of a media access control layer to an average node transmission rate; If the queuing volume ratio is greater than a first preset value and less than a second preset value, defining the continuous transmission duration 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.

2. The method according to claim 1, wherein 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 situation information of the respective 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, wherein 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 includes: 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 obtained according to the first neighboring situation information of each node.

4. The method according to claim 1, wherein 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 in the local information entry library to obtain a complete information package.

5. A situation-aware adaptive access duration device, 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, configured to acquire first neighboring situation information and situation information of the node itself based on the situation information of each node, and package the information to generate a plurality of information packets, wherein the first neighboring situation information is situation information of a neighboring one-hop node; A second information acquisition module is configured to transmit the plurality of information packets to the information entry library of the node by broadcasting, and acquire second neighboring situation information, where the second neighboring situation information is situation information of neighboring two-hop nodes; a transmission duration calculation module, configured to calculate the continuous transmission duration of channel transmission for all nodes based on the situation information of the neighboring nodes and the situation information of the node itself, wherein the situation information of the neighboring nodes includes the first neighboring situation information and the second neighboring situation information; The transmission duration calculation module is further configured to integrate the situation information of the neighboring nodes and the situation information of the own node to obtain a complete information packet; and calculate the queue volume ratio of the current node and the nodes two hops adjacent to the node based on the complete information packet; The transmission duration calculation module is further used to define the continuous transmission duration 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 less than a first preset value; if the queuing volume ratio is greater than the first preset value and less than a second preset value, define the continuous transmission duration as the queuing volume ratio; if the queuing volume ratio is greater than the second preset value, define the continuous transmission duration as the maximum continuous transmission duration.

6. A situational awareness-based adaptive access duration device, characterized in that: The device includes: 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 situational awareness-based adaptive access duration method according to any one of claims 1 to 4.

7. 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 4 are implemented.

8. A computer program product, characterized in that The computer program product includes 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 4 are implemented.

Images