CN108566635A - A D2D routing selection method - Google Patents

Abstract

The embodiment of the invention provides a D2D routing method, which comprises the following steps: if the current forwarding node and the target node belong to the same community, selecting a next forwarding node from the candidate next node group according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, and taking the next forwarding node as the last forwarding node of the forwarding node sequence; the last forwarding node is used as the current forwarding node to execute the steps until the last forwarding node can communicate with the target node; and setting a communication path from the source node to the target node based on the forwarding node sequence. In the embodiment of the invention, the routing of the D2D is selected based on the centrality, the similarity and the content preference value of the node, so that the problem that a D2D transmission link is difficult to maintain stable due to the autonomous mobility of a user and the time-varying social relationship is solved, and the reliability of the D2D transmission link is improved.

Description

A D2D routing selection method

technology neighborhood

Embodiments of the present invention relate to the technical neighborhood of mobile communication, and in particular to a D2D routing selection method.

Background technique

With the rapid popularization of smart terminals and the explosive growth of network communication capacity, the evolution requirements of 5G-oriented wireless communication technologies are becoming increasingly clear and urgent. In the evolution of 5G-oriented wireless communication technology, on the one hand, traditional wireless communication performance indicators, such as network capacity and spectrum efficiency, need to be continuously improved to further improve wireless spectrum utilization; The improvement of terminal user experience and the expansion of cellular communication applications brought about by this are also evolution directions that need to be considered.

As a key candidate technology for 5G, device-to-device communication (Device-to-Device, D2D) technology, that is, terminal direct technology, does not need to pass through the base station, supports direct short-distance communication between devices, and uses D2D technology and terminal buffering technology Caching mobile data traffic in smart device terminals can reduce base station load and transmission delay to a certain extent. It has the potential to improve system performance, improve user experience, and expand cellular communication applications, and has attracted widespread attention.

Because the carriers of mobile devices in cellular networks are often individuals with social attributes, mobile computing and social networks inevitably cross-link, and the concept of mobile social networks emerges as the times require. Benefiting from the development of wireless communication technology and smart terminals, users in mobile social networks can share resources with other users anytime and anywhere. The mobile social network is actually a heterogeneous network composed of wireless smart terminals and users, and realizes the transmission of D2D cached data between devices through the movement of people.

However, due to the autonomous mobility of users and the time-varying social relationship between users, it is difficult for terminal devices to maintain a stable end-to-end D2D transmission link. Therefore, how to realize stable and reliable delivery of D2D cache data poses a new challenge to mobile communication technology.

Contents of the invention

An embodiment of the present invention provides a D2D routing method to solve the problem that it is difficult for a terminal device to maintain a stable end-to-end D2D transmission link due to autonomous mobility of users and time-varying social relations between users.

On the one hand, an embodiment of the present invention provides a D2D routing method, including:

If the current forwarding node and the target node belong to the same community, according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, select the next node group from the candidate next node group A forwarding node, and adding the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence; wherein, the first forwarding node of the forwarding node sequence is a source node;

Using the last forwarding node as the current forwarding node to perform the above steps until the last forwarding node can communicate with the target node;

A communication path between the source node and the target node is set based on the forwarding node sequence.

On the other hand, an embodiment of the present invention provides a D2D routing device, including:

The first forwarding node acquisition unit is used to obtain the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, from the current forwarding node if the current forwarding node and the target node belong to the same community Select the next forwarding node from the candidate next node group, and add the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence; wherein, the first forwarding node of the forwarding node sequence is the source node;

a judging unit, configured to judge whether the last forwarding node can communicate with the target node;

An execution unit, configured to set a communication path between the source node and the target node based on the forwarding node sequence.

In yet another aspect, an embodiment of the present invention provides a D2D routing device, including a processor, a communication interface, a memory, and a bus, wherein the processor, the communication interface, and the memory complete communication with each other through the bus, and the processor can call the logic instructions to execute the aforementioned D2D routing method.

In yet another aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the aforementioned D2D routing method is implemented.

A D2D route selection method provided by the embodiment of the present invention selects a D2D route based on node centrality, similarity and content preference value, and performs route forwarding through several forwarding nodes, which solves the problem caused by the autonomous mobility of users. The D2D transmission link is difficult to maintain stability due to the time-varying nature of social relations, which improves the reliability of the D2D transmission link.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description These are some embodiments of the present invention. For those skilled in the art, other drawings can also be obtained based on these drawings without creative effort.

FIG. 1 is a schematic flowchart of a D2D route selection method according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of a same-community D2D routing mechanism according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of a cross-community D2D routing mechanism according to an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a D2D routing selection device according to an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a D2D routing selection device according to an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Benefiting from the development of wireless communication technology and smart terminals, users in mobile social networks can share resources with other users anytime and anywhere. Mobile social network is actually a heterogeneous network composed of wireless smart terminals and users. In mobile social networks, the autonomous mobility of users and the time-varying nature of social relationships between users make it difficult for terminal devices to maintain a stable, end-to-end D2D transmission link, so the delivery of D2D cache data requires one or more forwarding nodes for routing Forward. Therefore, the embodiment of the present invention proposes a D2D routing method to solve the problem in the prior art that it is difficult for terminal devices to maintain a stable, end-to-end D2D route due to the autonomous mobility of users and the time-varying nature of social relationships between users. Transmission link problem.

FIG. 1 is a schematic flowchart of a D2D routing selection method according to an embodiment of the present invention. As shown in FIG. 1 , a D2D routing selection method includes:

101. If the current forwarding node and the target node belong to the same community, according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, select from the candidate next node group Selecting the next forwarding node, and adding the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence.

Specifically, the candidate next node group corresponding to the current forwarding node is composed of several candidate nodes, wherein each candidate node belongs to the community where the target node is located, and each candidate node has the ability to transmit the target data required by the target node. ability. In addition, each candidate node can directly communicate with the current forwarding node, that is, the distance between each candidate node and the current forwarding node is less than or equal to the maximum transmission distance between nodes.

In addition, centrality refers to the average number of times a node transmits data with other nodes within a certain period of time. The centrality C _i of node i is as follows:

Among them, nodes i, j∈V _c , V _c is the node set of community c. N _c is the total number of nodes in community c. If nodes i and j perform D2D data transmission within the time period T, then U _ij =1, otherwise, U _ij =0. P _ij is the number of D2D data transmissions performed by nodes i and j within the time period T.

Similarity refers to the similarity between a node and a target node. Suppose any node is node i, the target node is node des, the set of neighbor nodes of node i in time T is φ _i , the set of neighbor nodes of node des in time T is φ _des , the similarity between node i and node des Degree _Sides are as follows:

S _ides ＝ |φ _ides |

Wherein, φ _ides = φ _i ∩ φ _des . Here, the set of neighbor nodes of a node refers to the set of all nodes whose distances to the node are all less than or equal to the maximum transmission distance between nodes.

Assuming that the node i’s preference for the target data f in the tth period will remain for θ periods, then define the content preference value of the node i for the target data f in the tth period of the d day for:

Among them, FAT _i ^dt (f) is the average communication time between node i and the node interested in the target data f in the tth time period of the d day.

102. Using the last forwarding node in the forwarding node sequence as the current forwarding node, perform step 101 until the last forwarding node in the forwarding node sequence can communicate with the target node.

Specifically, the condition that the forwarding node can communicate with the target node is that the distance between the forwarding node and the target node is less than or equal to the maximum transmission distance between nodes.

It can be known from step 102 that steps 101 and 102 are recursive processes, obtaining the next forwarding node according to the current forwarding node, and then obtaining the next forwarding node according to the next forwarding node, until the latest obtained forwarding node can communicate with the target node.

103. Set a communication path between the source node and the target node based on the forwarding node sequence.

Several forwarding nodes are arranged sequentially in the forwarding node sequence, starting from the first forwarding node, that is, the source node, the target data cached by the source node is transmitted sequentially according to the order of each forwarding node in the forwarding node sequence, and finally sent to target node.

For example, FIG. 2 is a schematic diagram of a same-community D2D routing mechanism according to an embodiment of the present invention. As shown in FIG. 2 , the source node S1 and the target node D1 both belong to community 1, and each of the candidate next node groups corresponding to the source node S1 For the centrality, similarity and content preference values of a candidate node, the forwarding node A1 is selected, and the distance between A1 and D1 is greater than the maximum transmission distance between nodes. Then, based on the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the forwarding node A1, the forwarding node A2 is selected, and the distance between A2 and D1 is smaller than the maximum transmission distance between nodes. Based on the above selection of forwarding nodes, the source node S1 transmits the target data to the target node D1 through A1 and A2.

In the embodiment of the present invention, the D2D route is selected based on the centrality, similarity and content preference value of the node, and the routing is forwarded through several forwarding nodes, which solves the problem caused by the autonomous mobility of the user and the time-varying nature of social relations. The D2D transmission link is difficult to maintain stability, which improves the reliability of the D2D transmission link.

Based on the above embodiments, a D2D routing method, if the current forwarding node and the target node belong to the same community, according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, Selecting the next forwarding node from the candidate next node group, and adding the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence, also includes: according to each candidate target The priority weight of the node, select the target node.

Specifically, a candidate target node refers to a node that needs to accept corresponding target data. If there are multiple candidate target nodes at the same time, first obtain the preferred weight of each candidate target node, and then select the candidate target node with the highest preferred weight as the target node, and perform D2D routing selection for the target node.

Among them, the priority weight refers to the sum of the number of times a node communicates with all nodes in the community where the node is located in the previous time period of the current time. If the node communicates more times in the previous time period, it indicates that the node is more involved, so correspondingly, a higher priority is given to the node at the current time. For example, the priority weight of node i in time period t as follows:

In the formula, V is the community set. If nodes i and j perform D2D single-hop buffer data transmission within time period t, then otherwise, If node i performs D2D multi-hop buffer data transmission with node j as a source node within time period t, then otherwise,

In the embodiment of the present invention, according to the priority weight, the node with high participation is provided with the condition of preferentially executing D2D routing, which helps to improve the user experience of the social network.

Based on any of the above embodiments, a D2D routing selection method, if the current forwarding node and the target node belong to the same community, according to the centrality, similarity and The content preference value is to select the next forwarding node from the candidate next node group, and add the next forwarding node to the forwarding node sequence as the last forwarding node of the forwarding node sequence, further comprising:

1011. If the current forwarding node and the target node belong to the same community, obtain the centrality of each candidate node in the candidate next node group corresponding to the current forwarding node, and select a first preset number of The candidate nodes with the greatest centrality form the first node group;

1012. Obtain the similarity of each candidate node in the first node group, and select a second preset number of candidate nodes with the highest similarity from the first node group to form a second node group;

1013. Obtain the content preference value of each candidate node in the second node group, select the candidate node with the largest content preference value in the second node group as the next forwarding node, and add the next forwarding node to In the forwarding node sequence, it is used as the last forwarding node of the forwarding node sequence.

Here, the first preset number and the second preset number can be set according to the size of the candidate next node group and the size of the first node group respectively.

Based on any of the above embodiments, a D2D routing selection method further includes: if the current forwarding node and the target node belong to different communities, selecting the candidate node with the largest turning radius from the candidate next node group corresponding to the current forwarding node as the next A forwarding node is provided, and the next forwarding node is added to the forwarding node sequence as the last forwarding node of the forwarding node sequence.

Specifically, in cross-community routing selection, forwarding nodes are selected based on the radius of gyration of candidate nodes. The radius of gyration is the prediction of the node's position change range based on the observed node's position track information within T time. The radius of gyration R _i of node i is as follows:

In the formula, P _i (τ) is the position information of node i at time τ. By integrating and analyzing the position information and changes of node i within T time, the moving center of gravity P _center (i) of node i within T time is obtained as follows :

For example, FIG. 3 is a schematic diagram of a cross-community D2D routing mechanism according to an embodiment of the present invention. As shown in FIG. 3 , source node S2 belongs to community 2, destination node D2 belongs to community 1, and the candidate next node group corresponding to source node S2 The candidate node B1 with the largest radius of gyration is selected as the forwarding node, and the distance between B1 and D2 is greater than the maximum transmission distance between nodes. Next, select the candidate node B2 with the largest turning radius from the candidate next node group corresponding to the forwarding node B2 as the forwarding node, and the distance between B2 and D2 is smaller than the maximum transmission distance between nodes. Based on the above selection of forwarding nodes, the source node S2 transmits the target data to the target node D2 through B1 and B2.

In the embodiment of the present invention, the cross-community D2D route is selected based on the radius of gyration of the nodes, and the routing is forwarded through several forwarding nodes, which solves the problem of D2D transmission links caused by the autonomous mobility of users and the time-varying nature of social relationships. It is difficult to maintain stability, which improves the reliability of the D2D transmission link.

Based on any one of the above embodiments, a D2D routing selection method further includes: performing community division on the social network based on a preset distance threshold and node threshold. It further includes: for any node in any community, obtaining the neighborhood of any node based on a preset distance threshold; if the number of nodes in the neighborhood of any node is not less than the preset node threshold, Add the neighborhood of any node to any community.

Here, the preset distance threshold is used to limit the range of the node neighborhood, that is, for the neighborhood of any node, the distance from each node in the neighborhood to the node cannot exceed the preset distance threshold.

The steps for community division are as follows:

First, initialize the distance threshold ε and node threshold MinPts. For any node i∈V, its ε neighborhood contains a set of nodes whose social distance is not greater than ε, namely

Then, for any node i∈V, if the number of neighbor nodes of node i then will Join the community V _c .

For any node k∈V _c and k∈V, if the number of neighbor nodes of node k then will Join the community V _c .

Based on any of the above method embodiments, FIG. 4 is a schematic structural diagram of a D2D routing selection device according to an embodiment of the present invention. As shown in FIG. 4 , a D2D routing selection device includes a first forwarding node obtaining unit 401, a judging unit 402 and execution unit 403 .

Among them, the first forwarding node acquisition unit 401 is used to, if the current forwarding node and the target node belong to the same community, according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node , select the next forwarding node from the candidate next node group, and add the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence; wherein, the forwarding node sequence The first forwarding node is the source node;

A judging unit 402, configured to judge whether the last forwarding node of the forwarding node sequence can communicate with the target node;

The execution unit 403 is configured to set a communication path between the source node and the target node based on the forwarding node sequence.

It should be noted that the first forwarding node acquisition unit 401, the judging unit 402 and the execution unit 403 cooperate to execute a D2D routing selection method in the above embodiment. For the specific functions of the system, please refer to the implementation of the above-mentioned D2D routing selection method. example, which will not be repeated here.

Based on any of the above embodiments, a D2D routing selection device further includes:

The target node obtaining unit is used to select the target node according to the priority weight of each candidate target node.

Based on any of the above embodiments, in a D2D routing device, the first forwarding node obtaining unit is further configured to:

If the current forwarding node and the target node belong to the same community, obtain the centrality of each candidate node in the candidate next node group corresponding to the current forwarding node, and select a first preset number of centralities from the candidate next node group The largest candidate nodes form the first node group;

Obtaining the similarity of each candidate node in the first node group, and selecting a second preset number of candidate nodes with the highest similarity from the first node group to form a second node group;

Obtain the content preference value of each candidate node in the second node group, select the candidate node with the largest content preference value in the second node group as the next forwarding node, and add the next forwarding node to the forwarding node In the sequence, it is used as the last forwarding node of the forwarding node sequence.

Based on any of the above embodiments, a D2D routing selection device further includes:

The second forwarding node acquisition unit is used to select the candidate node with the largest radius of gyration as the next forwarding node from the candidate next node group corresponding to the current forwarding node as the next forwarding node if the current forwarding node and the target node belong to different communities, and The next forwarding node is added to the forwarding node sequence as the last forwarding node of the forwarding node sequence.

Based on any of the above embodiments, a D2D routing selection device further includes:

The community division unit is configured to perform community division on the social network based on preset distance thresholds and node thresholds.

Based on any of the above embodiments, a D2D routing device, a community division unit, is further used for:

For any node in any community, obtain the neighborhood of any node based on a preset distance threshold;

If the number of nodes in the neighborhood of any node is not less than a preset node threshold, then add the neighborhood of any node into any community.

5 is a schematic structural diagram of a D2D routing device according to an embodiment of the present invention. As shown in FIG. 504 , where the processor 501 , the communication interface 502 , and the memory 503 communicate with each other through the bus 504 . The processor 501 can call the logic instructions in the memory 503 to execute the following method: if the current forwarding node and the target node belong to the same community, according to the centrality and similarity of each candidate node in the candidate next node group corresponding to the current forwarding node Degree and content preference value, select the next forwarding node from the candidate next node group, and add the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence; wherein, the The first forwarding node of the forwarding node sequence is the source node; the last forwarding node is used as the current forwarding node to perform the above steps until the last forwarding node can communicate with the target node; the forwarding node sequence is set based on the Describe the communication path between the source node and the target node.

The embodiment of the present invention discloses a computer program product. The computer program product includes a computer program stored on a non-transitory computer-readable storage medium. The computer program includes program instructions. When the program instructions are executed by the computer, the computer can execute the above methods. The method provided by the embodiment includes, for example: if the current forwarding node and the target node belong to the same community, according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, from Selecting the next forwarding node from the candidate next node group, and adding the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence; wherein, the first forwarding node in the forwarding node sequence forwards The node is a source node; the last forwarding node is used as the current forwarding node to perform the above steps until the last forwarding node can communicate with the target node; based on the forwarding node sequence, the distance between the source node and the target node is set communication path.

This embodiment provides a non-transitory computer-readable storage medium. The non-transitory computer-readable storage medium stores computer instructions. The computer instructions cause the computer to execute the methods provided in the foregoing method embodiments. For example, it includes: if the current forwarding node and The target node belongs to the same community, then according to the centrality, similarity and content preference value of each candidate node in the candidate next node group corresponding to the current forwarding node, select the next forwarding node from the candidate next node group, and Adding the next forwarding node into the forwarding node sequence as the last forwarding node of the forwarding node sequence; wherein, the first forwarding node of the forwarding node sequence is the source node; using the last forwarding node as the current forwarding node The node executes the above steps until the last forwarding node can communicate with the target node; based on the sequence of forwarding nodes, a communication path between the source node and the target node is set.

Those of ordinary skill in the art can understand that all or part of the steps for implementing the above-mentioned method embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, Execution includes the steps of the above method embodiments; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.

The above-described embodiments such as communication equipment are only illustrative, and the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in One place, or it can be distributed to multiple network elements. Part or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. It can be understood and implemented by those skilled in the art without any creative effort.

Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the prior art can be embodied in the form of software products, and the computer software products can be stored in computer-readable storage media, such as ROM/RAM, magnetic Discs, optical discs, etc., include several instructions to make a computer device (which may be a personal computer, server, or network device, etc.) execute the methods of various embodiments or some parts of the embodiments.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the embodiments of the present invention, not to limit them; although the embodiments of the present invention have been described in detail with reference to the foregoing embodiments, the scope of this invention Those of ordinary skill should understand that: they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements for some or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from this document. Embodiments of the invention The scope of the technical solutions of each embodiment.

Claims (10)

1. a kind of D2D route selection methods, which is characterized in that including：

If current forward node belongs to same community with destination node, according to the corresponding candidate next node of current forward node Centrality, similarity and the content-preference value of each both candidate nodes in group are chosen next from the candidate next node group Forward node, and next forward node is added in forward node sequence, the last position as the forward node sequence Forward node；Wherein, the first forward node of the forward node sequence is source node；

The last position forward node is executed into above-mentioned steps as current forward node, until the last position forward node can be with The destination node communication；

The source node is set to the communication path between destination node based on the forward node sequence.

2. according to the method described in claim 1, it is characterized in that, if the current forward node belongs to same with destination node Community, according to centrality, similarity and the content of each both candidate nodes in the corresponding candidate next node group of current forward node Preference value chooses next forward node from the candidate next node group, and next forward node is added and is turned It sends out in sequence node, as the last position forward node of the forward node sequence, further includes before：

According to the priority weight of each candidate target node, destination node is chosen.

3. according to the method described in claim 1, it is characterized in that, if the current forward node belongs to same with destination node Community, according to centrality, similarity and the content of each both candidate nodes in the corresponding candidate next node group of current forward node Preference value chooses next forward node from the candidate next node group, and next forward node is added and is turned It sends out in sequence node, as the last position forward node of the forward node sequence, further comprises：

If current forward node belongs to same community with destination node, the corresponding candidate next node group of current forward node is obtained In each both candidate nodes centrality, and it is maximum from the candidate next node group to choose the first preset quantity centrality Both candidate nodes constitute first segment point group；

The similarity of each both candidate nodes in the first segment point group is obtained, and chooses second from the first segment point group and presets The maximum both candidate nodes of quantity similarity constitute second node group；

The content-preference value for obtaining each both candidate nodes in the second node group, it is inclined by content is chosen in the second node group It is worth maximum both candidate nodes well as next forward node, and forward node sequence is added in next forward node In, the last position forward node as the forward node sequence.

4. according to the method described in claim 1, it is characterized in that, further including：

If current forward node belongs to different communities from destination node, from the corresponding candidate next node group of current forward node Forwarding is added as next forward node, and by next forward node in the maximum both candidate nodes of the middle selection radius of gyration In sequence node, the last position forward node as the forward node sequence.

5. according to the method described in claim 1, it is characterized in that, further including：

Based on preset distance threshold and Node B threshold, community's division is carried out to social networks.

6. according to the method described in claim 5, it is characterized in that, it is described be based on preset distance threshold and Node B threshold, it is right Social networks carries out community's division, further comprises：

For any node in any community, the neighborhood of any node is obtained based on preset distance threshold；

If the number of nodes in the neighborhood of any node is not less than preset Node B threshold, by the neighbour of any node Domain is added in any community.

7. a kind of D2D routing arrangements, which is characterized in that including：

First forward node acquiring unit, if belonging to same community with destination node for current forward node, according to current Centrality, similarity and the content-preference value of each both candidate nodes in the corresponding candidate next node group of forward node, from described Next forward node is chosen in candidate next node group, and next forward node is added in forward node sequence, Last position forward node as the forward node sequence；Wherein, the first forward node of the forward node sequence saves for source Point；

Judging unit, for judging whether the last position forward node can communicate with the destination node；

Execution unit, for the source node to be arranged to the communication path between destination node based on the forward node sequence.

8. device according to claim 7, which is characterized in that further include：

Second forward node acquiring unit, if belonging to different communities from destination node for current forward node, from working as forward It sends out in the corresponding candidate next node group of node and chooses the maximum both candidate nodes of the radius of gyration as next forward node, and will Next forward node is added in forward node sequence, the last position forward node as the forward node sequence.

9. a kind of D2D smart boxs, which is characterized in that including processor, communication interface, memory and bus, wherein place Device, communication interface are managed, memory completes mutual communication by bus, and processor can call the logic in memory to refer to It enables, to execute the D2D route selection methods as described in claim 1 to 6 is any.

10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program quilt The D2D route selection methods as described in claim 1 to 6 is any are realized when processor executes.