CN112799695A - Multi-domain multi-source collaborative common scene software reconstruction implementation method - Google Patents

Multi-domain multi-source collaborative common scene software reconstruction implementation method Download PDF

Info

Publication number
CN112799695A
CN112799695A CN202011624144.6A CN202011624144A CN112799695A CN 112799695 A CN112799695 A CN 112799695A CN 202011624144 A CN202011624144 A CN 202011624144A CN 112799695 A CN112799695 A CN 112799695A
Authority
CN
China
Prior art keywords
domain
node
source
nodes
cooperation
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.)
Granted
Application number
CN202011624144.6A
Other languages
Chinese (zh)
Other versions
CN112799695B (en
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.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
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 National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN202011624144.6A priority Critical patent/CN112799695B/en
Publication of CN112799695A publication Critical patent/CN112799695A/en
Application granted granted Critical
Publication of CN112799695B publication Critical patent/CN112799695B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • G06F8/65—Updates
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a multi-domain multi-source collaborative common scene software reconstruction implementation method, which comprises the following steps that firstly, a broadcast optimal search selection method is adopted in a domain to implement the collaboration of nodes in the domain; secondly, inter-domain cooperation and power optimization are realized by adopting a depth-first search selection method between domains, and a multi-domain multi-source cooperation scene sharing network is formed; and thirdly, by adopting a mode of 'reconstruction program + original program', the basic task of the system cannot be modified when the reconstruction program is updated, if the reconstruction program cannot normally run, the system fuses and responds and jumps to the original program, and the original program is run to execute the basic task before the original upgrading, so that the risk of system failure is reduced, the reliability of task execution is improved, and the design of software reconstruction is simplified. Meanwhile, the method can be used for updating the local code, and is suitable for code transplantation reconstruction of the multi-domain multi-source modem.

Description

Multi-domain multi-source collaborative common scene software reconstruction implementation method
Technical Field
The invention belongs to the technical field of computer software, and particularly relates to a multi-domain multi-source collaborative scene sharing software reconstruction implementation method.
Background
The method is developed along with the requirements of mixed reality multi-person remote interaction, the technologies of space anchor point, space time auxiliary positioning and the like are adopted, the system network server is used for synchronizing the space positioning of each remote terminal in a virtual space and a real space, so that the space positioning is realized, the operation synchronization and the response synchronization of each terminal are coordinated on the basis of determining the space positioning, the multi-domain multi-source collaborative scene sharing holographic display is realized by utilizing the mixed reality MR and the expanded reality XR thought, the cross-domain scene sharing is realized, and the system application and the emergency guarantee based on the whole task process are completed.
At present, the software reconfiguration technology mainly adopts a 'BootLoader + APP' mode, and injects executable codes of a complete software functional module into application equipment by a remote control injection mode of continuous addresses so as to replace the original functional module. However, the methods cannot keep the initial software version, and once the APP loaded for the second time is abnormal, the APP cannot be repaired in time, which will affect the task.
In addition, software reconstruction under the condition of multi-domain and multi-source collaborative sharing scene is not involved, and meanwhile, only part of codes need to be modified sometimes, such as a certain control algorithm. Due to the limitation of cooperative communication bandwidth, if the whole code updating mode is still used, the waste of time and resources is caused, and the processing process is complex and has high risk.
Disclosure of Invention
The invention aims to provide a multi-domain multi-source collaborative scene sharing software reconstruction implementation method which can be used for updating local codes.
The technical scheme adopted by the invention is that a multi-domain multi-source collaborative scene sharing software reconstruction implementation method is implemented according to the following steps:
step 1, establishing a multi-domain multi-source wireless cooperative common scene model;
step 2, realizing the cooperation of nodes in the domain by adopting a broadcast optimal search selection method in the multi-domain multi-source wireless cooperation common scene model domain; inter-domain cooperation and power optimization are realized by adopting a depth-first search selection method between domains, and a multi-domain multi-source wireless cooperation scene sharing strategy is formed;
step 3, optimizing the common scene strategy obtained in the step 2 through a multisource wireless cooperative power minimum strategy;
step 4, the reconstructed code is sent to an optimized common-scenario policy management and control computer through a wireless communication link, the computer transplants the reconstructed code into a reconstruction program APP1 in a mode of 'reconstruction program APP1+ original program APP 2', and APP1 is mapped to an internal flash memory address; if the APP1 cannot normally operate, the system fuses the response and jumps to the original program APP2, and operates the original program APP2 to execute the basic task before the original upgrade.
The specific process of the step 1 is as follows:
different collaboration domains in the multi-domain multi-source wireless collaboration same-scene network system are defined as follows: s1,S2,…,SLL is the number of cooperative domains, and each cooperative domain has M nodes dl1,dl2,…,dlML is 1,2, …, L wherein S1And S2,S3,…,SLIs inter-domain friendship, at different S1,…,SLThe relationships of nodes in the domain are respectively parent-child relationships;
establishing reversible and equivalent channels among all the cooperative domains, wherein each channel is independent and obeys a Rayleigh fading model;
setting a source node d in each cooperation domainliChannel gain (d) between corresponding cooperating nodes in the domainli，dlj)(dli，dlj∈Sl,i≠j,j＝1,2,…,M-1)；
The system will be subjected to mean 0 and variance σ in cooperation0If the transmission power of each node is PjThen the signal-to-noise ratio is expressed as P ═ Pj/σ0。
The specific process of the step 2 is as follows:
when any one cooperative intra-domain source node and other cooperative intra-domain nodes in the multi-domain multi-source wireless cooperative scene sharing model cooperate to share a scene, intra-domain node cooperation and inter-domain node cooperation need to be considered respectively;
and (3) inter-domain node cooperation: dliAnd dlmBelongs to the same domain SlNode dliSending data request and dlmCollaboratively, an intra-domain broadcast optimal search selection method is adopted, namely, after receiving the message, the other M-1 source nodes in the domain decode d respectivelyliAll as relay nodes, the selected intra-domain optimal cooperative target node dlm；
Inter-domain node cooperation: constructing a node d calling the recursive function dfs (-) for marking and accessingiEstablishing an associated adjacency list function list (·); when the nodes do not belong to the same domain, selecting the node closest to inter-domain decoding as the optimal cooperative destination node d by adopting an inter-domain depth-first search selection methodlk；
And the intra-domain node cooperation and the inter-domain node cooperation form a multi-domain multi-source wireless cooperation scene sharing strategy.
The inter-domain node cooperation specific process is as follows:
node d1i∈S1Node d2i∈S2And region S2Node d of2iIs the source node d1iThe first node element of the adjacency list, i.e.
Figure BDA0002874473700000031
And has not been searched, identifying and accessing node d using a recursive call function dfs (-) to2iI.e. dfs (d)1i,d2i)＝d2iThe system connects node d1iAnd node d2iThe current position of the adjacency list is pressed into the stack;
node d1iAnd node d2iHas been searched, so that the recursion function dfs (-) skips the node; region S2Node d of2iSelecting region S by using intra-domain broadcast optimal search selection method2Inner d2iBest cooperative destination node d2n；
In the same way, in the region SlFind node d1iFirst node element d of adjacency listliI.e. by
Figure BDA0002874473700000041
dfs(d1i,dli)＝dliUsing intra-domain broadcastingOptimum search selection method, selecting region SlInner dliOptimal cooperative destination node dlk。
The specific process of the step 3 is as follows:
each source node communicates with each target node by adopting an orthogonal transmission mechanism, the relay nodes cooperate with each other according to an orthogonal channel principle, the same codebook is adopted for the source nodes which are cooperated when the relay nodes communicate, and the information efficiency between the source nodes and the target nodes is R;
minimum reliable transmission power distribution coefficient k of optimal cooperative destination nodeiDerived from the information efficiency R, i.e.:
Figure BDA0002874473700000042
Figure BDA0002874473700000043
wherein the content of the first and second substances,
Figure BDA0002874473700000044
for nodes within or between domains
Figure BDA0002874473700000045
Inter-channel gain;
assuming all relay nodes of each source node have undergone a full traversal, S within the domain1Source node d1iSelecting a relay node d1pIf the relay node can support the source node, the relay node is qualified to be an alternative relay node of the source node, otherwise, the relay node is not considered; repeating the steps until all the conditions in the domain are traversed; selecting a set of relay nodes in all relay node selection cases d1p,d1p+1,d1p+2，…，d1p+m}，(m＝1,2,…,D1-1) making the protocolThe number of successful links is minimized;
similarly, for different domains, an inter-domain depth-first search selection method is adopted to complete inter-domain node design, and an intra-domain method is adopted to calculate a cooperation domain SlThe middle relay node is expressed as: { dlp,dlp+1,dlp+2，…，dlp+m}，(m＝1,2,…,Dl-1)；
When a plurality of relay nodes exist in a domain, after the minimum reliable transmission power is allocated to the relay nodes, if the residual power cannot continuously support the source nodes needing the relay nodes to cooperate, the relay nodes are removed from the set of the source nodes;
let the total number of relay nodes be D, i.e. D ═ D1+D2…+DlPreferentially selecting the relay node number capable of minimizing D as the optimal relay node number, and randomly selecting one relay node number if a plurality of relay node numbers are minimized;
under the condition of minimum D, information rate and distributed power P are transmitted by optimizing a collaborative common sceneiThe allocation implements a co-scenario policy optimization.
Optimizing cooperative co-scenario transmission information rate R and distributed power PiThe distribution process is as follows:
the information rate R is transformed from the formula (1) to
Figure BDA0002874473700000051
The optimization function can be expressed as:
Figure BDA0002874473700000052
the invention has the beneficial effects that:
the multi-domain multi-source collaborative common-scene software reconstruction implementation method can reduce the system failure risk, improve the reliability of task execution and simplify the design of software reconstruction. Meanwhile, the method can also be used for updating the local code and is suitable for code transplantation reconstruction of the multi-domain multi-source modem.
Drawings
FIG. 1 is a schematic diagram of a multi-domain multi-source wireless collaboration sharing scenario in the present invention;
FIG. 2 is a multi-domain multi-source collaborative co-scene online reconstruction relationship diagram in the present invention;
FIG. 3 is a schematic diagram of software reconfiguration of a collaborative co-scenario in accordance with the present invention;
fig. 4 is a 16QAM continuous signal timing synchronization constellation in an embodiment of the present invention;
fig. 5 is a 16QAM continuous signal carrier synchronization constellation in an embodiment of the present invention;
FIG. 6 is a symbol map of a 16 tone signal after timing synchronization according to an embodiment of the present invention;
FIG. 7 is a diagram of symbols after carrier synchronization of a 16-tone signal according to an embodiment of the present invention;
fig. 8 is a simulation comparison graph of the network outage probability for the minimum and ideal power allocation in the embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to the following embodiments.
The invention relates to a multi-domain multi-source collaborative common scene software reconstruction implementation method, which is implemented according to the following steps:
step 1, establishing a multi-domain multi-source wireless cooperative common scene model;
the specific process of the step 1 is as follows:
different cooperation domains S in multi-domain multi-source wireless cooperation same-scene network1,S2,…,SLAnd L is the number of the cooperative domains, and different cooperative domains in the multi-domain multi-source wireless cooperative same-scene network system are defined as follows: s1,S2,…,SLL is the number of cooperative domains, and each cooperative domain has M nodes dl1,dl2,…,dlML is 1,2, …, L wherein S1And S2,S3,…,SLIs inter-domain friendship, at different S1,…,SLThe relationships of nodes in the domain are respectively parent-child relationships;
as shown in FIG. 1, taking three cooperation areas as an example, the cooperation area S1Having M nodes d therein1,d2,…,dMOf the collaboration domain S2With N nodes r therein1,r2,…,rNOf the collaboration domain S3With K nodes e therein1,e2,…,eK. Each node in the network cooperates with each other.
Establishing reversible and equivalent channels among all the cooperative domains, wherein each channel is independent and obeys a Rayleigh fading model;
setting a source node d in each cooperation domainliChannel gain (d) between corresponding cooperating nodes in the domainli，dlj)(dli，dlj∈Sl,i≠j,j＝1,2,…,M-1)；
Let S1Source node d within a domainiChannel gain h (d) between corresponding cooperative nodes in the domaini,dj)(di,dj∈S1I ≠ j, j ≠ 1,2, …, M-1), source node diAnd domain S2Node r ofiInter-channel gain h (d)i,rj)(di∈S1,rj∈S2I 1,2, …, M, j 1,2, …, N), source node diAnd domain S3Node e ofjInter-channel gain h (d)i,ej)(di∈S1,ej∈S3,i＝1,2,…,M,j＝1,2,…,K)。
All channels are reversibly equivalent, and the system is subjected to mean 0 and variance σ in cooperation0If the transmission power of each node is PjThen the signal-to-noise ratio is expressed as P ═ Pj/σ0。
Step 2, realizing the cooperation of nodes in the domain by adopting a broadcast optimal search selection method in the multi-domain multi-source wireless cooperation common scene model domain; inter-domain cooperation and power optimization are realized by adopting a depth-first search selection method between domains, and a multi-domain multi-source wireless cooperation scene sharing strategy is formed;
the specific process of the step 2 is as follows:
when any one cooperative intra-domain source node and other cooperative intra-domain nodes in the multi-domain multi-source wireless cooperative scene sharing model cooperate to share a scene, intra-domain node cooperation and inter-domain node cooperation need to be considered respectively;
and (3) inter-domain node cooperation: dliAnd dlmBelongs to the same domain SlNode dliSending data request and dlmCollaboratively, an intra-domain broadcast optimal search selection method is adopted, namely, after receiving the message, the other M-1 source nodes in the domain decode d respectivelyliAll as relay nodes, the selected intra-domain optimal cooperative target node dlm；
Inter-domain node cooperation: constructing a node d calling the recursive function dfs (-) for marking and accessingiEstablishing an associated adjacency list function list (·); when the nodes do not belong to the same domain, selecting the node closest to inter-domain decoding as the optimal cooperative destination node d by adopting an inter-domain depth-first search selection methodlk；
The inter-domain node cooperation specific process is as follows:
node d1i∈S1Node d2i∈S2And region S2Node d of2iIs the source node d1iThe first node element of the adjacency list, i.e.
Figure BDA0002874473700000071
And has not been searched, identifying and accessing node d using a recursive call function dfs (-) to2iI.e. dfs (d)1i,d2i)＝d2iThe system connects node d1iAnd node d2iThe current position of the adjacency list is pressed into the stack;
node d1iAnd node d2iHas been searched, so that the recursion function dfs (-) skips the node; region S2Node d of2iSelecting region S by using intra-domain broadcast optimal search selection method2Inner d2iBest cooperative destination node d2n；
In the same way, in the region SlFind node d1iFirst node element d of adjacency listliI.e. by
Figure BDA0002874473700000081
dfs(d1i,dli)＝dliSelecting the region S by using the intra-domain broadcast optimal search selection methodlInner dliOptimal cooperative destination node dlk。
And the intra-domain node cooperation and the inter-domain node cooperation form a multi-domain multi-source wireless cooperation scene sharing strategy.
On the basis of adopting an intra-domain broadcast optimal search selection method and adopting an inter-domain depth-first search selection method among domains, a method for maximizing the information transmission rate of a system under the condition of minimum power consumption is provided for selecting an optimal relay node to cooperate with a target node on the premise of ensuring the reliability of the system. The method maximizes the transmission rate of the cooperative network information on the premise of meeting the minimum power for successful cooperative transmission, thereby achieving the purposes of reducing the power consumption of the system and improving the utilization efficiency of the whole system.
Step 3, optimizing the common scene strategy obtained in the step 2 through a multisource wireless cooperative power minimum strategy;
the specific process of the step 3 is as follows:
each source node communicates with each target node by adopting an orthogonal transmission mechanism, the relay nodes cooperate with each other according to an orthogonal channel principle, the same codebook is adopted for the source nodes which are cooperated when the relay nodes communicate, and the information efficiency between the source nodes and the target nodes is R.
In order to ensure successful multi-domain cooperation and minimize power consumption of the system, power can be distributed to just enable each source node to cooperate with each relay node. The channel quality between the optimal relay node and the destination node is considered, and the mode of combining and receiving the optimal relay node and the destination node is not considered.
Therefore, the minimum reliable transmission power distribution coefficient k of the optimal cooperative destination nodeiDerived from the information efficiency R, i.e.:
R＝log2(1+kiρi|gi(ni,nj)|2) (1)
Figure BDA0002874473700000091
wherein, gi(ni,nj) For intra-or inter-domain nodes ni,njInter-channel gain; the channel gains are circularly symmetric complex Gaussian random variables, and the variances are respectively
Figure BDA0002874473700000092
ρi＝Pi/N0Representing the signal-to-noise ratio, P, of node ii，N0Respectively, the transmit power and the white noise power of node i.
Assuming all relay nodes of each source node have undergone a full traversal, S within the domain1Source node d1iSelecting a relay node d1pIf the relay node can support the source node, the relay node is qualified to be an alternative relay node of the source node, otherwise, the relay node is not considered; repeating the steps until all the conditions in the domain are traversed; selecting a set of relay nodes in all relay node selection cases d1p,d1p+1,d1p+2，…，d1p+m}，(m＝1,2,…,D1-1) minimizing the number of cooperative link successes;
similarly, for different domains, an inter-domain depth-first search selection method is adopted to complete inter-domain node design, and an intra-domain method is adopted to calculate a cooperation domain SlThe middle relay node is expressed as: { dlp,dlp+1,dlp+2，…，dlp+m}，(m＝1,2,…,Dl-1)；
According to the method, an optimal relay does not forward at full power any more, but performs cooperation at minimum reliable transmission power, when a plurality of relay nodes exist in a domain, after the minimum reliable transmission power is distributed to the relay nodes, if the residual power cannot continuously support a source node which needs the relay nodes to perform cooperation, the relay nodes are removed from a set of the source node;
let the total number of relay nodes be D, i.e. D ═ D1+D2…+DlThe number of relay nodes selected is different, and the value of D is also different. Preferentially selecting the relay node number capable of minimizing D as the optimal relay node number, and randomly selecting one relay node number if a plurality of relay node numbers are minimized;
in order to realize multi-domain multi-source node collaborative common scene, on the premise of selecting the minimum D, the information transmission rate and the distributed power P are transmitted by optimizing the collaborative common sceneiThe allocation implements a co-scenario policy optimization.
Optimizing cooperative co-scenario transmission information rate R and distributed power PiThe distribution process is as follows:
the information rate R is transformed from the formula (1) to
Figure BDA0002874473700000101
The optimization function can be expressed as:
Figure BDA0002874473700000102
the smaller D means that the selection of the relay has smaller influence on the selection of the number of the subsequent relay nodes, namely, a larger space is reserved for the selection of the number of the subsequent relay nodes, and the optimization of the system power consumption and the information rate becomes simple. The method can continue to support other nodes in its shared set after allocating the minimum reliable transmission power to the best relay node, if power still remains, until power is exhausted or no supportable source node exists, so that the allocation has the advantage of reducing collisions more effectively.
And 4, synchronizing the spatial positioning of each remote terminal in a real space through a system network server so as to realize spatial positioning, coordinating operation synchronization and response synchronization of each terminal on the basis of determining the spatial positioning, and holographically displaying the multi-domain multi-source collaborative common scene based on a multi-domain multi-source wireless collaborative common scene collaborative power minimum method by adopting ideas such as spatial anchor points, spatial time auxiliary positioning and the like so as to realize cross-domain scene sharing.
The reconstructed codes are sent to an optimized common-scenario policy management and control computer through a wireless communication link, the computer transplants the reconstructed codes into a reconstruction program APP1 in a mode of 'reconstruction program APP1+ original program APP 2', and APP1 is mapped to an internal flash memory address; if the APP1 cannot normally operate, the system fuses the response and jumps to the original program APP2, and operates the original program APP2 to execute the basic task before the original upgrade.
And after the reconstructed code is sent to the optimized computer for the management control of the common scene strategy through a wireless communication link, the computer forwards the reconstructed code to the application embedded system through communication modes such as EMIF, UART, SPI, USB, Ethernet and the like. The application embedded system can configure different interface chips according to the communication mode with the data management control computer.
In order to verify the feasibility of the above DSP multi-domain multi-source reconstruction method, remote update simulation verification of DSP subroutines is performed in a laboratory environment, as shown in fig. 2. Taking a synchronous terminal view as an example, multi-domain software reconstruction is realized. The terminal system adopts a DSP chip as a main controller and is interconnected with the FPGA through an external memory interface EMIF/UART, and the FPGA is used as a manager of various external devices such as SDRAM, Flash, PROM, CAN interface and the like, so as to realize the access of the DSP to various peripheral devices.
The original DSP software system is started by powering on, and the updated DSP software system can be loaded through Flash. When software in Flash needs to be updated, prepared update code data is sent to a computer through a communication interface, then the update code data is transmitted to a DSP by the computer through a CAN bus and is temporarily stored in SDRAM, then the update program code is written into Flash by the DSP for software updating, and after the updating is finished, the DSP is electrified again to start the DSP, so that the new code CAN be executed.
The invention discloses a software reconstruction method based on multi-domain multi-source collaborative sharing scene, which adopts a combination mode of 'reconstruction program + original program', as shown in figure 3, a BootLoader function is coupled in a reconstruction program APP1, an APP1 is mapped to an internal Flash memory (Flash) address, the original program APP2 is not modified by updating of APP1, if the APP1 cannot normally operate, the system jumps to an APP2 (the memory mapped by the APP2 is PROM), the APP2 is operated to execute the original basic task before upgrading, the risk of system failure is reduced, the reliability of task execution is improved, and the design of software reconstruction is simplified.
The DSP software loading process of the invention is carried out in two stages: first-level upgrade optimization and second-level recovery backup. The first-level upgrade optimized loading is that after the DSP is reset, the system mainly comprises system initialization setting, CRC (cyclic redundancy check) check, version check, code data copying and the like, 1KB or 64KB Bootloader codes are copied from the CE1 space (Flash) outside the DSP to a high-speed RAM of an internal address 0 by DSP hardware through a DMA (direct memory access) or EDMA (enhanced direct memory access) mode, and loading is executed from the internal address 0; the secondary recovery backup loading is to copy the original user program from a loading address to an operating address through Bootloader selection on the basis of primary loading.
On the software level, aiming at a multi-system storage redundancy design scheme realized by hardware, a guide system supporting four functions of operation upgrading, system error detection, selective starting and system loading is designed. The system supports multi-system starting and checking, can realize on-line upgrading of the system in the Flash, selects the updated system to start after upgrading is successful, and reserves the initial system in the PROM to ensure that the system can still normally start when the system in the Flash fails to start. The method has the characteristics of high reliability and high flexibility, and can well meet the high reliability requirement of the system.
Software reconfiguration specific steps
(1) The system is initialized so that a loader Bootloader can access Flash, PROM and SDRAM through EMIF;
(2) reading Flash to obtain a system copy table, judging whether the system is an empty table or an effective table by using the length of the copy table, and if the system is effective, performing system CRC (cyclic redundancy check);
(3) if the CRC of the system is successful, selecting 'APP 1 main program' for upgrading and loading, and the Bootloader starts to copy codes and data section by section according to the requirement of a copy table until meeting an end mark of the copy table;
(4) if the CRC of the system fails, the system starts an APP2 backup program, and Bootloader automatically selects an original system in the PROM to start;
(5) judging whether to continue the next upgrading loading according to design requirements;
(6) and jumping to a C language entry address, initializing a C language environment, and entering a MAIN function to execute a user code.
Examples
In order to verify the feasibility of the multi-domain multi-source common-scene reconstruction method, the 16-tone continuous signal demodulation algorithm is remotely updated and verified in a laboratory environment, the remote updating and verification is compared with a simulation result, the effectiveness of the method is verified, and the online reconstruction relation is shown in fig. 2.
And (3) reconstructing the 16-tone continuous signal demodulator, wherein software needs to complete software code collaborative compiling and debugging of three components, namely Timing-16 tone, Carrier-16 tone and SymTobit-16 tone. And modifying and adding software codes to be changed according to corresponding functional algorithm requirements, compiling and debugging, multiplexing corresponding software codes, synchronously loading software after the software codes are compiled and debugged again, and combining the software codes with the component framework codes to generate a new component. The simulated constellation diagrams of the sampling points of the 16-tone continuous signal after carrier synchronization and timing synchronization are shown in fig. 4 and 5.
Based on the multi-domain multi-source software reconstruction method, symbol mapping is annularly distributed in three amplitudes after timing synchronization through real-time monitoring of timing synchronization and carrier synchronization, as shown in fig. 6, symbol mapping is aggregated in 16 clusters after carrier synchronization, the shapes of symbols after 16-tone signal timing synchronization and carrier synchronization can be correctly reflected, and as shown in fig. 7, the correctness of the operation result of a component is represented.
This section simulates the proposed relay selection method. By using the shannon limit theorem, when the mutual information quantity between the relay node and the target node is smaller than the channel capacity, the system is interrupted. This experimental approach focuses on observing the impact of the disruption caused by the channel itself changes on the system communication performance. The influence of the network interruption rate on the algorithm is considered during the experiment, and the network interruption refers to any one of the twoAnd if the link is interrupted, the network is considered to be interrupted. Without special explanation, all channels in the simulation are independent and subject to Rayleigh fading, and the simulation parameters are set as follows: d is 6, R is 1(bps)/Hz,
Figure BDA0002874473700000131
let the signal-to-noise ratio (ρ) of the source increase from 8dB to 15dB in 1dB increments, and take an average value of 1000 times for each bit error rate calculation, and obtain the bit error rate of 16 tone signals as shown in table 1.
Table 116 tone signal demodulation bit error rate
Figure BDA0002874473700000132
Figure BDA0002874473700000141
Fig. 8 is a simulation comparison graph of network outage probability for minimum and ideal power allocation. It can be observed from the figure that as the SNR increases, the bit error rate decreases and the outage probability also decreases. As can be seen from table 1 and fig. 8, at the same SNR, the bit error rate of demodulation is smaller than the standard value under the theoretical condition; at the same bit error rate value, the degradation is about 1dB for a lower signal SNR and about 1.5dB for a higher signal SNR. However, when the bit error rate is lower than 0.001 (the signal-to-noise ratio is higher than about 10.5dB), the bit error rate is easily reduced to 0 by channel coding, and the performance degradation is negligible. The target node of the method only considers the power result of the relay node, and reduces the complexity of the receiver under the condition of similar interruption performance, thereby having better practical value.

Claims (6)

1. A multi-domain multi-source collaborative common scene software reconstruction implementation method is characterized by being implemented according to the following steps:
step 1, establishing a multi-domain multi-source wireless cooperative common scene model;
step 2, realizing the cooperation of nodes in the domain by adopting a broadcast optimal search selection method in the multi-domain multi-source wireless cooperation common scene model domain; inter-domain cooperation and power optimization are realized by adopting a depth-first search selection method between domains, and a multi-domain multi-source wireless cooperation scene sharing strategy is formed;
step 3, optimizing the common scene strategy obtained in the step 2 through a multisource wireless cooperative power minimum strategy;
step 4, the reconstructed code is sent to an optimized common-scenario policy management and control computer through a wireless communication link, the computer transplants the reconstructed code into a reconstruction program APP1 in a mode of 'reconstruction program APP1+ original program APP 2', and APP1 is mapped to an internal flash memory address; if the APP1 cannot normally operate, the system fuses the response and jumps to the original program APP2, and operates the original program APP2 to execute the basic task before the original upgrade.
2. The method for realizing multi-domain multi-source collaborative scene sharing software reconfiguration according to claim 1, wherein the specific process of step 1 is as follows:
different collaboration domains in the multi-domain multi-source wireless collaboration same-scene network system are defined as follows: s1,S2,…,SLL is the number of cooperative domains, and each cooperative domain has M nodes dl1,dl2,…,dlML is 1,2, …, L wherein S1And S2,S3,…,SLIs inter-domain friendship, at different S1,…,SLThe relationships of nodes in the domain are respectively parent-child relationships;
establishing reversible and equivalent channels among all the cooperative domains, wherein each channel is independent and obeys a Rayleigh fading model;
setting a source node d in each cooperation domainliChannel gain (d) between corresponding cooperating nodes in the domainli，dlj)(dli，dlj∈Sl,i≠j,j＝1,2,…,M-1)；
The system will be subjected to mean 0 and variance σ in cooperation0If per the interference of the additive white Gaussian noiseThe transmission power of each node is PjThen the signal-to-noise ratio is expressed as P ═ Pj/σ0。
3. The method for realizing multi-domain multi-source collaborative scene sharing software reconfiguration according to claim 1, wherein the specific process of step 2 is as follows:
when any one cooperative intra-domain source node and other cooperative intra-domain nodes in the multi-domain multi-source wireless cooperative scene sharing model cooperate to share a scene, intra-domain node cooperation and inter-domain node cooperation need to be considered respectively;
and (3) inter-domain node cooperation: dliAnd dlmBelongs to the same domain SlNode dliSending data request and dlmCollaboratively, an intra-domain broadcast optimal search selection method is adopted, namely, after receiving the message, the other M-1 source nodes in the domain decode d respectivelyliAll as relay nodes, the selected intra-domain optimal cooperative target node dlm；
Inter-domain node cooperation: constructing a node d calling the recursive function dfs (-) for marking and accessingiEstablishing an associated adjacency list function list (·); when the nodes do not belong to the same domain, selecting the node closest to inter-domain decoding as the optimal cooperative destination node d by adopting an inter-domain depth-first search selection methodlk；
And the intra-domain node cooperation and the inter-domain node cooperation form a multi-domain multi-source wireless cooperation scene sharing strategy.
4. The method for realizing multi-domain multi-source collaborative common-scene software reconfiguration according to claim 3, wherein the inter-domain node collaborative specific process is as follows:
node d1i∈S1Node d2i∈S2And region S2Node d of2iIs the source node d1iThe first node element of the adjacency list, i.e.
Figure FDA0002874473690000021
And has not been searched, using recursive call functionsdfs (-) to identify and access node d2iI.e. dfs (d)1i,d2i)＝d2iThe system connects node d1iAnd node d2iThe current position of the adjacency list is pressed into the stack;
node d1iAnd node d2iHas been searched, so that the recursion function dfs (-) skips the node; region S2Node d of2iSelecting region S by using intra-domain broadcast optimal search selection method2Inner d2iBest cooperative destination node d2n；
In the same way, in the region SlFind node d1iFirst node element d of adjacency listliI.e. by
Figure FDA0002874473690000031
dfs(d1i,dli)＝dliSelecting the region S by using the intra-domain broadcast optimal search selection methodlInner dliOptimal cooperative destination node dlk。
5. The method for realizing multi-domain multi-source collaborative scene sharing software reconfiguration according to claim 1, wherein the specific process of step 3 is as follows:
each source node communicates with each target node by adopting an orthogonal transmission mechanism, the relay nodes cooperate with each other according to an orthogonal channel principle, the same codebook is adopted for the source nodes which are cooperated when the relay nodes communicate, and the information efficiency between the source nodes and the target nodes is R;
minimum reliable transmission power distribution coefficient k of optimal cooperative destination nodeiDerived from the information efficiency R, i.e.:
Figure FDA0002874473690000032
Figure FDA0002874473690000033
wherein the content of the first and second substances,
Figure FDA0002874473690000034
for nodes within or between domains
Figure FDA0002874473690000035
Inter-channel gain;
assuming all relay nodes of each source node have undergone a full traversal, S within the domain1Source node d1iSelecting a relay node d1pIf the relay node can support the source node, the relay node is qualified to be an alternative relay node of the source node, otherwise, the relay node is not considered; repeating the steps until all the conditions in the domain are traversed; selecting a set of relay nodes in all relay node selection cases d1p,d1p+1,d1p+2，…，d1p+m}，(m＝1,2,…,D1-1) minimizing the number of cooperative link successes;
similarly, for different domains, an inter-domain depth-first search selection method is adopted to complete inter-domain node design, and an intra-domain method is adopted to calculate a cooperation domain SlThe middle relay node is expressed as: { dlp,dlp+1,dlp+2，…，dlp+m}，(m＝1,2,…,Dl-1)；
When a plurality of relay nodes exist in a domain, after the minimum reliable transmission power is allocated to the relay nodes, if the residual power cannot continuously support the source nodes needing the relay nodes to cooperate, the relay nodes are removed from the set of the source nodes;
let the total number of relay nodes be D, i.e. D ═ D1+D2…+DlPreferentially selecting the relay node number capable of minimizing D as the optimal relay node number, and randomly selecting one relay node number if a plurality of relay node numbers are minimized;
co-sharing by optimizing the coordination in the case of minimum DScene transmission information rate and distributed power PiThe allocation implements a co-scenario policy optimization.
6. The method as claimed in claim 1, wherein the method for implementing software reconfiguration of multi-domain multi-source collaborative sharing scene is characterized in that the information transmission rate R and the distributed power P of the optimized collaborative sharing sceneiThe distribution process is as follows:
the information rate R is transformed from the formula (1) to
Figure FDA0002874473690000041
The optimization function can be expressed as:
Figure FDA0002874473690000042
CN202011624144.6A 2020-12-30 2020-12-30 Multi-domain multi-source collaborative common-scene software reconstruction implementation method Active CN112799695B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011624144.6A CN112799695B (en) 2020-12-30 2020-12-30 Multi-domain multi-source collaborative common-scene software reconstruction implementation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011624144.6A CN112799695B (en) 2020-12-30 2020-12-30 Multi-domain multi-source collaborative common-scene software reconstruction implementation method

Publications (2)

Publication Number Publication Date
CN112799695A true CN112799695A (en) 2021-05-14
CN112799695B CN112799695B (en) 2022-05-17

Family

ID=75807535

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011624144.6A Active CN112799695B (en) 2020-12-30 2020-12-30 Multi-domain multi-source collaborative common-scene software reconstruction implementation method

Country Status (1)

Country Link
CN (1) CN112799695B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113382453A (en) * 2021-08-12 2021-09-10 北京小鸟科技股份有限公司 Cross-domain graph transmission method and system based on enhanced static routing calculation and source return

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090092073A1 (en) * 2007-10-09 2009-04-09 Nokia Corporation Cooperative relay system enabling simultaneous broadcast-unicast operation with efficient automatic repeat request functionality
CN105933224A (en) * 2016-04-15 2016-09-07 国网河北省电力公司 Opportunistic routing method for improving reliability of communication network
CN107040466A (en) * 2017-03-07 2017-08-11 西安电子科技大学 The routing resource of domain collaborative multi data transfer based on Internet of Things layer architecture
CN107942943A (en) * 2017-12-25 2018-04-20 北京信息科技大学 A kind of high-end numerical control equipment state identification method based on Multi-source Information Fusion
CN108989115A (en) * 2018-07-25 2018-12-11 湖北民族学院 Application method of the virtual beams co-interfere in heterogeneous wireless network safety of physical layer
CN110266435A (en) * 2019-06-25 2019-09-20 杭州电子科技大学 Fountain codes collaboration communication method under a kind of more relay scenes
CN110301143A (en) * 2016-12-30 2019-10-01 英特尔公司 Method and apparatus for radio communication
US20200169533A1 (en) * 2014-09-04 2020-05-28 Telefonaktiebolaget Lm Ericsson (Publ) Method and Apparatuses for Enabling Routing of Data Packets Between a Wireless Device and a Service Provider Based in the Local Service Cloud
CN111586614A (en) * 2020-05-11 2020-08-25 吉林大学 Method for optimizing cooperative network information and energy transmission by combining target node weight

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090092073A1 (en) * 2007-10-09 2009-04-09 Nokia Corporation Cooperative relay system enabling simultaneous broadcast-unicast operation with efficient automatic repeat request functionality
CN101821960A (en) * 2007-10-09 2010-09-01 诺基亚公司 Cooperative relay system enabling simultaneous broadcast-unicast operation with efficient automatic repeat request functionality
US20200169533A1 (en) * 2014-09-04 2020-05-28 Telefonaktiebolaget Lm Ericsson (Publ) Method and Apparatuses for Enabling Routing of Data Packets Between a Wireless Device and a Service Provider Based in the Local Service Cloud
CN105933224A (en) * 2016-04-15 2016-09-07 国网河北省电力公司 Opportunistic routing method for improving reliability of communication network
CN110301143A (en) * 2016-12-30 2019-10-01 英特尔公司 Method and apparatus for radio communication
CN107040466A (en) * 2017-03-07 2017-08-11 西安电子科技大学 The routing resource of domain collaborative multi data transfer based on Internet of Things layer architecture
CN107942943A (en) * 2017-12-25 2018-04-20 北京信息科技大学 A kind of high-end numerical control equipment state identification method based on Multi-source Information Fusion
CN108989115A (en) * 2018-07-25 2018-12-11 湖北民族学院 Application method of the virtual beams co-interfere in heterogeneous wireless network safety of physical layer
CN110266435A (en) * 2019-06-25 2019-09-20 杭州电子科技大学 Fountain codes collaboration communication method under a kind of more relay scenes
CN111586614A (en) * 2020-05-11 2020-08-25 吉林大学 Method for optimizing cooperative network information and energy transmission by combining target node weight

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
万抒; 余兴华; 吴中军: "一种基于分布式共识的多域安全策略智能生成机制研究", 《通信技术》 *
路遥，张晓，江汉红，吴优，许轶楠: "电磁发射系统以太网拓扑结构建模优化", 《国防科技大学学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113382453A (en) * 2021-08-12 2021-09-10 北京小鸟科技股份有限公司 Cross-domain graph transmission method and system based on enhanced static routing calculation and source return
CN113382453B (en) * 2021-08-12 2021-10-29 北京小鸟科技股份有限公司 Cross-domain graph transmission method and system based on enhanced static routing calculation and source return

Also Published As

Publication number Publication date
CN112799695B (en) 2022-05-17

Similar Documents

Publication Publication Date Title
CN110149382A (en) Data synchronous method, system, primary server, sync client and medium
CN105988926B (en) The treating method and apparatus of multi version test data
US20100125758A1 (en) Distributed system checker
CN103455381A (en) Method and system for de-serializing source object of source software into target software component
CN108366005A (en) The interlock method and device of electric room
US20100131859A1 (en) Systems and methods for managing a collaboration space having application hosting capabilities
CN112799695B (en) Multi-domain multi-source collaborative common-scene software reconstruction implementation method
CN112527647B (en) NS-3-based Raft consensus algorithm test system
CN114880159B (en) Data processing method, device, equipment and storage medium
Benedetto et al. MobiCOP: a scalable and reliable mobile code offloading solution
CN106295326A (en) A kind of inline hook method and system for obtaining video card content
CN107395456B (en) Distributed file system direct current storage test method and platform
CN113873040B (en) Block chain-based power Internet of things cross-domain service function chain arrangement method
CN105245579B (en) A kind of distribution network system mass data Communication processing method and system
CN106875184A (en) Abnormal scene analogy method, device and equipment
CN114430894A (en) Minimizing production interruptions by scanning rule engines
RU2373565C2 (en) Automatic generation of message exchange scheme modeling code
CN110673835A (en) Dynamic assembly type development system, method, computer and computer program
CN112804313B (en) Data synchronization method, device, equipment and medium based on cross-domain edge node
CN109739666A (en) Striding course call method, device, equipment and the storage medium of singleton method
CN115454333A (en) Docking method and device for cloud computing platform and storage system
CN115238006A (en) Retrieval data synchronization method, device, equipment and computer storage medium
US7925487B2 (en) Replaying distributed systems
CN110960858A (en) Game resource processing method, device, equipment and storage medium
CN104618421A (en) Method and device for distributing storage resources

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
GR01 Patent grant
GR01 Patent grant