CN111614771B - Content caching method for content-centric Internet of things - Google Patents
Content caching method for content-centric Internet of things Download PDFInfo
- Publication number
- CN111614771B CN111614771B CN202010450687.4A CN202010450687A CN111614771B CN 111614771 B CN111614771 B CN 111614771B CN 202010450687 A CN202010450687 A CN 202010450687A CN 111614771 B CN111614771 B CN 111614771B
- Authority
- CN
- China
- Prior art keywords
- content
- cache
- node
- network
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y10/00—Economic sectors
- G16Y10/75—Information technology; Communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Abstract
The invention provides a content caching method of a content center internet of things, which comprises the following specific steps: s1, the network node cache spaces are all in an idle state, and the cache spaces with the size of p cache contents are divided into areas to be sunk and marked as areas D, and the rest spaces are marked as areas R as the rest areas; s2, calculating the expected profit change rate delta E of all cache contents cached by the network node, distributing the cache contents into an R area or a D area according to the sequence of the expected profit change rate delta E from large to small, firstly distributing the cache contents to the R area, distributing the contents exceeding the size limit of the R area into the D area, and deleting the cache contents if the contents produced by the node per se exist in the D area; and if the cache content allocated into the D area exceeds the space size limit, deleting the excess cache content. The invention can provide faster content request response, improve the effective utilization rate of the cache space and reduce the energy consumption of the whole network.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a content caching method of a content center internet of things.
Background
With the rapid development of the technology of the internet of things, the number of devices in the internet of things is increasing explosively, and the application scenario of the internet of things has been continuously permeated from the separately deployed industrial scenario to personal and commercial applications. Relevant predictive data shows that the number of globally active internet of things devices will exceed 200 billion in 2025. How to realize interconnection and intercommunication of massive internet of things devices and efficient distribution of content information provides a serious challenge for a unified internet of things architecture system. Network element devices of the internet of things are typically resource-constrained as compared to the core network, which is very limited in computing power, memory space, and network transmission bandwidth. In addition, the internet of things has high heterogeneity, the processing capacity of sensing node equipment is different, and the communication technology between nodes is greatly different from the standard. In terms of network energy consumption, most node devices are powered by independent batteries, and the energy consumption of computing processing and network transmission is strongly limited. Conventional IP networks are designed to ensure efficient communication between hosts. To accommodate the above-mentioned characteristics of the internet of things, many research projects have completed a great deal of communication protocol development work, which involves ranging from the data link layer up to the application layer. However, the internet of things is naturally content-centric, and the user is interested in the data detected by the perceiving device, not in his specific network location. An IP-centric network architecture limits efficient acquisition and distribution of content in the internet of things.
Content Centric Networking (CCN) is a new network framework, which adopts a design principle that Content is separated from location, and provides a new way for Content distribution. Compared with an IP network, the CCN takes the named content as the center of the network, and does not depend on end-to-end connection when the content is distributed. In addition, the CCN naturally supports the in-network caching technology, and a user can hit the cache on a content request path, so that the network acquisition delay is reduced, and the network load is reduced. In the CCN network architecture, core components of the CCN include a Content Store (CS), a Forwarding Information Base (FIB), and a Pending Interest Table (PIT). Communication between nodes in a CCN network is accomplished primarily through interest packets as well as data packets. The interest packet is sent by the content request node and carries information such as a content name. The data packet is sent by a content provider, and may be a content source node or a cache node, and the data packet carries data information of the requested content.
When a node receives an interest request packet, firstly, whether a complete matching item exists or not is inquired in a CS table of the node. And if the matching item is found, forwarding the data from the port which receives the interest packet. Otherwise, whether a matching item exists or not is searched in the PIT, if yes, the node receives the request with the same content before, the port receiving the interest packet at this time is added to the PIT entry, and the interest packet is discarded. Otherwise, adding a new entry in the PIT entry, inquiring a corresponding entry in the FIB table in a maximum prefix matching mode, and forwarding the interest packet according to a port specified by the entry. And when the node receives the data packet, inquiring a matching item in the PIT according to the content name. And if the data packet exists, forwarding the data packet according to the port specified by the entry, executing a cache function according to a cache strategy, and deleting the corresponding entry in the PIT after the forwarding is finished. If not, the data packet is directly discarded.
In a content-centric internet of things, the CCN caching technology can effectively improve content distribution efficiency, reduce content acquisition delay and network load, and cache content at each node of a return path of a data packet. Common CCN caching techniques include path caching and probability caching, which determine whether to cache content according to a fixed probability or a calculated dynamic probability value.
The classic content center network cache strategy does not effectively manage the multi-version content in the Internet of things, and the invalid content cache cannot be timely cleaned.
In addition, for example, caching along a path or probabilistic caching also causes a large amount of cache redundancy in the network, and thus, an effective cache space is wasted. The content distribution efficiency of the internet of things is low, and the user experience is poor. The network characteristics of the internet of things need to be fully considered before the existing CCN content caching method is directly applied to the scene of the internet of things. Firstly, most of the internet of things belong to a wireless network scene, and the existing caching method is mainly proposed for a wired CCN network. Secondly, the internet of things equipment is resource-limited in terms of computing capacity, content space size and energy supply (battery independent power supply), and the existing content caching method is poor in cache space efficiency and energy consumption performance. Finally, the content objects researched by the existing content caching method are all multimedia and other information which does not change along with time, the same named content in the internet of things has different attribute values at different times, and for example, environmental temperature information detected by a sensing device changes along with time. The freshness of the contents of the internet of things can be specifically required by the user. The existing content caching method can indiscriminately cache content information of different versions, and effective content which does not meet the requirement of freshness of users cannot be timely and effectively cleaned. Therefore, the existing CCN content caching method cannot provide good caching performance in the scene of the Internet of things.
Disclosure of Invention
The invention provides a content caching method of a content center internet of things, which aims at the time-varying characteristic of the content of the internet of things, considers the timeliness and freshness of the content, can provide faster content request response, improves the effective utilization rate of a caching space, and reduces the energy consumption of the whole network.
The invention discloses a content caching method of a content center Internet of things, which comprises the following specific steps:
s1, the network node cache spaces are all in an idle state, and the cache spaces with the size of p cache contents are divided into areas to be sunk and marked as areas D, and the rest spaces are marked as areas R as the rest areas;
s2, calculating the expected profit change rate delta E of all cache contents cached by the network node, distributing the cache contents into an R area or a D area according to the sequence of the expected profit change rate delta E from large to small, firstly distributing the cache contents to the R area, distributing the contents exceeding the size limit of the R area into the D area, and deleting the cache contents if the contents produced by the node per se exist in the D area; if the cache content distributed into the D area exceeds the space size limit, deleting the exceeding cache content;
s3, when the network node receives the interest request packet of the local content, generating a fresh content, and performing primary cache arrangement on the node cache space content and the newly generated content; the network node organizes and sends Hello;
when the network receiving node receives the Hello packet, sending a receiving confirmation message to a corresponding node according to the difference of the Hello message from the node;
and the network node receives the cache receiving confirmation message and deletes the corresponding cache content from the cache space.
Further, step S1 further includes: the internet of things is abstracted into a tree network, the gateway node is a root node, the interest request path is a tree path, and node neighbor nodes are marked as father nodes, child nodes and the like according to the tree network.
Further, the rate of change Δ E of the expected revenue of the cache content may be expressed as: Δ E ═ k (τ)m+gm-t)λmδ, where k is a fixed parameter, δ denotes the transmission time required for a one-hop network request, τmIs the freshness requirement of the content by the requestor, gmIs the generation time of the cache contents, t represents the current time, λmIs the poisson parameter of the cached content.
Further, step S2 further includes: where k is 4 τm。
Further, step S3 further includes: before the network node sends the Hello packet, the node cache space is subjected to cache arrangement once, and cache information with the maximum delta E in the R region and all cache information in the D region are added into the Hello packet and are respectively called as R information and D information.
Further, step S3 further includes: when the network node receives the Hello packet, if the Hello message is from the child node, performing one-time caching and sorting on the node caching space content and the R information in the Hello message, if the R information is distributed to the R area, sending a receiving confirmation message to the child node, and otherwise, deleting the R information.
Further, step S3 further includes: when the network node receives the Hello packet, if the Hello message is from the father node and the D information of the Hello message has the cache information uploaded by the current node, the network node receives the cache information and performs cache arrangement once, and then sends a receiving confirmation message to the father node.
Further, the number of content cache copies is limited to one, and the cache copies can only be moved between neighboring nodes.
Further, the network nodes transmit information in a wireless communication mode.
Aiming at the problems that the existing content caching method of the content-centric network does not fully consider the network characteristics and the content characteristics of the scene of the Internet of things and the limitations of the computing capacity, the storage capacity and the battery energy of the nodes of the Internet of things, the existing content caching method is directly used for the Internet of things and the problems of heavy processing burden and influence on the life cycle of the Internet of things are solved.
The caching method provided by the invention is applied to the Internet of things, and has the advantages that the overall network protocol is simple, and the method is friendly to equipment with limited computing capability; the utilization rate of the cache space is improved, and the method is friendly to equipment with limited content space; the time delay for obtaining the user content is reduced; the energy consumption of node network activities is reduced, and the life cycle of the whole network is prolonged; the requirement of freshness of the content when the user requests the content is supported, and the content received by the user is guaranteed to be effective.
The content caching method of the content center internet of things network of the present invention is further described with reference to the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art according to the drawings.
Fig. 1 is a structural diagram of an internet of things scenario in an embodiment of the invention;
fig. 2 is a schematic flow chart of a content caching method of a content-centric internet of things according to an embodiment of the present invention;
the method comprises the following steps that 1 gateway, 2 Internet of things equipment, 3 content routing paths, 4 wireless communication links, and a, b, c, d, e, f, g and h are network nodes.
Detailed Description
The technical solutions in the embodiments of the present application are clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In addition, in the description of the present invention, "a plurality" means two or more unless otherwise specified. In the present specification, the term "step" is used to mean not only an independent step but also a step that is not clearly distinguished from other steps, provided that the action intended by the step is achieved. In addition, the numerical range represented by "-" in the present specification means a range in which numerical values recited before and after "-" are included as a minimum value and a maximum value, respectively. In the drawings, elements having similar or identical structures are denoted by the same reference numerals.
Fig. 1 is a structural diagram of a physical network scenario to which the embodiment of the present invention is applied. Referring to fig. 1, the content caching method of the content-centric internet of things of the present invention is described in detail. In fig. 1, the network is composed of a gateway node 1 and other common network nodes of the internet of things, content requests of external users are forwarded into the network through the gateway node 1, and the network nodes perform networking communication according to a CCN protocol. The routing strategy of the content interest packet is realized according to the principle of the shortest path, from the content distribution perspective, the network can be abstracted into a tree network, and the gateway node is the root node of the tree network. In view of the characteristic that response data in the content-centric network returns along the forwarding path of the interest request, only the cache closest to the gateway node will be hit when caching multiple copies of the content on the path.
The caching method for the physical network limits the number of the cached copies of the content to one, and the cached copies can only move on the node of the source request path of the content. When the cache copy is invalid, the processing node actively deletes the cache information and continuously forwards the interest request of the content to the content source node, thereby generating the content of a new version. In a content center Internet of things scene, information is transmitted between network nodes in a wireless communication mode, so that the nodes can periodically send Hello packets to surrounding nodes, and the nodes which successfully receive the Hello information can return response information so as to maintain the neighbor relation between the network nodes.
The invention provides a new content caching method by utilizing natural support of a wireless communication channel to broadcast, which extracts relevant caching information of a node and carries the information in a Hello packet, and realizes the movement of cache through the exchange of the caching information between adjacent nodes, thereby improving the caching efficiency. The neighbor node needs to calculate the expected revenue of the content cache, so as to make a decision whether to perform cache exchange.
Fig. 2 is a flowchart of a content caching method according to an embodiment of the present invention, and the content caching method is described in more detail below with reference to fig. 2.
S1, initialization step:
101: the internet of things is abstracted into a tree network, the gateway node is a root node, and the interest request path is a tree path. The neighbor nodes are labeled as parent nodes, child nodes, and others according to the stub network.
In the flowchart of fig. 2, different network nodes, i.e., a network node a, a network node b, a network node c, a network node d, a network node e, a network node f, a network node g, and a network node h, are represented by different letters, respectively, where the network node a is a parent node of the network node b and the network node c, and the network node b and the network node c are child nodes of the network node a; the network node c is a father node of the network node e and the network node f, and the network node e and the network node f are child nodes of the network node c. And so on for relationships between other network nodes.
102: the cache spaces of the network nodes are all in an idle state, wherein the cache spaces with the size of p cache contents are divided as areas to be sunk and are marked as D areas, and the rest spaces are residual areas and are marked as R areas.
The cache content information of the node is shown in table 1, where the downstream node information records a path from the cache node where the cache content is located to the source node. Taking the cache content aaa as an example, if the network node where the cache content is currently located is the network node c, the source node is the network node e, and the path from the node c to the source node e is c → e.
Table 1:
s2, cache sorting:
201: the network node calculates the change rate delta E of the expected profit of all the cached contents, distributes the cached contents into the R area or the D area according to the sequence from the big delta E to the small delta E, distributes the cached contents to the R area first, and distributes the contents exceeding the size limit of the R area into the D area. If the content produced by the node of the D area exists, deleting the cache content; if the cache content distributed into the D area exceeds the space size limit, deleting the exceeding cache content;
the following describes in detail the calculation process of the content cache expected revenue:
the overall network contains N network nodes and M content, with Ν {1, 2.., N } representing the set of network nodes and M {1, 2.., M } representing the set of all content that the network nodes are capable of producing. The total number of network nodes and the total number of contents are denoted by N ═ Ν | and M ═ M | respectively. The content information in the scene of the internet of things is related to the node equipment producing the content or the position of the node equipment, such as environment information such as temperature, humidity and the like detected by the equipment, wherein S is { S ═ S1,s2,...,sMDenotes a network node that produces the corresponding content. Meanwhile, the node devices of the internet of things are generally resource-limited devices, so that the space for caching contents by the network nodes is limited. In order to simplify the processing of the problem, assuming that each node has a caching function, the caching space size of the node is the same and the size of each content is also the same, and the caching space size limit of the node is expressed by the maximum cacheable content number q of each node.
In a network scene, the interest request of an external user to each content is an independent Poisson random process, and the Poisson parameter of each content is represented by Λ ═ λ1,λ2,...,λMRepresents it. Considering that contents in the scene of the internet of things have certain timeliness, therefore, a content requester has certain requirements on freshness of the contents, and the maximum lifetime Γ ═ τ { τ } which the requester can tolerate the obtained contents is used1,τ2,...,τMRepresents the content freshness requirement. The content generation time G ═ G1,g2,...,gMThe difference between the generation time of the content and the current time is the survival time of the content. The poisson parameter and freshness parameter of each content remain unchanged for a longer period of timeAnd (6) changing.
The content cost function represents the benefit of caching a certain content m on a certain network node n, and the cached benefit can be reflected in two aspects, namely the reduction of content acquisition delay and the reduction of network transmission energy. Both of these are directly related to the forward hop count reduction of interest requests on cache hits, where δ represents the required transmission time for a one-hop network request. As mentioned above, the request process of each content obeys poisson distribution, and the expected hit number of the cached content is in direct proportion to the remaining lifetime of the content, so the content cost function is a function related to time, and the cost function of the content m cached on the network node n is expressed as:
wherein k is a fixed coefficient in equation (1), δ represents a transmission time required for a one-hop network request,
indicating the shortest hop distance from the cache node to the source node, i.e. the saved hop count for forwarding the interest request on a cache hit, τmIs the freshness requirement of the content by the requestor, gmIs the generation time of the cache contents, t represents the current time, λmIs the poisson parameter of the cached content.
The benefit of the overall lifetime of the cached content should satisfy the following equation:
wherein, the right part in the formula (2) is the profit of the content complete survival time, the left part is the integration result of the profit function in the content survival time, and the two are equal; so that k is 4 τm。
In the content caching method of the present invention, the cached content copy can only move between neighboring nodes, and then the rate of change of the expected revenue of the cached content can be expressed as:
ΔE＝k(τm+gm-t)λmδ (3)
where k is a fixed parameter in equation (3), δ is a transmission time required for a network request of one hop, and in practical applications, the average value of the network request times of multiple hops may be taken, and it may be considered here to be also a constant value. The other parameters are the attribute values of the content, and the calculation results of the attributes are used as the decision basis for exchanging cache between the neighboring nodes. Based on k being a fixed parameter, equation (3) can also be expressed as:
s3, cache exchange step:
301: when the network node receives the interest request packet of the local content, it generates a new content, and performs a cache sorting on the node cache space content and the newly generated content as a whole (please refer to S2).
302: before sending the Hello packet, the network node adds the cache information with the maximum delta E in the R region and all the cache information in the D region into the Hello packet, which are respectively called as R information and D information.
Take the example of table 1 as an example, where R information is the first row of the R area in table 1 and D information is all the contents of the D area.
303: when the network node receives the Hello packet, if the Hello message is from the child node, performing a cache arrangement on the node cache space content of the current network node and the whole R information in the Hello message (please refer to S2), if the R information in the Hello message is distributed to the R area of the current network node, sending a reception confirmation message to the child node, otherwise, deleting the R information in the Hello message.
304: when the network node receives the Hello packet, if the Hello message is from the parent node and the D information of the Hello packet includes the cache information uploaded by the current network node, the network node receives the cache information and performs cache arrangement (please refer to S2), and then sends a reception confirmation message to the parent node.
305: and if the network node receives the cache receiving confirmation message, deleting the corresponding cache content from the cache space.
In the embodiment shown in fig. 2, in step 303, the Hello packet of the node c is received by all the neighboring nodes a, b, e, f, wherein only the parent node and the child node of c process the information related to the Hello packet and the cache, the specific R information is processed by the parent node a of c, and the D information is processed by the child nodes e, f of c. When the node a receives the Hello packet of the node c, if the node a has a free buffer space and the R information of the Hello packet can be received to the R area of the node a after the buffer finishing step (step S2), the node a receives the buffer content (updates the downstream node information) and sends a reception confirmation message to the node c. In response to receiving the confirmation message, node c deletes the corresponding cache contents from its cache space (step 305).
In step 304, when the nodes e and f receive the Hello packet of the node c, the nodes e and f process the cache information that the first downstream node of the cache contents in the D information is the current node, and record the cache information as the D information of the current node, and receive the cache contents and send a reception confirmation message to the node c when the nodes e and f have a free cache space. In response to receiving the confirmation message, node c deletes the corresponding cache contents from its cache space (step 305).
In fig. 2, the content ddd in the area D of the node c is processed by the downstream node e (the first downstream node of the cached content ddd), and the content eee is processed by the downstream node f (the first downstream node of the cached content eee).
The caching method is that through the exchange work among the parent network nodes and the child network nodes, the content with higher caching value is pushed to the network nodes closer to the gateway node. The D area is set in the node cache space to play a role of buffering, and the content exceeding the size limit of the cache space in the cache exchange process is prevented from being roughly discarded. This sacrifices a small portion of the cache space, but overall cache utilization is improved. The size p value of the D area can be adjusted and observed to obtain the optimal empirical value.
The invention overcomes the defects of the existing content center Internet of things:
the method comprises the steps that firstly, the time-varying characteristic of the content of the Internet of things is considered, the attribute of freshness is added to the content, and cache content with invalid freshness in the network is removed in time;
secondly, the CCN technology is applied to the scene of the Internet of things, and the content distribution efficiency of the Internet of things is improved by utilizing the in-network cache characteristic;
thirdly, the characteristic of broadcasting of a wireless network channel is fully utilized, and the cache information of the node is carried in the periodic broadcasting information;
and fourthly, redundancy of cache information is controlled, and especially in a network scene of a single request source node, the number of content copies is limited to one.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application. It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (9)
1. A content caching method of a content center Internet of things comprises the following specific steps:
s1, the network node cache spaces are all in an idle state, and the cache spaces with the size of p cache contents are divided into areas to be sunk and marked as areas D, and the rest spaces are marked as areas R as the rest areas;
s2, calculating the expected profit change rate delta E of all cache contents cached by the network node, distributing the cache contents into an R area or a D area according to the sequence of the expected profit change rate delta E from large to small, firstly distributing the cache contents to the R area, distributing the contents exceeding the size limit of the R area into the D area, and deleting the cache contents if the contents produced by the node per se exist in the D area; if the cache content distributed into the D area exceeds the space size limit, deleting the exceeding cache content;
wherein, still include the following step:
s3, when the network node receives the interest request packet of the local content, generating a fresh content, and performing primary cache arrangement on the node cache space content and the newly generated content; the network node organizes and sends Hello;
when the network receiving node receives the Hello packet, sending a receiving confirmation message to a corresponding node according to the difference of the Hello message from the node;
and the network node receives the cache receiving confirmation message and deletes the corresponding cache content from the cache space.
2. The content caching method for the content-centric internet of things according to claim 1, wherein the step S1 further comprises: the internet of things is abstracted into a tree network, the gateway node is a root node, the interest request path is a tree path, and the neighbor nodes are marked as father nodes and child nodes according to the tree network.
3. The content caching method of the content-centric internet of things according to claim 2, wherein the change rate Δ E of the expected profit of the cached content is represented as: Δ E ═ k (τ)m+gm-t)λmδ, where k is a fixed parameter, δ denotes the transmission time required for a one-hop network request, τmIs the freshness requirement of the content by the requestor, gmIs the generation time of the cache contents, t represents the current time, λmIs the poisson parameter of the cached content.
4. The content caching method for the content-centric internet of things as claimed in claim 3, wherein k-4/τm。
5. The content caching method for the content-centric internet of things according to claim 3, wherein the step S3 further comprises: before the network node sends the Hello packet, the node cache space is subjected to cache arrangement once, and cache information with the maximum delta E in the R region and all cache information in the D region are added into the Hello packet and are respectively called as R information and D information.
6. The content caching method for the content-centric internet of things according to claim 5, wherein the step S3 further comprises: when the network node receives the Hello packet, if the Hello message is from the child node, performing one-time caching and sorting on the node caching space content and the R information in the Hello message, if the R information is distributed to the R area, sending a receiving confirmation message to the child node, and otherwise, deleting the R information.
7. The content caching method for the content-centric internet of things according to claim 5, wherein the step S3 further comprises: when the network node receives the Hello packet, if the Hello message is from the father node and the D information of the Hello message has the cache information uploaded by the current node, the network node receives the cache information and performs cache arrangement once, and then sends a receiving confirmation message to the father node.
8. The content caching method of the content-centric internet of things according to any one of claims 1 to 7, wherein the number of cached copies of content is limited to one, and cached copies can only be moved between neighboring nodes.
9. The content caching method for the content-centric internet of things according to any one of claims 1 to 7, wherein the network nodes transmit information by wireless communication.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010450687.4A CN111614771B (en) | 2020-05-25 | 2020-05-25 | Content caching method for content-centric Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010450687.4A CN111614771B (en) | 2020-05-25 | 2020-05-25 | Content caching method for content-centric Internet of things |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111614771A CN111614771A (en) | 2020-09-01 |
| CN111614771B true CN111614771B (en) | 2021-07-13 |
Family
ID=72202316
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010450687.4A Active CN111614771B (en) | 2020-05-25 | 2020-05-25 | Content caching method for content-centric Internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111614771B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103634231A (en) * | 2013-12-02 | 2014-03-12 | 江苏大学 | Content popularity-based CCN cache partition and substitution method |
| CN104253851A (en) * | 2014-03-11 | 2014-12-31 | 哈尔滨工程大学 | Node grouping method for data caching in mobile CCN (content-concentric network) |
| CN105022700A (en) * | 2015-07-17 | 2015-11-04 | 哈尔滨工程大学 | Named data network cache management system based on cache space division and content similarity and management method |
| CN105407055A (en) * | 2015-12-30 | 2016-03-16 | 深圳先进技术研究院 | Energy consumption control method of content center network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102100710B1 (en) * | 2012-11-26 | 2020-04-16 | 삼성전자주식회사 | Method for transmitting packet of node and content owner in content centric network |
| CN103001870B (en) * | 2012-12-24 | 2015-10-07 | 中国科学院声学研究所 | A kind of content center network works in coordination with caching method and system |
| CN108965479B (en) * | 2018-09-03 | 2021-04-20 | 中国科学院深圳先进技术研究院 | Domain collaborative caching method and device based on content-centric network |
-
2020
- 2020-05-25 CN CN202010450687.4A patent/CN111614771B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103634231A (en) * | 2013-12-02 | 2014-03-12 | 江苏大学 | Content popularity-based CCN cache partition and substitution method |
| CN104253851A (en) * | 2014-03-11 | 2014-12-31 | 哈尔滨工程大学 | Node grouping method for data caching in mobile CCN (content-concentric network) |
| CN105022700A (en) * | 2015-07-17 | 2015-11-04 | 哈尔滨工程大学 | Named data network cache management system based on cache space division and content similarity and management method |
| CN105407055A (en) * | 2015-12-30 | 2016-03-16 | 深圳先进技术研究院 | Energy consumption control method of content center network |
Non-Patent Citations (2)
| Title |
|---|
| Proactive Edge Caching in Content-Centric Networks With Massive Dynamic Content Requests;xiaogeng xu et al;《IEEE Aceess》;20200408;全文 * |
| 信息中心网络缓存技术研究综述;张天魁;《北京邮电大学学报》;20160630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111614771A (en) | 2020-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ding et al. | Peer-to-peer file-sharing over mobile ad hoc networks | |
| Cao et al. | Cooperative cache-based data access in ad hoc networks | |
| Fang et al. | A survey of energy-efficient caching in information-centric networking | |
| De Castro et al. | A dynamic hierarchical VANET architecture for named data networking applications | |
| CN108173903B (en) | Application method of autonomous system cooperation caching strategy in CCN | |
| CN112399485A (en) | CCN-based new node value and content popularity caching method in 6G | |
| Liu et al. | A novel cooperative caching scheme for content centric mobile ad hoc networks | |
| Majeed et al. | Pre-caching: A proactive scheme for caching video traffic in named data mesh networks | |
| Hoh et al. | P2p file sharing system over manet based on swarm intelligence: A cross-layer design | |
| Li et al. | An aggregatable name-based routing for energy-efficient data sharing in big data era | |
| Kuppusamy et al. | A review of cooperative caching strategies in mobile ad hoc networks | |
| CN108183867B (en) | Information center network node cache replacement method | |
| CN111614771B (en) | Content caching method for content-centric Internet of things | |
| Yang et al. | Content-based hyperbolic routing and push mechanism in named data networking | |
| Hwang et al. | Cross-layer design of P2P file sharing over mobile ad hoc networks | |
| Jain et al. | Cooperative caching strategy in mobile ad hoc networks for cache the replaced data item | |
| Delvadia et al. | CCJRF-ICN: A novel mechanism for coadjuvant caching joint request forwarding in information centric networks | |
| Yu et al. | A performance comparison of flat and cluster based routings in mobile ad hoc networks | |
| Meka et al. | Efficient simulation architecture for routing and replication in mobile peer to peer network of UAVs | |
| Sheeba et al. | Enhanced cache sharing through cooperative data cache approach in MANET | |
| Alduayji et al. | PF-EdgeCache: Popularity and freshness aware edge caching scheme for NDN/IoT networks | |
| Lilly Sheeba et al. | Collaborative clustering for cooperative caching in mobile Ad Hoc networks | |
| Shanmugavadivu et al. | Caching technique for improving data retrieval performance in mobile ad hoc networks | |
| Murali et al. | Cached data access in MANET employing AODV protocol | |
| Tsuchida et al. | Replica arrangement for location dependent data in consideration of network partition in ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |