CN112528451A - Network transmission method, terminal device, and computer-readable storage medium - Google Patents

Network transmission method, terminal device, and computer-readable storage medium Download PDF

Info

Publication number
CN112528451A
CN112528451A CN202110053576.4A CN202110053576A CN112528451A CN 112528451 A CN112528451 A CN 112528451A CN 202110053576 A CN202110053576 A CN 202110053576A CN 112528451 A CN112528451 A CN 112528451A
Authority
CN
China
Prior art keywords
agent
formula
task
task area
representing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110053576.4A
Other languages
Chinese (zh)
Inventor
傅涛
陈志明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bozhi Safety Technology Co ltd
Original Assignee
Bozhi Safety Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bozhi Safety Technology Co ltd filed Critical Bozhi Safety Technology Co ltd
Priority to CN202110053576.4A priority Critical patent/CN112528451A/en
Publication of CN112528451A publication Critical patent/CN112528451A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Geometry (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer And Data Communications (AREA)

Abstract

The invention discloses a network transmission method, terminal equipment and a computer readable storage medium, wherein the method comprises the following steps: establishing a logic topological structure among all network nodes; and resolving conflicts among different burst tasks in the logic topological structure to realize network transmission. According to the invention, different emergency models are established and solved corresponding to different task allocation objective functions and constraint condition models by researching various conditions of emergency under a complex environment in the interconnected and intercommunicated cognitive radio network, so that the transmission performance of the cognitive radio network is improved.

Description

Network transmission method, terminal device, and computer-readable storage medium
Technical Field
The application relates to a network transmission method, terminal equipment and a computer readable storage medium, and belongs to the technical field of wireless signal transmission.
Background
The mutual interconnection relates to intelligent manufacturing, intelligent medical treatment, smart cities and Internet of things big data, and a large amount of wireless connections are needed, and all wireless connections need frequency spectrums, the limitation of frequency spectrum resources and the unlimited demand on the frequency spectrum resources create huge market application space for the civil cognitive radio technology.
The cognitive radio network can cover a wide frequency band, and aims to completely use software to completely complete baseband processing and intermediate frequency modulation of signals and generate radio frequency signal waveforms. By loading different software, the cognitive radio system can support different waveforms, different protocol stacks and brand new system capability, has the characteristics of ad hoc network, spectrum sensing, interference resistance, self adaptation, low time delay, simplicity in operation and maintenance and the like, and can realize interconnection with the existing radio system.
In an interworking cognitive wireless network, various emergencies may occur due to the complex environment, such as: the system comprises a wireless signal transmission system, a wireless signal transmission system and a wireless signal processing system, wherein the wireless signal transmission system comprises a wireless signal transmission system, a wireless signal processing system and a wireless signal processing system, wherein the wireless signal transmission system comprises a wireless signal transmission system and a wireless signal processing system, and the wireless signal transmission system comprises a wireless signal transmission system and a wireless signal processing system.
Disclosure of Invention
The present application aims to provide a network transmission method and a terminal device, so as to solve various emergencies in wireless signal transmission and ensure stability and accuracy of transmission.
A first embodiment of the present invention provides a network transmission method, including:
establishing a logic topological structure among all network nodes;
and resolving conflicts among different burst tasks in the logic topological structure to realize network transmission.
Preferably, the establishing of the logical topology structure among all network nodes specifically includes:
when a burst failure occurs:
calculating Agent iMarginal score for all task areas
Figure 883DEST_PATH_IMAGE001
；
Combining marginal scores of all task regions
Figure 428453DEST_PATH_IMAGE001
Determining the Agent iA task area obtained by auction;
determining task areas meeting preset conditions from task areas
Figure 820776DEST_PATH_IMAGE002
And the insertion position at which the maximum score can be obtained
Figure 557657DEST_PATH_IMAGE003
；
According to the task area meeting the preset conditions
Figure 439025DEST_PATH_IMAGE002
And the insertion position where the maximum score can be obtained
Figure 794920DEST_PATH_IMAGE003
Determining the task area
Figure 429033DEST_PATH_IMAGE002
Margin score of (2)
Figure 100002_DEST_PATH_IMAGE004
；
As described the margin score
Figure 406654DEST_PATH_IMAGE005
If the current value is larger than zero, the Agent is updatediAnd updating the shared information vector until the execution of all task areas is finished to obtain the logic topological structures among all network nodes.
Preferably, said combining the margin scores of all task areas
Figure 759007DEST_PATH_IMAGE006
Determining the Agent iThe task area of the auction specifically includes:
determining the Agent according to a first formulaiThe task area of the auction is that the first formula is:
Figure 528380DEST_PATH_IMAGE007
in the formula (I), the compound is shown in the specification,
Figure DEST_PATH_IMAGE008
representing AgentiFor task area
Figure 876054DEST_PATH_IMAGE009
The marginal score of (a) is calculated,
Figure 439890DEST_PATH_IMAGE010
representing AgentiFor task area
Figure 282469DEST_PATH_IMAGE009
The maximum bid amount of (a) is,
Figure 980166DEST_PATH_IMAGE011
is the total number of task areas.
Preferably, task areas meeting preset conditions are determined from the task areas
Figure 339603DEST_PATH_IMAGE002
And the insertion position at which the maximum score can be obtained
Figure 323609DEST_PATH_IMAGE003
Determining the task area
Figure 525920DEST_PATH_IMAGE002
Margin score of (2)
Figure 902675DEST_PATH_IMAGE012
The method specifically comprises the following steps:
determining the task area meeting the preset condition according to a second formula
Figure 368816DEST_PATH_IMAGE002
The second formula is:
Figure 540034DEST_PATH_IMAGE013
in the formula (I), the compound is shown in the specification,
Figure 229641DEST_PATH_IMAGE014
representing Agent iA path of (a);
determining the insertion position capable of obtaining the maximum score according to the third formula
Figure 128196DEST_PATH_IMAGE003
The third formula is:
Figure 462225DEST_PATH_IMAGE015
in the formula (I), the compound is shown in the specification,
Figure 928979DEST_PATH_IMAGE016
a time stamp representing the Agent i,
Figure 967866DEST_PATH_IMAGE017
is the serial number of the task area,
Figure 420845DEST_PATH_IMAGE018
the longest sequence number of the task area;
determining the task area according to a fourth formula
Figure 858648DEST_PATH_IMAGE002
Margin score of (2)
Figure 496303DEST_PATH_IMAGE019
The fourth formula is:
Figure 35868DEST_PATH_IMAGE020
。
preferably, the updating the AgentiThe information and the update shared information vector of (1) are specifically:
updating the Agent according to a fifth formulaiThe fifth formula is:
Figure 541805DEST_PATH_IMAGE021
in the formula (I), the compound is shown in the specification,
Figure 724130DEST_PATH_IMAGE022
is Agent iThe serial number of the nth task area obtained by current auction,
Figure 673631DEST_PATH_IMAGE023
representing AgentiTask area obtained by auction
Figure 418602DEST_PATH_IMAGE002
，
Figure 603596DEST_PATH_IMAGE024
Is a set of winners;
updating the shared information vector according to a sixth formula, the sixth formula being:
Figure 766724DEST_PATH_IMAGE026
。
preferably, after the establishing a logical topology between all the network nodes on each logical plane when a sudden failure occurs in a complex environment, the method further includes:
sharing messages between adjacent agents, the messages including a set of winners
Figure 870815DEST_PATH_IMAGE027
Bids corresponding to winners
Figure 100002_DEST_PATH_IMAGE028
And time stamp
Figure 450219DEST_PATH_IMAGE016
；
The receiver adopts a corresponding mechanism to process each task area in the receiver according to the received message, and the mechanism comprises the following steps: update mechanism, reset mechanism and leave mechanism, specifically:
the updating mechanism is as follows:
Figure 297959DEST_PATH_IMAGE029
wherein
Figure 50014DEST_PATH_IMAGE010
Representing a recipient AgentiFor task area
Figure 325006DEST_PATH_IMAGE009
The maximum bid of;
Figure 529723DEST_PATH_IMAGE030
representing sender AgentkFor task area
Figure 915574DEST_PATH_IMAGE009
The maximum bid of;
Figure 649699DEST_PATH_IMAGE031
representing the task area obtained by Agent i auction
Figure 111904DEST_PATH_IMAGE009
；
Figure 53184DEST_PATH_IMAGE032
Representing AgentkTask area obtained by auction
Figure 993459DEST_PATH_IMAGE009
；
The reset mechanism is as follows:
Figure 703794DEST_PATH_IMAGE033
；
the leaving mechanism is:
Figure 727114DEST_PATH_IMAGE034
；
preferably, the time stamp
Figure 906423DEST_PATH_IMAGE016
Updating according to a seventh formula, wherein the seventh formula is as follows:
Figure 902585DEST_PATH_IMAGE035
in the formula (I), the compound is shown in the specification,
Figure 749318DEST_PATH_IMAGE036
representing AgentiWith AgentkWhether the communication is directly connected or not, if the communication is known according to the communication topology, the Agent iWith Agent kCan communicate directly therebetween, then
Figure 412381DEST_PATH_IMAGE037
Otherwise
Figure 593832DEST_PATH_IMAGE038
(ii) a m represents the communication with Agent in communication topologykAgents directly connected;
Figure 531701DEST_PATH_IMAGE039
representing Agent iReceiving Agents from a communication networkkThe time of the message.
A second embodiment of the present invention provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the above method when executing the computer program.
A third embodiment of the invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the above-mentioned method.
Compared with the prior art, the network transmission method, the terminal equipment and the computer readable storage medium have the following beneficial effects:
according to the invention, different emergency models are established in the interconnected and intercommunicated cognitive wireless network by researching various conditions (emergency threat, appearance or disappearance of random targets, change of target priority, signal problems or faults and the like) of emergency under a complex environment, and are corresponding to different task allocation objective functions and constraint condition models, and an Extended-CBBA (ECBBA) strategy is adopted for solving, so that the transmission performance of the cognitive radio network is improved, and the economic benefit of a microgrid can be obviously provided.
Drawings
Fig. 1 is a flow chart of a network transmission method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of the infrastructure of a radio network based on SRN in the network transmission method according to an embodiment of the present invention;
fig. 3 is a design diagram of a burst fault model and a processing strategy thereof according to the network transmission method in the embodiment of the invention.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
The present invention will be described in detail with reference to examples, but the present invention is not limited to these examples.
Fig. 1 is a flow chart of a network transmission method according to the present invention.
Fig. 2 is a schematic diagram of the infrastructure of a radio network based on SRN in the network transmission method according to the embodiment of the present invention.
Fig. 3 is a design diagram of a burst fault model and a processing strategy thereof according to the network transmission method in the embodiment of the invention.
Software defined radio-SDR, as shown in fig. 2, changes its operating frequency, occupied bandwidth, and different wireless standards being adhered to by invoking supporting software algorithms.
The network transmission method of the first embodiment of the present invention includes:
step 1, establishing a logic topological structure among all network nodes;
and 2, resolving conflicts among different burst tasks in the logic topological structure to realize network transmission.
In the invention, nodes distributed in the same area respectively work in two different frequency spectrum intervals to logically form two different networks; the nodes above each logical topology form a logical topology at the cost level over the wireless links based on CBBA policies.
CBBA (Consensus-Based Bundle Algorithm) mainly studies which agents execute which task areas, is a distributed, polynomial-time Algorithm Based on a market auction task allocation protocol, and is a task allocation Algorithm capable of avoiding conflict and efficiently solving emergency events.
Before detailing this step, the parameters involved therein are explained.
Bundle (Bundle): define the bundle set as
Figure 232941DEST_PATH_IMAGE040
In which the elements
Figure 182750DEST_PATH_IMAGE041
Representing AgentiThe sequence number of the nth task area obtained by the current auction is, for example:
Figure 602230DEST_PATH_IMAGE042
the 5 th element representing the Agent1 sequential auction gets is task area 3. AgentiThe length of the task set isl b Here, the maximum number of task areas that all agents can execute is specified asL t Will beL t As one of the task assignment end conditions. The bundle sets are sequentially arranged according to the sequence of the task areas, and if the current Agent does not auction to obtain any task area, the bundle sets are orderedb i Is an empty set.
Path (Path): defining a set of paths as
Figure 812631DEST_PATH_IMAGE043
In which the elements
Figure 883224DEST_PATH_IMAGE044
Indicates that the current Agent is includediThe sequence number of the task area obtained by current auction, but different from the bundle set, the path set represents the AgentiThe order of the task areas, and hence the path order, is performed sequentiallyThe length of the set is the same as the length of the bundle set.
Time (Time): the time set is defined as
Figure DEST_PATH_IMAGE045
Wherein
Figure 356931DEST_PATH_IMAGE046
Representing Agent iThe time of arrival at the mission area is sequentially flown according to the current path because of the AgentiThe time to reach a certain task area is obtained according to the path sequence, so the time set is monotonously increased, and the length of the time set is the same as that of the path set.
Winner (Winning Agents): the set of winners may be represented as
Figure 100002_DEST_PATH_IMAGE047
And is and
Figure 719167DEST_PATH_IMAGE048
the element stores AgentiWhich Agent is considered to execute the task areanThe information of (1) is an Agent set for successful auction, specifically, according to the AgentiThe current obtained message can know which Agent finally auctioned the task arean. If Agent iConsider that no Agent competes to the task area at presentnThen, then
Figure 100002_DEST_PATH_IMAGE049
。
Winner bid (Winning Bids): set of winner bids
Figure 920210DEST_PATH_IMAGE050
Wherein
Figure DEST_PATH_IMAGE051
Representing Agent iKnowing the maximum bid of each Agent currently on task area n if the Agent isiNo Agent is considered to compete to the task area at presentnThen, then
Figure 48572DEST_PATH_IMAGE052
。
Timestamp (Time Stamps): time stamp of
Figure DEST_PATH_IMAGE053
Wherein
Figure 430530DEST_PATH_IMAGE054
Representing Agent iReceiving Agents from a communication networknThe time of the latest information, the time stamp is established to record the new and old of a series of information, and the new information is always updated based on the old information.
Step 2 will be described in detail below.
Fig. 3 is a design diagram of a burst fault model and a processing strategy thereof according to the network transmission method in the embodiment of the invention.
When a burst fault occurs in a complex environment, establishing a logical topology structure among all the network nodes on each logical level specifically includes:
step a: respectively calculating Agent on each logic level iMargin scores for all task areas on the logical level
Figure DEST_PATH_IMAGE055
(ii) a When an emergency target in the target set is encountered, sorting is carried out according to the distance between the current position and the target, and the editing score of the first N faults meeting the conditions on the target is initialized to be infinite. The margin scores of other emergency situations are normally calculated at the stage;
step b: determining AgentiWhich task areas to auction to:
Figure 401766DEST_PATH_IMAGE056
step c: finding the task area that best meets the conditions
Figure 829336DEST_PATH_IMAGE002
And the insertion position at which the maximum score can be obtained
Figure 608942DEST_PATH_IMAGE003
：
Figure 96555DEST_PATH_IMAGE013
Figure 839908DEST_PATH_IMAGE057
Figure DEST_PATH_IMAGE058
Step d: if it is
Figure 258120DEST_PATH_IMAGE059
Quitting, otherwise continuing to execute the next step;
step e: updating Agent iThe information of (2):
Figure DEST_PATH_IMAGE060
；
step f: updating the shared information vector:
Figure 485708DEST_PATH_IMAGE061
；
step g: if it is not
Figure DEST_PATH_IMAGE062
And exiting, otherwise, returning to the step a to continue the execution.
The conflict resolution stage of the ECBBA algorithm facing different burst tasks in a complex environment specifically comprises the following steps:
step a: when all agents get from the adjacent Agent
Figure 611400DEST_PATH_IMAGE063
And
Figure DEST_PATH_IMAGE064
then, the obtained information is combinedFurther judging whether the Agent wins the bid or not, if the Agent wins the bid iRacing task areajRepresents the Agent at that momentiFor task areajIf the bid (score) is the highest, the task area is required to be coveredjThe bundle set of other agents is modified, the task area and all task areas added into the bundle set later are released, and the Agent is selected again, because if the tasks are not released, the agents make more wrong decisions according to wrong scores, and the overall performance of the algorithm is reduced.
Step b: the following messages are assumed to be shared simultaneously between the adjacent agents: set of winners
Figure 42382DEST_PATH_IMAGE065
And corresponding offer
Figure DEST_PATH_IMAGE066
Time stamp
Figure 264285DEST_PATH_IMAGE067
The timestamp updating formula of the Agent is as follows:
Figure 893849DEST_PATH_IMAGE035
Figure 975462DEST_PATH_IMAGE036
is AgentiWith Agent kWhether the communication is directly connected or not, if the communication is known according to the communication topology, the AgentiWith AgentkCan communicate directly therebetween, then
Figure 565843DEST_PATH_IMAGE037
Otherwise
Figure 997962DEST_PATH_IMAGE038
；
m is the communication topology with AgentkAgents directly connected;
Figure 606667DEST_PATH_IMAGE039
is AgentiReceiving Agents from a communication networkkThe time of the message.
Step c, updating mechanism of the stage, specifically, when the information sender Agent is sentkPassing information to Agent iThen, the Agent as the receiver iNeed to be based on received information such as
Figure DEST_PATH_IMAGE068
、
Figure 200459DEST_PATH_IMAGE069
、
Figure DEST_PATH_IMAGE070
Determining AgentkAnd Agent iWhich information is up-to-date and reacts and changes accordingly. Known Agent iFor task area jThe following three actions may be taken:
(1) an updating mechanism comprises the following steps:
Figure 468017DEST_PATH_IMAGE029
；
(2) a reset mechanism:
Figure 94039DEST_PATH_IMAGE033
；
(3) the leaving mechanism:
Figure 432616DEST_PATH_IMAGE034
；
step d, when the receiver AgentiWith the sender AgentkAbout task areasjDuring communication, the receiver can know which mechanism should be executed according to the received information from the table 1, and the values of the first two columns in the table indicate the senderkAnd the receiveriWho each think is the task areajThe third column explains the receiveriMechanisms that should be implemented, where the default is the away mechanism. After the conflict resolution of the second stage is finished, the algorithm returns to the first stage again to continue the task selection and adds a new task area,the process is circulated until the information is collected
Figure 603835DEST_PATH_IMAGE071
And
Figure DEST_PATH_IMAGE072
when no more changes occur, the ECBBA algorithm ends.
TABLE 1
Figure 90180DEST_PATH_IMAGE073
A second embodiment of the present invention provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the above method when executing the computer program.
A third embodiment of the invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the above-mentioned method.
According to the invention, different emergency models are established in the interconnected and intercommunicated cognitive wireless network by researching various conditions (emergency threat, appearance or disappearance of random targets, change of target priority, signal problems or faults and the like) of emergency under a complex environment, and are corresponding to different task allocation objective functions and constraint condition models, and an Extended-CBBA (ECBBA) strategy is adopted for solving, so that the tactical use flexibility of the multi-way aircraft is improved.
The network transmission method can obviously provide economic benefits of the micro-grid.
Although the present application has been described with reference to a few embodiments, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the application as defined by the appended claims.

Claims (9)

1. A network transmission method, comprising:
establishing a logic topological structure among all network nodes;
and resolving conflicts among different burst tasks in the logic topological structure to realize network transmission.
2. The network transmission method according to claim 1, wherein the establishing of the logical topology among all network nodes specifically includes:
calculating Agent iMarginal score for all task areas
Figure DEST_PATH_IMAGE001
；
Combining marginal scores of all task regions
Figure 735481DEST_PATH_IMAGE002
Determining the Agent iA task area obtained by auction;
determining task areas meeting preset conditions from task areas
Figure 166462DEST_PATH_IMAGE003
And the insertion position at which the maximum score can be obtained
Figure DEST_PATH_IMAGE004
；
According to the task area meeting the preset conditions
Figure 254942DEST_PATH_IMAGE005
And the insertion position where the maximum score can be obtained
Figure DEST_PATH_IMAGE006
Determining the task area
Figure 716798DEST_PATH_IMAGE007
Margin score of (2)
Figure 405268DEST_PATH_IMAGE008
；
As described the margin score
Figure 385862DEST_PATH_IMAGE009
If the current value is larger than zero, the Agent is updatediAnd updating the shared information vector until the execution of all task areas is finished to obtain the logic topological structures among all network nodes.
3. The network transmission method of claim 2, wherein said combining marginal scores of all task zones
Figure 585025DEST_PATH_IMAGE010
Determining the Agent iThe task area of the auction specifically includes:
determining the Agent according to a first formulaiThe task area of the auction is that the first formula is:
Figure DEST_PATH_IMAGE011
in the formula (I), the compound is shown in the specification,
Figure 36472DEST_PATH_IMAGE012
representing AgentiFor task area
Figure 630265DEST_PATH_IMAGE013
The marginal score of (a) is calculated,
Figure 301417DEST_PATH_IMAGE014
representing AgentiFor task area
Figure DEST_PATH_IMAGE015
The maximum bid amount of (a) is,
Figure 396998DEST_PATH_IMAGE016
is the total number of task areas.
4. The network transmission method according to claim 3, wherein a task area meeting a preset condition is determined from the task areas
Figure 204417DEST_PATH_IMAGE003
And the insertion position at which the maximum score can be obtained
Figure DEST_PATH_IMAGE017
Determining the task area
Figure 798472DEST_PATH_IMAGE005
Margin score of (2)
Figure 425762DEST_PATH_IMAGE018
The method specifically comprises the following steps:
determining the task area meeting the preset condition according to a second formula
Figure 934104DEST_PATH_IMAGE019
The second formula is:
Figure 861609DEST_PATH_IMAGE020
in the formula (I), the compound is shown in the specification,
Figure DEST_PATH_IMAGE021
representing Agent iA path of (a);
determining the insertion position capable of obtaining the maximum score according to the third formula
Figure 623635DEST_PATH_IMAGE022
The third formula is:
Figure 3801DEST_PATH_IMAGE023
in the formula (I), the compound is shown in the specification,
Figure 581413DEST_PATH_IMAGE024
a time stamp representing the Agent i,
Figure 629003DEST_PATH_IMAGE025
is the serial number of the task area,
Figure 768123DEST_PATH_IMAGE026
the longest sequence number of the task area;
determining the task area according to a fourth formula
Figure 432322DEST_PATH_IMAGE003
Margin score of (2)
Figure 813625DEST_PATH_IMAGE027
The fourth formula is:
Figure DEST_PATH_IMAGE028
。
5. the network transmission method of claim 4, wherein the updating the AgentiThe information and the update shared information vector of (1) are specifically:
updating the Agent according to a fifth formulaiThe fifth formula is:
Figure 79171DEST_PATH_IMAGE029
in the formula (I), the compound is shown in the specification,
Figure DEST_PATH_IMAGE030
is Agent iThe serial number of the nth task area obtained by current auction,
Figure 717088DEST_PATH_IMAGE031
representing AgentiTask area obtained by auction
Figure 134163DEST_PATH_IMAGE032
，
Figure DEST_PATH_IMAGE033
Is a set of winners;
updating the shared information vector according to a sixth formula, the sixth formula being:
Figure 145588DEST_PATH_IMAGE034
。
6. the network transmission method according to claim 5, wherein the resolving conflicts between different bursty tasks in the logical topology is specifically:
sharing messages between adjacent agents, the messages including a set of winners
Figure 167771DEST_PATH_IMAGE035
Bids corresponding to winners
Figure 147228DEST_PATH_IMAGE036
And time stamp
Figure 287484DEST_PATH_IMAGE024
；
The receiver adopts a corresponding mechanism to process each task area in the receiver according to the received message, and the mechanism comprises the following steps: update mechanism, reset mechanism and leave mechanism, specifically:
the updating mechanism is as follows:
Figure 10590DEST_PATH_IMAGE037
wherein
Figure 887279DEST_PATH_IMAGE038
Representing a recipient AgentiFor task area
Figure 61472DEST_PATH_IMAGE015
The maximum bid of;
Figure DEST_PATH_IMAGE039
representing sender AgentkFor task area
Figure 610396DEST_PATH_IMAGE040
The maximum bid of;
Figure DEST_PATH_IMAGE041
representing the task area obtained by Agent i auction
Figure 963624DEST_PATH_IMAGE040
；
Figure 960398DEST_PATH_IMAGE042
Representing AgentkTask area obtained by auction
Figure 547238DEST_PATH_IMAGE043
；
The reset mechanism is as follows:
Figure DEST_PATH_IMAGE044
；
the leaving mechanism is:
Figure 458824DEST_PATH_IMAGE045
。
7. the network transmission method of claim 6, wherein the timestamp is updated according to a seventh formula, wherein the seventh formula is:
Figure 523732DEST_PATH_IMAGE046
in the formula (I), the compound is shown in the specification,
Figure DEST_PATH_IMAGE047
representing AgentiWith AgentkWhether the communication is directly connected or not, if the communication is known according to the communication topology, the Agent iWith Agent kCan communicate directly therebetween, then
Figure 207304DEST_PATH_IMAGE048
Otherwise
Figure DEST_PATH_IMAGE049
(ii) a m represents the communication with Agent in communication topologykAgents directly connected;
Figure 325564DEST_PATH_IMAGE050
representing Agent iReceiving Agents from a communication networkkThe time of the message.
8. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any of claims 1 to 7 when executing the computer program.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
CN202110053576.4A 2021-01-15 2021-01-15 Network transmission method, terminal device, and computer-readable storage medium Pending CN112528451A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110053576.4A CN112528451A (en) 2021-01-15 2021-01-15 Network transmission method, terminal device, and computer-readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110053576.4A CN112528451A (en) 2021-01-15 2021-01-15 Network transmission method, terminal device, and computer-readable storage medium

Publications (1)

Publication Number Publication Date
CN112528451A true CN112528451A (en) 2021-03-19

Family

ID=74977511

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110053576.4A Pending CN112528451A (en) 2021-01-15 2021-01-15 Network transmission method, terminal device, and computer-readable storage medium

Country Status (1)

Country Link
CN (1) CN112528451A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1899908A2 (en) * 2005-05-23 2008-03-19 SAP Governance Risk and Compliance, Inc Embedded module for real-time risk analysis and treatment
CN108664038A (en) * 2018-05-14 2018-10-16 中国人民解放军火箭军工程大学 A kind of online mission planning method of multiple no-manned plane distribution contract auction
CN109088667A (en) * 2017-12-06 2018-12-25 中国人民解放军国防科技大学 Isomorphic multi-satellite online collaboration method for simple tasks
CN110134146A (en) * 2019-06-14 2019-08-16 西北工业大学 A kind of distributed multiple no-manned plane method for allocating tasks under uncertain environment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1899908A2 (en) * 2005-05-23 2008-03-19 SAP Governance Risk and Compliance, Inc Embedded module for real-time risk analysis and treatment
CN109088667A (en) * 2017-12-06 2018-12-25 中国人民解放军国防科技大学 Isomorphic multi-satellite online collaboration method for simple tasks
CN108664038A (en) * 2018-05-14 2018-10-16 中国人民解放军火箭军工程大学 A kind of online mission planning method of multiple no-manned plane distribution contract auction
CN110134146A (en) * 2019-06-14 2019-08-16 西北工业大学 A kind of distributed multiple no-manned plane method for allocating tasks under uncertain environment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张蕾: "多无人机协同侦察任务决策研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 *

Similar Documents

Publication Publication Date Title
EP2871908B1 (en) Relay apparatus and method of selecting relay node based on learning in wireless network
CN108712491A (en) Block chain node, exchange information processing method, terminal device and medium
WO2004049131A2 (en) Network architecture, addressing and routing
US20090190496A1 (en) Method of Organizing Nodes of a Network into Groupings of Nodes, Computer Program for Implementing such a Method and Communication Device Forming a Node of a Network of Nodes
CN106713468B (en) A kind of distributed type assemblies service system and its method for node synergy
CN111580970A (en) Transmission scheduling method for model distribution and aggregation of federated learning
CN105024919B (en) A kind of groups of users method for building up and device
CN102158983A (en) Method for constructing 6LoWPAN wireless sensor network
CN107210850A (en) Method and system for selecting the messaging parameter in wireless network
CN106302230B (en) A kind of data transmission method and device
CN107404541A (en) A kind of method and system of peer-to-peer network transmission neighbor node selection
CN108259195A (en) The determining method and system of the coverage of anomalous event
CN102506886A (en) Method for realizing path planning in navigation equipment
CN110740177A (en) Network merging method and device, storage medium and electronic device
CN103929377A (en) Wired network and wireless network combined dispatching method and system and related devices
CN100446497C (en) Method for assigning a back-off interval
CN108494688A (en) A kind of Future Data network implementation approach of low-cost
CN112383926A (en) Multi-agent transmission method and terminal equipment for cognitive radio network signals
CN105786618B (en) The method and apparatus of message are routed in accelerator network
US7941531B2 (en) Age biased distributed collision resolution without clocks
CN112528451A (en) Network transmission method, terminal device, and computer-readable storage medium
CN112528450A (en) Network topology construction method, terminal device and computer readable storage medium
CN109961148B (en) Method for realizing selection of blockchain production nodes by using random forest algorithm
CN100578484C (en) Self-adaptive multicast file transfer method and device
CN116132353A (en) TSN route selection method based on DDQN

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20210319

RJ01 Rejection of invention patent application after publication