CN103888982B - A kind of management in content center wireless network and control node selection method - Google Patents
A kind of management in content center wireless network and control node selection method Download PDFInfo
- Publication number
- CN103888982B CN103888982B CN201410123664.7A CN201410123664A CN103888982B CN 103888982 B CN103888982 B CN 103888982B CN 201410123664 A CN201410123664 A CN 201410123664A CN 103888982 B CN103888982 B CN 103888982B
- Authority
- CN
- China
- Prior art keywords
- node
- topology
- community
- network
- management
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses management and the control node selection method in a kind of content center wireless network, this method includes：Current network topology is abstracted as weighted-graph G, and calculates the Topology Potential of each node in figure G；Optional start node ni, and start to search for based on Topology Potential, until finding the maximum node of local topology gesture；It is searched for again from the maximum node of local topology gesture along Topology Potential descent direction up to reaching frontier node；It is a virtual network community by involved node division along Topology Potential descent direction search process；After all nodes divide in the figure G, using the maximum node of local topology gesture in each virtual network community as the management of the virtual network community and control node.By using method disclosed by the invention, the time delay of content search and feedback in community is shortened, improves TOCOM total communication service quality.
Description
Technical field
The present invention relates to the management and control in wireless communication technology field more particularly to a kind of content center wireless network
Node selecting method.
Background technology
With the fast development of network technology and application, Internet resources finiteness, rigid, management and control energy force difference and network demand
Diversity, the sudden principal contradiction faced as network operation.How to efficiently use conventional network resources, maximizes to meet and use
The business demand at family and requirement to service quality become a major issue urgently to be resolved hurrily.
In the research to future network architectural framework, content center network (CCN) is for user to content related service
Growing demand is studied using content as network identity, to replace the new network architecture of existing network IP eel-like figures.Research
By way of taking Internet resources to be detached with position, realizes the decoupling of business and resource, improve utilization rate and the use of resource
Flexibility.However, as CCN network sizes constantly expand, forward the search pattern of interest packet that will lead to net with flooding pattern
Network performance drops suddenly, it is necessary to by the technologies such as topology planning and caching resource, on the one hand inhibit spreading unchecked for flooding data, on the other hand
Improve the success rate and efficiency of content distribution.
As user for mobile office and carries equipment（BYOD）Be widely used, the performance of each terminal in network
Irregular, network isomery characteristic is gradually notable.Meanwhile the finiteness and difference of mobile network's transmission mode and transmission rate
Property, content distribution efficiency is limited, user experience is reduced.This just needs the available of each terminal and link in dynamic evaluation network
Property, by the topological structure for network of making rational planning for, the technological means such as suitable network-caching node are selected, optimize network operation mould
Formula improves user experience.
In the prior art, it is proposed that based on the dynamic network management/monitoring node selection for minimizing network flow
Pressure algorithms are generated by optimizing the deployment of the information collection node (ICP) in network in reduction infonnation collection process
Data traffic improves the utilization rate of network, reduces network and gathers around.But the algorithm is substantially the optimization to network bandwidth resources
Configuration strategy.Flow pressure parameter is only selected ICP nodes by algorithm as unique single index, not to the processing energy of node
Other attributes such as power, storage capacity carry out comprehensive assessment, can not ensure that selected ICP nodes have enough managerial abilities,
It even fails so as to cause monitoring capacity is insufficient.In addition, algorithm only considers network bulk flow, it is not directed to specific each in network
The utilizable flow situation of link is made a concrete analysis of, it will leads to local link load excessive, reduces transmission quality.
Invention content
The object of the present invention is to provide management and the control node selection methods in a kind of content center wireless network, shorten
The time delay of content search and feedback, improves TOCOM total communication service quality in community.
The purpose of the present invention is what is be achieved through the following technical solutions：
Management and control node selection method, this method in a kind of content center wireless network include：
Current network topology is abstracted as weighted-graph G, and calculates the Topology Potential of each node in figure G；
Optional start node ni, and start to search for based on Topology Potential, until finding the maximum node of local topology gesture；Again from
The maximum node of local topology gesture is searched for along Topology Potential descent direction until reaching frontier node；It will be along the Topology Potential side of decline
Into search process, involved node division is a virtual network community；
It is after all nodes divide in the figure G, local topology gesture in each virtual network community is maximum
Management and control node of the node as the virtual network community.
It as seen from the above technical solution provided by the invention, can be according to the performance of nodes and link certainly
Hair, dynamic construction virtual network community reduce the number of interest packet forwarding to reduce network size；Moreover, it is achieved that management
With the selection of control node, transmitted data amount can be reduced, reduces propagation delay time, while again can be in heterogeneous wireless network environment
Under, it is ensured that superior resources are fully utilized, and avoid the occurrence of node and transmittability is limited caused network congestion.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill in field, without creative efforts, other are can also be obtained according to these attached drawings
Attached drawing.
Fig. 1 is management and control node selecting party in a kind of content center wireless network that the embodiment of the present invention one provides
The flow chart of method；
Fig. 2 is management and control node selecting party in a kind of content center wireless network provided by Embodiment 2 of the present invention
The flow chart of method；
Fig. 3 is in a kind of distribution based on virtual network community management and control node provided by Embodiment 2 of the present invention
Hold the flow chart of search.
Specific implementation mode
With reference to the attached drawing in the embodiment of the present invention, technical solution in the embodiment of the present invention carries out clear, complete
Ground describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Based on this
The embodiment of invention, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, belongs to protection scope of the present invention.
The demand of user is sent to specified server according to fixed route relative to traditional IP, CCN networks are adopted
Interest packet is sent with the mode of flooding, inquires whether each node includes required content, the clothes that network is capable of providing in network
The close phase of available bandwidth for the quality and each link in the data-handling capacity of each node in network size, network and network of being engaged in
It closes.The propagation scale of interest packet in a network how is reduced, processing capacity and the higher forward node of transmission bandwidth are selected, it will be straight
Connecing influences the efficiency and user experience of content search.In view of the access of user in mobile network and leave with uncertainty,
Therefore it needs to study the method that can whole network spontaneous be rationally split as to several small-scale virtual network communities so that emerging
The forwarding of interest packet and the return of content are after less network node；Further in considering network each joint behavior and
In the case of link transmission rate, select good node as in localized network content resource management and control node（Again
Claim management and control node）, undertake the caching of content and distribution function so that other user nodes be able to quickly, easily obtain resource.
Embodiment one
Fig. 1 is management and control node selecting party in a kind of content center wireless network that the embodiment of the present invention one provides
The flow chart of method.As shown in Figure 1, this method mainly includes the following steps：
Current network topology is abstracted as weighted-graph G by step 11, and calculates the Topology Potential of each node in figure G.
In the embodiment of the present invention, weighted-graph G is represented by：G=(N, E), wherein N indicates that the set of node of figure G, E are
Scheme the side collection of G, eijIndicate node niWith njBetween link；
A=(aij)K×KIndicate the adjacency matrix of figure G, wherein
The available resources of nodes and link are carried out comprehensive assessment and quantization by the embodiment of the present invention with field theory,
According to the height of weighted topological potential energy be distributed it is spontaneous whole network is divided into several virtual network communities of scale is smaller, and select
It selects the optimal node of Local resource this community is managed and is controlled, when ensureing to realize low between community's internal node
Prolong, the content transmission of high success rate.
Based on data field theory, regard network as a physical system comprising K node and interaction.Each section
Point niThere are a field, all node nj={ nj∈ N, (i ≠ j) } all by niThe effect of field；And node niAlso by network
In other node fields influence.According to the characteristics of field theory it is found that the active force of node with the increase of node sole mass and
Increase, and the range of node active force decays with the growth of network distance.Using represent short-range field and have good mathematics
The Gauss potential function of property describes the interaction between nodes.Definition node niTopology Potential W (ni) be：
Wherein,It is to weigh each node in physical network to consider equipment disposal ability
With the Weighted Guidelines of storage capacity, αjAnd βjNode device n is indicated respectivelyjProcessing capacity c (nj) and storage capacity v (nj) plus
Weight coefficient；It indicates and physical node njEach connected link residue available transmission rate summation, γjTable
Show the weighting coefficient of link available transmission rate summation；D { i, j } indicates node niWith njBetween distance.
Step 12, optional start node ni, and start to search for based on Topology Potential, until finding the maximum section of local topology gesture
Point；It is searched for again from the maximum node of local topology gesture along Topology Potential descent direction up to reaching frontier node；It will be along topology
Involved node division is a virtual network community in gesture descent direction search process.
The processing procedure of this step is specially：Optional start node ni, by inquiring the adjacency matrix A of the figure G, obtain
With node niThere are the adjacent segments point set of connection, comparison node niThe Topology Potential of set of node adjacent thereto；Select the adjacent node
Concentrate the highest node of Topology Potential as node niThe ascent direction of climbing the mountain of point, until the Topology Potential for finding a node is higher than it
All adjacent nodes, then the node is the maximum node of local topology gesture；From the whole phases in local pole general trend of events value node edge of acquisition
The Topology Potential descent direction of neighbors is searched for, until all frontier nodes are reached, it will be along Topology Potential descent direction search process
Involved node division is a virtual network community.The frontier node includes several, and each frontier node is opened up
It flutters gesture and is less than its adjacent node Topology Potential, and after frontier node adjacent node carries out search by hill climbing, reach different parts and open up
Flutter gesture maximum node.
Step 13, after all nodes divide in the figure G, by local topology gesture in each virtual network community
Management and control node of the maximum node as the virtual network community.
It repeats step 12 and is finished until scheming all nodes in G and dividing, so far, virtual network community, which divides, to complete.
In the entire network, it forms with local pole general trend of events value point（The maximum node of local topology gesture）Centered on Topology Potential highland,
Frontier node point set forms gesture value low ebb, separates adjacent virtual network community.
Since the very big gesture value node in virtual network community possesses highest Topology Potential in community, i.e. node integration capability
（Containing processing capacity, memory space, network bandwidth）Therefore the very big gesture value node in virtual network community is this by assessed value highest
The management of virtual network community and control node.
Further, interest can be avoided by carrying out content search with control node based on the management in the embodiment of the present invention
Packet is forwarded in the whole network in a manner of flooding, and further decreases interest packet hop count and content search time delay, improves search efficiency.
In virtual network community, management needs to fulfil internal and external two parts of responsibilities with control node.Internal responsibility：Pipe
Reason needs to cache all the elements resource in present networks community with control node, and responds the resource requirement inside community.Externally
Responsibility：At the beginning of community is formed, each management, i.e. by shaking hands, obtains adjacent virtual Web Community mark, and delay with control node
Deposit communication lines between adjacent community management and control node by.It is different from the whole network Flooding, it is based on virtual network society
Area manages the content search assisted with control node, the search of specific direction is carried out first inside community, when this community is not wrapped
It is carried out again across community search when containing required content；Specifically：Node in a certain virtual network community according to content search command,
It generates interest packet and is sent along Topology Potential ascent direction；After forward node receives the interest packet, judge locally whether cached institute
State the corresponding content of interest packet；If so, feeding back corresponding content according to the opposite direction that interest packet is sent；Otherwise, judge it
Whether itself is management and control node in current virtual Web Community.If so, the management to adjacent virtual Web Community
It is transmitted to interest packet with control node；Otherwise, continue to forward interest packet along Topology Potential ascent direction；When the adjacent virtual network
When community has cached the interest packet corresponding content, corresponding content is fed back according to the opposite direction that interest packet is sent.In addition,
When the corresponding content of the uncached interest packet of the adjacent virtual Web Community, then whether current interest packet hop count is judged
More than threshold value；If so, feedback search failure information；Otherwise, continue to forward the interest packet.
The embodiment of the present invention can according to the performances of nodes and link spontaneous, dynamic construction virtual network society
The number of interest packet forwarding is reduced to reduce network size in area；Moreover, it is achieved that the selection of management and control node, can subtract
Few transmitted data amount, reduces propagation delay time, while again can be under heterogeneous wireless network environment, it is ensured that superior resources obtain fully
Utilization, avoid the occurrence of node and transmittability and be limited caused network congestion.
Embodiment two
To facilitate the understanding of the present invention, the present invention will be further described by 2-3 below in conjunction with the accompanying drawings.
It is weighted-graph G=(N, E) by network topology, wherein N indicates the set of node of figure G, E in the embodiment of the present invention
To scheme the side collection of G, eijIndicate node niWith njBetween link；A=(aij)K×KIndicate the adjacency matrix of figure G, wherein
The available resources of nodes and link are carried out comprehensive assessment and quantization by the embodiment of the present invention with field theory,
According to the height of weighted topological potential energy be distributed it is spontaneous whole network is divided into several virtual network communities of scale is smaller, and select
It selects the optimal node of Local resource this community is managed and is controlled, when ensureing to realize low between community's internal node
Prolong, the content transmission of high success rate.
Wherein, the available resources of node with the state change of node dynamic change.The embodiment of the present invention utilizes vector
[c(ni),v(ni)] description node available resources, wherein c (ni) indicate node ni（Any node in set of node N）Can use
Reason ability, such as node cpu；v(ni) indicate node available cache memory space；Utilize bwijIndicate link eijDominate transmission speed
Rate.
Based on data field theory, regard network as a physical system comprising K node and interaction.Each section
Point niThere are a field, all node nj={ nj∈ N, (i ≠ j) } all by niThe effect of field；And node niAlso by network
In other node fields influence.According to the characteristics of field theory it is found that the active force of node with the increase of node sole mass and
Increase, and the range of node active force decays with the growth of network distance.Using represent short-range field and have good mathematics
The Gauss potential function of property describes the interaction between nodes.Definition node niTopology Potential W (ni) be：
Wherein,It is to weigh each node in physical network to consider equipment disposal ability
With the Weighted Guidelines of storage capacity, αjAnd βjNode device n is indicated respectivelyjProcessing capacity c (nj) and storage capacity v (nj) plus
Weight coefficient；It indicates and physical node njEach connected link residue available transmission rate summation, γjTable
Show the weighting coefficient of link available transmission rate summation；D { i, j } indicates node niWith njBetween distance, using shortest path hop count
It weighs.It, can be with definition node and the associated weighting coefficient of link circuit resource, so as to from example according to different optimization aims
Such as efficiency, cost different angle assesses network.For example, when using network energy efficiency as optimization aim, weighting coefficient is
The energy consumed using unit resource；When using network operation cost as optimization aim, weighting coefficient then chooses occupancy unit
Expense caused by resource.
According to the mathematical property of Gaussian function, each node njCoverage be approximatelyIt jumps, works as distance
When more than this range, potential function decays to 0 quickly.That is, the node in network connection close quarters, has higher
Topology Potential.When the external available bandwidth of node gradually decreases, the Topology Potential of node continuously decreases, node in a network important
Property declines immediately.It can thus be seen that the weighted topological gesture W (n of nodei) can quantify by the processing of node, storage capacity
Strong and weak Integrative expression come out, and can be between quantitative reaction node topographical location and node action intensity.
Management provided in an embodiment of the present invention and control node selection method are the sizes based on Topology Potential come selection.Tool
It is that virtual network community, the management in reselection virtual network community and control node are divided based on Topology Potential for body.It should
Method can realize that network control platform has following two major functions in the unified control platform of the whole network：On the one hand, net
Network control platform needs the Resource Properties of each node and link in collection network；On the other hand it divides virtual network community and controls
Routing mode.
This method can be summarized as following three steps：1）It obtains Internet resources and calculates each node weighted topological gesture；2）It is logical
The tendency for crossing Topology Potential between comparison node judges highland and low ebb that Topology Potential is formed, and continuous sheet of Topology Potential highland is drawn
It is divided into a virtual network community；3）Select node appropriate as the virtual network community inside each Web Community
Management and control node.The method of this patent design considers the dynamic characteristic of wireless network node and link, is worked as based on network
Preceding available resources adaptively realize the division of virtual network community.Specific flow can be found in Fig. 2, mainly include the following steps：
1）Formula (1) calculates the Topology Potential of each node in network.
2）Optional start node ni, by inquiring the adjacency matrix A of the figure G, obtain and node niThere are the adjacent of connection
Set of node, comparison node niThe Topology Potential of set of node adjacent thereto.
3）The adjacent node is selected to concentrate the highest node of Topology Potential as node niThe ascent direction of climbing the mountain of point.
4）Repeat step 2）With step 3）Until the Topology Potential for finding a node is higher than its all adjacent node, at this point,
Hill-climbing algorithm is completed, present node is a local pole general trend of events value node（The maximum node of local topology gesture）.
5）It is searched for from the local pole general trend of events value node of acquisition along the Topology Potential descent direction of whole adjacent nodes, until reaching
That is, there is the node topology gesture and be less than adjacent node Topology Potential, and search by hill climbing is carried out along this adjacent node in all frontier nodes
Afterwards, different local maximum value nodes is reached；
6）Step 5）In the node that traverses form a virtual network community.
7）The node for not yet dividing virtual network community is optionally selected, step 2 is repeated）- step 6）, until owning in network
Node is respectively formed virtual network community.So far, network virtual Web Community, which divides, completes.In the entire network, it forms with office
Topology Potential highland centered on the very big gesture value point in portion, frontier node point set form gesture value low ebb, separate adjacent virtual network community；
8）Since the very big gesture value node in virtual network community possesses highest Topology Potential in virtual network community, that is, save
Point integration capability（Containing processing capacity, memory space, network bandwidth）Assessed value highest, therefore, by the very big gesture in virtual network community
Value node is management and the control node of this virtual network community.
Above-mentioned virtual network community division method does not need the quantity that user specifies community in advance, but to being saved in network
Point is calculated with link available resources, it will be able to the division of spontaneous realization community；Community network management and control node
It is undertaken by the highest node of Topology Potential value in existing community.Therefore, when newly-increased in network/removal node or link transmission ability become
When change, this algorithm can automatically update Web Community's division according to the attribute of resource, reselect suitable management and saved with control
Point has ensured the continuity managed under wireless network environment.
Further, interest can be avoided by carrying out content search with control node based on the management in the embodiment of the present invention
Packet is forwarded in the whole network in a manner of flooding, and further decreases interest packet hop count and content search time delay, improves search efficiency.
In virtual network community, management needs to fulfil internal and external two parts of responsibilities with control node.Internal responsibility：Pipe
Reason needs to cache all the elements resource in present networks community with control node, and responds the resource requirement inside community.Externally
Responsibility：At the beginning of community is formed, each management, i.e. by shaking hands, obtains adjacent virtual Web Community mark, and delay with control node
Deposit communication lines between adjacent community management and control node by.It is different from the whole network Flooding, it is based on virtual network society
Area manages the content search assisted with control node, the search of specific direction is carried out first inside community, when this community is not wrapped
It is carried out again across community search when containing required content；Detailed process is as shown in figure 3, include mainly：In a certain virtual network community
Node generates interest packet and is sent along Topology Potential ascent direction according to content search command；After forward node receives the interest packet,
Judge locally whether cached the corresponding content of the interest packet；If so, the opposite direction feedback pair sent according to interest packet
The content answered；Otherwise, judge whether its own is management and control node in current virtual Web Community.If so, to phase
The management of adjacent virtual network community is transmitted to interest packet with control node；Otherwise, continue to forward interest along Topology Potential ascent direction
Packet；When the adjacent virtual Web Community has cached the corresponding content of the interest packet, the phase negative side that is sent according to interest packet
To the corresponding content of feedback.
In addition, in order to control the hop count of interest packet in network, interest bag data is avoided to spread unchecked, reduces network performance,
Max-forwards number need to be set in advance, and uses counter keeps track interest packet hop count.When the adjacent virtual Web Community
The corresponding content of the uncached interest packet then judges whether current interest packet hop count is more than threshold value；If so, feedback is searched
Rope failure information；Otherwise, continue to forward the interest packet.
The embodiment of the present invention can according to the performances of nodes and link spontaneous, dynamic construction virtual network society
The number of interest packet forwarding is reduced to reduce network size in area；Moreover, it is achieved that the selection of management and control node, can subtract
Few transmitted data amount, reduces propagation delay time, while again can be under heterogeneous wireless network environment, it is ensured that superior resources obtain fully
Utilization, avoid the occurrence of node and transmittability and be limited caused network congestion.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment can
By software realization, the mode of necessary general hardware platform can also be added to realize by software.Based on this understanding,
The technical solution of above-described embodiment can be expressed in the form of software products, the software product can be stored in one it is non-easily
The property lost storage medium（Can be CD-ROM, USB flash disk, mobile hard disk etc.）In, including some instructions are with so that a computer is set
It is standby（Can be personal computer, server or the network equipment etc.）Execute the method described in each embodiment of the present invention.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
Any one skilled in the art is in the technical scope of present disclosure, the change or replacement that can be readily occurred in,
It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with the protection model of claims
Subject to enclosing.
Claims (5)
1. a kind of management in content center wireless network and control node selection method, which is characterized in that this method includes：
Current network topology is abstracted as weighted-graph G, and calculates the Topology Potential of each node in figure G；
An optional start node ni, and start to search for based on Topology Potential, until finding the maximum node of local topology gesture；Again from
The maximum node of local topology gesture is searched for along Topology Potential descent direction until reaching frontier node；It will be along the Topology Potential side of decline
Into search process, involved node division is a virtual network community；The frontier node includes several, each
The Topology Potential of frontier node is less than its adjacent node Topology Potential, and after the adjacent node of frontier node carries out search by hill climbing, arrives
Up to different local topology gesture maximum nodes；
After all nodes divide in the figure G, by the maximum node of local topology gesture in each virtual network community
Management as the virtual network community and control node；
The management of the virtual network community and control node, for caching all the elements resource in this virtual network community,
And respond the resource requirement of virtual network community internal node；It is additionally operable at the beginning of virtual network community is formed, obtain by shaking hands
Adjacent virtual Web Community is taken to identify, and caching and the communication lines between the management and control node of adjacent virtual Web Community
By；
This method further includes the steps that carrying out content search with control node based on the management, and the step includes：
Node in a certain virtual network community generates interest packet and is sent out along Topology Potential ascent direction according to content search command
It send；
After forward node receives the interest packet, judge locally whether cached the corresponding content of the interest packet；If so, according to
The opposite direction that interest packet is sent feeds back corresponding content；Otherwise, judge whether its own is in current virtual Web Community
Management and control node；
If so, the management to adjacent virtual Web Community forwards the interest packet with control node；Otherwise, continue along Topology Potential
Rise direction forwarding interest packet；
When the adjacent virtual Web Community has cached the corresponding content of the interest packet, the phase negative side that is sent according to interest packet
To the corresponding content of feedback.
2. according to the method described in claim 1, it is characterized in that, described be abstracted as weighted-graph G by current network topology
Including：
Weighted-graph G=(N, E), wherein N indicates that the set of node of figure G, E are the side collection for scheming G, eijIndicate node niWith njBetween
Link；Node niWith node njFor different node in set of node N, subscript i and j is node ID；
A=(aij)K×KIndicate the adjacency matrix of figure G, wherein
3. according to the method described in claim 2, it is characterized in that, the Topology Potential of each node includes in the calculating figure G：
Each node niThere are a field, all node nj={ nj∈ N, (i ≠ j) } all by niThe effect of field；And node
niAlso it is influenced by other node fields in network, then the calculation formula of the Topology Potential of each node is：
Wherein,It is to weigh each node in physical network to consider equipment disposal ability and storage
The Weighted Guidelines of ability, αjAnd βjNode device n is indicated respectivelyjProcessing capacity c (nj) and storage capacity v (nj) weighting system
Number；bwa(j) it indicates and physical node njEach connected link residue available transmission rate summation, γjIt indicates that link can be used to pass
The weighting coefficient of defeated rate summation；D (i, j) indicates node niWith njBetween distance.
4. method according to claim 1 or 2, which is characterized in that the optional start node ni, and opened based on Topology Potential
Begin to search for, includes up to finding the maximum node of local topology gesture：
Optional start node ni, by inquiring the adjacency matrix A of the figure G, obtain and node niThere are the adjacent nodes of connection
Collection, comparison node niThe Topology Potential of each adjacent node in set of node adjacent thereto；
The adjacent node is selected to concentrate the highest node of Topology Potential as node niAscent direction of climbing the mountain, until find one
The Topology Potential of node is higher than its all adjacent node, then the node is the maximum node of local topology gesture.
5. according to the method described in claim 1, it is characterized in that, working as the uncached interest of the adjacent virtual Web Community
Corresponding content is wrapped, then judges whether current interest packet hop count is more than threshold value；If so, feedback search failure information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410123664.7A CN103888982B (en) | 2014-03-28 | 2014-03-28 | A kind of management in content center wireless network and control node selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410123664.7A CN103888982B (en) | 2014-03-28 | 2014-03-28 | A kind of management in content center wireless network and control node selection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103888982A CN103888982A (en) | 2014-06-25 |
| CN103888982B true CN103888982B (en) | 2018-10-16 |
Family
ID=50957666
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410123664.7A Active CN103888982B (en) | 2014-03-28 | 2014-03-28 | A kind of management in content center wireless network and control node selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103888982B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109525407B (en) | 2017-09-18 | 2020-05-26 | 中国科学院声学研究所 | Method for generating same-layer intersection-free full-coverage nested container and readable storage medium |
| CN110138814B (en) * | 2018-02-02 | 2020-04-24 | 中国科学院声学研究所 | Centrality probability deployment method for network flow unloading |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383748A (en) * | 2008-10-24 | 2009-03-11 | 北京航空航天大学 | Community division method in complex network |
| CN102004641A (en) * | 2010-11-23 | 2011-04-06 | 武汉大学 | Topology potential-based software requirement case priority sorting method |
| CN103500168A (en) * | 2013-09-02 | 2014-01-08 | 中国矿业大学 | Method and system for discovering communities in overlapped complex networks according to topology potential |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130155919A1 (en) * | 2011-12-20 | 2013-06-20 | Korea Basic Science Institute | Method of potential routing, method of potential scheduling, and mesh node |
-
2014
- 2014-03-28 CN CN201410123664.7A patent/CN103888982B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383748A (en) * | 2008-10-24 | 2009-03-11 | 北京航空航天大学 | Community division method in complex network |
| CN102004641A (en) * | 2010-11-23 | 2011-04-06 | 武汉大学 | Topology potential-based software requirement case priority sorting method |
| CN103500168A (en) * | 2013-09-02 | 2014-01-08 | 中国矿业大学 | Method and system for discovering communities in overlapped complex networks according to topology potential |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103888982A (en) | 2014-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Adaptive transmission optimization in SDN-based industrial Internet of Things with edge computing | |
| CN104053175B (en) | A kind of thing network sensing layer topology control method | |
| Chen et al. | Energy-efficient itinerary planning for mobile agents in wireless sensor networks | |
| CN108540204A (en) | Fast Convergent ant group algorithm for satellite network Topology g eneration | |
| CN104581817A (en) | Dynamic shortest path weighting routing method in mobile ad-hoc network | |
| Izaddoost et al. | Energy efficient data transmission in iot platforms | |
| Khodaparas et al. | A multi criteria cooperative caching scheme for internet of things | |
| CN103888982B (en) | A kind of management in content center wireless network and control node selection method | |
| Sajid et al. | A New Linear Cluster Handling (LCH) Technique Toward's Energy Efficiency in Linear WSNs | |
| Di Caro et al. | Optimal relay node placement for throughput enhancement in wireless sensor networks | |
| Venkateswaran et al. | A mobility prediction based relay deployment framework for conserving power in manets | |
| Bhattacharjee et al. | Energy efficient multiple sink placement in wireless sensor networks | |
| Sultan et al. | Evaluation of energy consumption of reactive and proactive routing protocols in MANET | |
| Villas et al. | Time-space correlation for real-time, accurate, and energy-aware data reporting in wireless sensor networks | |
| Zhang et al. | Lifetime-aware leisure degree adaptive routing protocol for mobile ad hoc networks | |
| Erman et al. | A cross-layered communication protocol for load balancing in large scale multi-sink wireless sensor networks | |
| Acharya et al. | Energy-aware virtual backbone tree for efficient routing in wireless sensor networks | |
| Kaur et al. | Implementation of rank based ACO approach with load balancing in ad hoc network for multipath routing mechanism | |
| Kuo et al. | Efficient traffic load reduction algorithms for mitigating query hotspots for wireless sensor networks | |
| Jawad et al. | A review of approaches to energy aware multi-hop routing for lifetime enhancement in wireless sensor networks | |
| Nalluri et al. | An efficient energy saving sink selection scheme with the best base station placement strategy using tree based self organizing protocol for IoT | |
| Kim | An effective load balancing scheme maximizes the lifetime in wireless sensor networks | |
| CN108834192A (en) | A kind of method for routing and server | |
| Belghith et al. | CE-OLSR: a cartography and stability enhanced OLSR for dynamic MANETs with obstacles | |
| Fouchal et al. | A battery recovery aware routing protocol for 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |