CN110035008B - Content distribution method based on coverage rate dynamic adjustment in node ad hoc network - Google Patents

Content distribution method based on coverage rate dynamic adjustment in node ad hoc network Download PDF

Info

Publication number
CN110035008B
CN110035008B CN201810027211.2A CN201810027211A CN110035008B CN 110035008 B CN110035008 B CN 110035008B CN 201810027211 A CN201810027211 A CN 201810027211A CN 110035008 B CN110035008 B CN 110035008B
Authority
CN
China
Prior art keywords
node
content
coverage rate
neighbor
nodes
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
Application number
CN201810027211.2A
Other languages
Chinese (zh)
Other versions
CN110035008A (en
Inventor
尤佳莉
薛寒星
张欣
王劲林
刘学
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Acoustics CAS
Beijing Hili Technology Co Ltd
Original Assignee
Institute of Acoustics CAS
Beijing Hili Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Institute of Acoustics CAS, Beijing Hili Technology Co Ltd filed Critical Institute of Acoustics CAS
Priority to CN201810027211.2A priority Critical patent/CN110035008B/en
Publication of CN110035008A publication Critical patent/CN110035008A/en
Application granted granted Critical
Publication of CN110035008B publication Critical patent/CN110035008B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/806—Broadcast or multicast traffic
    • 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
    • H04L67/104—Peer-to-peer [P2P] networks
    • 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
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a content distribution method based on coverage rate dynamic adjustment in a node ad hoc network, which comprises the following steps: when a content source node distributes content with a certain coverage rate requirement in a node ad hoc network constructed by a network state, the rest nodes in the network determine the minimum distance with the content source node according to the broadcast information of the content source node; the node dynamically adjusts the coverage rate requirement of the node on the content according to the minimum distance, and increases the coverage rate requirement of the node close to the content source node on the content to utilize idle resources of more nodes to promote distribution; when the coverage rate of the node does not meet the requirement in the distribution process and a neighbor node is selected, the transmission gain to the neighbor node and the uploading bandwidth available to the neighbor node are comprehensively considered, and the node with the maximum comprehensive index is selected for distribution; the content is distributed to the whole network through the continuous diffusion of the neighbor nodes, and finally the coverage rate of each node in the network to the content meets the requirement.

Description

Content distribution method based on coverage rate dynamic adjustment in node ad hoc network
Technical Field
The invention relates to the field of communication technology and content distribution networks, in particular to a content distribution method based on coverage rate dynamic adjustment in a node ad hoc network.
Background
With the rapid expansion of P2P networks, resource sharing among users is a good mode for relieving server stress. Therefore, the P2P network is built under the traditional CDN, and the pressure of the server can be relieved while the service quality of the user is ensured. Because of the limited storage capacity of the user nodes, the nodes can only store a limited amount of content. Therefore, for the content with extremely high part of heat and extremely high user access probability, the edge server or the content source node can distribute the content to the whole network according to a certain local coverage rate, so that all nodes in the network can meet the coverage rate requirement. When a user wants to access the content, the content can be quickly acquired from the local or neighbor node, so that the quality of service is ensured, and the pressure of the edge server is reduced.
Most of the existing content distribution methods are used for distributing files from a single node to all nodes in a network, so that the method for quickly and efficiently distributing hot content from a content source node to the whole network according to the specified coverage rate has important research value. Under the condition that the node can only obtain the file content from one-hop neighbors, when the default coverage rate of the file is low and the file is kept unchanged in the distribution process, the number of cached copies in the neighbors of part of the nodes is too small, and the distribution of the part of the nodes is slow, so that the time for completing the distribution of the whole network is influenced. In essence, when the size of the node is large, the number of neighbor nodes of each node is large, and the distribution of the content can be effectively assisted by fully utilizing the node resources close to the content source node in the ad hoc network. The coverage rate of the node close to the content source node is partially improved, the idle time period existing after the initial partial node completes the requirement of the default coverage rate is utilized, the number of copies of the file is increased, the distribution of partial nodes at the later stage of the whole distribution is assisted, and the distribution rate of the whole network is improved. Therefore, it is necessary to propose a method for content fast distribution in a node ad hoc network based on coverage rate dynamic adjustment, so that a node can utilize known local connection information and the hop count of the node itself with a content source node in the ad hoc network, fully utilize its resources, dynamically adjust the coverage rate, and quickly spread content from the source node to the entire network according to a certain coverage rate.
Disclosure of Invention
The invention aims to overcome the defects existing in content distribution by using coverage rate, and provides a content distribution method based on coverage rate dynamic adjustment in a node ad hoc network. Content is quickly and efficiently distributed from a single source node throughout the network with a coverage rate such that the coverage rate of the content by all nodes in the network meets default requirements.
In order to achieve the above object, the present invention discloses a content distribution method based on coverage rate dynamic adjustment in a node ad hoc network, wherein the method comprises:
when a content source node distributes content with a certain coverage rate requirement in a node ad hoc network constructed by a network state, the rest nodes in the network determine the minimum distance with the content source node according to the broadcast information of the content source node; the node dynamically adjusts the coverage rate requirement of the node on the content according to the minimum distance, and increases the coverage rate requirement of the node close to the content source node on the content to utilize idle resources of more nodes to promote distribution; when the coverage rate of the node does not meet the requirement in the distribution process and a neighbor node is selected, the transmission gain to the neighbor node and the uploading bandwidth available to the neighbor node are comprehensively considered, and the node with the maximum comprehensive index is selected for distribution; the content is distributed to the whole network through the continuous diffusion of the neighbor nodes, and finally the coverage rate of each node in the network to the content meets the requirement.
As an improvement of the above method, the method specifically comprises:
step 1) the nodes construct a neighbor relation by selecting nodes with better network states with the nodes, and a node ad hoc network is formed;
step 2) the content source node broadcasts the message of the distributed content through a node ad hoc network, the node determines the minimum hop count with the content source node, and the content source node starts to distribute after determining the maximum value of the minimum hop count with all nodes in the network;
step 3) each node dynamically adjusts the coverage rate of the node about the content according to the minimum hop count of the node and the content source node and the maximum value of the minimum hop count in the network;
step 4), the nodes which possess the content or receive the diffusion instruction calculate the coverage rate of the content at present, and judge whether the coverage rate at present meets the coverage rate requirement after dynamic adjustment; if the coverage rate meets the requirement, sending diffusion instructions to all the neighbor nodes, and otherwise, turning to the step 5);
step 5) each neighbor node which does not cache the content calculates the cache gain brought to the network by caching the content;
step 6) the content source node selects the node with the maximum comprehensive index for distribution according to the received cache gain of the neighbor node which does not cache the content, and simultaneously considering the transmission cost between the content source node and the uploading bandwidth which can be participated in distribution by the neighbor node;
and 7) continuously calculating the coverage rate of the current content after the distribution is finished, and jumping to the step 4) until the coverage rate of the node on the content meets the coverage rate requirement after the dynamic adjustment.
As an improvement of the above method, the step 2) specifically includes:
step 201) the content source node broadcasts the content message to be distributed through the node ad hoc network;
step 202) the node determines the minimum hop count of the node and a content source node according to the minimum forwarding times of the received content message, and the node forwards information to a neighbor node after updating the minimum hop count;
step 203) after the node confirms the shortest distance with the content source node, the node sends distance information to the content source node;
step 204) the content source node starts to distribute the content after determining the node hop number with the maximum distance from the node in the network according to the received distance information.
As an improvement of the above method, the coverage rate of the dynamic adjustment node with respect to the content in step 3) is dynamically adjusted by using an exponential decay function, and the coverage rate adjustment formula is as follows:
Figure BDA0001545351580000031
in the above formula, NiRepresenting nodes i, FjRepresenting content j, Covdr(Ni,Fj) Represents the coverage rate, Cov, of the node i after dynamically adjusting the content jd(Fj) Indicates the default coverage, L, of content jiRepresenting the shortest distance of node i from the content source node in the ad hoc network, and α representing the attenuation factor, i.e., the number of hops of the node that is the largest in the network from the content source node.
As an improvement of the above method, in the step 4), the coverage rate is a percentage of the number of copies of the content in the node and all the neighboring nodes of the node to the number of neighboring nodes including the node.
As an improvement of the above method, the cache gain of step 5) is a change caused by the local node and the neighbor node meeting the coverage rate requirement after the node caches the content, and the change includes a local cache gain and a neighbor cache gain;
the calculation formula is as follows:
Figure BDA0001545351580000032
wherein the content of the first and second substances,
Figure BDA0001545351580000033
representing node m caching content jThe gain of the buffer is increased by the gain of the buffer,
Figure BDA0001545351580000034
the local gain is represented by the gain of the local,
Figure BDA0001545351580000035
representing the neighbor gain;
the calculation formula of the local cache gain is as follows:
Figure BDA0001545351580000036
wherein, Cov (N)m,Fj) Representing the current coverage of content j by node m, Covs(Nm,Fj) Representing the coverage rate of the node m after caching the content j;
the calculation formula of the neighbor cache gain is as follows:
Figure BDA0001545351580000041
wherein the content of the first and second substances,
Figure BDA0001545351580000042
representing the set of nodes in the neighbor list that contain node m.
As an improvement of the above method, the step 6) specifically includes:
step 601) the source node collects the cache gain and uploading bandwidth of all neighbor nodes which do not cache the content;
step 602) the source node calculates the transmission cost for transmitting the content to the neighbor node:
Figure BDA0001545351580000043
wherein the content of the first and second substances,
Figure BDA0001545351580000044
representing the transmission cost, FS (F), of the content j from node i to node mj) Indicates the size of content j, B (N)i,Nm) Representing the bandwidth between node i and node m, HC (N)i,Nm) The hop count of the logic topology between the node i and the node m is represented, and HF represents an influence factor of the hop count on transmission cost;
step 603) the source node calculates the transmission gain corresponding to each neighbor node which does not cache the content according to the received cache gain and the calculated transmission cost:
Figure BDA0001545351580000045
wherein the content of the first and second substances,
Figure BDA0001545351580000046
representing the transmission gain of node i for transmitting content j to node m;
step 604) the source node normalizes the calculated transmission gain and uploading bandwidth of the neighbor node and calculates a comprehensive index:
Figure BDA0001545351580000047
wherein the content of the first and second substances,
Figure BDA0001545351580000048
and
Figure BDA0001545351580000049
respectively representing the normalized transmission gain and upload bandwidth, wdbfAnd wubRepresenting the corresponding weight, Cm,jThen represents the final node m's synthetic index with respect to the file j;
step 605) the source node selects the neighbor node with the maximum comprehensive index and not caching the content for distribution:
Figure BDA00015453515800000410
Figure BDA00015453515800000411
representing a node NiSet of neighbor nodes of, NmIs a certain node in the neighbor set, NcFor the final selected from the neighbor nodes with the maximum composite index Cm,jOf the neighboring node.
The invention has the advantages that:
1. the method provided by the invention can enable the nodes in the network to utilize the known local information, dynamically adjust the coverage rate to fully utilize the resources of the nodes according to the shortest distance between the nodes and the content source node in the self-organized network, continuously select the node with the maximum comprehensive index to distribute the content, and realize that the file is quickly and efficiently diffused to the whole network from the content source node according to a certain coverage rate;
2. the method of the invention has better effect in the occasion with lower coverage rate requirement of the content.
Drawings
Fig. 1 is a flowchart of a content distribution method based on coverage rate dynamic adjustment in a node ad hoc network according to the present invention.
Detailed Description
The technical solution of the present invention will be described in detail below with reference to the accompanying drawings.
As shown in fig. 1, a content distribution method based on coverage rate dynamic adjustment in a node ad hoc network includes:
step 1) the nodes construct a neighbor relation by selecting nodes with better network states with the nodes, and a node ad hoc network is formed;
and step 2) the content source node broadcasts the distribution message through the ad hoc network, and the node determines the minimum hop count with the content source node. The content source node starts to distribute after determining the maximum hop count with the nodes in the network;
the step 2) further comprises the following steps:
step 201) taking a node with content as a content source node, and broadcasting a content message to be distributed through an ad hoc network;
step 202) the node determines the minimum hop count of the node and a content source node according to the minimum forwarding times of the received content message, and in order to avoid the broadcast information from infinitely circulating in the network to form a storm, the node forwards the information to a neighbor node only after updating the minimum hop count;
step 203) after the node finally confirms the shortest distance with the content source node, the node sends distance information to the content source node under the condition that the shortest distance is larger;
step 204) the content source node starts to distribute the content after determining the node hop number with the maximum distance from the node in the network through the received distance information.
The content source node broadcasts and distributes the information of the content through the ad hoc network. And the node determines the minimum hop count between the node and the content source node according to the received message with the minimum forwarding times. In order to avoid the broadcast information from circulating in the network infinitely to form a storm, the node can forward the information to the neighbor node only after the minimum hop count is updated.
And 3) each node dynamically adjusts the coverage rate of the node relative to the content according to the minimum hop count of the node and the content source node and the maximum value of the minimum hop count in the network.
The dynamic adjustment method is to dynamically adjust the coverage rate by an exponential decay function.
The specific attenuation formula is:
Figure BDA0001545351580000061
in the above formula, NiRepresenting nodes i, FjRepresenting content j, Covdr(Ni,Fj) Represents the coverage rate, Cov, of the node i after dynamically adjusting the content jd(Fj) Indicates the default coverage, L, of content jiRepresenting the shortest distance of node i from the content source node in the ad hoc network, and α representing the attenuation factor, here the hop count of the node that is the largest distance from the content source node in the network.
And 4) calculating the current coverage rate of the content by the node which has the content or receives the diffusion instruction, and judging whether the current coverage rate meets the coverage rate requirement after dynamic adjustment.
The coverage rate in the step is the proportion of the number of neighbors (including the self) storing the required film in the neighbors to the total number of the neighbors, and is marked as Cov, and the value range is more than or equal to 0 and less than or equal to 1.
And 5) if the coverage rate meets the requirement, sending a diffusion instruction to all the neighbor nodes. If the coverage rate does not meet the requirement, each neighbor node which does not cache the content calculates the gain brought to the network by caching the content.
The step 5) further comprises the following steps:
step 501) when the current coverage rate does not meet the coverage rate requirement after dynamic adjustment, the neighbor node of the node which does not cache the content calculates the cache gain of the current cache content;
step 502) the cache gain comprises a local cache gain and a neighbor cache gain, and the specific calculation mode is as follows:
Figure BDA0001545351580000062
wherein
Figure BDA0001545351580000063
The cache gain of the cache content j of the node m is shown,
Figure BDA0001545351580000064
the local gain is represented by the gain of the local,
Figure BDA0001545351580000065
representing the neighbor gain.
The calculation formula of the local cache gain is as follows:
Figure BDA0001545351580000066
wherein Cov (N)m,Fj) Representing the current coverage of content j by node m, Covs(Nm,Fj) Indicating the coverage rate of the node m after caching the content j.
The calculation formula of the neighbor cache gain is as follows:
Figure BDA0001545351580000071
wherein
Figure BDA0001545351580000072
Representing the set of nodes in the neighbor list that contain node m.
Step 6), the source node greedily selects the node with the maximum comprehensive index for distribution according to the received cache gain of the neighbor node which does not cache the content and considering the transmission cost between the source node and the uploading bandwidth of the neighbor node;
step 6) further comprises:
step 601) the source node collects the cache gain and upload bandwidth of all neighbor nodes which do not cache the content;
step 602) the source node calculates the transmission cost for transmitting the content to the neighboring node, and the specific calculation formula is as follows:
Figure BDA0001545351580000073
wherein
Figure BDA0001545351580000074
Representing the transmission cost, FS (F), of the content j from node i to node mj) Indicates the size of content j, B (N)i,Nm) Representing the bandwidth between node i and node m, HC (N)i,Nm) The hop count of the logic topology between the node i and the node m is represented, and HF represents an influence factor of the hop count on transmission cost;
step 603) the source node calculates the transmission gain corresponding to each neighbor node which does not cache the content according to the received cache gain and the calculated transmission cost. The calculation formula of the transmission gain is as follows:
Figure BDA0001545351580000075
wherein
Figure BDA0001545351580000076
Representing the transmission gain of node i for transmitting content j to node m.
Step 604) the node carries out corresponding normalization on the calculated transmission gain and the uploading bandwidth of the neighbor node and then synthesizes the normalization result to obtain a comprehensive index of the gain and the bandwidth.
Figure BDA0001545351580000077
Wherein
Figure BDA0001545351580000078
And
Figure BDA0001545351580000079
respectively representing the normalized transmission gain and upload bandwidth, wdbfAnd wubRepresenting the corresponding weights. Cm,jIt represents the composite index of the final node m with respect to the file j.
Step 605) the node selects the neighbor node which has the maximum comprehensive index and does not cache the content for distribution;
the mathematical representation is as follows:
Figure BDA00015453515800000710
Figure BDA00015453515800000711
representing a node NiSet of neighbor nodes of, NmIs a certain node in the neighbor set, NcFor the final selected from the neighbor nodes with the maximum composite index Cm,jOf the neighboring node.
And 7) continuously calculating the current file coverage rate after the distribution is finished, and jumping to the step 4) until the coverage rate of the node on the content meets the coverage rate requirement after the dynamic adjustment.
Finally, it should be noted that the above embodiments are only used for illustrating the technical solutions of the present invention and are not limited. Although the present invention has been described in detail with reference to the embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (4)

1. A content distribution method based on coverage rate dynamic adjustment in a node ad hoc network comprises the following steps:
when a content source node distributes content with a certain coverage rate requirement in a node ad hoc network constructed by a network state, the rest nodes in the network determine the minimum distance with the content source node according to the broadcast information of the content source node; the node dynamically adjusts the coverage rate requirement of the node on the content according to the minimum distance, and increases the coverage rate requirement of the node close to the content source node on the content to utilize idle resources of more nodes to promote distribution; when the coverage rate of the node does not meet the requirement in the distribution process and a neighbor node is selected, the transmission gain to the neighbor node and the uploading bandwidth available to the neighbor node are comprehensively considered, and the node with the maximum comprehensive index is selected for distribution; distributing the content to the whole network through continuous diffusion of neighbor nodes, and finally enabling the coverage rate of each node in the network to the content to meet the requirement;
the method specifically comprises the following steps:
step 1) the nodes construct a neighbor relation by selecting nodes with better network states with the nodes, and a node ad hoc network is formed;
step 2) the content source node broadcasts the message of the distributed content through a node ad hoc network, the node determines the minimum hop count with the content source node, and the content source node starts to distribute after determining the maximum value of the minimum hop count with all nodes in the network;
step 3) each node dynamically adjusts the coverage rate of the node about the content according to the minimum hop count of the node and the content source node and the maximum value of the minimum hop count in the network;
step 4), the nodes which possess the content or receive the diffusion instruction calculate the coverage rate of the content at present, and judge whether the coverage rate at present meets the coverage rate requirement after dynamic adjustment; if the coverage rate meets the requirement, sending diffusion instructions to all the neighbor nodes, and otherwise, turning to the step 5);
step 5) each neighbor node which does not cache the content calculates the cache gain brought to the network by caching the content;
step 6) the content source node selects the node with the maximum comprehensive index for distribution according to the received cache gain of the neighbor node which does not cache the content, and simultaneously considering the transmission cost between the content source node and the uploading bandwidth which can be participated in distribution by the neighbor node;
step 7), after distribution is finished, the coverage rate of the current content is continuously calculated, and the step 4) is skipped until the coverage rate of the node on the content meets the coverage rate requirement after dynamic adjustment;
the coverage rate of the dynamic adjustment node about the content in the step 3) is dynamically adjusted by adopting an exponential decay function, and the adjustment formula of the coverage rate is as follows:
Figure FDA0002473037850000011
in the above formula, NiRepresenting nodes i, FjRepresenting content j, Covdr(Ni,Fj) Represents the coverage rate, Cov, of the node i after dynamically adjusting the content jd(Fj) Indicates the default coverage, L, of content jiRepresenting the shortest distance of the node i from the content source node in the ad hoc network, and α representing the attenuation factor, i.e. the hop count of the node in the network that is the largest distance from the content source node;
the cache gain of the step 5) is the change brought by the local node and the neighbor node meeting the coverage rate requirement after the node caches the content, wherein the cache gain comprises the local cache gain and the neighbor cache gain;
the calculation formula is as follows:
Figure FDA0002473037850000021
wherein the content of the first and second substances,
Figure FDA0002473037850000022
the cache gain of the cache content j of the node m is shown,
Figure FDA0002473037850000023
the local gain is represented by the gain of the local,
Figure FDA0002473037850000024
representing the neighbor gain;
the calculation formula of the local cache gain is as follows:
Figure FDA0002473037850000025
wherein, Cov (N)m,Fj) Representing the current coverage of content j by node m, Covs(Nm,Fj) Representing the coverage rate of the node m after caching the content j;
the calculation formula of the neighbor cache gain is as follows:
Figure FDA0002473037850000026
wherein the content of the first and second substances,
Figure FDA0002473037850000027
representing the set of neighbor nodes of node m.
2. The method for distributing content in a node ad hoc network based on coverage dynamic adjustment according to claim 1, wherein the step 2) specifically comprises:
step 201) the content source node broadcasts the content message to be distributed through the node ad hoc network;
step 202) the node determines the minimum hop count of the node and a content source node according to the minimum forwarding times of the received content message, and the node forwards information to a neighbor node after updating the minimum hop count;
step 203) after the node confirms the shortest distance with the content source node, the node sends distance information to the content source node;
step 204) the content source node starts to distribute the content after determining the node hop number with the maximum distance from the node in the network according to the received distance information.
3. The method according to claim 2, wherein in step 4), the coverage is a percentage of the number of copies of the content in the node and all neighboring nodes of the node to the number of neighboring nodes including the node.
4. The method for distributing content in a node ad hoc network based on coverage dynamic adjustment according to claim 3, wherein the step 6) specifically comprises:
step 601) the source node collects the cache gain and uploading bandwidth of all neighbor nodes which do not cache the content;
step 602) the source node calculates the transmission cost for transmitting the content to the neighbor node:
Figure FDA0002473037850000031
wherein the content of the first and second substances,
Figure FDA0002473037850000032
representing the transmission cost, FS (F), of the content j from node i to node mj) Indicates the size of content j, B (N)i,Nm) Representing the bandwidth between node i and node m, HC (N)i,Nm) The hop count of the logic topology between the node i and the node m is represented, and HF represents an influence factor of the hop count on transmission cost;
step 603) the source node calculates the transmission gain corresponding to each neighbor node which does not cache the content according to the received cache gain and the calculated transmission cost:
Figure FDA0002473037850000033
wherein the content of the first and second substances,
Figure FDA0002473037850000034
representing the transmission gain of node i for transmitting content j to node m;
step 604) the source node normalizes the calculated transmission gain and uploading bandwidth of the neighbor node and calculates a comprehensive index:
Figure FDA0002473037850000035
wherein the content of the first and second substances,
Figure FDA0002473037850000036
and
Figure FDA0002473037850000037
respectively representing the normalized transmission gain and upload bandwidth, wdbfAnd wubRepresenting the corresponding weight, Cm,jThen represents the final node m's synthetic index with respect to the file j;
step 605) the source node selects the neighbor node with the maximum comprehensive index and not caching the content for distribution:
Figure FDA0002473037850000038
Figure FDA0002473037850000039
set of neighbor nodes, N, representing node imAs a set of neighbor nodes
Figure FDA00024730378500000310
A certain node of, NcFor the final selected from the neighbor nodes with the maximum composite index Cm,jOf the neighboring node.
CN201810027211.2A 2018-01-11 2018-01-11 Content distribution method based on coverage rate dynamic adjustment in node ad hoc network Active CN110035008B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810027211.2A CN110035008B (en) 2018-01-11 2018-01-11 Content distribution method based on coverage rate dynamic adjustment in node ad hoc network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810027211.2A CN110035008B (en) 2018-01-11 2018-01-11 Content distribution method based on coverage rate dynamic adjustment in node ad hoc network

Publications (2)

Publication Number Publication Date
CN110035008A CN110035008A (en) 2019-07-19
CN110035008B true CN110035008B (en) 2020-08-18

Family

ID=67234346

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810027211.2A Active CN110035008B (en) 2018-01-11 2018-01-11 Content distribution method based on coverage rate dynamic adjustment in node ad hoc network

Country Status (1)

Country Link
CN (1) CN110035008B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112469008B (en) * 2020-11-27 2022-07-05 重庆电讯职业学院 Content distribution method and device based on D2D reliability

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103618675A (en) * 2013-11-11 2014-03-05 西安交通大学 Content-network-oriented content-influence-based caching method
CN104270751A (en) * 2014-04-19 2015-01-07 湘潭大学 Security protocol based on received signal intensity in wireless sensor network
CN105991378A (en) * 2015-02-15 2016-10-05 华为技术有限公司 3D-mesh network-based point-to-multipoint communication method and communication node

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102546775B (en) * 2011-12-27 2015-05-20 中兴通讯股份有限公司 Node in CDN (content delivery network) and automatic networking method thereof
CN107179954B (en) * 2017-04-25 2020-07-31 内蒙古科技大学 Distributed social network privacy protection method for keeping node reachability

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103618675A (en) * 2013-11-11 2014-03-05 西安交通大学 Content-network-oriented content-influence-based caching method
CN104270751A (en) * 2014-04-19 2015-01-07 湘潭大学 Security protocol based on received signal intensity in wireless sensor network
CN105991378A (en) * 2015-02-15 2016-10-05 华为技术有限公司 3D-mesh network-based point-to-multipoint communication method and communication node

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
车载自组网中基于发布/订阅的数据分发的技术研究;吕希来;《中国优秀硕士论文库工程科技2辑》;20180110;全文 *

Also Published As

Publication number Publication date
CN110035008A (en) 2019-07-19

Similar Documents

Publication Publication Date Title
Zhang et al. Hierarchical caching for statistical QoS guaranteed multimedia transmissions over 5G edge computing mobile wireless networks
Siris et al. Efficient proactive caching for supporting seamless mobility
Zhang et al. Toward concurrent video multicast orchestration for caching-assisted mobile networks
CN108834080B (en) Distributed cache and user association method based on multicast technology in heterogeneous network
CN109194763B (en) Caching method based on small base station self-organizing cooperation in ultra-dense network
CN106851741B (en) Distributed mobile node file caching method based on social relation in cellular network
CN101640699A (en) P2P streaming media system and streaming media downloading method thereof
Jiang et al. Efficient D2D content caching using multi-agent reinforcement learning
CN108259628B (en) Content caching and user association joint optimization method in heterogeneous cellular network
CN108600998B (en) Cache optimization decision method for ultra-density cellular and D2D heterogeneous converged network
CN106973360B (en) Caching strategy and excitation method of D2D communication network
CN110138836A (en) It is a kind of based on optimization energy efficiency line on cooperation caching method
CN113271353B (en) Satellite-oriented data cache terminal selection method and device
CN108322352B (en) Honeycomb heterogeneous caching method based on inter-group cooperation
CN115001537B (en) Routing networking method of carrier communication system based on clustering algorithm
CN110035008B (en) Content distribution method based on coverage rate dynamic adjustment in node ad hoc network
CN104158904A (en) Cloud-assisted cooperative downloading method of mobile P2P network
Tran et al. Spectrum sharing and power allocation optimised multihop multipath D2D video delivery in beyond 5G networks
CN110324175B (en) Network energy-saving method and system based on edge cache
CN110139125B (en) Video sharing method based on demand perception and resource caching in wireless mobile network
Choi et al. Probabilistic caching policy for categorized contents and consecutive user demands
CN108668288B (en) Method for optimizing small base station positions in wireless cache network
Liu et al. Joint optimization of server placement and content caching in mobile edge computing networks
CN109194767A (en) A kind of flow medium buffer dispatching method suitable for mixing network
KR101048016B1 (en) Method for forming P2P overlay network, terminal for P2P overlay network, and method and apparatus for managing P2P overlay network

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