CN104394545B - A kind of network-caching method of content oriented - Google Patents
A kind of network-caching method of content oriented Download PDFInfo
- Publication number
- CN104394545B CN104394545B CN201410526621.3A CN201410526621A CN104394545B CN 104394545 B CN104394545 B CN 104394545B CN 201410526621 A CN201410526621 A CN 201410526621A CN 104394545 B CN104394545 B CN 104394545B
- Authority
- CN
- China
- Prior art keywords
- node
- virtual community
- content
- base station
- management node
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of network-caching method of content oriented, including：Base station divides virtual community in each update cycle and selects Virtual Community Management node；The network topology selection independent sets set that base station is formed using Virtual Community Management node；Base station randomly chooses virtual community corresponding to an independent sets and carries out content caching；Notice selected virtual community in base station carries out content caching, and sends content to corresponding Virtual Community Management node；Receive the node that the Virtual Community Management node of content caching instruction is cached using broad sense dominant set algorithms selection to content；Content is cached Virtual Community Management node notice selected node and the content is sent to the node；Selected node caches to content.
Description
Technical field
The present invention relates to a kind of mobile radio network method for managing system, in particular to the network-caching side of content oriented
Method.
Background technology
Van Jacobson are one of initiator and NDN project Primary Actors of content center network CCN frameworks.He in
Deliver within 2009《Networking Named Content》Itd is proposed in one text, " CCN content storage in ip router with delaying
Rush that memory operation principle is similar, simply follow different replacement policies.Due to IP packets belong to one it is specific point-to-point
Session, value is just lost after next-hop is forwarded to, therefore after the completion of forwarding, IP can forget this packet and clear at once
Empty buffer memory.Different from IP, CCN content-datas can be used as potential useful information to service more clients (for example, multiple
User reads identical electronic newspaper or viewing identical YouTube video).In order to maximize the probability of lifting data sharing,
To obtain minimum up demand bandwidth and downlink data transmission time delay, the content being cached to up to node that CCN should grow as far as possible
Data ".In brief, CCN each router can be by way of caching by way of the copy of content of itself, to reduce
Network node obtains time and the bandwidth cost of content.It is described along path cache (On-Path Caching) mechanism via
CCNx protocol realizations.But due to being proposed along path cache policy under core net scene, especially suitable for hierarchical network
And tree topology, and multi-hop relay cellular network has the characteristics of node equality and mesh topology, can not along path caching
Realize that copy of content is sunk, the lifting contribution to content obtaining efficiency is limited.Further, using along path cache policy, it is buffered
Copy of content is in linear radiation, and the path of copy of content caching is closely related with demand user position, copy of content
The whole network distribution it is uncontrollable.Finally, cache along path and gradually triggered by user's request, the benefit of content caching need according to
Accumulation by the time could embody, it is particularly disadvantageous in Hot Contents the whole network quick distribution and deployment.
The content of the invention
To solve the deficiencies in the prior art, it is an object of the invention to provide a kind of network-caching method of content oriented.
In order to realize above-mentioned target, the present invention adopts the following technical scheme that：
A kind of network-caching method of content oriented, this method include：Base station divides virtual community in each update cycle
And select Virtual Community Management node；The network topology selection independent sets set that base station is formed using Virtual Community Management node；
Base station randomly chooses virtual community corresponding to an independent sets and carries out content caching；Notice selected virtual community in base station is carried out
Content caching, and send content to corresponding Virtual Community Management node；Receive the virtual community pipe of content caching instruction
The node that reason node is cached using broad sense dominant set algorithms selection to content；Virtual Community Management node notice is selected
Node is cached to content and the content is sent into the node；Selected node caches to content.
Further, the Virtual Community Management node for receiving content caching instruction utilizes broad sense dominant set algorithms selection pair
The node that content is cached concretely comprises the following steps：
For node u, N is definedi(u) node set with node u distances i jump scopes, d (u)=N are representedi(u) N is representedi
(u) nodes in, defined herein as the node u broad sense number of degrees,
Step 1：Management node all node bulletins into community need to be buffered the size b of content；
Step 2：Ordinary node checks self residual electricity E, if E >=Eth, then node to management node send participate in content
Caching selection mark 1, otherwise sends 0, wherein, Eth=B (EbB), EthFor minimum dump energy thresholding, EbRepresent that node often caches
The electricity of 1 bit contents consumption, B are the parameter more than 1；
Step 3：The node that management node identifies the selection as participation content caching 0 is put into node set R, will be identified as 1
Node be put into node set W；
Step 4：Initialization starting node setJ=1, management node calculate in community and are each denoted as white
Node the broad sense number of degrees, and number of degrees identical nodes are put into same node set；
Step 5：A=A ∪ AjIf A is unsatisfactory for | A | >=| V | × r%, wherein r ∈ (0,100), | V | represent all nodes
Number, then j=j+1, A=A ∪ Aj；If A meets | A | >=| V | × r%, set A are that required start node combines, and are skipped to
Step 7.
Step 6：Repeat step 5；
Step 7：Randomly choose a node v in start node set A to be put into dominant set D as start node, i.e. D
={ v }, and by Ni(v) node in ∩ W is put into set G, i.e. G=Ni(v) ∩ W, remove in set W and be put into set G and set
D node, i.e. W=W-G-D, remove set N in set Ri(v) node in, i.e. R=R-Ni(v)∩R；
Step 8：Recalculate the N of all node u in set Gi(u) the node number d ' (u) in, wherein d ' (u) are represented
(Ni(u)∩W)∪(Ni(u) ∩ R) interior nodes number；
Step 9：The maximum node of rear d ' (u) will be recalculated and be put into set D, and remove the section in set D in set G
Put and add Ni(u) node in ∩ W, i.e. G=G ∪ (Ni(u) ∩ W)-G ∩ D, remove set N in set Wi(u) in ∩ W
Node, i.e. W=W-Ni(u) ∩ W, set N is removed in set Ri(v) node in ∩ R, i.e. R=R-Ni(v)∩R；
Repeat step 8-9 untilThen now the node in set D forms broad sense dominant set.
Further, base station interacts with the Virtual Community Management node in dominant set, and management node confirms to carry out
The content is sent to corresponding management node by base station after caching.
Further, management node is also required to participate in the selection of broad sense dominant set, but in order to ensure that management node can be with
Continue management work, its minimum dump energy thresholding is higher than Eth。
Further, when there is new content to be cached, if for a certain start node and according to the starting section
Node battery electric quantity in the broad sense dominant set of point selection is all higher than Eth, then only need directly to enter content using the broad sense dominant set
Row storage is without recalculating broad sense dominant set.
Further, base station divides virtual community in each update cycle and selects the specific of Virtual Community Management node
Step is：Base station obtains cell multihop network topology information；Base station utilizes preset rules according to cell multihop network topology information
Divide virtual community；Base station selects a node within each virtual community, as Virtual Community Management node；Base station notifies
The ID of virtual community ID and the virtual community of each node where it virtual management node, notifies Virtual Community Management section
Route between the ID and management node of other Virtual Community Management nodes of point.
Further, the network topology that base station is formed using Virtual Community Management node selects the specific of independent sets set
Step is：The set that base station generation Virtual Community Management node is formed；Base station generates independent sets set.
Further, the set that generation Virtual Community Management node in base station is formed includes：Base station utilizes network multi-hop
The set that topology information generation Virtual Community Management node is formedWhereinVirtual Community Management node set is represented,
AndThen represent the link set between Virtual Community Management node；IfFor unconnected graph, then forwarded by ordinary node, will
Isolated node is connected to the reachable Virtual Community Management node of minimum forwarding hop count, to form connected graph.
Further, generation independent sets set in base station includes：The minimum node of sequence number is put into first independent sets；
Start to check each independent sets according to the sequence number of node is ascending, if all nodes are all boundless in node and independent sets,
The node is added into the independent sets and continues to check next independent sets；If node and all independent sets have side, create again
An independent sets are built, the node is put into the newly-built independent sets；After all nodes all check end, the independent sets set of network
Number according to node ID is ascending it has been determined that check each independent sets, if node and all sections in independent sets again
Point is all boundless, then the node is added into the independent sets and continue to check next independent sets.
Further, notice selected virtual community in base station carries out content caching, and sends content to corresponding
Virtual Community Management node includes：Virtual Community Management node in the notice independent sets of base station needs to cache the content specified, and
Confirmed from the Virtual Community Management node to base station.
The present invention is advantageous in that：Layering cache decision is carried out to Hot Contents so that content is in first caching
Just it is distributed in the whole network, so as to reduce the time delay that user obtains content；By selecting independent sets set to select content caching
Community so that otherwise a certain community is cached with the content in community, otherwise its adjacent community is cached with the content, so as to reduce
User obtains the average delay of content between virtual community；Content caching is selected by way of selecting broad sense dominant set
Node so that node at least has a copy in the range of its i jumps, and content is obtained inside virtual community so as to reduce user
Average delay；The battery level information of node is considered when carrying out cache decision, so as to extend the life of node and network
Deposit the time.
Brief description of the drawings
Fig. 1 is the topological diagram of existing multi-hop relay cellular network；
Fig. 2 is the network topological diagram of the specific embodiment of the invention；
Fig. 3 is content caching flow chart；
Fig. 4 is the network topological diagram that Virtual Community Management node is formed；
Fig. 5-a, 5-b and 5-c are that broad sense dominant set selects schematic diagram.
Embodiment
Make specific introduce to the present invention below in conjunction with the drawings and specific embodiments.
Reference picture 1, the network topological diagram of a traditional wireless multi-hop relay cellular network is shown, as illustrated, should
Cell 101 in wireless multi-hop relay cellular network is made up of multiple nodes 102 and base station 103, and wherein base station 103 is to cell
101 are managed and control, and node 102 carries out the caching and relay forwarding of content.But conventional contents center illustrated in fig. 1
Network finds required content in a network in a manner of flooding, and the expansion of network size will have a strong impact on the performances such as network throughput.
In the wireless network, limited by frequency spectrum resource and terminal capability, it is shared by serious shadow that content is carried out in large scale network
Radio resource efficiency is rung, reduces Consumer's Experience.Therefore the network topology structure designed by the present invention is proposed, as shown in Figure 2.
Fig. 2 shows the network topological diagram of the specific embodiment of the invention, the multi-hop relay cellular network system of the content oriented
System is divided into three layers：Base station 202, Virtual Community Management node 203 and ordinary node 204.
First, base station 202, the cell 201 in network system is managed and controlled, specifically：
1st, obtain and update the network topology of cell；
Base station 202 needs to obtain the network multi-hop topology information of cell 201, in order to complete the pipe to the network of cell
Reason.Newly-increased, mobile or node the destruction of the interior joint of cell 201 can cause the change of network topological information, therefore, base station 202
Need to periodically update full subzone network topology information.
2nd, the division of virtual community 205 is carried out；
Base station can carry out virtual community division according to the rule of setting, such as can be according to geographical position, user
Interest-degree etc., and assign the whole network for these virtual communities and uniquely identify ID.
3rd, Virtual Community Management node is selected；
After virtual community is divided, base station selects a node within each virtual community, as virtual community pipe
Manage node.The selection of Virtual Community Management node, which generally requires, considers several aspects：
Computing capability：Virtual Community Management node needs the management and control of assistant base station progress network, it is therefore desirable to compared with
Strong computing capability.
Battery electric quantity：Virtual Community Management node realizes that management needs to consume extra electricity with control, in battery electric quantity
In limited Ad Hoc networks, select remaining battery power more Virtual Community Management node be just avoided that management node because of
Not enough power supply and exit network.
Position：Node in network center position is more convenient for logical with other nodes than the node in network edge
Letter, therefore be easier to be selected as Virtual Community Management node；
Wireless coverage area：The coverage of node wireless frequency is bigger, and in the case where user is uniformly distributed, it is connected
User it is more, then the node is more important in a network, therefore is easier to be selected as Virtual Community Management node.
4th, each node into cell sends notice, and notice includes virtual community ID belonging to the node and this is virtual
The ID of the virtual management node of community；Further, if certain node is Virtual Community Management node, it is also carried in notice
The ID of his Virtual Community Management node.
2nd, Virtual Community Management node 203
Assistant base station is managed to network.
3rd, ordinary node 204
Self-position, interest, storage content and periphery nodal information etc. are reported to base station, in order to which base station obtains multi-hop
Relay cellular network topology information, division virtual community, and selection Virtual Community Management node etc.；
Network topological diagram according to an embodiment of the invention is described above according to Fig. 2, the network of the content oriented is internal
Hold the method cached as shown in figure 3, specific as follows：
Base station divides virtual community in each update cycle and selects Virtual Community Management node；
The network topology selection independent sets set that base station is formed using Virtual Community Management node；
Base station randomly chooses virtual community corresponding to an independent sets and carries out content caching；
Notice selected virtual community in base station carries out content caching, and sends content to corresponding Virtual Community Management
Node；
The Virtual Community Management node for receiving content caching instruction is carried out using broad sense dominant set algorithms selection to content
The node of caching；
The selected node of Virtual Community Management node notice is cached to content and the content is sent into the node；
Selected node caches to content.
Above-mentioned flow is described in detail below in conjunction with accompanying drawing 4-5.
First, base station divides virtual community in each update cycle and selects Virtual Community Management node, concretely comprises the following steps：
1st, base station obtains cell multihop network topology information；Including：
Step 1：Interacted between cell interior nodes and confirm its neighboring node list；
Step 2：Node reports oneself state information, including the positional information of the node, neighbor node ID etc. to base station；
Step 3：The information that base station is reported using node, for example, the positional information of node and information of neighbor nodes formed it is small
Area's multihop network topology information.
2nd, base station utilizes preset rules division virtual community according to cell multihop network topology information.Such as can be according to ground
Position, the interest-degree etc. of user are managed, and assigns the whole network for these virtual communities and uniquely identifies ID.
3rd, base station selects a node according to pre-set criteria within each virtual community, as Virtual Community Management section
Point, and a secondary node is selected, when Virtual Community Management node exits network, secondary node takes on Virtual Community Management
Node.
The selection of Virtual Community Management node and secondary node, which generally requires, considers several aspects：
Computing capability：Virtual Community Management node needs the management and control of assistant base station progress network, it is therefore desirable to compared with
Strong computing capability；
Battery electric quantity：Virtual Community Management node realizes that management needs to consume extra electricity with control, in battery electric quantity
In limited Ad Hoc networks, select remaining battery power more Virtual Community Management node be just avoided that management node because of
Not enough power supply and exit network.
Position：Node in network center position is more convenient for logical with other nodes than the node in network edge
Letter, therefore be easier to be selected as Virtual Community Management node；
Wireless coverage area：The coverage of node wireless frequency is bigger, and in the case where user is uniformly distributed, it is connected
User it is more, then the node is more important in a network, therefore is easier to be selected as Virtual Community Management node.
4th, base station notifies the ID of virtual community ID and the virtual community of each node where it virtual management node.
5th, base station notifies the route between the ID of other Virtual Community Management nodes and management node to each virtual community pipe
Manage node.
2nd, the network topology selection independent sets set that base station is formed using Virtual Community Management node；
Step 1：The set that base station generation Virtual Community Management node is formed.
The set that base station is formed using network multi-hop topology information generation Virtual Community Management node(such as Fig. 4
It is shown), whereinVirtual Community Management node set is represented, andThen represent the link set between Virtual Community Management node
Close.IfFor unconnected graph, then forwarded by ordinary node, isolated node is connected to the reachable virtual society of minimum forwarding hop count
Area's management node, to form connected graph.
Step 2：Base station generates independent sets set.
Independent sets refer to figureIn two-by-two mutually non-conterminous node set.When selecting independent sets set, first by sequence number
Minimum node is put into first independent sets.Then, according to node sequence number it is ascending start to check each independent sets,
If all nodes are all boundless in node and independent sets, the node is added into the independent sets and continues to check next independent sets；
If node and all independent sets have side, an independent sets are re-created, the node is put into the newly-built independent sets.It is all
After node all checks end, the independent sets set number of network is it has been determined that the still size of each independent sets and unbalanced.If
All nodes are all boundless in node and independent sets, then the node are added into the independent sets and continue to check next independent sets.
Base station selected independent sets set comprises the following steps that
The minimum independent sets S formed using the above method includes multiple independent sets.Virtual network management as shown in Figure 4
The minimum independent set S={ S of network topology between node1,S2,S3,S4, wherein：
3rd, base station randomly chooses virtual community corresponding to an independent sets and carries out content caching；
In view of the spatial cache of each virtual community is limited and virtual community between fairness, base station is random every time
Different independent sets are selected to determine the virtual community of cache contents.
4th, notice selected virtual community in base station carries out content caching, and sends content to corresponding virtual community
Management node；
Virtual Community Management node in the notice independent sets of base station needs to cache the content specified, and by the virtual community pipe
Reason node is confirmed to base station.
5th, the Virtual Community Management node for receiving content caching instruction is entered using broad sense dominant set algorithms selection to content
The node of row caching；
For node u, N is definedi(u) node set with node u distances i jump scopes, d (u)=N are representedi(u) N is representedi
(u) nodes in, defined herein as the node u broad sense number of degrees.
The step of selecting broad sense dominant set is as follows：
Step 1：Management node all node bulletins into community need to be buffered the size b of content；
Step 2：Ordinary node checks self residual electricity E, if E >=Eth, then node to management node send participate in content
Caching selection mark 1, otherwise sends 0.Wherein, Eth=B (EbB), it is minimum dump energy thresholding, EbRepresent that node often caches 1
The electricity of bit contents consumption, B are the parameter more than 1；
Step 3：Node (the black triangle node in such as Fig. 5-a that management node will participate in content caching and identify the selection as 0
v2、v12、v15) node set R is put into, 1 node (such as Fig. 5-a hollow node v will be identified as1、v3Deng) it is put into node set
W；
Step 4：Initialization starting node setJ=1.Management node calculates in community and is each denoted as white
Node the broad sense number of degrees, and number of degrees identical nodes are put into same node set.For example, the node of number of degrees maximum is put
Enter set A1, the number of degrees time big node is put into set A2, by that analogy.
Step 5：A=A ∪ AjIf A is unsatisfactory for | A | >=| V | and × r% (wherein r ∈ (0,100), | V | represent all nodes
Number) then j=j+1, A=A ∪ Aj.If A meets | A | >=| V | × r%, set A are that required start node combines, and are skipped to
Step 7.
Step 6：Repeat step 5.
Step 7：A node v is randomly choosed in start node set A as start node (solid section in such as Fig. 5-a
Point v9) be put into dominant set D, i.e. D={ v }, and by Ni(v) (such as Fig. 5-a shaded nodes the v of the node in ∩ W5、v13Deng) it is put into collection
Close G, i.e. G=Ni(v) ∩ W, the node for being put into set G and set D, i.e. W=W-G-D are removed in set W, in set R
Fall set Ni(v) node in, i.e. R=R-Ni(v)∩R；
Step 8：Recalculate the N of all node u in set Gi(u) the node number d ' (u) in, wherein d ' (u) are represented
(Ni(u)∩W)∪(Ni(u) ∩ R) interior nodes number；
Step 9：The maximum node of rear d ' (u) will be recalculated and be put into set D, and remove the section in set D in set G
Put and add Ni(u) node in ∩ W, i.e. G=G ∪ (Ni(u) ∩ W)-G ∩ D, remove set N in set Wi(u) in ∩ W
Node, i.e. W=W-Ni(u) ∩ W, set N is removed in set Ri(v) node in ∩ R, i.e. R=R-Ni(v)∩R。
Repeat step 8-9 untilThen now (the solid node in Fig. 5-c of the node in set D
v3、v9、v13) composition broad sense dominant set.
Base station interacts with the management node in dominant set, and management node confirms that the content is sent out in base station after being cached
Give corresponding management node.
Management node is also required to participate in the selection of broad sense dominant set, but in order to ensure that management node can continue to carry out virtually
The work such as community network management and content caching management, what its minimum dump energy thresholding will be appropriate is higher than Eth。
Fig. 5-a, 5-b, 5-c are the broad sense dominant set selection algorithm schematic diagrames provided by taking i=2 as an example, people in the art
Member is it is understood that the one exemplary embodiment that Fig. 5-a, 5-b, 5-c are for convenience of description and provided, those skilled in the art
Member can on this basis, using above-mentioned algorithm draw i be it is any be more than or equal to 1 other selection examples.
In addition, when there is new content to be cached, if being selected for a certain start node and according to the start node
Broad sense dominant set in node battery electric quantity be all higher than Eth, then only need directly to store content using the broad sense dominant set
Without recalculating broad sense dominant set.
6th, the selected node of Virtual Community Management node notice is cached to content and the content is sent to the section
Point；
7th, selected node caches to content.
It should be noted that the invention is not limited in any way for above-described embodiment, it is all to use equivalent substitution or equivalent change
The technical scheme that the mode changed is obtained, all falls within protection scope of the present invention.
Claims (9)
1. a kind of network-caching method of content oriented, it is characterised in that this method includes：
Base station divides virtual community in each update cycle and selects Virtual Community Management node；
The network topology selection independent sets set that base station is formed using Virtual Community Management node；
Base station randomly chooses virtual community corresponding to an independent sets and carries out content caching；
Notice selected virtual community in base station carries out content caching, and sends content to corresponding Virtual Community Management section
Point；
The Virtual Community Management node for receiving content caching instruction is cached using broad sense dominant set algorithms selection to content
Node；
The selected node of Virtual Community Management node notice is cached to content and the content is sent into the node；
Selected node caches to content；
The Virtual Community Management node for receiving content caching instruction is cached using broad sense dominant set algorithms selection to content
Node concretely comprise the following steps：
For node u, N is definedi(u) node set with node u distances i jump scopes, d (u)=N are representedi(u) N is representedi(u) in
Nodes, defined herein as the node u broad sense number of degrees,
Step 1：Management node all node bulletins into community need to be buffered the size b of content；
Step 2：Ordinary node checks self residual electricity E, if E >=Eth, then node to management node send participate in content caching
Selection mark 1, otherwise sends 0, wherein, Eth=B (EbB), EthFor minimum dump energy thresholding, EbRepresent that node often caches 1 ratio
The electricity of special content consumption, B are the parameter more than 1；
Step 3：The node that management node identifies the selection as participation content caching 0 is put into node set R, will be identified as 1 section
Point is put into node set W；
Step 4：Initialization starting node setJ=1, management node calculate the node that white is each denoted as in community
The broad sense number of degrees, and number of degrees identical nodes are put into same node set；
Step 5：A=A ∪ AjIf A is unsatisfactory for | A | >=| V | × r%, wherein r ∈ (0,100), | V | all node numbers are represented,
Then j=j+1, A=A ∪ Aj；If A meets | A | >=| V | × r%, set A are that required start node combines, and skip to step 7；
Step 6：Repeat step 5；
Step 7：Randomly choose a node v in start node set A to be put into dominant set D as start node, i.e. D=
{ v }, and by Ni(v) node in ∩ W is put into set G, i.e. G=Ni(v) ∩ W, remove in set W and be put into set G and set D
Node, i.e. W=W-G-D, remove set N in set Ri(v) node in ∩ R, i.e. R=R-Ni(v)∩R；
Step 8：Recalculate the N of all node u in set Gi(u) the node number d ' (u) in, wherein d ' (u) represent (Ni(u)
∩W)∪(Ni(u) ∩ R) interior nodes number；
Step 9：The maximum node of rear d ' (u) will be recalculated and be put into set D, and remove in set G the node in set D simultaneously
Add Ni(u) node in ∩ W, i.e. G=G ∪ (Ni(u) ∩ W)-G ∩ D, remove set N in set Wi(u) section in ∩ W
Point, i.e. W=W-Ni(u) ∩ W, set N is removed in set Ri(v) node in ∩ R, i.e. R=R-Ni(v)∩R；
Repeat step 8-9 untilThen now the node in set D forms broad sense dominant set.
2. network-caching method according to claim 1, it is characterised in that：Base station and the Virtual Community Management in dominant set
Node interacts, and management node confirms that the content is sent to corresponding management node by base station after being cached.
3. network-caching method according to claim 1, it is characterised in that：Management node is also required to participate in broad sense dominant set
Selection, but in order to ensure that management node can continue management work, its minimum dump energy thresholding is higher than Eth。
4. network-caching method according to claim 1, it is characterised in that：When there is new content to be cached, if right
Node battery electric quantity in a certain start node and the broad sense dominant set selected according to the start node is all higher than Eth, then only
Need directly to store without recalculating broad sense dominant set content using the broad sense dominant set.
5. network-caching method according to claim 1, it is characterised in that
Base station divides virtual community in each update cycle and selects concretely comprising the following steps for Virtual Community Management node：
Base station obtains cell multihop network topology information；
Base station utilizes preset rules division virtual community according to cell multihop network topology information；
Base station selects a node within each virtual community, as Virtual Community Management node；
Base station notifies the ID of virtual community ID and the virtual community of each node where it virtual management node, and notice is empty
Route between the ID and management node of other Virtual Community Management nodes of plan community management node.
6. network-caching method according to claim 1, it is characterised in that base station is formed using Virtual Community Management node
Network topology selection independent sets set concretely comprise the following steps：
The set that base station generation Virtual Community Management node is formed；
Base station generates independent sets set.
7. network-caching method according to claim 6, it is characterised in that：Base station generation Virtual Community Management node institute structure
Into set include：
The set that base station is formed using network multi-hop topology information generation Virtual Community Management nodeWhereinRepresent empty
Intend community management node set, andThen represent the link set between Virtual Community Management node；IfFor unconnected graph, then
Forwarded by ordinary node, isolated node is connected to the reachable Virtual Community Management node of minimum forwarding hop count, with the company of composition
Logical figure.
8. network-caching method according to claim 6, it is characterised in that：Base station generation independent sets set includes：
The minimum node of sequence number is put into first independent sets；
Start to check each independent sets according to the sequence number of node is ascending, if in node and independent sets all nodes all without
Side, then the node is added into the independent sets and continue to check next independent sets；If node and all independent sets have side, weigh
An independent sets are newly created, the node is put into the newly-built independent sets；
After all nodes all check end, the independent sets set number of network it has been determined that again according to node ID by it is small to
Check each independent sets greatly, if all nodes are all boundless in node and independent sets, by the node add the independent sets and after
It is continuous to check next independent sets.
9. network-caching method according to claim 1, it is characterised in that：Notice selected virtual community in base station is carried out
Content caching, and send content to corresponding Virtual Community Management node and include：Virtual community in the notice independent sets of base station
Management node needs to cache the content specified, and is confirmed from the Virtual Community Management node to base station.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410526621.3A CN104394545B (en) | 2014-10-08 | 2014-10-08 | A kind of network-caching method of content oriented |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410526621.3A CN104394545B (en) | 2014-10-08 | 2014-10-08 | A kind of network-caching method of content oriented |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104394545A CN104394545A (en) | 2015-03-04 |
| CN104394545B true CN104394545B (en) | 2017-11-10 |
Family
ID=52612369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410526621.3A Expired - Fee Related CN104394545B (en) | 2014-10-08 | 2014-10-08 | A kind of network-caching method of content oriented |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104394545B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001870A (en) * | 2012-12-24 | 2013-03-27 | 中国科学院声学研究所 | Collaboration caching method and system for content center network |
| WO2013103493A1 (en) * | 2012-01-08 | 2013-07-11 | Licensing Thomson | Apparatus and method for content directory server presentation |
| CN103518377A (en) * | 2011-01-06 | 2014-01-15 | 汤姆逊许可公司 | Method and apparatus for updating a database in a receiving device |
-
2014
- 2014-10-08 CN CN201410526621.3A patent/CN104394545B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103518377A (en) * | 2011-01-06 | 2014-01-15 | 汤姆逊许可公司 | Method and apparatus for updating a database in a receiving device |
| WO2013103493A1 (en) * | 2012-01-08 | 2013-07-11 | Licensing Thomson | Apparatus and method for content directory server presentation |
| CN103001870A (en) * | 2012-12-24 | 2013-03-27 | 中国科学院声学研究所 | Collaboration caching method and system for content center network |
Non-Patent Citations (1)
| Title |
|---|
| A Dominating-set-based Collaborative Caching with Request Routing in Content Centric Networking;Yuemei XU等;《International Conference》;20130616;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104394545A (en) | 2015-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100591029C (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| Villasenor-Gonzalez et al. | HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks | |
| CN1926835A (en) | Method, communication device and system for address resolution mapping in a wireless multihop self-organizing network | |
| CN110995333B (en) | Cluster QoS route design method | |
| CN106888490A (en) | The method for routing and device of a kind of wireless self-networking | |
| Lee et al. | A mesh routing protocol using cluster label in the ZigBee network | |
| CN107846706A (en) | A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance | |
| Palta et al. | Comparison of OLSR and TORA routing protocols using OPNET Modeler | |
| Barve et al. | Optimization of DSR routing protocol in MANET using passive clustering | |
| CN106850436A (en) | Mine hybrid wireless mesh network routing protocols based on virtual potential energy field | |
| Huang et al. | A routing algorithm based on cross-layer power control in wireless ad hoc networks | |
| CN104219156B (en) | A kind of multicast route method suitable for the aerial self-organizing network of stratification | |
| Alqaysi et al. | Performance analysis of video streaming application over MANETs routing protocols | |
| Jamali et al. | Comparative analysis of ad hoc networks routing protocols for multimedia streaming | |
| CN104394545B (en) | A kind of network-caching method of content oriented | |
| Lafta et al. | Efficient routing protocol in the mobile ad-hoc network (MANET) by using genetic algorithm (GA) | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| Imani et al. | DSDV-Het: a new scalable routing protocol for large heterogeneous ad hoc networks | |
| Sahnoun et al. | Increasing network lifetime by energy-efficient routing scheme for OLSR protocol | |
| Raiyani et al. | Probabilistic and neighbour knowledge based flooding mechanism for AODV | |
| CN105187515B (en) | A kind of network-caching method for considering terminal capability | |
| Pappa et al. | Implementation of power aware features in AODV for ad hoc sensor networks. A simulation study | |
| Macuha et al. | Route-count based anycast routing in wireless ad hoc networks | |
| Janacik et al. | Self-organizing data collection in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20161207 Address after: 214135 Jiangsu New District of Wuxi City Linghu Road No. 97 University Science and Technology Park E building of Beijing University of Posts and Telecommunications Applicant after: Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd. Applicant after: Beijing University of Posts and Telecommunications Address before: 214135 Jiangsu New District of Wuxi City Linghu Road No. 97 University Science and Technology Park E building of Beijing University of Posts and Telecommunications Applicant before: Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171110 Termination date: 20191008 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |