CN110839166A - A data sharing method and device - Google Patents

Abstract

The application discloses a data sharing method and device, relates to the field of communication, and aims to solve the problem of unbalanced load of each MEC node in the same cooperation domain. The method comprises the following steps: obtaining the similarity between the cache content of each first MEC node in the N first MEC nodes and the cache content of the second MEC node, and obtaining the influence degree of each first MEC node; wherein the N first MEC nodes are adjacent to the second MEC node; determining a target MEC node from the N first MEC nodes according to the content similarity and influence degree; and dividing the second MEC node and the target MEC node into a target cooperation domain. The application is applied to the MEC network.

Description

A data sharing method and device

technical field

The present invention relates to the field of communications, and in particular, to a data sharing method and device.

Background technique

With the rapid development of mobile multimedia services such as high-definition video streaming, business traffic in the network has increased dramatically. In order to cope with the impact of massive data traffic on the mobile communication network, the way of caching the content required by the user to the MEC (mobile edge computing, mobile edge computing) node can reduce the access traffic of the mobile communication network.

In the related art, the shared content cached on each MEC node usually provides the cached content to users in the domain by adopting a cooperative domain.

However, due to the different popularity of cached content on the MEC nodes in the same cooperation domain, the difference in the access volume of each MEC node is too large, resulting in an unbalanced load of each MEC node.

SUMMARY OF THE INVENTION

Embodiments of the present application provide a data sharing method and apparatus to solve the problem of unbalanced load among MEC nodes in the same cooperation domain.

To achieve the above object, the embodiments of the present application adopt the following technical solutions:

In a first aspect, a data sharing method is provided, the method comprising: obtaining the similarity between the cached content of each first MEC node and the cached content of the second MEC node among the N first MEC nodes, and obtaining each of the first MEC nodes The influence degree of the node; wherein, the N first MEC nodes are adjacent to the second MEC node; according to the content similarity and the influence degree, the target MEC node is determined from the N first MEC nodes; the second MEC node and the The target MEC node is divided into the target cooperation domain.

In a second aspect, a data sharing device is provided, the device includes an acquisition unit, a determination unit, and an execution unit; the acquisition unit is configured to acquire the cache content of each of the first MEC nodes among the N first MEC nodes and the second MEC The similarity of the cached content of the node, and the influence degree of each first MEC node is obtained; wherein, N first MEC nodes are adjacent to the second MEC node; the determination unit is used for according to the content similarity and influence degree, from N In the first MEC node, the target MEC node is determined; the execution unit is configured to divide the second MEC node and the target MEC node into the target cooperation domain.

The data sharing method and device provided by the present application can reflect the content between each first MEC node and the second MEC node due to the similarity of content between each first MEC node and the second MEC node and the degree of influence of each first MEC node. The popularity gap can be used as an indicator of the access traffic load of MEC nodes. Therefore, in the embodiment of the present invention, the content similarity and influence degree between MEC nodes are used to allocate appropriate MEC nodes for cooperation domains, so that each MEC node in each cooperation domain is Load balancing as much as possible reduces network congestion of each MEC node and improves user experience.

Description of drawings

1 is a schematic diagram of a MEC network architecture provided by an embodiment of the present application;

2 is a schematic flowchart of a data sharing method provided by an embodiment of the present application;

FIG. 3 is a schematic diagram of the influence degree of a MEC node provided by an embodiment of the present application;

FIG. 4 is a schematic structural diagram of a data sharing apparatus according to an embodiment of the present application;

FIG. 5 is a schematic structural diagram of another data sharing apparatus provided by an embodiment of the present application;

FIG. 6 is a schematic structural diagram of another data sharing apparatus according to an embodiment of the present application.

Detailed ways

Hereinafter, some concepts involved in the embodiments of the present application will be briefly introduced, and the technical solutions in the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only Some embodiments of the present application, but not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

In the description of this application, unless otherwise stated, "/" means "or", for example, A/B can mean A or B. In this article, "and/or" is only an association relationship to describe the associated objects, which means that there can be three kinds of relationships, for example, A and/or B, which can mean that A exists alone, A and B exist at the same time, and B exists alone these three situations. Further, "at least one" means one or more, and "plurality" means two or more. The words "first" and "second" do not limit the quantity and execution order, and the words "first", "second" and the like do not limit certain differences.

The technical solutions provided in the embodiments of the present application can be applied to various communication systems, for example, an NR communication system using the fifth generation (5th generation, 5G) communication technology, a future evolution system, or a variety of communication fusion systems, and so on. The technical solutions provided in this application can be applied to various application scenarios, such as machine to machine (M2M), enhanced mobile broadband (eMBB), ultra-reliable and ultra-low-latency communication (ultra- reliable&low latency communication, uRLLC) and massive machine type communication (mMTC) and other scenarios.

In this embodiment of the present application, the access network device may be a base station or a base station controller for wireless communication. In this embodiment of the present application, the base station may be a global system for mobile communication (GSM), a base station (basetransceiver station, BTS) in code division multiple access (CDMA), a broadband code division Base station (node B), eNB in multiple access (wideband code division multiple access, WCDMA), eNB in Internet of things (Internet of things, IoT) or narrowband Internet of things (narrow band-internet of things, NB-IoT), A base station in a future 5G mobile communication network or a future evolved public land mobile network (public land mobile network, PLMN) is not limited in this embodiment of the present application.

Terminals are used to provide voice and/or data connectivity services to users. The terminal may have different names, such as user equipment (UE), access terminal, terminal unit, terminal station, mobile station, mobile station, remote station, remote terminal, mobile device, wireless communication device, vehicle user equipment, terminal agent or terminal device, etc. Optionally, the terminal may be various handheld devices, vehicle-mounted devices, wearable devices, and computers with communication functions, which are not limited in this embodiment of the present application. For example, the handheld device may be a smartphone. The in-vehicle device may be an in-vehicle navigation system. The wearable device can be a smart bracelet. The computer may be a personal digital assistant (PDA) computer, a tablet computer, and a laptop computer.

In order to cope with the impact of massive data traffic on the mobile communication network, the way of caching the content required by the user to the MEC node can reduce the access traffic of the mobile communication network.

FIG. 1 provides a schematic diagram of a MEC network architecture. As shown in FIG. 1 , the MEC network architecture includes: a remote server R, a cooperative domain A, a cooperative domain B, a base station C, and a user terminal U1 and a user terminal U2. The cooperation domain A includes: MEC node a1 , MEC node a2 , MEC node a3 and MEC node a4 . The cooperation domain B includes: MEC node b1 , MEC node b2 , MEC node b3 and MEC node b4 .

Exemplarily, when the user terminal U1 or the user terminal U2 initiates a video access request, the base station C sends the video access request to the MEC node b3 in the cooperative domain B. If there is no video resource requested by the user terminal U1 in the buffer of the MEC node b3 at this time, the MEC node b3 will cooperate with other adjacent MEC nodes in the domain B (such as the MEC node b1, MEC node b2 and The MEC node b4) requests the video resource, and if the video resource is buffered in the buffers of other adjacent MEC nodes in the cooperation domain B, the video resource is sent to the user terminal U1 through the MEC node b3.

If the video resource is not in the buffer area of other adjacent MEC nodes in the cooperative domain B, the video resource is requested from the cooperative domain A. If there is no video resource requested by the user terminal U1 in the buffer areas of the MEC nodes in the cooperative domain A, the video resource is requested from the remote central server R.

In the related art, the division of the MEC cooperation domain only considers dividing multiple adjacent MEC nodes into the same cooperation domain. However, as can be seen from the above process, when the user terminal requests video resources, there may be no video resources required by the user terminal in the buffers of the MEC nodes in the cooperative domain, resulting in requests for the video from nodes with more hops in the network. resources, resulting in high latency for users to watch videos and affecting user experience.

At the same time, if the popularity of the content cached in the cache area of some MEC nodes in the cooperation domain is relatively high, the traffic will be too concentrated to the MEC node, causing network congestion and also affecting user experience.

In order to solve this problem, the present application provides a data sharing method and device, which allocates appropriate MEC nodes to cooperation domains through content similarity and influence between MEC nodes, so that each MEC node in each cooperation domain can load as much as possible. Balanced, reducing network congestion of each MEC node and improving user experience.

The technical solutions provided by the present application will be introduced below with reference to the accompanying drawings.

Example 1:

This embodiment provides a data sharing method. As shown in FIG. 2 , the data sharing method includes the following steps:

S101. Obtain the similarity between the cached content of each first MEC node and the cached content of the second MEC node among the N first MEC nodes, and obtain the influence degree of each first MEC node.

Wherein, the N first MEC nodes are adjacent to the second MEC nodes.

Exemplarily, the foregoing second MEC node may be any MEC node in the MEC network in FIG. 1 , which is not limited in this embodiment of the present invention.

In an implementation manner, before step S101 is performed, the method further includes:

S101a: Acquire connection parameters between each MEC node and the second MEC node among M adjacent MEC nodes adjacent to the second MEC node.

Among them, the connection parameter is used to indicate the degree of difficulty of connection between two MEC nodes.

S101b. Determine N first MEC nodes from among the M adjacent MEC nodes according to the connection parameters.

Exemplarily, the relationship between N and M may be N=[M/2].

Exemplarily, the second MEC node is any MEC node in the network, and based on the second MEC node, M adjacent MEC nodes adjacent to the second MEC node are selected as candidate nodes. According to the degree of difficulty of connection between the M adjacent MEC nodes and the second MEC node, from the M adjacent MEC nodes, N MEC nodes with high connection parameters may be selected as the first MEC nodes.

Exemplarily, if the connection distance between any adjacent MEC node and the second MEC node is less than or equal to the connection distance between the second MEC node and the server (such as the remote server R in FIG. The MEC node and the second MEC node are divided into a cooperative domain, that is, any adjacent MEC node is not selected as the first MEC node.

It should be noted that the above connection parameters reflect the degree of difficulty of connection between two MEC nodes. In order to reduce the user's access delay, the MEC node that is easier to connect can be selected as a candidate node. The degree of difficulty between two MEC nodes is related to the number of hops between the two MEC nodes. Therefore, in this embodiment of the present invention, the degree of difficulty of connection can be determined by acquiring the number of hops between two MEC nodes. .

In an implementation manner, the above step S101a may include the following steps:

S11. Acquire the connection parameters between each MEC node and the second MEC node among the M adjacent MEC nodes according to formula 1.

Wherein, in the above formula, C _i represents the connection parameter between the second MEC node and the ith adjacent MEC node among the M adjacent MEC nodes; the above d _ij represents the number of hops from the second MEC node to the jth network node , the jth network node is the network node on the link between the second MEC node and the ith MEC node; the above K represents the total number of network nodes on the link between the second MEC node and the ith node.

It should be noted that if the similarity of the cached content of adjacent MEC nodes is high, it may cause a waste of the cache space of the MEC nodes, and it will also make it difficult for users to obtain video resources from the MEC nodes adjacent to the main serving MEC node. , resulting in the need to obtain video resources from MEC nodes with higher hops, which increases user waiting time. Therefore, the similarity of cached content on each MEC node in the same cooperation domain is lower than the preset value.

In an implementation manner, the similarity of cached content of two MEC nodes may be determined according to the content popularity vector X(x ₁ , x ₂ , x ₃ , . . . , x _n ) cached by the MEC nodes.

Exemplarily, in the above step S101, the process of obtaining the similarity between the cached content of each first MEC node in the N first MEC nodes and the cached content of the second MEC node may specifically include the following step S12:

S12, using formula 2 to obtain the similarity between the cached content of each first MEC node and the cached content of the second MEC node among the N first MEC nodes:

Among them, in the above formula, S _ab represents the similarity of the contents of the two MEC nodes, x _1k represents the kth value in the feature vector of the cache content of the MEC node a; x _2k represents the th value in the feature vector of the cache content of the MEC node b. k values; n is the total number of parameters of the cache content feature vector.

Exemplarily, the MEC node a is the second MEC node, and the MEC node b is any one of the N first MEC nodes. Alternatively, the MEC node a is any one of the N first MEC nodes, and the MEC node b is the second MEC node.

In order to balance the load of each MEC node in the cooperation domain, it is also necessary to calculate the influence degree of each first MEC node.

It should be noted that, if the MEC node is adjacent to an MEC node with a high degree of influence, the MEC node will obtain a higher degree of influence through the adjacent MEC node. The degree of influence is mainly related to the number of child nodes of the MEC node.

Exemplarily, as shown in FIG. 3 , nodes D2, D3, and D4 are child nodes of node D1, nodes D5 and D5 are child nodes of node D2, node D7 is a child node of node D3, and nodes D8, D9, and D10 are child nodes of node D3. Child node of node D4. The influence degree of the above node D1 is 3, the influence degree of node D2 is 2, the influence degree of node D3 is 1, the influence degree of node D4 is 3, the influence degree of nodes D5, D6, D7, D8, D9, D10 is 0 .

In an implementation manner, the process of obtaining the influence degree of each first MEC node among the N first MEC nodes in the above step S101 specifically includes the following step S13:

S13: Use formula 3 to obtain the influence degree of each first MEC node:

Among them, in the above formula, I _i represents the influence degree of the ith first MEC node among the N first MEC nodes, β _ij represents the ith row jth element in the degree matrix of the ith MEC node, and ε represents the ith row and jth element in the degree matrix of the ith MEC node. The eigenvalues of the degree matrix of i MEC nodes, e _j represents the jth parameter in the eigenvector corresponding to the eigenvalue ε of the degree matrix of the ith MEC node; n represents the total number of parameters of the eigenvector; the degree matrix is used for Indicates the influence degree of the i-th MEC node.

S102: Determine a target MEC node from the N first MEC nodes according to the above content similarity and influence.

Exemplarily, from the N first MEC nodes, a first MEC node whose content similarity is lower than or equal to the first preset value and whose influence degree is higher than or equal to the second preset value can be selected as the target MEC. node. That is, the content similarity of the above-mentioned target MEC node is less than or equal to the first preset value, and the influence degree is greater than or equal to the second preset value.

S103: Divide the second MEC node and the target MEC node into a target cooperation domain.

It should be noted that, with the constant change of the cached content in the MEC nodes, the content similarity between the MEC nodes is getting higher and higher. Therefore, the above cooperation domain division method is a dynamic process.

Exemplarily, at every threshold time interval, the cooperation domain is divided according to the above method.

In the data sharing method provided by the embodiments of the present application, the target is determined according to the similarity of content and the degree of influence by acquiring the similarity of content of each first MEC node and the second MEC node, and the degree of influence of each first MEC node. The method of dividing the target MEC node and the second MEC node into the target cooperation domain, so as to solve the technical problem of unbalanced load of each MEC node in each cooperative domain. The network congestion of each MEC node is reduced, and the user experience is improved.

Embodiment 2:

This embodiment provides a data sharing apparatus, as shown in FIG. 4 , including: an acquisition unit 201 , a determination unit 202 , and an execution unit 203 .

The obtaining unit 201 is configured to obtain the similarity between the cache content of each first MEC node and the cache content of the second MEC node among the N first MEC nodes, and obtain the influence degree of each first MEC node.

Wherein, the N first MEC nodes are adjacent to the second MEC node.

The determining unit 202 is configured to determine a target MEC node from the N first MEC nodes according to the content similarity and the influence degree acquired by the acquiring unit 201 .

The executing unit 203 is configured to divide the second MEC node and the target MEC node determined by the determining unit 202 into a target cooperation domain.

Optionally, the obtaining unit 201 is further configured to obtain connection parameters between each MEC node and the second MEC node among M adjacent MEC nodes adjacent to the second MEC node.

The connection parameter is used to indicate the degree of difficulty of connection between two MEC nodes.

Optionally, the determining unit 202 is further configured to determine the above-mentioned N first MEC nodes from the M adjacent MEC nodes according to the connection parameters obtained by the obtaining unit 201 .

Optionally, the obtaining unit 201 is specifically configured to calculate the connection parameters between each MEC node and the second MEC node in the M adjacent MEC nodes by using formula 1:

Wherein, in the above formula, C _i represents the connection parameter between the second MEC node and the ith adjacent MEC node among the M adjacent MEC nodes; d _ij represents the number of hops from the second MEC node to the jth network node, The jth network node is the network node on the link between the second MEC node and the ith MEC node; K represents the total number of network nodes on the link between the second MEC node and the ith node.

Optionally, the obtaining unit 201 is specifically configured to obtain the similarity between the cache content of each first MEC node in the N first MEC nodes and the cache content of the second MEC node by using formula 2:

Among them, in the above formula, S _ab represents the similarity of the contents of the two MEC nodes, x _1k represents the kth value in the feature vector of the cache content of the MEC node a; x _2k represents the th value in the feature vector of the cache content of the MEC node b. k values; n is the total number of parameters of the cache content feature vector.

Exemplarily, the MEC node a is the second MEC node, and the MEC node b is any one of the N first MEC nodes. Alternatively, the MEC node a is any one of the N first MEC nodes, and the MEC node b is the second MEC node.

The obtaining unit 201 is specifically configured to obtain the influence degree of each first MEC node by using formula 3;

Wherein, I _i in the above formula represents the influence degree of the i-th first MEC node among the N first MEC nodes, β _ij represents the i-th row j-th element in the degree matrix of the i-th MEC node, ε represents the eigenvalue of the degree matrix of the ith MEC node, e _j represents the jth parameter in the eigenvector corresponding to the degree matrix of the ith MEC node and the eigenvalue ε; n represents the parameter of the eigenvector The total number; the degree matrix represents the influence degree of the i-th MEC node.

Regarding the apparatus in the above-mentioned embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be described in detail here.

In this embodiment of the present application, the data sharing apparatus may be divided into functional modules or functional units according to the foregoing method examples. For example, each functional module or functional unit may be divided corresponding to each function, or two or more functions may be integrated into one in the processing module. The above-mentioned integrated modules can be implemented in the form of hardware, and can also be implemented in the form of software function modules or functional units. Wherein, the division of modules or units in the embodiments of the present application is schematic, and is only a logical function division, and there may be other division manners in actual implementation.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.

In the case of using an integrated unit, FIG. 5 shows a possible structural schematic diagram of the above-mentioned data sharing apparatus. The control device 50 includes: a storage unit 501 , a processing unit 502 and an interface unit 503 . The processing unit 502 is used to control and manage the operation of the control device 50 . The storage unit 501 is used to control program codes and data of the device. The interface unit 503 is used to connect with other external devices to receive input contents.

The processing unit is the processor, the storage unit is the memory, and the interface unit is the transceiver as an example. The data sharing apparatus may refer to the apparatus 60 shown in FIG. 6 , including a transceiver 603 , a processor 602 , a memory 601 and a bus 604 .

The processor 602 may be a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), or one or more processors for controlling the execution of the programs of the present application. integrated circuit.

The memory 601 may be a read-only memory (Read-Only Memory, ROM) or other types of static storage devices that can store static information and instructions, a random access memory (Random Access Memory, RAM) or other types that can store information and instructions. The dynamic storage device can also be an Electrically Erasable Programmable Read-only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM), or other optical disk storage, optical disk storage ( including compact discs, laser discs, compact discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or capable of carrying or storing desired program code in the form of instructions or data structures and capable of being stored by a computer any other medium taken, but not limited to this. The memory can exist independently and be connected to the processor through a bus. The memory can also be integrated with the processor.

Wherein, the memory 601 is used for storing the application program code for executing the solution of the present application, and the execution is controlled by the processor 602 . The transceiver 603 is configured to receive content input by an external device, and the processor 602 is configured to execute the application code stored in the memory 601, thereby implementing the data sharing method in this embodiment of the present application.

It should be understood that, in various embodiments of the present invention, the size of the sequence numbers of the above-mentioned processes does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, rather than the embodiments of the present invention. implementation constitutes any limitation.

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of the present invention.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, all or part of the processes or functions described in the embodiments of the present application are generated. The computer may be a general purpose computer, special purpose computer, computer network, or other programmable device. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be downloaded from a website site, computer, server, or data center The transmission is carried out to another website site, computer, server or data center by wire (eg coaxial cable, optical fiber, Digital Subscriber Line, DSL) or wireless (eg infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or data storage devices including one or more servers, data centers, etc. that can be integrated with the medium. The usable media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, DVD), or semiconductor media (eg, Solid State Disk (SSD)), and the like.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited to this. should be covered within the scope of protection of this application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims (10)

1. a data sharing method, is characterized in that, comprises: Obtain the similarity between the cache content of each first MEC node and the cache content of the second MEC node among the N first MEC nodes, and obtain the influence degree of each first MEC node; wherein, the N first MEC nodes The node is adjacent to the second MEC node; N is a positive integer; According to the similarity of the cached content and the degree of influence, from the N first MEC nodes, determine the target MEC node; Divide the second MEC node and the target MEC node into a target cooperation domain. 2. data sharing method according to claim 1, is characterized in that, described obtaining the similarity of the cached content of each first MEC node and the cached content of the second MEC node in N first MEC nodes, and obtain all the similarity. Before describing the influence degree of each first MEC node, the method further includes: Obtain the connection parameters between each adjacent MEC node and the second MEC node among the M adjacent MEC nodes of the second MEC node; the connection parameter is used to indicate the degree of difficulty of connection between the two MEC nodes ; M is a positive integer; According to the connection parameter, the N first MEC nodes are determined from the M adjacent MEC nodes. 3. The data sharing method according to claim 2, wherein in the acquisition of M adjacent MEC nodes adjacent to the second MEC node, the relationship between each MEC node and the second MEC node is Connection parameters, including: Use formula 1 to obtain the connection parameters between each MEC node and the second MEC node in the M adjacent MEC nodes;

Wherein, C _i represents the connection parameter between the second MEC node and the ith MEC node among the M adjacent MEC nodes; d _ij represents the number of hops from the second MEC node to the jth network node, The jth network node is a network node on the link between the second MEC node and the ith MEC node; K represents the connection between the second MEC node and the ith MEC node. The total number of network nodes on the link. 4. data sharing method according to claim 1, is characterized in that, described obtaining the similarity of the cache content of each first MEC node and the cache content of the second MEC node in N first MEC nodes, specifically comprises: Use formula 2 to obtain the similarity between the cached content of each of the N first MEC nodes and the cached content of the second MEC node:

Among them, S _ab represents the similarity of the contents of two MEC nodes, x _1k represents the k-th value in the feature vector of the cache content of MEC node a; x _2k represents the k-th value in the feature vector of the cache content of MEC node b ; n is the total number of parameters of the cache content feature vector; The MEC node a is the second MEC node, and the MEC node b is any one of the N first MEC nodes; Alternatively, the MEC node a is any one of the N first MEC nodes, and the MEC node b is the second MEC node. 5. The data sharing method according to claim 1, wherein the acquiring the influence degree of each first MEC node specifically comprises: Use formula 3 to obtain the influence degree of each first MEC node;

Wherein, I _i represents the influence degree of the i-th first MEC node among the N first MEC nodes, β _ij represents the i-th row j-th element in the degree matrix of the i-th MEC node, and ε represents the ith-th MEC node The eigenvalues of the degree matrix of each MEC node, e _j represents the jth parameter in the eigenvector corresponding to the eigenvalue ε of the ith MEC node; n represents the total number of parameters of the eigenvector; the degree matrix represents all the The influence degree of the i-th MEC node. 6. A data sharing device, characterized in that the device comprises an acquisition unit, a determination unit and an execution unit; The obtaining unit is used to obtain the similarity between the cache content of each first MEC node and the cache content of the second MEC node in the N first MEC nodes, and obtain the influence degree of each first MEC node; wherein, the N first MEC nodes are adjacent to the second MEC node; The determining unit is configured to determine a target MEC node from the N first MEC nodes according to the content similarity and the influence degree obtained by the obtaining unit; The executing unit is configured to divide the second MEC node and the target MEC node determined by the determining unit into a target cooperation domain. 7. The data sharing device according to claim 6, wherein, The obtaining unit is further configured to obtain the connection parameters between each MEC node and the second MEC node among the M adjacent MEC nodes adjacent to the second MEC node; the connection parameters are used to indicate two MEC nodes. The difficulty of connecting between MEC nodes; The determining unit is further configured to determine the N first MEC nodes from the M adjacent MEC nodes according to the connection parameters obtained by the obtaining unit. 8. The data sharing device according to claim 7, wherein the obtaining unit is specifically configured to obtain the data between each MEC node and the second MEC node in the M adjacent MEC nodes by using formula one. connection parameters;

Wherein, C _i represents the connection parameter between the second MEC node and the ith MEC node among the M adjacent MEC nodes; d _ij represents the number of hops from the second MEC node to the jth network node, The jth network node is a network node on the link between the second MEC node and the ith MEC node; K represents the connection between the second MEC node and the ith MEC node. The total number of network nodes on the link. 9. The data sharing device according to claim 6, wherein the obtaining unit is specifically configured to obtain the cache content of each of the first MEC nodes in the N first MEC nodes and the The similarity of cached content of two MEC nodes:

Among them, S _ab represents the similarity of the contents of two MEC nodes, x _1k represents the k-th value in the feature vector of the cache content of MEC node a; x _2k represents the k-th value in the feature vector of the cache content of MEC node b ; n is the total number of parameters of the cache content feature vector; The MEC node a is the second MEC node, and the MEC node b is any one of the N first MEC nodes; Alternatively, the MEC node a is any one of the N first MEC nodes, and the MEC node b is the second MEC node. 10. The data sharing device according to claim 6, wherein the obtaining unit is specifically configured to obtain the influence degree of each first MEC node by using Formula 3;

Wherein, I _i represents the influence degree of the i-th first MEC node among the N first MEC nodes, β _ij represents the i-th row j-th element in the degree matrix of the i-th MEC node, and ε represents the ith-th MEC node The eigenvalues of the degree matrix of each MEC node, e _j represents the jth parameter in the eigenvector corresponding to the degree matrix of the ith MEC node and the eigenvalue; n represents the total number of parameters of the eigenvector; the The degree matrix represents the degree of influence of the i-th MEC node.

Images