Information transmission method, device and equipment of bidirectional relay network

Abstract

The invention discloses an information transmission method, device and equipment for a two-way relay network, and the method comprises the steps: carrying out the aging consistency analysis based on the time information of a transmission file obeying the index distribution in a two-way relay network system, and determining an information freshness expectation expression, the information freshness expectation expression is related to the freshness duration of the transmitted file; carrying out information freshness analysis on a transmission file of the two-way relay network system by adopting an auction game theory to obtain an updated resource auction function; the information freshness expectation expression and the updated resource auction function are combined for game solving, and a Nash equilibrium solution is obtained and comprises file request frequency; and bidirectional information transmission is carried out through a bidirectional relay network system according to the Nash equilibrium solution. Therefore, the technical problem that timeliness and reliability of information transmission are lacked due to the fact that timeliness and consistency analysis of transmission information is lacked in the prior art can be solved.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method, device and equipment for transmitting information in a bidirectional relay network. Background Art

[0002] In scenarios where data flows require bidirectional transmission, communication systems can incorporate relays into bidirectional communication channels to forward information and enable bidirectional information exchange. This communication scenario constitutes a bidirectional relay network. Relay nodes are located within the broadcast range of both end users. End users cannot directly reach each other, so they require the assistance of relay nodes to facilitate information exchange. Depending on how the relay processes received data, relay transmission protocols are primarily categorized as Amplify-and-Forward (AF) and Decode-and-Forward (DF).

[0003] Furthermore, current information systems increasingly prioritize information timeliness. Highly specialized applications such as instant messaging, wireless payments, smart grids, and intelligent transportation all place extremely high demands on information timeliness. Furthermore, communication networks often involve numerous information exchange scenarios, but direct information transmission cannot be achieved due to factors such as long physical distances between nodes or excessive propagation losses caused by harsh channel environments.

[0004] In other words, all current application technologies involve the timeliness and consistency of transmitted information, but actual solutions lack relevant research on the timeliness and consistency of transmitted information, resulting in a lack of timeliness and reliability in information transmission. Summary of the Invention

[0005] The present application provides a method, apparatus and device for information transmission in a bidirectional relay network, which is used to solve the technical problem that the existing technology lacks timeliness and consistency analysis of transmitted information, resulting in a lack of timeliness and reliability in information transmission.

[0006] In view of this, a first aspect of the present application provides an information transmission method for a bidirectional relay network, comprising:

[0007] Performing a temporal consistency analysis based on time information of a transmitted file that follows an exponential distribution in a bidirectional relay network system and determining an expected expression for information freshness, wherein the expected expression for information freshness is related to the freshness duration of the transmitted file;

[0008] Using auction game theory to perform information freshness analysis on the transmission file of the bidirectional relay network system to obtain an update resource auction function;

[0009] Combining the information freshness expectation expression and the update resource auction function to perform game solving, to obtain a Nash equilibrium solution, wherein the Nash equilibrium solution includes the file request frequency;

[0010] Bidirectional information transmission is performed through the bidirectional relay network system according to the Nash equilibrium solution.

[0011] Preferably, the time consistency analysis of the time information of the transmission files obeying the exponential distribution in the bidirectional relay network system and the determination of the expected expression of the information freshness include:

[0012] Calculating the expected freshness duration of the transmission file according to the freshness duration of the transmission file that obeys the exponential distribution in the bidirectional relay network system;

[0013] Calculating the expected total cycle time of the file transmission according to the freshness duration and the total waiting time of the user;

[0014] An information freshness expectation expression is constructed based on the freshness duration expectation and the cycle total time expectation.

[0015] Preferably, the step of calculating the expected total cycle time of the file transmission based on the freshness duration and the total user waiting time further includes:

[0016] Determining an acquisition waiting time according to an update status of the transmission file during transmission;

[0017] The total user waiting time is calculated based on the acquisition waiting time and the file copying time.

[0018] Preferably, the use of auction game theory to perform information freshness analysis on the transmission files of the bidirectional relay network system to obtain an updated resource auction function includes:

[0019] Based on auction game theory, a unit bid price is calculated according to the total relay request update frequency constraint, the file request related frequency and the reserved bid, wherein the file request related frequency is the frequency information of the file transmission in the bidirectional relay network system;

[0020] An information freshness analysis based on resource balance is performed on the transmission file according to the unit price to obtain an updated resource auction function.

[0021] Preferably, the combining the information freshness expectation expression and the update resource auction function to perform game solving to obtain a Nash equilibrium solution includes:

[0022] Substituting the update resource auction function into the expected information freshness expression to obtain the expected information freshness substitution formula;

[0023] Calculating a utility function of the transferred file based on the expected information freshness substitution formula;

[0024] Calculating the first-order derivative and the second-order derivative of the utility function and determining the range of utility values;

[0025] Within the utility value range, the utility function is solved based on a preset conditional formula to obtain a Nash equilibrium solution.

[0026] A second aspect of the present application provides an information transmission device for a bidirectional relay network, comprising:

[0027] A file analysis unit, configured to perform time consistency analysis based on time information of a transmission file that obeys an exponential distribution in a bidirectional relay network system, and determine an expected expression for information freshness, wherein the expected expression for information freshness is related to a freshness duration of the transmission file;

[0028] a game analysis unit configured to perform information freshness analysis on the transmission file of the bidirectional relay network system using auction game theory to obtain an update resource auction function;

[0029] a game solving unit, configured to solve the game by combining the expected expression of information freshness and the update resource auction function to obtain a Nash equilibrium solution, wherein the Nash equilibrium solution includes a file request frequency;

[0030] An information transmission unit is used to perform bidirectional information transmission based on the Nash equilibrium solution through the bidirectional relay network system.

[0031] Preferably, the file analysis unit includes:

[0032] a duration expectation calculation subunit, configured to calculate a freshness duration expectation of a transmission file according to a freshness duration of the transmission file that obeys an exponential distribution in a bidirectional relay network system;

[0033] A time expectation calculation subunit, configured to calculate the total expected time of the file transmission cycle according to the freshness duration and the total waiting time of the user;

[0034] The expression building subunit is used to build an information freshness expectation expression based on the freshness duration expectation and the cycle total time expectation.

[0035] Preferably, it also includes:

[0036] A waiting determination unit, configured to determine an acquisition waiting time according to an update status of the transmission file during transmission;

[0037] The waiting calculation unit is used to calculate the total waiting time of the user according to the acquisition waiting time and the file copying time.

[0038] Preferably, the game solving unit is specifically used to:

[0039] Substituting the update resource auction function into the expected information freshness expression to obtain the expected information freshness substitution formula;

[0040] Calculating a utility function of the transferred file based on the expected information freshness substitution formula;

[0041] Calculating the first-order derivative and the second-order derivative of the utility function and determining the range of utility values;

[0042] Within the utility value range, the utility function is solved based on a preset conditional formula to obtain a Nash equilibrium solution.

[0043] A third aspect of the present application provides an information transmission device for a bidirectional relay network, the device comprising a processor and a memory;

[0044] The memory is used to store program code and transmit the program code to the processor;

[0045] The processor is configured to execute the information transmission method for a bidirectional relay network according to the first aspect according to the instructions in the program code.

[0046] It can be seen from the above technical solutions that the embodiments of the present application have the following advantages:

[0047] In the present application, a method for information transmission in a bidirectional relay network is provided, comprising: performing a time consistency analysis based on time information of a transmission file that obeys an exponential distribution in the bidirectional relay network system, and determining an expected expression for information freshness, wherein the expected expression for information freshness is related to the freshness duration of the transmission file; performing an information freshness analysis on the transmission file of the bidirectional relay network system using auction game theory to obtain an update resource auction function; performing a game solution based on the expected expression for information freshness and the update resource auction function to obtain a Nash equilibrium solution, wherein the Nash equilibrium solution includes a file request frequency; and performing bidirectional information transmission through the bidirectional relay network system based on the Nash equilibrium solution.

[0048] The information transmission method for a two-way relay network provided by this application quantifies the timeliness of a two-way relay network system and analyzes the information freshness of files, thereby enabling research on the timeliness and consistency of information. This process also introduces auction game theory to implement game analysis of information freshness, finding a Nash equilibrium solution, and based on this solution, performs two-way information transmission, ensuring the coordination and reliability of two-way communication. Therefore, this application can address the technical problem that the existing technology lacks timeliness and consistency analysis of transmitted information, resulting in a lack of timely and reliable information transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Figure 1 A schematic diagram of a flow chart of an information transmission method for a bidirectional relay network provided in an embodiment of the present application;

[0050] Figure 2 A schematic diagram of the structure of an information transmission device for a bidirectional relay network provided in an embodiment of the present application;

[0051] Figure 3 An example diagram of a two-way relay network system model provided in an embodiment of the present application;

[0052] Figure 4 A schematic diagram of an information freshness curve under the total constraint of sufficient relay total update rate provided in an embodiment of the present application;

[0053] Figure 5 A schematic diagram of the information freshness curve of the transmission file provided in an embodiment of the present application under the influence of a specific update frequency. DETAILED DESCRIPTION

[0054] In order to help those skilled in the art better understand the present invention, the following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of this application.

[0055] For easier understanding, see Figure 1 , an embodiment of the information transmission method of the bidirectional relay network provided by the present application includes:

[0056] Step 101: Perform a temporal consistency analysis based on time information of a transmission file that obeys an exponential distribution in a bidirectional relay network system, and determine an expected expression for information freshness, where the expected expression for information freshness is related to the freshness duration of the transmission file.

[0057] Furthermore, step 101 includes:

[0058] Calculate the expected freshness duration of the transmitted file according to the freshness duration of the transmitted file that obeys the exponential distribution in the bidirectional relay network system;

[0059] Calculate the expected total cycle time of the file transfer based on the freshness duration and the total user waiting time;

[0060] The expected expression of information freshness is constructed based on the expected freshness duration and the expected total cycle time.

[0061] Furthermore, the expected total cycle time of the file transfer is calculated based on the freshness duration and the total user waiting time, which also includes:

[0062] Determine the acquisition waiting time based on the update status of the transferred file during the transfer;

[0063] The total user waiting time is calculated based on the acquisition waiting time and the file copy time.

[0064] It should be noted that the example two-way relay network system of this embodiment includes a relay and multiple users, each of which performs corresponding power grid tasks, such as environmental perception, edge computing, etc. User tasks require the cooperation and support of other users' data, so users are each other's information source and destination; two users are matched to form a group. Figure 3 For example, let's select any group of users in the system, including User 1 and User 2. User 1 wants to obtain User 2's latest file M1, and User 2 wants to obtain User 1's latest file M2. User 1 and User 2 are each other's information sources, and User 1 and User 2 assist in completing the file transfer through a relay. To measure the timeliness consistency of the transmitted information, the information freshness function defined in this embodiment is expressed as:

[0065]

[0066] Then the file The long-term average information freshness can be expressed as:

[0067]

[0068] in, The update intervals of the latest files M1 and M2 corresponding to users 1 and 2 follow an exponential distribution, and their frequencies are recorded as and The distance between the user and the relay and the file size are relatively small, so the influence of the channel can be ignored. For an example of information freshness under the constraint of sufficient relay total update rate, see Figure 4 ,at this time, 、 . The latest file M1 is updated at a frequency of The freshness of information under the influence is recorded as and , please refer to Figure 5 ,at this time , , C is the relay's user request update frequency constraint condition that the relay can provide forwarding update frequency, which is also the total update frequency.

[0069] When the relay initiates the acquisition of a new version of the file, the user will send the latest version of the file; the frequency of the relay obtaining the file follows an exponential distribution, and the frequency is expressed as and ; Relay will and Copy and save. When the destination user initiates a file forwarding request, the relay forwards it according to the request. The file request follows an exponential distribution with a frequency of and .

[0070] Let N be the duration The total number of update cycles within ; for any , in update cycle, and the total cycle time is recorded as , and the corresponding transfer file The duration of freshness is recorded as ; Then we can get:

[0071]

[0072] It is known that the system is ergodic, so the restriction of the above formula exists. Can be equivalent to:

[0073]

[0074] in, 、 Respectively 、 The corresponding expectations are freshness duration expectation and cycle total time expectation. It follows an exponential distribution, so the expected duration of freshness is Expressed as:

[0075]

[0076] in, To transfer files The update interval frequency.

[0077] make For the The destination user receives the transferred file within the update cycle The non-freshness duration of is also called the total waiting time of the user; if , and the first The total cycle time is It can be expressed as:

[0078]

[0079] The relay needs to obtain the transferred file , you need to wait for time Update; after the relay file is updated, transfer the file There are two situations. The first one is that the user obtains the latest version from the relay, and the waiting time is ; The second case is transferring files When the information source user updates again, the relayed file becomes outdated again and needs to be retrieved again. The retrieval waiting time is When the user gets the latest version from the relay, the waiting time ends; when the file is transferred When the next update occurs, the system considers that the transmission has ended, and the waiting time has also ended. The two events are independent of each other, and the system only needs to consider the smaller part of the two cases, so the waiting time can be expressed as:

[0080]

[0081] Known, The frequency of compliance is The exponential distribution of The frequency of compliance is exponential distribution, so, The frequency of compliance is The exponential distribution of , and:

[0082]

[0083] Based on the above, the destination user obtains the latest version of the transferred file The probability is:

[0084]

[0085] However, when the destination user has not yet received the transferred file stored in the relay The latest copy of the file, transfer the file It has been updated, so transfer the file It needs to be copied to the relay again, and the time required is recorded as , also known as the file copy time, and then wait for the relay to send the latest version of the transferred file To the destination user. Then in this whole process, the total waiting time for the user who successfully receives the latest transmitted file when the nth node is recorded is expressed as:

[0086]

[0087] in, Denotes the number of d-th transmissions, D denotes the total number of transmissions experienced during the n-th successful transmission, and satisfies the geometric random variable of the above probability.

[0088]

[0089]

[0090] All obey exponential distribution, and the probabilities are:

[0091] and

[0092] Based on the above, the total cycle time can be deduced Expectations Expressed as:

[0093]

[0094] in, Get the request frequency for relay to transfer file k.

[0095] Based on the above, the expected expression of the information freshness of the transferred file is:

[0096]

[0097] In a two-way relay network system, users and relays are both senders and receivers.

[0098] Step 102: Use auction game theory to analyze the information freshness of the transmission files of the two-way relay network system to obtain an update resource auction function.

[0099] Furthermore, step 102 includes:

[0100] Based on auction game theory, the unit price is calculated according to the total relay request update frequency constraint, the file request related frequency and the reserved bid. The file request related frequency is the frequency information of file transmission in the two-way relay network system.

[0101] According to the unit price, the information freshness of the transferred files is analyzed based on resource balance, and the updated resource auction function is obtained.

[0102] It should be noted that this embodiment optimizes the relay selection and power allocation of the distributed network through auction game theory, establishes an effective forwarding mechanism for resource forwarding allocation, and ensures the maximization and fairness of the overall resource freshness. Since the relay's response to user update requests in the system is limited, it can be assumed that the user request update frequency constraint of the relay is C, that is, the total request update frequency constraint of the relay, and the corresponding user uses the frequency As the cost of bidding relay update resources, that is, the copy request frequency of the transmission file k in the relay, the transmission file can be obtained Auction function, that is, update resource auction function:

[0103]

[0104] in, Represents the update resource auction function, the relay obtains the request frequency of the transfer file k Equal to it, Indicates file transfer Request file of the source user The update frequency, Indicates the reserve bid; the fraction on the right side of the formula is the unit price.

[0105] It should be noted that if the file The source of the information is user 1, and its destination is user 2. User 1 selects a strategy To get the file User 2 chooses strategy To get the file When other factors are given, user 1's selection strategy Increasing the value of will result in fewer files being relayed. Request resource allocation, and increase the file The above update resource auction function is to balance the use of relay resources by each user. Each user needs to reasonably choose its own request update strategy to maximize the benefits.

[0106] Step 103: A game is solved by combining the expected expression of information freshness and the updated resource auction function to obtain a Nash equilibrium solution, which includes the file request frequency.

[0107] Furthermore, step 103 includes:

[0108] Substitute the updated resource auction function into the expected expression of information freshness to obtain the expected substitution formula of information freshness;

[0109] Calculate the utility function of the transferred file based on the expected substitution formula of information freshness;

[0110] Calculate the first and second derivatives of the utility function and determine the range of utility values;

[0111] Within the range of utility values, the utility function is solved based on the preset conditional formula to obtain the Nash equilibrium solution.

[0112] Substitute the updated resource auction function into the expected expression of information freshness, that is, Replace, you can get the transfer file The expected transformation formula of information freshness is:

[0113]

[0114] It can be seen that the expectation of information freshness Depend on and Control, this problem is solved by establishing a cooperative game.

[0115] For example, participants are transferring files and The respective receiving users, the participant's strategy is and ; Participants are concerned about the corresponding transmission files The information freshness, so the corresponding utility function can be expressed as ; Cost factor can be set Equal to the unit price, that is:

[0116]

[0117] Then transfer the file The utility function It can be expressed as:

[0118]

[0119] Calculating utility function about The first and second derivatives of :

[0120]

[0121]

[0122] make:

[0123]

[0124] We can obtain:

[0125]

[0126] Based on this formula and the second-order derivative formula, we can get:

[0127]

[0128] therefore, It is about the utility function The maximum value point of , then it must satisfy:

[0129]

[0130] According to this formula, we can get About Maximum The allowable value range of , the utility value range:

[0131]

[0132] Observing this formula, we can see that to make The domain of is not the empty set, and Need to meet:

[0133]

[0134]

[0135] in, is the number of users, which can be determined according to the above formula. For any user ,user Indicates other users in the system. If The above conditions are met and the total request update frequency constraint of the relay If the above conditions are met, then the cooperative game must be solvable. There is a unique Nash equilibrium point within the range of utility values, denoted as ,Right now:

[0136]

[0137] By solving the unique Nash equilibrium solution, we can get the file request frequency At the same time, the value of this point must be within the domain of definition. The equilibrium point solution in the formula 、 They are all monotonically increasing functions, so the binary search algorithm can be used for fast iterative calculation to obtain the Nash equilibrium point. .

[0138] Step 104: Perform bidirectional information transmission based on the Nash equilibrium solution through the bidirectional relay network system.

[0139] The information transmission method for a two-way relay network provided in the embodiment of the present application quantifies the timeliness in the two-way relay network system and analyzes the information freshness of files, thereby realizing the study of information timeliness and consistency. In this process, auction game theory is also introduced to realize the game analysis of information freshness, obtain the Nash equilibrium solution, and perform two-way information transmission based on this solution to ensure the coordination and reliability of two-way communication. Therefore, the embodiment of the present application can solve the technical problem that the existing technology lacks the timeliness and consistency analysis of transmitted information, resulting in the lack of timeliness and reliability of information transmission.

[0140] For easier understanding, see Figure 2, the present application provides an embodiment of an information transmission device for a bidirectional relay network, comprising:

[0141] The file analysis unit 201 is configured to perform a temporal consistency analysis based on time information of a transmitted file that follows an exponential distribution in a bidirectional relay network system, and determine an expected expression for information freshness, where the expected expression for information freshness is related to the freshness duration of the transmitted file;

[0142] A game analysis unit 202 is configured to perform information freshness analysis on the transmission files of the bidirectional relay network system using auction game theory to obtain an update resource auction function;

[0143] A game solving unit 203 is configured to solve the game by combining the expected expression of information freshness and the updated resource auction function to obtain a Nash equilibrium solution, wherein the Nash equilibrium solution includes the file request frequency;

[0144] The information transmission unit 204 is configured to perform bidirectional information transmission based on a Nash equilibrium solution through a bidirectional relay network system.

[0145] Furthermore, the file analysis unit 201 includes:

[0146] The expected duration calculation subunit 2011 is configured to calculate the expected freshness duration of the transmission file according to the freshness duration of the transmission file that obeys the exponential distribution in the bidirectional relay network system;

[0147] The time expectation calculation subunit 2012 is used to calculate the total cycle time expectation of the file transmission based on the freshness duration and the total user waiting time;

[0148] The expression building subunit 2013 is used to build an information freshness expectation expression based on the freshness duration expectation and the cycle total time expectation.

[0149] Furthermore, it also includes:

[0150] Waiting determination unit 205, used to determine the acquisition waiting time according to the update status of the transmission file during transmission;

[0151] The waiting calculation unit 206 is used to calculate the total waiting time of the user according to the acquisition waiting time and the file copying time.

[0152] Furthermore, the game solving unit 203 is specifically configured to:

[0153] Substitute the updated resource auction function into the expected expression of information freshness to obtain the expected substitution formula of information freshness;

[0154] Calculate the utility function of the transferred file based on the expected substitution formula of information freshness;

[0155] Calculate the first and second derivatives of the utility function and determine the range of utility values;

[0156] Within the range of utility values, the utility function is solved based on the preset conditional formula to obtain the Nash equilibrium solution.

[0157] The present application also provides an information transmission device for a bidirectional relay network, the device including a processor and a memory;

[0158] The memory is used to store program codes and transmit the program codes to the processor;

[0159] The processor is configured to execute the information transmission method of the bidirectional relay network in the above embodiment according to the instructions in the program code.

[0160] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0161] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0162] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0163] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for executing all or part of the steps of the method described in each embodiment of the present application through a computer device (which can be a personal computer, server, or network device, etc.). The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (full name: Read-Only Memory, English abbreviation: ROM), random access memory (full name: Random Access Memory, English abbreviation: RAM), disk or optical disk, and other media that can store program code.

[0164] As described above, the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the above embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the above embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. Information transmission method of two-way relay network, It is characterized in that include: Based on the time information of the transmission file that obeys the exponential distribution in the two-way relay network system, a time consistency analysis is performed, and an expected expression of information freshness is determined, where the expected expression of information freshness is related to the freshness duration of the transmission file; Using auction game theory to analyze the information freshness of the transmission file of the two-way relay network system, and obtaining an update resource auction function; Combining the expected expression of information freshness with the update resource auction function to perform game solving, to obtain a Nash equilibrium solution, wherein the Nash equilibrium solution includes a file request frequency; Bidirectional information transmission is performed through the bidirectional relay network system according to the Nash equilibrium solution.

2. The information transmission method of the two-way relay network according to claim 1, It is characterized in that The time consistency analysis is performed on the time information of the transmission file that obeys the exponential distribution in the bidirectional relay network system, and the expected expression of the information freshness is determined, including: Calculate the expected freshness duration of the transmission file according to the freshness duration of the transmission file that obeys exponential distribution in the two-way relay network system; Calculating the expected total cycle time of the file transmission according to the freshness duration and the total user waiting time; An information freshness expectation expression is constructed based on the freshness duration expectation and the period total time expectation.

3. The information transmission method of the two-way relay network according to claim 2, It is characterized in that The calculation of the expected total cycle time of the file transmission according to the fresh duration and the total user waiting time also includes: Determine the acquisition waiting time according to the update status of the transmission file during transmission; The total user waiting time is calculated based on the acquisition waiting time and the file copying time.

4. The information transmission method of the two-way relay network according to claim 1, It is characterized in that The method of using auction game theory to perform information freshness analysis on the transmission file of the bidirectional relay network system to obtain an update resource auction function includes: Based on auction game theory, the unit price is calculated according to the total relay request update frequency constraint, the file request related frequency and the reserved bid, wherein the file request related frequency is the frequency information of the transmission file in the two-way relay network system; An information freshness analysis based on resource balancing is performed on the transmission file according to the unit price to obtain an updated resource auction function.

5. The information transmission method of the two-way relay network according to claim 1, It is characterized in that The game solving is performed by combining the expected expression of information freshness with the updated resource auction function to obtain a Nash equilibrium solution, including: Substituting the update resource auction function into the expected information freshness expression to obtain the expected information freshness substitution formula; Calculating the utility function of the transferred file based on the expected substitution formula of the information freshness; Calculating the first-order derivative and the second-order derivative of the utility function and determining the range of utility values; Within the utility value range, the utility function is solved based on a preset conditional formula to obtain a Nash equilibrium solution.

6. Information transmission device of two-way relay network, It is characterized in that include: A file analysis unit, configured to perform time consistency analysis based on time information of a transmission file that obeys an exponential distribution in a bidirectional relay network system, and determine an expected expression for information freshness, wherein the expected expression for information freshness is related to a freshness duration of the transmission file; A game analysis unit, configured to perform information freshness analysis on the transmission file of the bidirectional relay network system by using auction game theory to obtain an update resource auction function; A game solving unit, used to solve the game by combining the expected expression of information freshness and the update resource auction function to obtain a Nash equilibrium solution, wherein the Nash equilibrium solution includes a file request frequency; An information transmission unit is used to perform bidirectional information transmission according to the Nash equilibrium solution through the bidirectional relay network system.

7. The information transmission device of the two-way relay network according to claim 6, It is characterized in that The file analysis unit comprises: A duration expectation calculation subunit, used for calculating the freshness duration expectation of the transmission file according to the freshness duration of the transmission file obeying the exponential distribution in the two-way relay network system; A time expectation calculation subunit, used to calculate the total cycle time expectation of the file transmission according to the fresh duration and the total user waiting time; The expression building subunit is used to build an expected expression of information freshness based on the expected freshness duration and the expected total period time.

8. The information transmission device of the two-way relay network according to claim 7, It is characterized in that Also includes: A waiting determination unit, used to determine the acquisition waiting time according to the update status of the transmission file during transmission; The waiting calculation unit is used to calculate the total waiting time of the user according to the acquisition waiting time and the file copying time.

9. The information transmission device of the two-way relay network according to claim 6, It is characterized in that The game solving unit is specifically used for: Substituting the update resource auction function into the expected information freshness expression to obtain the expected information freshness substitution formula; Calculating the utility function of the transferred file based on the expected substitution formula of the information freshness; Calculating the first-order derivative and the second-order derivative of the utility function and determining the range of utility values; Within the utility value range, the utility function is solved based on a preset conditional formula to obtain a Nash equilibrium solution.

10. Information transmission equipment for two-way relay networks, It is characterized in that The device comprises a processor and a memory; The memory is used to store program code and transmit the program code to the processor; The processor is used to execute the information transmission method of the bidirectional relay network according to any one of claims 1 to 5 according to the instructions in the program code.

Images