Information forwarding method, device and equipment based on energy perception in social internet of things

By determining the minimum energy consumption node in the social Internet of Things for information forwarding, the problem of unconsidered energy consumption is solved and the energy utilization efficiency is improved.

CN120343658APending Publication Date: 2025-07-18HUBEI ENG UNIV
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202510341738.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-03-21
Publication Date
2025-07-18

AI Technical Summary

Technical Problem

The existing information forwarding methods in the social Internet of Things do not take into account energy consumption, resulting in low overall energy utilization efficiency.

Method used

By obtaining the properties of the own node, the encounter node, the neighbor node and the destination node, the minimum energy consumption node is determined, and the information to be forwarded is sent to the node.

Benefits of technology

Improve the overall energy utilization efficiency of the information forwarding network.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120343658A_ABST
    Figure CN120343658A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of information forwarding, and provides an information forwarding method, device and equipment based on energy perception in a social internet of things, and the method comprises the steps: obtaining the own node attribute and the encountering node attribute of a current encountering node when the encountering with the current encountering node is detected, obtaining a destination node attribute of the destination node according to the carried to-be-forwarded information; determining a neighbor node based on the own node attribute, and obtaining the neighbor node attribute of the neighbor node; determining a minimum energy consumption node based on the own node attribute, the encountering node attribute, the neighbor node attribute and the destination node attribute; and determining a next node according to the current encountering node and the minimum energy consumption node, and sending the to-be-forwarded information to the next node. According to the method and the device, whether the current encountering node is used as the next node for information forwarding or not is judged by acquiring the minimum energy consumption node as the threshold value, so that the overall energy utilization efficiency of the information forwarding network is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of social Internet of Things, and particularly to an energy-aware information forwarding method, apparatus, and device in a social Internet of Things. Background Art

[0002] The Social Internet of Things (SIoT) is an emerging network architecture that combines Internet of Things (IoT) devices with the concept of social networks, enabling devices to interact in social networks like human users. This architecture not only supports data exchange between devices but also allows devices to make intelligent decisions based on their social relationships and community affiliations.

[0003] In the existing information forwarding method in social Internet of Things, when a current encounter node is encountered by its own node, it determines whether to use the current encounter node as the next node for information forwarding by analyzing the transmission efficiency of the current encounter node, without considering the impact of energy consumption on information forwarding, resulting in a low overall energy utilization efficiency of the information forwarding network. Summary of the Invention

[0004] The main objective of the present application is to provide an energy-aware information forwarding method, apparatus, and device in a social Internet of Things, aiming to solve the technical problem in the prior art that the impact of energy consumption on information forwarding is not considered, resulting in a low overall energy utilization efficiency of the information forwarding network.

[0005] To achieve the above objective, the present application proposes an energy-aware information forwarding method in a social Internet of Things, the method comprising:

[0006] When it is detected that a current encounter node is encountered, obtain the attributes of its own node and the encounter node attributes of the current encounter node, and obtain the destination node attributes of the destination node according to the information to be forwarded carried;

[0007] Determine neighbor nodes based on the attributes of its own node, and obtain the neighbor node attributes of the neighbor nodes;

[0008] Determine the node with the minimum energy consumption based on the attributes of its own node, the encounter node attributes, the neighbor node attributes, and the destination node attributes;

[0009] Determine the next node according to the current encounter node and the node with the minimum energy consumption, and send the information to be forwarded to the next node.

[0010] In one embodiment, the step of determining the minimum energy consumption node based on the self-node attributes, the encountered node attributes, the neighbor node attributes, and the destination node attributes includes:

[0011] Determine the current energy consumption for forwarding the information to be forwarded to the destination node through the current encountered node based on the self-node attributes, the encountered node attributes, and the destination node attributes;

[0012] Determine the neighbor energy consumption for forwarding the information to be forwarded to the destination node through the neighbor node according to the self-node attributes, the neighbor node attributes, and the destination node attributes;

[0013] Compare the current energy consumption with each neighbor energy consumption, and determine the minimum energy consumption and the minimum energy consumption node corresponding to the minimum energy consumption based on the energy comparison result.

[0014] In one embodiment, the step of determining the next node according to the current encountered node and the minimum energy consumption node includes:

[0015] Compare the current encountered node with the minimum energy consumption node;

[0016] When the current encountered node is the minimum energy consumption node, use the current encountered node as the next node;

[0017] When the current encountered node is not the minimum energy consumption node, determine a first forwarding metric corresponding to the self-node attributes and a second forwarding metric corresponding to the encountered node attributes based on a preset forwarding metric model;

[0018] Compare the first forwarding metric with the second forwarding metric, and determine the next node based on the metric comparison result.

[0019] In one embodiment, before the step of determining the minimum energy consumption node based on the self-node attributes, the encountered node attributes, the neighbor node attributes, and the destination node attributes, further includes:

[0020] Obtain the length of the data packet to be forwarded of the information to be forwarded;

[0021] Compare a preset data packet length threshold with the length of the data packet to be forwarded;

[0022] When the length of the data packet to be forwarded is not higher than the preset data packet length threshold, execute the step of determining the minimum energy consumption node based on the self-node attributes, the encountered node attributes, the neighbor node attributes, and the destination node attributes.

[0023] In one embodiment, after the step of comparing the preset data packet length threshold with the length of the data packet to be forwarded, the following steps are further included:

[0024] When the length of the data packet to be forwarded is higher than the preset data packet length threshold, it is determined whether there is a node with the minimum energy consumption based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node;

[0025] When the node with the minimum energy consumption exists, the node with the minimum energy consumption is determined based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node;

[0026] The step of determining the next node according to the current encountered node and the node with the minimum energy consumption, and sending the information to be forwarded to the next node includes:

[0027] When the current encountered node is the node with the minimum energy consumption, the current encountered node is used as the next node, and the information to be forwarded is sent to the next node;

[0028] When the node with the minimum energy consumption exists and the current encountered node is not the node with the minimum energy consumption, the information to be forwarded is sent to the next node.

[0029] In one embodiment, after the step of determining whether there is a node with the minimum energy consumption based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node, the following steps are further included:

[0030] When the node with the minimum energy consumption does not exist, the first social intensity corresponding to the attributes of the own node and the second social intensity corresponding to the attributes of the encountered node are determined based on a preset social intensity algorithm;

[0031] The first social intensity and the second social intensity are compared in terms of intensity, the next node is determined according to the intensity comparison result, and the information to be forwarded is sent to the next node.

[0032] In one embodiment, before the step of determining neighbor nodes based on the attributes of the own node, the following steps are further included:

[0033] Obtain the survival time threshold and the current information survival time of the information to be forwarded, and compare the current information survival time with the survival time threshold;

[0034] When the current information survival time is higher than the survival time threshold, the step of determining neighbor nodes based on the attributes of the own node is executed.

[0035] In one embodiment, after the step of comparing the current information survival time with the survival time threshold, the method further includes:

[0036] When the current information survival time is not higher than the survival time threshold, obtain a first interval distance based on the self-node attribute and the destination node attribute, and obtain a second interval distance based on the current encounter node and the destination node;

[0037] Compare the first interval distance with the second interval distance, determine the next node according to the distance comparison result, and send the information to be forwarded to the next node.

[0038] In addition, to achieve the above object, the present application further provides an information forwarding device based on energy awareness in a social Internet of Things, the device includes:

[0039] An acquisition module, configured to obtain the self-node attribute and the encounter node attribute of the current encounter node when detecting an encounter with the current encounter node, and obtain the destination node attribute of the destination node according to the information to be forwarded carried;

[0040] A search module, configured to determine neighbor nodes based on the self-node attribute, and obtain the neighbor node attributes of the neighbor nodes;

[0041] A calculation module, configured to determine the node with the minimum energy consumption based on the self-node attribute, the encounter node attribute, the neighbor node attribute, and the destination node attribute;

[0042] A forwarding module, configured to determine the next node according to the current encounter node and the node with the minimum energy consumption, and send the information to be forwarded to the next node.

[0043] In addition, to achieve the above object, the present application further provides an information forwarding device based on energy awareness in a social Internet of Things, the device includes: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program is configured to implement the steps of the information forwarding method based on energy awareness in a social Internet of Things as described above.

[0044] The present application proposes a method, device, and equipment for information forwarding based on energy awareness in a social Internet of Things. The method includes: when detecting an encounter with a current encounter node, obtaining its own node attributes and the encounter node attributes of the current encounter node, and obtaining the destination node attributes of the destination node according to the information to be forwarded carried; determining neighbor nodes based on its own node attributes, and obtaining the neighbor node attributes of the neighbor nodes; determining the node with the minimum energy consumption based on its own node attributes, the encounter node attributes, the neighbor node attributes, and the destination node attributes; determining the next node according to the current encounter node and the node with the minimum energy consumption, and sending the information to be forwarded to the next node. Since the present application uses obtaining the node with the minimum energy consumption as a threshold to determine whether to use the current encounter node as the next node for information forwarding, the overall energy utilization efficiency of the information forwarding network is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The drawings herein are incorporated into the specification and form a part of the specification, showing embodiments consistent with the present application, and are used together with the specification to explain the principles of the present application.

[0046] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, for those of ordinary skill in the art, other drawings can also be obtained based on these drawings without creative efforts.

[0047] Figure 1 It is a flowchart of the first embodiment of the method for information forwarding based on energy awareness in the social Internet of Things proposed in this embodiment;

[0048] Figure 2 It is a flowchart of the second embodiment of the method for information forwarding based on energy awareness in the social Internet of Things proposed in this embodiment;

[0049] Figure 3 It is a specific flowchart of the method for information forwarding based on energy awareness in the social Internet of Things proposed in this embodiment;

[0050] Figure 4 It is a flowchart of the third embodiment of the method for information forwarding based on energy awareness in the social Internet of Things proposed in this embodiment;

[0051] Figure 5 It is a flowchart of the fourth embodiment of the method for information forwarding based on energy awareness in the social Internet of Things proposed in this embodiment;

[0052] Figure 6 It is a diagram of the device for information forwarding based on energy awareness in the social Internet of Things provided in this embodiment;

[0053] Figure 7 It is a schematic structural diagram of an information forwarding device based on energy awareness in the social Internet of Things suitable for implementing this embodiment.

[0054] The realization of the purpose of this application, functional characteristics and advantages will be further described in conjunction with the embodiments with reference to the accompanying drawings. Detailed implementation manners

[0055] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of this application and are not used to limit this application.

[0056] Next, the technical solutions in the embodiments of this application will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of this application. Obviously, the described embodiments are only a part of the embodiments of this application, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in this application without creative efforts belong to the scope of protection of this application.

[0057] It can be understood that the Social Internet of Things (SIoT) is a new network architecture that combines Internet of Things (IoT) devices with the concept of social networks, enabling devices to interact in social networks like human users. This architecture not only supports data exchange between devices but also allows devices to make intelligent decisions based on their social relationships and community affiliations.

[0058] The existing information forwarding method in the social Internet of Things is to analyze the transmission efficiency of the current encountered node when the own node encounters the current encountered node to determine whether to use the current encountered node as the next node for information forwarding, without considering the impact of energy consumption on information forwarding, resulting in a relatively low overall energy utilization efficiency of the information forwarding network.

[0059] Therefore, to solve the technical problem in the prior art that the impact of energy consumption on information forwarding is not considered, resulting in a low overall energy utilization efficiency of the information forwarding network, this embodiment proposes an energy-aware information forwarding method, device, and equipment in the social Internet of Things. When detecting an encounter with the current encounter node, obtain its own node attributes and the encounter node attributes of the current encounter node, and obtain the destination node attributes of the destination node according to the information to be forwarded carried; determine neighbor nodes based on its own node attributes, and obtain the neighbor node attributes of the neighbor nodes; determine the node with the minimum energy consumption based on its own node attributes, encounter node attributes, neighbor node attributes, and destination node attributes; determine the next node according to the current encounter node and the node with the minimum energy consumption, and send the information to be forwarded to the next node. Since this embodiment determines whether to use the current encounter node as the next node for information forwarding by using the node with the minimum energy consumption as a threshold, the overall energy utilization efficiency of the information forwarding network is improved.

[0060] For ease of understanding, the following combines Figures 1 to 7 to specifically introduce the energy-aware information forwarding method in the social Internet of Things provided in the embodiments of the present application and the energy-aware information forwarding method, device, and equipment in the social Internet of Things provided in the following embodiments.

[0061] The embodiments of the present application provide an energy-aware information forwarding method in the social Internet of Things. Refer to Figure 1 , Figure 1 which is the flowchart of the first embodiment of the energy-aware information forwarding method in the social Internet of Things proposed in this embodiment.

[0062] As Figure 1 shown, the method includes:

[0063] Step S10: When detecting an encounter with the current encounter node, obtain its own node attributes and the encounter node attributes of the current encounter node, and obtain the destination node attributes of the destination node according to the information to be forwarded carried.

[0064] It should be noted that the execution subject of this embodiment can be a computing service device with information forwarding, network communication, and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of implementing the above functions. The following takes the energy-aware information forwarding device in the social Internet of Things (hereinafter referred to as the device) as an example to illustrate this embodiment and the following embodiments.

[0065] In addition, it should be noted that the above-mentioned self-node attributes can be the node attributes of the above-mentioned device when it acts as a node, such as node location, energy state, community affiliation, social relationship, etc. The above-mentioned current encounter node can be a node that encounters the self-node, such as a node that enters the communication range of the above-mentioned device. The above-mentioned encounter can be that the current encounter node enters the communication range of the above-mentioned self-node. The above-mentioned encounter node attributes can be the node attributes of the above-mentioned encounter node. The above-mentioned information to be forwarded can be the information carried by the above-mentioned self-node that needs to be forwarded, the above-mentioned destination node can be the node that the above-mentioned information to be forwarded needs to reach, and the above-mentioned destination node attributes can be the node attributes of the above-mentioned destination node.

[0066] In a specific implementation, when the above-mentioned device detects an encounter with a current encounter node, it will first obtain its own node attributes and the encounter node attributes of the current encounter node. In addition, the above-mentioned device will also obtain the destination node attributes of the destination node according to the information to be forwarded carried by it.

[0067] The following is an example for illustration, but it does not specifically limit this embodiment. Suppose a social Internet of Things device carries a piece of information from community A and needs to forward it to a certain destination node in community B. When the device encounters a node in community B, it will first obtain its own node attributes, such as its energy level is 80%, community affiliation is community A, mobility is low, and social relationship is close. Then, it will obtain the attributes of the encounter node, such as its energy level is 60%, community affiliation is community B, mobility is high, and social relationship is relatively scattered. Finally, it will obtain the attributes of the destination node according to the information carried, such as its community affiliation is community B and the location information is a certain specific location in community B. By obtaining these attribute information, the above-mentioned device can more comprehensively understand the network state and the relationship between nodes, so as to make more reasonable routing decisions.

[0068] Step S20: Determine neighbor nodes based on the self-node attributes, and obtain the neighbor node attributes of the neighbor nodes.

[0069] It should be noted that the above-mentioned neighbor nodes can be other nodes that are directly connected to the self-node or already within the communication range of the self-node. The above-mentioned neighbor node attributes can be the attributes of the above-mentioned neighbor nodes. In a specific implementation, after determining its own node attributes, the above-mentioned device will further identify the neighbor nodes around it. These neighbor nodes are other nodes that the current node can directly communicate with. The above-mentioned device detects the existence of these neighbor nodes through wireless signals or other communication means, and obtains their attributes, such as location, energy state, community affiliation, and social relationship, etc. These neighbor node attributes are used to evaluate whether the current encounter node is suitable for information forwarding.

[0070] Step S30: Determine the node with the minimum energy consumption based on the attributes of the own node, the encountered node, the neighbor nodes, and the destination node.

[0071] It should be noted that the above-mentioned minimum consumption node can be the node with the minimum energy cost that the above-mentioned device needs to rely on when forwarding the above-mentioned information to be forwarded to the destination node. In this embodiment, the above-mentioned minimum consumption node can also be the neighbor node with the minimum energy cost that the above-mentioned device needs to rely on when forwarding the above-mentioned information to be forwarded to the destination node. In specific implementation, the above-mentioned device will calculate the energy consumption (ED) from the own node to each neighbor node, and combine the energy consumption from each neighbor node to the destination node, select the path with the minimum total energy consumption, and use the node corresponding to this path as the minimum consumption node.

[0072] Further, in order to obtain the node with the minimum energy consumption to determine whether the current encountered node can be used as the next node, the step of determining the node with the minimum energy consumption based on the attributes of the own node, the encountered node, the neighbor nodes, and the destination node includes:

[0073] Step S31: Determine the current consumption energy for forwarding the information to be forwarded to the destination node through the current encountered node based on the attributes of the own node, the encountered node, and the destination node.

[0074] It should be noted that the above-mentioned current consumption energy can be the total energy consumption required to forward the information to be forwarded to the destination node through the current encountered node. The above-mentioned current consumption energy consists of two parts: the energy consumption from the own node to the current encountered node and the energy consumption from the current encountered node to the destination node. The above-mentioned energy consumption can be the energy consumed when transmitting information from one node to another node. The above-mentioned energy consumption is usually determined by factors such as transmission distance, signal strength, and communication quality.

[0075] Step S32: Determine the neighbor consumption energy for forwarding the information to be forwarded to the destination node through the neighbor node based on the attributes of the own node, the neighbor nodes, and the destination node.

[0076] It should be noted that the above-mentioned neighbor consumption energy can be the total energy consumption required to forward the information to be forwarded to the destination node through the neighbor node. The above-mentioned current consumption energy consists of two parts: the energy consumption from the own node to the neighbor node and the energy consumption from the neighbor node to the destination node.

[0077] Step S33: Compare the current consumption energy with each of the neighbor consumption energies, and determine the minimum consumption energy and the node with the minimum energy consumption corresponding to the minimum consumption energy based on the energy comparison result.

[0078] It should be noted that the above minimum energy consumption can be the minimum value of the energy consumption among all neighbor nodes and the current encounter node. The above minimum energy consumption node can be the node with the minimum energy consumption among all neighbor nodes and the current encounter node.

[0079] In a specific implementation, when the above device forwards information, it first calculates the current energy consumption of forwarding the information to be forwarded to the destination node through the current encounter node based on its own node attributes, the attributes of the encounter node, and the attributes of the destination node. Then, the above device determines the neighbor energy consumption of forwarding the information to be forwarded to the destination node through each neighbor node according to its own node attributes, the attributes of the neighbor nodes, and the attributes of the destination node. Finally, the above device compares the current energy consumption with the neighbor energy consumption of each neighbor, determines the path with the minimum energy consumption, and determines the corresponding minimum energy consumption node.

[0080] In addition, it should be noted that in the social Internet of Things, the communication between nodes may consume different energies, which depends on various factors such as distance, signal strength, and communication quality. Different combinations of these factors may lead to huge differences in the communication costs between different nodes. Therefore, both distance and energy jointly determine the selection of the minimum consumption node as important factors. To find the minimum energy consumption path from a source node to a destination node, first find the minimum consumption node among the neighbor nodes. The minimum consumption algorithm uses Euclidean distance and cumulative energy cost to calculate the cost from the starting point to any node. These costs are managed using a priority queue to ensure that the node with the lowest estimated total cost is always processed first. Considering factors such as communication quality and signal power, the energy consumption is evaluated by calculating the distance, signal strength, and communication quality, making it particularly applicable in an energy-sensitive environment such as the social Internet of Things. In addition, the algorithm iteratively checks the neighbors of the node and updates the path and cost according to the newly calculated cost until the optimal path to the destination node is found or all possible paths are traversed.

[0081] Among them, the above-mentioned minimum consumption algorithm includes: inputting the source node and the destination node, outputting the minimum energy consumption node and the minimum consumption energy, and finding the minimum energy path from the source node to the destination node. The distance is used to estimate the cost of reaching the target, and the actual energy cost from the source node to the current node is combined. The above-mentioned minimum consumption algorithm maintains an open set for storing nodes to be processed, and uses a closed set (ClosedSet) to track the processed nodes. In each step, the minimum consumption algorithm selects the node with the lowest total cost estimate from the open set for processing. For each neighbor of the current node, if it has not been processed and a lower arrival cost can be obtained through the current node, its cost is updated and it is added to the open set. When the destination node is reached, the algorithm ends and returns the lowest cost to reach that node and the corresponding node.

[0082] In an example, a preset energy loss formula can be used to calculate the energy consumption of the own node reaching each neighbor node and the current encounter node, as well as the energy loss of each neighbor node and the current encounter node reaching the destination node. Among them, the preset energy loss formula is:

[0083] ED(i, j) =

[0084] α·Distance(i, j) + β·SignalStrength(i, j) + γ·CommunicationQuality(i, j);

[0085] Among them, Distance(i, j) is the Euclidean distance between node i and node j, SignalStrength(i, j) is the signal strength between node i and node j, CommunicationQuality(i, j) is the communication quality between node i and node j, and α, β, and γ are weight coefficients used to adjust the relative importance of different factors.

[0086] Step S40: Determine the next node according to the current encounter node and the minimum energy consumption node, and send the information to be forwarded to the next node.

[0087] It should be noted that the above-mentioned next node can be the node selected as the next information forwarding node during the information forwarding process. In a specific implementation, after the device determines the minimum energy consumption node, it will compare the energy consumption of the current encounter node and the minimum energy consumption node. Whether to use the current encounter node as the next node is judged based on the comparison result.

[0088] Based on the first embodiment, in the second embodiment, for the same or similar content as in the above-mentioned first embodiment, reference can be made to the above introduction and will not be elaborated hereinafter. On this basis, please refer to Figure 2 , Figure 2 which is a flowchart of the second embodiment of the energy-aware information forwarding method in the social Internet of Things proposed in this embodiment. Further, in order to determine which node is used as the next node, the step of determining the next node according to the current encounter node and the minimum energy consumption node includes:

[0089] Step S41: Compare the current encounter node with the minimum energy consumption node;

[0090] Step S42: When the current encounter node is the minimum energy consumption node, use the current encounter node as the next node;

[0091] Step S43: When the current encounter node is not the minimum energy consumption node, determine a first forwarding metric corresponding to the own node attribute and a second forwarding metric corresponding to the encounter node attribute based on a preset forwarding metric model.

[0092] It should be noted that the above preset forwarding metric model can be a model for obtaining the social forwarding metric of a node based on the node attribute. The above first forwarding metric can be a forwarding metric obtained based on the own node attribute of the above device, and the above second forwarding metric can be a forwarding metric obtained based on the encounter node attribute of the above current encounter node.

[0093] In addition, in this embodiment, the preset forwarding metric model includes: a community influence model, a postal node model, a community node interaction model, and an inter-community interaction model. The above preset forwarding metric models will be explained respectively below.

[0094] First, in the social Internet of Things, the mobility of individuals and the dynamics of community structures have a crucial impact on the network. Therefore, this embodiment proposes a Community Influence Model (Node Interactivity Model, NIM) to evaluate the influence of nodes in the network. NIM focuses on the social connections and mobility behaviors of individuals, as well as their roles in information dissemination and resource sharing. Therefore, NIM defines two metrics: the community centrality of a node and the resource status of a node to measure the connectivity and potential influence level of a node in the network. Among them, community centrality includes two concepts: Degree Centrality (DC) and Closeness Centrality (CC). DC reflects the importance of a node i within a community in the entire community. In a human community, an individual with a high degree of centrality may be an opinion leader or a key communicator in the community, and they play an important role in information transmission and community influence. It is expressed as:

[0095]

[0096] CC is determined by calculating the reciprocal of the average distance to all other nodes in the network, and is expressed as:

[0097]

[0098] where d(i, j) is the shortest path length from node i to all other nodes j in the network, and n is the total number of nodes in the community.

[0099] The node resource R, R(i) is a measure of the ratio between the current available resources of a certain node i in the community init and its initial resources E.

[0100]

[0101] where a high R value indicates that the node has retained more resources, while a low R value may mean that the resources have been largely consumed.

[0102] The Intra-Community Forwarding Metrics (ICFM) within a community is a measurement method used when the source node, destination node, and relay node of information are all within the same community. When information is forwarded within the community, it is necessary to consider the community centrality of nodes within the community and the resource status indicators of nodes. The weights α, β, γ correspond to these metrics respectively, providing a quantitative proportion for the contributions of different characteristics. Therefore, it can be expressed as:

[0103] ICFM(i,j) = αDC(i) + βCC(i) + γR(i);

[0104] Secondly, in the social Internet of Things, the mobility and social attributes of nodes are crucial for establishing connections and information transmission. The movement trajectories of nodes not only exhibit a high degree of temporal and spatial regularity, but each individual also tends to visit a limited set of high-frequency locations, thus forming predictable movement patterns. These movement patterns and social behaviors play a key role in information exchange. Further, considering the information lifetime, i.e., the average time that information remains active in the network, is directly related to the efficiency of information dissemination in the social network. This embodiment adopts the postal node model to emphasize the way nodes cross community boundaries through mobility and how these cross-border activities affect the circulation and lifetime of information between communities.

[0105] Among them, the postal node model determines the postal metric by obtaining the mobility index and the information lifetime.

[0106] The mobility index is the average mobility index AMI (Average Mobility Index), which considers the average movement radius and the movement range. The average movement radius refers to the gyration radius of node i in the network. The movement range refers to the maximum distance that a node can cover under certain conditions. It is expressed as:

[0107]

[0108] Among them, Rg(i) represents the gyration radius of postal node i. Among them, l represents the l-th position visited by node i, l ∈ L; L represents the total sum of positions visited by node i. represents the total time that node i stays at position l, represents the total time that node i spends visiting these positions. represents the coordinate vector of node i in the two-dimensional plane at this moment, is the center of mass of the movement trajectory calculated based on the coordinate vectors of all nodes that node i has connected to; Distance(i,j) represents the Euclidean distance from node i to j.

[0109] The information lifetime IL (Information Lifetime) of information. The information lifetime IL is measured by the ratio of the remaining information dissemination time TTL of the information m carried by the current node i c to the initial maximum time TTL when the information can exist init and it measures the duration that the information remains active in the network. It is expressed as follows:

[0110]

[0111] The Post-node Forwarding Metric (PNM) is a metric used to evaluate the role and efficiency of individual nodes in a network during the information forwarding process. It assesses the key role of nodes in information dissemination in the network by comprehensively considering multiple aspects such as the activity of nodes during information forwarding, the duration of the forwarding behavior, and the impact of this behavior on other nodes. A high value of PNM indicates that the node has a strong information forwarding ability and a large influence range, while a low value may mean that the node plays a smaller role in information dissemination. PNM provides a quantitative comprehensive evaluation for the forwarding behavior of nodes in the network by weighted combination of multiple metrics such as AMI (Average Mobility Index), R (Node Resources), IL (Information Lifetime), etc., adjusted by weights δ, ε, ζ.

[0112] PNM(i,j) = δAMI(i) + εR + ζIL(m);

[0113] Furthermore, in the continuous evolution of the social Internet of Things, the mobility of nodes and the dynamics of community structures play a crucial role in the overall influence of the network. In this context, this embodiment proposes the Community-Node Interactivity Model (CNIM). CNIM quantifies the roles played by individual nodes in their affiliated and cross communities and their status in the information flow, covering dimensions of multiple interactions, the density of paths between nodes, and the diversity of their connectivity between different communities. These metrics include: node mobility diversity, community path density metric, and node diversity.

[0114] Among them, the node mobility diversity Md(C i ): That is, the diversity of node movement in the network. Md(C i ) helps identify key device nodes by calculating the diversity and information mobility of nodes within their communities. This metric is expressed using Shannon entropy, which is used to measure the uncertainty or complexity of a system. Where p(y j ) represents the relative probability of node j connected to node i among all connections, and log is used to transform the probability value to measure the information content. By analyzing this value, key influencers or central nodes in the social network can be identified, and these nodes can control information flow because they connect multiple social groups. Md(C i ) can be expressed as follows:

[0115]

[0116] n = Link(C i ,C f );

[0117] Among them, n represents the number of times of establishing connections between two communities, and C f represents all communities in the network; p(y j ) is the proportion of the number of times of establishing connections from the original community C i to the destination community C j in the number of times of establishing connections between the original community and all communities.

[0118] Community Path Density Measure (Path Density, PD). Given a community C s in a community network and a set of communities C o , C s represents the community where the source node is located, and C o represents all other communities, where C s , C o ∈C f . The community path quantity measure Pd(C s , C o ) refers to the ratio of the number of different paths between these two communities to the number of all possible paths between communities, reflecting the diversity of paths between specific communities and their distribution in the network. The calculation formula is as follows:

[0119]

[0120] Among them, P distinct is the number of different paths from community C s to other communities C o , that is, each non-repeated path is calculated, regardless of whether it passes through communities that have been visited. P total is the number of all possible paths from C s to C o , including those paths that may pass through the same community. is the node degree of the destination node of path h (the community where it is located belongs to a subset of the community set C o ), that is, the number of nodes directly connected to . is the destination node on the h-th non-repeated path from community C s to community C o . Pd provides a measure of the diversity of network connections and can be used to evaluate the diversity and complexity of paths from one community to another, as well as the role of the community where the node is located as a bridge across communities in the network.

[0121] Node Diversity (ND) is a measure to evaluate the ability of a node to connect to different other nodes in a network. Especially in the forwarding strategy between the postman node and the community, ND can be used to judge the degree to which a postman node connects to different members within the community. High diversity means that the node can establish connections with more different community members, which may increase the opportunities and scope of information transmission, thereby improving the overall communication efficiency of the network. The formula is as follows:

[0122]

[0123] Among them, C u represents the number of unique community members connected by the postman node, and C all represents the total number of community members encountered by the postman node.

[0124] Combining the above node flow diversity, the above community path density measure, and the above node diversity, the Community-Node Forwarding Metrics (CNFM) can be obtained. CNFM is a measurement method used when either the source node or the destination node of the information is a postman node and the other is a community node. These metrics are weighted by the corresponding weight parameters η, θ, ι, considering the community centrality of the community node and the resource status metrics of the node. The formula is as follows:

[0125] CNFM(i,j) = ηMd(C i ) + θPd(C s , C o ) + ιND;

[0126] Finally, in the social Internet of Things, the interactions of nodes are not limited to the local community. They also shuttle between different communities, playing a key role in information transmission and resource sharing. In response to this cross-community interaction phenomenon, this embodiment proposes an Inter-Community Interaction Model (ICIM) to quantitatively evaluate the connection role and information dissemination efficiency of nodes in a multi-community environment. ICIM uses the outra-Community Connectcount (oCC) to capture the activity of nodes expanding their social boundaries outward, and the Cumulative Degree Centrality (CDC) to reflect their cumulative central status through the paths in the network. These metrics reflect how nodes act as hubs for cross-community interactions and their role in promoting cross-community communication and cooperation.

[0127] It should be noted that oCC is directly equal to the average level of the number of links Link(i) of all nodes in the community. The more links a node has, the more other nodes it is connected to, which means it is more central in the network and has a greater influence on information dissemination. The formula is as follows:

[0128]

[0129] Among them, Link(i) is the number of edges by which a node is connected to other communities, and n is the total number of nodes in community C.

[0130] It should also be noted that CDC evaluates the influence of a node in all its communities, reflecting the overall centrality of the node rather than just its influence in a single community, and is calculated by accumulating and normalizing the degree centrality of the node in each community, showing the comprehensive influence of the node in multiple communities. The formula is as follows:

[0131]

[0132] Among them, C represents the set of communities. n c is the number of nodes in community c.

[0133] Based on the above oCC and the above CDC, the Between Community Forwarding Metrics (BCFM) can be obtained. BCFM is a forwarding utility function used when the source node, relay node, and destination node are all in the community. It is necessary to consider the number of external connections of the community and the cumulative degree centrality index, and the weights κ and λ are used to adjust the relative importance of the two in the comprehensive index. Therefore, it is defined as follows:

[0134] BCFM(i,j) = κOCC(i) + λCDC(i,j).

[0135] When this embodiment selects which model as the preset forwarding metric model to judge the attributes of its own nodes and the attributes of the encountered nodes to obtain the metric value, it needs to be selected based on the attributes of the nodes. Further, in order to select the correct preset forwarding metric model for judgment, before the step of determining the first forwarding metric corresponding to the attributes of the own node and the second forwarding metric corresponding to the attributes of the encountered node based on the preset forwarding metric model, it also includes.

[0136] Step S431: Judge whether the own node and the destination node belong to the same node community based on the attributes of the own node and the destination node, and judge whether the current encountered node and the destination node belong to the same node community based on the attributes of the encountered node and the destination node;

[0137] Refer to Figure 3 ,Figure 3 Specific flowchart of the energy-aware information forwarding method in the social Internet of Things proposed in this embodiment. It should be noted that the above node community can be a group composed of nodes with similar characteristics or strong social relationships with each other. In specific implementation, the above device will respectively obtain the own node community of its own node (i.e., node i in Figure 3 ) and the destination node community of the destination node (i.e., node d in Figure 3 ) based on the above own node attributes and destination node attributes, and determine whether the above own node community and the above destination node community are the same community. (That is, are i and d in Figure 3 in the same community?).

[0138] Moreover, the above device will also respectively obtain the current encounter node community of the current encounter node (i.e., node j in Figure 3 ) and the destination node community of the destination node based on the above encounter node attributes and destination node attributes, and determine whether the above encounter node community and the above destination node community are the same community (i.e., are j and d in Figure 3 in the same community?).

[0139] The step of determining the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on the preset forwarding metric model includes:

[0140] Step S432: When the own node and the destination node belong to the same node community, and the current encounter node and the destination node belong to the same node community, determine the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on the community influence model.

[0141] Refer to Figure 3 . It should be noted that when this embodiment uses the community influence model as the preset forwarding metric model, the above first forwarding metric can be the intra-community forwarding metric determined by the community influence model based on the above own node attributes, and the above second forwarding metric can be the intra-community forwarding metric determined by the community influence model based on the above encounter node attributes. In specific implementation, the above device obtains the intra-community forwarding metric corresponding to its own node as the first forwarding metric and the intra-community forwarding metric corresponding to the encounter node attribute as the second forwarding metric through the above community influence model (i.e., Figure 3 calculates the intra-community forwarding metrics ICFM(i) and ICFM(j)).

[0142] Further, after the step of determining whether the own node and the destination node belong to the same node community based on the own node attributes and the destination node attributes, and determining whether the current encounter node and the destination node belong to the same node community based on the encounter node attributes and the destination node attributes, the method further includes:

[0143] Step S432: When the own node and the destination node do not belong to the same node community, and the current encounter node and the destination node do not belong to the same node community, respectively determine whether the own node, the current encounter node, and the destination node are postal nodes based on the own node attributes, the encounter node attributes, and the destination node attributes;

[0144] Reference Figure 3 , it should be noted that the above-mentioned postal node can be a node whose moving speed reaches a preset speed threshold or the moving range reaches a preset range threshold. In a specific implementation, the above device obtains the moving speed and moving range of the own node according to the own node attributes, compares the moving speed of the own node with the preset speed threshold, and compares the moving range of the own node with the range threshold. When the above moving speed reaches the moving speed threshold or the above moving range reaches the range threshold, it is determined that the own node is a postal node (i.e., Figure 3 Is i a postal node in Figure 3 ). Similarly, the above device can also determine whether the current encounter node is a postal node (i.e., Figure 3 Is j a postal node in

[0145] The step of determining the first forwarding metric corresponding to the own node attributes and the second forwarding metric corresponding to the encounter node attributes based on a preset forwarding metric model includes:

[0146] Step S433: When the own node, the current encounter node, and the destination node are all postal nodes, determine the first forwarding metric corresponding to the own node attributes and the second forwarding metric corresponding to the encounter node attributes based on the postal node model.

[0147] Reference Figure 3 , it should be noted that when this embodiment uses the postal node model as the preset forwarding metric model, the above first forwarding metric can be the postal metric determined by the postal node model based on the above own node attributes, and the above second forwarding metric can be the postal metric determined by the postal node model based on the above encounter node attributes. In a specific implementation, the above device obtains the postal metric corresponding to the own node through the above postal node model as the first forwarding metric and the postal metric corresponding to the encounter node attributes as the second forwarding metric (i.e., Figure 3Calculate the forwarding metrics PNM(i) and PNM(j) between the nodes calculating i and j.

[0148] In another example, the step of determining the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on a preset forwarding metric model includes:

[0149] Step S434: When the own node, the current encounter node, and the destination node are not postal nodes, determine the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on the inter-community interaction model.

[0150] Reference Figure 3 , it should be noted that when the inter-community interaction model is adopted, the above first forwarding metric is the inter-community forwarding metric of the above own node, and the second forwarding metric is the inter-community forwarding metric of the above current encounter node. In a specific implementation, the above device obtains the inter-community forwarding metric corresponding to the own node through the above inter-community interaction model as the first forwarding metric and the inter-community forwarding metric corresponding to the encounter node attribute as the second forwarding metric (i.e., Figure 3 calculate the forwarding metrics BCFM(i) and BCFM(j) between communities and communities.

[0151] In another example, the step of determining the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on a preset forwarding metric model includes:

[0152] Step S435: When the own node and the current encounter node are both postal nodes and the destination node is not a postal node, or when the own node and the current encounter node are not postal nodes and the destination node is a postal node, determine the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on the community-node interaction model.

[0153] Reference Figure 3 , it should be noted that when the community-node interaction model is adopted, the above first forwarding metric is the community-node forwarding metric of the above own node, and the second forwarding metric is the community-node forwarding metric of the above current encounter node. In a specific implementation, the above device obtains the community-node forwarding metric corresponding to the own node through the above community-node interaction model as the first forwarding metric and the community-node forwarding metric corresponding to the encounter node attribute as the second forwarding metric (i.e., Figure 3 calculate the forwarding metrics CNFM(i) and CNFM(j) between communities and communities.

[0154] Step S44: Compare the first forwarding metric with the second forwarding metric, and determine the next node based on the metric comparison result.

[0155] Reference Figure 3 , in a specific implementation, after the above device selects a corresponding preset forwarding metric model according to the above self-node attributes, the above encounter node attributes, and the destination node attributes, it will compare the first forwarding metric and the second forwarding metric determined based on the preset forwarding metric model. When the above first forwarding metric is lower than the above second forwarding metric (i.e., Figure 3 CNFM(i) < CNFM(j), PNM(j) > PNM(i), BCFM(i) < BCFM(j), and ICFM(i) < ICFM(j) in Figure 3 ), the above current encounter node will be used as the next node (i.e., Figure 3 node i in

[0156] In addition, it should be noted that in this embodiment, when the above device's own node is a postal node and the current encounter node is not a postal node, or the device's own node is not a postal node and the current encounter node is a postal node, the device's own node will be used as the next node. When the above device's own node and the destination node do not belong to the same community and the current encounter node and the destination node belong to the same community, the above current encounter node will be used as the next node.

[0157] Based on the first embodiment and the second embodiment, in the third embodiment, the same or similar content as in the above-mentioned first embodiment and the above-mentioned second embodiment can be referred to the above introduction and will not be elaborated hereinafter. On this basis, please refer to Figure 4 , Figure 4 is the flowchart of the third embodiment of the energy-aware information forwarding method in the social Internet of Things proposed in this embodiment. Further, due to the limitations of network resources and the unpredictability of connection opportunities in the social Internet of Things, it is required to perform refined management of network routing strategies, especially when dealing with data packets of different sizes. In order to perform refined management of network routing strategies, before the step of determining the node with the minimum energy consumption based on the above self-node attributes, the above encounter node attributes, the above neighbor node attributes, and the above destination node attributes, the following steps are further included:

[0158] Step S301: Obtain the length of the data packet to be forwarded of the to-be-forwarded information;

[0159] It should be noted that the above length of the data packet to be forwarded can be the size of the data packet of the to-be-forwarded information, usually in bytes.

[0160] Step S302: Compare a preset data packet length threshold with the length of the data packet to be forwarded;

[0161] It should be noted that the above preset data packet length threshold can be a data packet size threshold preset by the user for distinguishing large data packets from small data packets.

[0162] Step S303: When the length of the data packet to be forwarded is not higher than the preset data packet length threshold, execute the step of determining the node with the minimum energy consumption based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node.

[0163] Reference Figure 3 , in a specific implementation, before calculating the node with the minimum energy loss, the above device also needs to obtain the data packet size of the information to be forwarded, and compare the data packet size with the preset data packet size threshold (i.e., whether the data packet size in Figure 3 is greater than the threshold). When the data packet size of the information to be forwarded is not higher than the preset data packet size threshold (i.e., the small data packet in Figure 3 ), determine the node with the minimum energy consumption based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node, and determine the next node based on the node with the minimum energy consumption and the current encountered node. After determining the next node, the above device sends the information to be forwarded to the next node.

[0164] In another example, after the step of comparing the preset data packet length threshold with the length of the data packet to be forwarded, the following is further included:

[0165] Step S3021: When the length of the data packet to be forwarded is higher than the preset data packet length threshold, determine whether there is a node with the minimum energy consumption based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node;

[0166] In a specific implementation, when the length of the data packet to be forwarded is higher than the preset data packet length threshold, since the process of finding the node with the minimum energy consumption itself consumes energy, it may exceed the energy cost of direct forwarding. Therefore, the above device sets an energy search upper limit. If the energy consumed during the search exceeds this upper limit, the above device will stop searching for the node with the minimum energy consumption and determine that the node with the minimum energy consumption does not exist. Otherwise, it is determined that the node with the minimum energy consumption exists.

[0167] Step S3022: When the node with the minimum energy consumption exists, determine the node with the minimum energy consumption based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node;

[0168] The step of determining the next node according to the current encounter node and the minimum energy consumption node and sending the information to be forwarded to the next node includes:

[0169] Step S41: When the current encounter node is the minimum energy consumption node, use the current encounter node as the next node and send the information to be forwarded to the next node;

[0170] Step S42: When the minimum energy consumption node exists and the current encounter node is not the minimum energy consumption node, send the information to be forwarded to the next node.

[0171] Reference Figure 3 , in a specific implementation, when the length of the data packet to be forwarded by the above device is higher than the preset data packet length threshold (i.e., the large data packet in Figure 3 ), the above device will, based on its own node attributes, encounter node attributes, neighbor node attributes, and destination node attributes, determine whether there is a minimum energy consumption node (i.e., does the minimum consumption node in Figure 3 exist). If there is a minimum energy consumption node, the device will further determine this node, use it as the next-hop node, and send the information to be forwarded to this node. Specifically, if the current encounter node is the minimum energy consumption node, the information will be directly sent to this node; if the minimum energy consumption node exists but is not the current encounter node, the information will be retained at its own node.

[0172] In another example, after the step of determining whether there is a minimum energy consumption node based on the above-mentioned own node attributes, encounter node attributes, neighbor node attributes, and destination node attributes, it further includes:

[0173] Step S3023: When the minimum energy consumption node does not exist, determine the first social intensity corresponding to the own node attributes and the second social intensity corresponding to the encounter node attributes based on a preset social intensity algorithm;

[0174] Step S3024: Compare the intensities of the first social intensity and the second social intensity, determine the next node according to the intensity comparison result, and send the information to be forwarded to the next node.

[0175] It should be noted that the Social Strength (SS) hypothesis assumes that over time, the social strength between individuals can gradually accumulate and change based on their interaction frequency and quality. The increment a represents the increment of social strength within the time interval Δt, and this increment depends on the interactions during this time period. The social strength SS(t) at a given time point t can be calculated based on the social strength at the previous time point t - Δt plus the increased social strength a(t) during this time period. The specific preset social strength algorithm formula is as follows:

[0176]

[0177] Among them, a(t) represents the change in social strength within the time interval Δt. a(t) can be calculated based on newly established mutual acquaintance relationships and one-sided acquaintance relationships. This can be expressed by the following formula:

[0178] a(t) = μ * M + ν * U;

[0179] Among them, M represents the number of newly established mutual acquaintance relationships. U represents the number of newly established one-sided acquaintance relationships. μ and ν are coefficients used to adjust the contributions of mutual acquaintance and one-sided acquaintance to the increase in social strength. μ >> ν. For M and U, if between time t and t - Δt, nodes i and j are neighbors, or the physical distance meets specific criteria, this relationship is defined as a mutual recognition (M) relationship. Similarly, if only one node knows the other party, this is regarded as a one-sided recognition (U) relationship.

[0180] It should be noted that the above preset social strength algorithm can be an algorithm for calculating the social strength between nodes. The preset social strength algorithm in this embodiment is as shown in the above preset social strength algorithm formula. The above first social strength can be the social strength calculated based on the attributes of its own node. The above second social strength can be the social strength calculated based on the attributes of the encountered node.

[0181] Reference Figure 3 , in a specific implementation, when the length of the data packet to be forwarded is higher than the preset data packet length threshold and the node with the minimum energy consumption does not exist, the above device will determine the first social strength corresponding to the attributes of its own node and the second social strength corresponding to the attributes of the encountered node (i.e., Figure 3 the social strengths SS(i) and SS(j) of nodes i and j in

[0182] Further, the step of comparing the first social intensity with the second social intensity and determining the next node according to the intensity comparison result includes:

[0183] Step S30241: When the first social intensity is higher than the second social intensity, use the own node as the next node;

[0184] Step S30242: When the first social intensity is lower than the second social intensity, use the current encounter node as the next node;

[0185] Step S30243: When the first social intensity is equal to the second social intensity, determine the first forwarding metric corresponding to the own node attribute and the second forwarding metric corresponding to the encounter node attribute based on the inter-community interaction model, compare the first social intensity with the second social intensity, and determine the next node according to the intensity comparison result.

[0186] Reference Figure 3 , in a specific implementation, the above device compares the first social intensity of its own node with the second social intensity of the current encounter node. If the first social intensity is higher than the second social intensity (i.e., SS(i)>SS(j) in Figure 3 ), the above device uses its own node as the next-hop node; if the first social intensity is lower than the second social intensity (i.e., SS(i)<SS(j) in Figure 3 ), the above device uses the current encounter node as the next-hop node. If the two are equal (i.e., SS(i)=SS(j) in Figure 3 ), the above device further determines the first forwarding metric and the second forwarding metric based on the inter-community interaction model (i.e., calculates the forwarding metrics BCFM(i) and BCFM(j) of community and community in Figure 3 ), and decides the next-hop node according to these metrics. When the first forwarding metric is lower than the second forwarding metric, use the above current encounter node as the next node, and when the above first forwarding metric is not lower than the second forwarding metric, use the above own node as the next node. Finally, the above device forwards the information to be forwarded to the next node. This routing optimization strategy based on data size and social intensity effectively combines network resource management and social network analysis, improves the transmission success rate of large data packets, and at the same time maintains the energy efficiency and social coherence of the network.

[0187] Based on the first embodiment, the second embodiment, and the third embodiment, in the fourth embodiment, the content that is the same as or similar to the above-mentioned first embodiment, second embodiment, and third embodiment can be referred to the above introduction and will not be elaborated hereinafter. It should be noted that in the social Internet of Things, due to the mobility of nodes and the intermittency of the network, information transmission often faces challenges. Especially in the case of network congestion or limited node capabilities, this embodiment proposes a dynamic response and congestion management mechanism (DRCM Mechanism). This mechanism includes two forwarding strategies: normal forwarding (i.e., the content of the above-mentioned first embodiment, second embodiment, and third embodiment) and fast forwarding (i.e., the content of this embodiment). Normal forwarding is applicable to environments with good network conditions and sufficient resources, and divides data packets into small data packets and large data packets, and adopts different forwarding strategies. The forwarding strategy is adjusted according to the size of the data packet. For small data packets, the path with the lowest energy consumption is selected for forwarding. For large data packets, the stability of transmission and the social attributes of nodes are considered. At the same time, when a node forwards information, it also needs to dynamically adjust the time-to-live (TTL) of the information according to the congestion status of the network to ensure that the information can reach the destination node in time. Optimize the TTL setting according to the real-time network status and the interaction information between nodes.

[0188] On this basis, please refer to Figure 5 , Figure 5 is a flowchart of the fourth embodiment of the energy-aware information forwarding method in the social Internet of Things proposed in this embodiment. Further, in order to ensure that the information can reach the destination node in time, before the step of determining neighbor nodes based on the attributes of the own node, it further includes:

[0189] Step S201: Obtain the time-to-live threshold and the current information time-to-live of the information to be forwarded, and compare the current information time-to-live with the time-to-live threshold;

[0190] Step S202: When the current information time-to-live is higher than the time-to-live threshold, execute the step of determining neighbor nodes based on the attributes of the own node.

[0191] It should be noted that the time-to-live (TTL) is a key indicator used to control the effective time and propagation range of information in the network. The above-mentioned current information time-to-live can be the current time-to-live of the information to be forwarded, indicating the remaining effective time of the information to be forwarded in the network. The above-mentioned time-to-live threshold can be a preset threshold used to judge whether the message still has enough time to propagate in the network.

[0192] Refer to Figure 3 , in the specific implementation, when the above device encounters the current encounter node (i.e., Figure 3When node i in [the context] encounters node j and needs to forward the information to the destination node d, it first obtains the preset time-to-live threshold and the current message time-to-live of the information to be forwarded. The above device compares the current message time-to-live with the time-to-live threshold (i.e., Figure 3 whether the TTL of the information m in [the context] is greater than the TTL threshold). If the current message time-to-live is higher than the time-to-live threshold, it means that the message still has enough time to spread in the network, and the device will execute the step of determining neighbor nodes based on its own node attributes in the previous embodiments.

[0193] In another example, after the step of comparing the current information time-to-live with the time-to-live threshold, it further includes:

[0194] Step S203: When the current information time-to-live is not higher than the time-to-live threshold, obtain a first interval distance based on the own node attributes and the destination node attributes, and obtain a second interval distance based on the current encounter node and the destination node;

[0195] Step S204: Compare the first interval distance with the second interval distance, determine the next node according to the distance comparison result, and send the information to be forwarded to the next node.

[0196] It should be noted that the above first interval distance can be the distance between the own node and the destination node, and the above second interval distance can be the distance between the current encounter node and the destination node. When calculating the distance, the Euclidean distance algorithm can be used for calculation. In this embodiment, the Euclidean distance is used for illustration, but this embodiment is not specifically limited.

[0197] Refer to Figure 3 In a specific implementation, when the above device determines that the current information time-to-live is not higher than the time-to-live threshold (i.e., Figure 3 fast forwarding in [the context]), when the above device processes message forwarding, it will calculate a first interval distance based on its own node attributes and the destination node attributes, and at the same time calculate a second interval distance based on the current encounter node and the destination node attributes (calculate the Euclidean distances ED(i) and ED(j) of nodes i and j). By comparing these two interval distances, the device selects the node with the shorter distance as the next-hop node (i.e., Figure 3 ED(j)>ED(i) in [the context]), and sends the information to be forwarded to this node.

[0198] In addition, before the start of this embodiment, the above device can also determine the above current encounter node and the above destination node, and determine whether the above current encounter node is the above destination node. If so, directly forward the information to be forwarded to the current encounter node. If not, execute the steps of the information forwarding method based on energy awareness in the social Internet of Things provided in this embodiment.

[0199] The first embodiment of the information forwarding device based on energy awareness in the social Internet of Things is also provided in this embodiment. Please refer to Figure 6 , Figure 6 which is the diagram of the information forwarding device based on energy awareness in the social Internet of Things provided in this embodiment. The information forwarding device based on energy awareness in the social Internet of Things includes:

[0200] An acquisition module, configured to obtain its own node attributes and the encounter node attributes of the current encounter node when detecting an encounter with the current encounter node, and obtain the destination node attributes of the destination node according to the information to be forwarded carried;

[0201] A search module, configured to determine neighbor nodes based on the above own node attributes, and obtain the neighbor node attributes of the neighbor nodes;

[0202] A calculation module, configured to determine the node with the minimum energy consumption based on the above own node attributes, the encounter node attributes, the neighbor node attributes, and the destination node attributes;

[0203] A forwarding module, configured to determine the next node according to the current encounter node and the node with the minimum energy consumption, and send the information to be forwarded to the next node.

[0204] The information forwarding device based on energy awareness in the social Internet of Things provided in this embodiment adopts the information forwarding method based on energy awareness in the social Internet of Things in the above embodiment, and can solve the technical problem that the overall energy utilization efficiency of the information forwarding network is relatively low due to the failure to consider the impact of energy consumption on information forwarding in the prior art. Compared with the prior art, the beneficial effects of the information forwarding device based on energy awareness in the social Internet of Things provided in this embodiment are the same as those of the information forwarding method based on energy awareness in the social Internet of Things provided in the above embodiment, and other technical features in the information forwarding device based on energy awareness in the social Internet of Things are the same as the features disclosed in the method of the above embodiment, and will not be elaborated here.

[0205] This embodiment provides an information forwarding device based on energy awareness in a social Internet of Things. The device includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the information forwarding method based on energy awareness in the social Internet of Things in the first embodiment above.

[0206] Reference is made below to Figure 7 , Figure 7 FIG. is a schematic structural diagram suitable for implementing the information forwarding device based on energy awareness in the social Internet of Things in this embodiment. The information forwarding device based on energy awareness in the social Internet of Things in the embodiments of the present application may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions: tablet computers), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 7 The information forwarding device based on energy awareness in the social Internet of Things shown is merely an example and should not impose any limitations on the functions and usage scope of the embodiments of the present application.

[0207] As Figure 7As shown in the figure, the energy-aware information forwarding device in the social Internet of Things may include a processing device 1001 (such as a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM: Read Only Memory) 1002 or the program loaded from the storage device 1003 into the random access memory (RAM: Random Access Memory) 1004. In the RAM 1004, various programs and data required for the operation of the energy-aware information forwarding device in the social Internet of Things are also stored. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other through a bus 1005. The input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD: Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the information forwarding device to communicate with other devices wirelessly or wiredly to exchange data. Although the figure shows an information forwarding device with various systems, it should be understood that it is not required to implement or have all the shown systems. Instead, more or fewer systems can be implemented or had.

[0208] The energy-aware information forwarding device in the social Internet of Things provided in this embodiment adopts the energy-aware information forwarding method in the social Internet of Things in the above embodiment, and can solve the technical problem that in the prior art, the impact of energy consumption on information forwarding is not considered, resulting in a low overall energy utilization efficiency of the information forwarding network. Compared with the prior art, the beneficial effects of the energy-aware information forwarding device in the social Internet of Things provided in this embodiment are the same as those of the energy-aware information forwarding method in the social Internet of Things provided in the above embodiment, and other technical features in this device are the same as those disclosed in the method of the previous embodiment, and will not be elaborated here.

[0209] It should be understood that each part disclosed in this embodiment can be implemented by hardware, software, firmware, or a combination of them. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in a suitable manner in any one or more embodiments or examples.

[0210] As described above, it is only the specific implementation manner of this embodiment, but the protection scope of this embodiment is not limited thereto. Any person skilled in the art within the technical scope disclosed by this embodiment can easily think of changes or substitutions, which should all be covered within the protection scope of this embodiment. Therefore, the protection scope of this embodiment shall be subject to the protection scope of the claims.

[0211] The above is only some embodiments, and thus does not limit the patent scope of this embodiment. Any equivalent structural transformation made under the technical concept of this application by using the content of the specification and drawings of this application, or directly / indirectly applied in other related technical fields, is included within the patent protection scope of this application.

Claims

1. An information forwarding method based on energy awareness in a social Internet of Things, characterized in that The method includes: When detecting an encounter with the current encounter node, obtain the attributes of its own node and the encounter node attributes of the current encounter node, and obtain the destination node attributes of the destination node according to the information to be forwarded carried; Determine neighbor nodes based on the attributes of its own node, and obtain the neighbor node attributes of the neighbor nodes; Determine the node with the minimum energy consumption based on the attributes of its own node, the encounter node attributes, the neighbor node attributes, and the destination node attributes; Determine the next node according to the current encounter node and the node with the minimum energy consumption, and send the information to be forwarded to the next node.

2. The method according to claim 1, wherein The step of determining the node with the minimum energy consumption based on the attributes of its own node, the encounter node attributes, the neighbor node attributes, and the destination node attributes includes: Determine the current energy consumption for forwarding the information to be forwarded to the destination node through the current encounter node based on the attributes of its own node, the encounter node attributes, and the destination node attributes; Determine the neighbor energy consumption for forwarding the information to be forwarded to the destination node through the neighbor node according to the attributes of its own node, the neighbor node attributes, and the destination node attributes; Compare the current energy consumption with each neighbor energy consumption for energy comparison, and determine the minimum energy consumption and the node with the minimum energy consumption corresponding to the minimum energy consumption based on the energy comparison result.

3. The method according to claim 1, characterized in that, The step of determining the next node according to the current encounter node and the node with the minimum energy consumption includes: Compare the current encounter node with the node with the minimum energy consumption; When the current encounter node is the node with the minimum energy consumption, use the current encounter node as the next node; When the current encounter node is not the node with the minimum energy consumption, determine the first forwarding metric corresponding to the attributes of its own node and the second forwarding metric corresponding to the encounter node attributes based on a preset forwarding metric model; Compare the first forwarding metric with the second forwarding metric for metric comparison, and determine the next node based on the metric comparison result.

4. The method according to claim 3, wherein Before the step of determining the node with the minimum energy consumption based on the attributes of its own node, the encounter node attributes, the neighbor node attributes, and the destination node attributes, it further includes: Obtain the length of the data packet to be forwarded of the information to be forwarded; Compare a preset data packet length threshold with the length of the data packet to be forwarded; When the length of the data packet to be forwarded is not higher than the preset data packet length threshold, execute the step of determining the node with the minimum energy consumption based on the attributes of its own node, the encounter node attributes, the neighbor node attributes, and the destination node attributes.

5. The method according to claim 4, characterized in that, After the step of comparing the preset data packet length threshold with the length of the data packet to be forwarded, it further includes: When the length of the data packet to be forwarded is higher than the preset data packet length threshold, determine whether there is a node with the minimum energy consumption based on the attributes of its own node, the encounter node attributes, the neighbor node attributes, and the destination node attributes; When the minimum energy consumption node exists, determine the minimum energy consumption node based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node; The step of determining the next node according to the current encountered node and the minimum energy consumption node, and sending the information to be forwarded to the next node includes: When the current encountered node is the minimum energy consumption node, use the current encountered node as the next node, and send the information to be forwarded to the next node; When the minimum energy consumption node exists and the current encountered node is not the minimum energy consumption node, send the information to be forwarded to the next node.

6. The method according to claim 5, wherein After the step of determining whether there is a minimum energy consumption node based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node, further include: When the minimum energy consumption node does not exist, determine the first social strength corresponding to the attributes of the own node and the second social strength corresponding to the attributes of the encountered node based on a preset social strength algorithm; Compare the first social strength with the second social strength, determine the next node according to the result of the strength comparison, and send the information to be forwarded to the next node.

7. The method according to claim 1, characterized in that Before the step of determining neighbor nodes based on the attributes of the own node, further include: Obtain the survival time threshold and the current information survival time of the information to be forwarded, and compare the current information survival time with the survival time threshold; When the current information survival time is higher than the survival time threshold, execute the step of determining neighbor nodes based on the attributes of the own node.

8. The method according to claim 7, wherein After the step of comparing the current information survival time with the survival time threshold, further include: When the current information survival time is not higher than the survival time threshold, obtain the first interval distance based on the attributes of the own node and the attributes of the destination node, and obtain the second interval distance based on the current encountered node and the destination node; Compare the first interval distance with the second interval distance, determine the next node according to the result of the distance comparison, and send the information to be forwarded to the next node.

9. An information forwarding device based on energy awareness in a social Internet of Things, characterized in that The device includes: An acquisition module, configured to, when detecting an encounter with a current encountered node, acquire the attributes of the own node and the attributes of the encountered node of the current encountered node, and acquire the attributes of the destination node of the destination node according to the information to be forwarded carried; A search module, configured to determine neighbor nodes based on the attributes of the own node, and acquire the attributes of the neighbor nodes of the neighbor nodes; A calculation module, configured to determine the minimum energy consumption node based on the attributes of the own node, the attributes of the encountered node, the attributes of the neighbor nodes, and the attributes of the destination node; A forwarding module, configured to determine the next node according to the current encountered node and the minimum energy consumption node, and send the information to be forwarded to the next node.

10. An information forwarding device based on energy awareness in a social Internet of Things, characterized in that, The device includes: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the method for energy-aware information forwarding in the social Internet of Things according to any one of claims 1 to 8.

Citation Information

Patent Citations

  • Self-adaptive transmitting method based on node transmission performance in opportunity network

    CN106102116A

  • Social Internet of Things routing method and device, equipment and storage medium

    CN116319546A

  • Method and device for forwarding data packets

    WO2011145027A1