CN103888982A - Management and control node selection method in content center wireless network - Google Patents

Management and control node selection method in content center wireless network Download PDF

Info

Publication number
CN103888982A
CN103888982A CN201410123664.7A CN201410123664A CN103888982A CN 103888982 A CN103888982 A CN 103888982A CN 201410123664 A CN201410123664 A CN 201410123664A CN 103888982 A CN103888982 A CN 103888982A
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.)
Granted
Application number
CN201410123664.7A
Other languages
Chinese (zh)
Other versions
CN103888982B (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201410123664.7A priority Critical patent/CN103888982B/en
Publication of CN103888982A publication Critical patent/CN103888982A/en
Application granted granted Critical
Publication of CN103888982B publication Critical patent/CN103888982B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a management and control node selection method in a content center wireless network. The method comprises the steps that current network topology is abstracted into a weighted undirected graph G, and the topology potential of each node in the graph G is calculated; any initial node ni is selected, and searching is started based on the topology potential until the node with the maximum local topology potential is found out; then searching is started from the node with the maximum local topology potential in the descent direction of the topology potential until the tip node is reached; the nodes related in the searching process in the descent direction of the topology potential are divided into virtual network cells; after all the nodes in the graph G are divided, the nodes with the maximum local topology potential in all the virtual network cells are used as the management and control nodes in the virtual network cells. The management and control node selection method is used, the time delay for searching and feeding back of the content in the cells is shortened, and the quality of whole network communication service is improved.

Description

Management in a kind of content center wireless network and control node selecting method
Technical field
The present invention relates to wireless communication technology field, relate in particular to management and control node selecting method in a kind of content center wireless network.
Background technology
Along with the fast development of network technology and application, Internet resources finiteness, ossify, management and control ability and network demand diversity, suddenly become the principal contradiction that network operation faces.How efficiently to utilize conventional network resources, maximize and meet user's business demand and the requirement of service quality is become to a major issue urgently to be resolved hurrily.
In to the research of future network architectural framework, content center network (CCN) is for user's demand growing to content related service, and research, using content as network identity, is replaced the new network architecture of existing network IP eel-like figure.Research, by the mode of taking Internet resources to separate with position, realizes the decoupling zero of business and resource, improves the utilance of resource and uses flexibility.But, along with CCN network size constantly expands, the search pattern that forwards interest bag with inundation pattern will cause network performance suddenly to fall, and must plan and the technology such as caching resource by topology, suppress spreading unchecked of inundation data on the one hand, improve on the other hand success rate and the efficiency of contents distribution.
Along with user for mobile office with carry being widely used of equipment (BYOD), in network, the spread in performance of each terminal is uneven, network isomery characteristic is remarkable gradually.Meanwhile, the finiteness of mobile network's transmission means and transmission rate and otherness, limited contents distribution efficiency, reduced user's experience.This just needs the availability of each terminal and link in dynamic evaluation network, by the topology of networks of making rational planning for, selects the technological means such as applicable network-caching node, and optimized network operational mode, improves user's experience.
In prior art, dynamic network management/the monitor node having proposed based on minimum network traffic is selected Pressure algorithm, by the deployment of the information node (ICP) in optimized network, reduce the data traffic producing in infonnation collection process, improve the utilization rate of network, reduce network and gather around.But this algorithm is the strategy of distributing rationally to network bandwidth resources in essence.Algorithm is only selected ICP node using flow pressure parameter as unique single index, other attributes of disposal ability, the storage capacity etc. of node are not carried out to comprehensive assessment, cannot guarantee that selected ICP node possesses enough managerial abilities, thereby cause monitoring capacity deficiency even to lose efficacy.In addition, algorithm is only considered network in general flow, does not make a concrete analysis of for the utilizable flow situation of concrete each link in network, will cause local link load excessive, reduces transmission quality.
Summary of the invention
The object of this invention is to provide management in a kind of content center wireless network and control node selecting method, having shortened the time delay of content search and feedback in community, having promoted TOCOM total communication service quality.
The object of the invention is to be achieved through the following technical solutions:
Management in content center wireless network and a control node selecting method, the method comprises:
Be weighted-graph G by current network topological abstract, and the Topology Potential of each node in calculating chart G;
Optional start node n i, and start search based on Topology Potential, until find the node of local topology gesture maximum; Search for until reach frontier node along Topology Potential descent direction from the node of described local topology gesture maximum again; To be a virtual network community along node division involved in Topology Potential descent direction search procedure;
After in described figure G, all nodes are all divided, the management using the node of local topology gesture maximum in each virtual network community as this virtual network community and control node.
As seen from the above technical solution provided by the invention, can be according to spontaneous, the dynamic constructing virtual of the performance of nodes and link Web Community, thus dwindle network size, reduce the number of times that interest bag forwards; In addition, realize management and the selection of controlling node, can reduce transmitted data amount, reduce propagation delay time, simultaneously again can be under heterogeneous wireless network environment, guarantee that superior resources are fully utilized, avoid occurring the limited caused network congestion of node and transmittability.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme of the embodiment of the present invention, below the accompanying drawing of required use during embodiment is described is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, do not paying under the prerequisite of creative work, can also obtain other accompanying drawings according to these accompanying drawings.
Management in a kind of content center wireless network that Fig. 1 provides for the embodiment of the present invention one and the flow chart of controlling node selecting method;
Management in a kind of content center wireless network that Fig. 2 provides for the embodiment of the present invention two and the flow chart of controlling node selecting method;
A kind of flow chart of searching for based on virtual network community management and the distributed content of controlling node that Fig. 3 provides for the embodiment of the present invention two.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Based on embodiments of the invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to protection scope of the present invention.
According to fixed route, user's demand is sent to the server of appointment with respect to traditional IP, the mode of CCN network using inundation sends interest bag, in inquiry network, whether each node comprises required content, and in the service quality that network can provide and network size, network, in the data-handling capacity of each node and network, the available bandwidth of each link is closely related.How to dwindle interest and wrap in the propagation scale in network, select the forward node that disposal ability and transmission bandwidth are higher, the efficiency and the user that directly affect content search are experienced.Consider the access of user in mobile network and leave and there is uncertainty, therefore need the research can the spontaneous method that whole network is rationally split as to some small-scale virtual networks community, make the forwarding of interest bag and returning of content go through less network node; Further in the situation that considering in network each joint behavior and link transmission speed, select the node of high-quality as content resource management and control node (claiming again management and control node) in localized network, the buffer memory of bearing content and distribution function, make that other user node is able to fast, Gains resources easily.
Embodiment mono-
Management in a kind of content center wireless network that Fig. 1 provides for the embodiment of the present invention one and the flow chart of controlling node selecting method.As shown in Figure 1, the method mainly comprises the steps:
Step 11, be weighted-graph G by current network topological abstract, and the Topology Potential of each node in calculating chart G.
In the embodiment of the present invention, weighted-graph G can be expressed as: G=(N, E), wherein, the set of node of N presentation graphs G, E be figure G limit collection, e ijrepresent node n iwith n jbetween link;
A=(a ij) k × Kthe adjacency matrix of presentation graphs G, wherein, a ij = 1 , e ij ∈ E 0 , e ij ∉ E i , j = 1,2 , . . . , N .
The embodiment of the present invention uses field theory that the available resources of nodes and link are carried out to comprehensive assessment and quantification, according to the height distribution of weighting topology potential energy is spontaneous, whole network is divided into some virtual networks community that scale is less, and select the optimum node of Local resource that this community is managed and controlled, to guarantee can realize between community's internal node the content delivery of low time delay, high success rate.
Based on data fields theory, regard network as one and comprise K node interactional physical system.Each node n iall there is a field, all node n j={ n j∈ N, (i ≠ j) } be all subject to n ithe effect of field; And node n ialso be subject to the impact of other node fields in network.Known according to the feature of field theory, the active force of node increases along with the increase of node sole mass, and the scope of node active force decays along with the growth of network distance.Employing represents short-range field and has the interaction between the Gauss potential function representation nodes of good mathematical property.Defined node n itopology Potential W (n i) be:
W ( n i ) = Σ j = 1 K c ‾ ( n j ) × e - ( d ( i , j ) γ j × bw a ( j ) ) 2 ;
Wherein, the Weighted Guidelines that in measurement physical network, each node is considered device processes ability and storage capacity, α jand β jrepresent respectively node device n jdisposal ability c (n j) and storage capacity v (n j) weight coefficient;
Figure BDA0000484196730000043
represent and physical node n jeach the link residue available transmission rate summation being connected, γ jrepresent the weight coefficient of link available transmission rate summation; D{i, j} represents node n iwith n jbetween distance.
Step 12, optional start node n i, and start search based on Topology Potential, until find the node of local topology gesture maximum; Search for until reach frontier node along Topology Potential descent direction from the node of described local topology gesture maximum again; To be a virtual network community along node division involved in Topology Potential descent direction search procedure.
The processing procedure of this step is specially: optional start node n i, by inquiring about the adjacency matrix A of described figure G, obtain and node n ithere is the adjacent segments point set connecting, comparison node n ibe adjacent the Topology Potential of set of node; Select described adjacent node to concentrate the highest node of Topology Potential as node n ithe ascent direction of climbing the mountain of point, until find the Topology Potential of a node higher than its all adjacent nodes, this node is the node of local topology gesture maximum; Along all Topology Potential descent direction search of adjacent node, until arrive all frontier nodes, will be a virtual network community along node division involved in Topology Potential descent direction search procedure from the local pole general trend of events value node obtaining.Described frontier node comprises several, and the Topology Potential of each frontier node is less than its adjacent node Topology Potential, and carries out after search by hill climbing along frontier node adjacent node, arrives different local topology gesture maximum node.
Step 13, after in described figure G, all nodes are all divided, the management using the node of local topology gesture maximum in each virtual network community as this virtual network community with control node.
Repeated execution of steps 12 until in figure G all nodes all divide completely, so far, virtual network community has divided.In whole network, form the Topology Potential highland centered by local pole general trend of events value point (node of local topology gesture maximum), frontier node point set composition gesture value low ebb, the virtual network community of separating adjacent.
Because the very big gesture value node in virtual network community has Topology Potential the highest in community, be that node integration capability (containing disposal ability, memory space, the network bandwidth) assessed value is the highest, therefore the management that is, this virtual network community by very big virtual network community gesture value node and control node.
Further, in the embodiment of the present invention based on described management with control node and carry out content search and can avoid interest to wrap in the whole network forwarding in inundation mode, further reduce interest bag hop count and content search time delay, improve search efficiency.
In virtual network community, management need to be fulfiled internally and external two parts of responsibilities with control node.Internally responsibility: management needs all the elements resource in buffer memory present networks community with control node, and responds the resource requirement of inside, community.Externally responsibility: at the beginning of community forms, each management with control node by shaking hands, obtain adjacent virtual Web Community mark, and the route of communicating by letter between buffer memory and adjacent community management and control node.Different from the whole network Flooding, based on virtual network community management and the content search of controlling node assistance, first carry out the search of specific direction in inside, community, in the time that not comprising required content, this community carries out again searching for across community; Concrete: the node in a certain virtual network community, according to content search instruction, generates interest bag and sends along Topology Potential ascent direction; Forward node receives after this interest bag, content corresponding to described interest bag that judged local whether buffer memory; If so, the rightabout sending according to interest bag feeds back corresponding content; Otherwise, judge whether himself is the management and control node in current virtual network community.If so, be transmitted to interest bag to the management of adjacent virtual Web Community with control node; Otherwise, continue to forward interest bag along Topology Potential ascent direction; When described adjacent virtual Web Community buffer memory when content corresponding to described interest bag, the rightabout sending according to interest bag feeds back corresponding content.In addition, when not content corresponding to interest bag described in buffer memory of described adjacent virtual Web Community, judge whether current interest bag hop count exceedes threshold value; If so, feedback search failure information; Otherwise, continue to forward this interest bag.
The embodiment of the present invention can be according to spontaneous, the dynamic constructing virtual of the performance of nodes and link Web Community, thereby dwindles network size, reduces the number of times that interest bag forwards; In addition, realize management and the selection of controlling node, can reduce transmitted data amount, reduce propagation delay time, simultaneously again can be under heterogeneous wireless network environment, guarantee that superior resources are fully utilized, avoid occurring the limited caused network congestion of node and transmittability.
Embodiment bis-
For the ease of understanding the present invention, below in conjunction with accompanying drawing 2-3, the present invention will be further described.
In the embodiment of the present invention, be weighted-graph G=(N, E) by network topology, wherein, the set of node of N presentation graphs G, E be figure G limit collection, e ijrepresent node n iwith n jbetween link; A=(a ij) k × Kthe adjacency matrix of presentation graphs G, wherein, a ij = 1 , e ij ∈ E 0 , e ij ∉ E i , j = 1,2 , . . . , N .
The embodiment of the present invention uses field theory that the available resources of nodes and link are carried out to comprehensive assessment and quantification, according to the height distribution of weighting topology potential energy is spontaneous, whole network is divided into some virtual networks community that scale is less, and select the optimum node of Local resource that this community is managed and controlled, to guarantee can realize between community's internal node the content delivery of low time delay, high success rate.
Wherein, the available resources of node dynamic change along with the state variation of node.The embodiment of the present invention is utilized vector [c (n i), v (n i)] description node available resources, wherein c (n i) expression node n ithe available processes ability of (the arbitrary node in set of node N), as node cpu; V (n i) represent the available cache memory space of node; Utilize bw ijrepresent link e ijarranged transmission rate.
Based on data fields theory, regard network as one and comprise K node interactional physical system.Each node n iall there is a field, all node n j={ n j∈ N, (i ≠ j) } be all subject to n ithe effect of field; And node n ialso be subject to the impact of other node fields in network.Known according to the feature of field theory, the active force of node increases along with the increase of node sole mass, and the scope of node active force decays along with the growth of network distance.Employing represents short-range field and has the interaction between the Gauss potential function representation nodes of good mathematical property.Defined node n itopology Potential W (n i) be:
W ( n i ) = Σ j = 1 K c ‾ ( n j ) × e - ( d ( i , j ) γ j × bw a ( j ) ) 2 - - - ( 1 )
Wherein, the Weighted Guidelines that in measurement physical network, each node is considered device processes ability and storage capacity, α jand β jrepresent respectively node device n jdisposal ability c (n j) and storage capacity v (n j) weight coefficient;
Figure BDA0000484196730000064
represent and physical node n jeach the link residue available transmission rate summation being connected, γ jrepresent the weight coefficient of link available transmission rate summation; D{i, j} represents node n iwith n jbetween distance, adopt shortest path jumping figure to weigh.According to different optimization aim, can defined node and the associated weight coefficient of link circuit resource, thus can assess network from the such as different angles such as efficiency, cost.For example, when take network energy efficiency as optimization aim, the energy that weight coefficient consumes for applying unit resource; When take network operation cost as optimization aim, weight coefficient is chosen and is taken the expense that unit resource causes.
According to the mathematical property of Gaussian function, each node n jcoverage be approximately
Figure BDA0000484196730000065
jump, in the time that distance is greater than this scope, potential function decays to 0 very soon.That is to say, connect the node of close quarters in network, there is higher Topology Potential.In the time that the external available bandwidth of node reduces gradually, the Topology Potential of node reduces gradually, and the importance of node in network declines immediately.This shows the weighting Topology Potential W (n of node i) can be quantitative by the strong and weak Integrative expression of the processing of node, storage capacity out, reaction node topology position that again can be quantitative and internodal action intensity.
The management that the embodiment of the present invention provides and control node selecting method are that the size based on Topology Potential is selected.Specifically, be to divide virtual network community based on Topology Potential, then select management and control node in virtual network community.The method can realize on the unified control platform of the whole network, and network control platform has following two major functions: on the one hand, network control platform needs the Resource Properties of each node and link in collection network; Divide on the other hand virtual network community and control routing mode.
The method can be summarized as following three steps: 1) obtain Internet resources and calculate each node weighting Topology Potential; 2) by the tendency of Topology Potential between comparison node, judge highland and low ebb that Topology Potential forms, Topology Potential highland continuous a slice is divided into a virtual network community; 3) select the management and control node of suitable node as this virtual network community in each Web Community inside.The method of this patent design is considered the dynamic characteristic of wireless network node and link, and current available resource self adaptation Network Based realizes the division of virtual network community.Concrete flow process can, referring to Fig. 2, mainly comprise the steps:
1) using formula (1), the Topology Potential of each node in computing network.
2) optional start node n i, by inquiring about the adjacency matrix A of described figure G, obtain and node n ithere is the adjacent segments point set connecting, comparison node n ibe adjacent the Topology Potential of set of node.
3) select described adjacent node to concentrate the highest node of Topology Potential as node n ithe ascent direction of climbing the mountain of point.
4) repeating step 2) and step 3) until find the Topology Potential of a node higher than its all adjacent nodes, now, complete hill-climbing algorithm, present node is a local pole general trend of events value node (node of local topology gesture maximum).
5) the local pole general trend of events value node certainly obtaining is along all Topology Potential descent direction search of adjacent node, until arrive all frontier nodes, exist this node topology gesture to be less than adjacent node Topology Potential, and carry out after search by hill climbing along this adjacent node, arrive different local maximum value nodes;
6) the node traversing in step 5) forms a virtual network community.
7) optionally select the node of not yet dividing virtual network community, repeating step 2)-step 6), until all nodes all form virtual network community in network.So far, network virtual Web Community has divided.In whole network, form the Topology Potential highland centered by local pole general trend of events value point, frontier node point set composition gesture value low ebb, the virtual network community of separating adjacent;
8) because the very big gesture value node in virtual network community has the highest Topology Potential in virtual network community, be that node integration capability (containing disposal ability, memory space, the network bandwidth) assessed value is the highest, therefore the management that is, this virtual network community by very big virtual network community gesture value node and control node.
Above-mentioned virtual network community division method, the quantity that does not need user to specify in advance community, but nodes and link available resources are calculated to the division that realizes community that just can be spontaneous; Community network management is also born by the node that in current community, Topology Potential value is the highest with control node.Therefore, in the time increase newly/removing node or link transmission capacity variation in network, this algorithm can be according to the attribute of resource, automatically upgrades Web Community and divides, and reselects applicable management and controls node, has ensured the continuity of managing under wireless network environment.
Further, in the embodiment of the present invention based on described management with control node and carry out content search and can avoid interest to wrap in the whole network forwarding in inundation mode, further reduce interest bag hop count and content search time delay, improve search efficiency.
In virtual network community, management need to be fulfiled internally and external two parts of responsibilities with control node.Internally responsibility: management needs all the elements resource in buffer memory present networks community with control node, and responds the resource requirement of inside, community.Externally responsibility: at the beginning of community forms, each management with control node by shaking hands, obtain adjacent virtual Web Community mark, and the route of communicating by letter between buffer memory and adjacent community management and control node.Different from the whole network Flooding, based on virtual network community management and the content search of controlling node assistance, first carry out the search of specific direction in inside, community, in the time that not comprising required content, this community carries out again searching for across community; Idiographic flow as shown in Figure 3, mainly comprises: the node in a certain virtual network community, according to content search instruction, generates interest bag and sends along Topology Potential ascent direction; Forward node receives after this interest bag, content corresponding to described interest bag that judged local whether buffer memory; If so, the rightabout sending according to interest bag feeds back corresponding content; Otherwise, judge whether himself is the management and control node in current virtual network community.If so, be transmitted to interest bag to the management of adjacent virtual Web Community with control node; Otherwise, continue to forward interest bag along Topology Potential ascent direction; When described adjacent virtual Web Community buffer memory when content corresponding to described interest bag, the rightabout sending according to interest bag feeds back corresponding content.
In addition, in order to control the hop count of interest bag in network, avoid the flood of data of interest bag, reduce network performance, need in advance to set max-forwards number of times, and usage counter is followed the tracks of interest bag hop count.When not content corresponding to interest bag described in buffer memory of described adjacent virtual Web Community, judge whether current interest bag hop count exceedes threshold value; If so, feedback search failure information; Otherwise, continue to forward this interest bag.
The embodiment of the present invention can be according to spontaneous, the dynamic constructing virtual of the performance of nodes and link Web Community, thereby dwindles network size, reduces the number of times that interest bag forwards; In addition, realize management and the selection of controlling node, can reduce transmitted data amount, reduce propagation delay time, simultaneously again can be under heterogeneous wireless network environment, guarantee that superior resources are fully utilized, avoid occurring the limited caused network congestion of node and transmittability.
Through the above description of the embodiments, those skilled in the art can be well understood to above-described embodiment and can realize by software, and the mode that also can add necessary general hardware platform by software realizes.Based on such understanding, the technical scheme of above-described embodiment can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise that some instructions are in order to make a computer equipment (can be personal computer, server, or the network equipment etc.) carry out the method described in each embodiment of the present invention.
The above; only for preferably embodiment of the present invention, but protection scope of the present invention is not limited to this, is anyly familiar with in technical scope that those skilled in the art disclose in the present invention; the variation that can expect easily or replacement, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.

Claims (8)

1. the management in content center wireless network and a control node selecting method, is characterized in that, the method comprises:
Be weighted-graph G by current network topological abstract, and the Topology Potential of each node in calculating chart G;
Optional start node n i, and start search based on Topology Potential, until find the node of local topology gesture maximum; Search for until reach frontier node along Topology Potential descent direction from the node of described local topology gesture maximum again; To be a virtual network community along node division involved in Topology Potential descent direction search procedure;
After in described figure G, all nodes are all divided, the management using the node of local topology gesture maximum in each virtual network community as this virtual network community and control node.
2. method according to claim 1, is characterized in that, described is that weighted-graph G comprises by current network topological abstract:
Weighted-graph G=(N, E), wherein, the set of node of N presentation graphs G, E be figure G limit collection, e ijrepresent node n iwith n jbetween link;
A=(a ij) k × Kthe adjacency matrix of presentation graphs G, wherein, a ij = 1 , e ij ∈ E 0 , e ij ∉ E i , j = 1,2 , . . . , N .
3. method according to claim 1 and 2, is characterized in that, the comprising of the Topology Potential of each node in described calculating chart G:
Each node n iall there is a field, all node n j={ n j∈ N, (i ≠ j) } be all subject to n ithe effect of field; And node n ialso be subject to the impact of other node fields in network, the computing formula of the Topology Potential of each node is:
W ( n i ) = Σ j = 1 K c ‾ ( n j ) × e - ( d ( i , j ) γ j × bw a ( j ) ) 2 ;
Wherein,
Figure FDA0000484196720000014
the Weighted Guidelines that in measurement physical network, each node is considered device processes ability and storage capacity, α jand β jrepresent respectively node device n jdisposal ability c (n j) and storage capacity v (n j) weight coefficient; represent and physical node n jeach the link residue available transmission rate summation being connected, γ jrepresent the weight coefficient of link available transmission rate summation; D{i, j} table shownode n iwith n jbetween distance.
4. method according to claim 1 and 2, is characterized in that, described optional start node n i, and start search based on Topology Potential, until find the node of local topology gesture maximum to comprise:
Optional start node n i, by inquiring about the adjacency matrix A of described figure G, obtain and node n ithere is the adjacent segments point set connecting, comparison node n ibe adjacent the Topology Potential of set of node;
Select described adjacent node to concentrate the highest node of Topology Potential as node n ithe ascent direction of climbing the mountain of point, until find the Topology Potential of a node higher than its all adjacent nodes, this node is the node of local topology gesture maximum.
5. method according to claim 1 and 2, it is characterized in that, described frontier node comprises several, and the Topology Potential of each frontier node is less than its adjacent node Topology Potential, and carry out after search by hill climbing along frontier node adjacent node, arrive different local topology gesture maximum node.
6. method according to claim 1, is characterized in that,
The management of described virtual network with control node, for all the elements resource in this virtual network of buffer memory community, and respond the resource requirement of virtual network community internal node; Also, at the beginning of forming in virtual network community, obtain adjacent virtual Web Community mark by shaking hands, and buffer memory manages and controls the route of communicating by letter between node with adjacent virtual Web Community.
7. according to the method described in claim 1 or 6, it is characterized in that, the method also comprises the step of carrying out content search based on described management and control node, and this step comprises:
Node in a certain virtual network community, according to content search instruction, generates interest bag and sends along Topology Potential ascent direction;
Forward node receives after this interest bag, content corresponding to described interest bag that judged local whether buffer memory; If so, the rightabout sending according to interest bag feeds back corresponding content; Otherwise, judge whether himself is the management and control node in current virtual network community;
If so, be transmitted to interest bag to the management of adjacent virtual Web Community with control node; Otherwise, continue to forward interest bag along Topology Potential ascent direction;
When described adjacent virtual Web Community buffer memory when content corresponding to described interest bag, the rightabout sending according to interest bag feeds back corresponding content.
8. method according to claim 7, is characterized in that, when not content corresponding to interest bag described in buffer memory of described adjacent virtual Web Community, judges whether current interest bag hop count exceedes threshold value; If so, feedback search failure information.
CN201410123664.7A 2014-03-28 2014-03-28 A kind of management in content center wireless network and control node selection method Active CN103888982B (en)

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 true CN103888982A (en) 2014-06-25
CN103888982B 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)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104796946A (en) * 2015-05-05 2015-07-22 北京邮电大学 User access method
CN104796946B (en) * 2015-05-05 2018-06-01 北京邮电大学 User access method
WO2019052076A1 (en) * 2017-09-18 2019-03-21 中国科学院声学研究所 Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium
CN110138814A (en) * 2018-02-02 2019-08-16 中国科学院声学研究所 A kind of centrality probability dispositions method for network flow unloading

Citations (4)

* Cited by examiner, † Cited by third party
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
US20130155919A1 (en) * 2011-12-20 2013-06-20 Korea Basic Science Institute Method of potential routing, method of potential scheduling, and mesh node
CN103500168A (en) * 2013-09-02 2014-01-08 中国矿业大学 Method and system for discovering communities in overlapped complex networks according to topology potential

Patent Citations (4)

* Cited by examiner, † Cited by third party
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
US20130155919A1 (en) * 2011-12-20 2013-06-20 Korea Basic Science Institute Method of potential routing, method of potential scheduling, and mesh node
CN103500168A (en) * 2013-09-02 2014-01-08 中国矿业大学 Method and system for discovering communities in overlapped complex networks according to topology potential

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104796946A (en) * 2015-05-05 2015-07-22 北京邮电大学 User access method
CN104796946B (en) * 2015-05-05 2018-06-01 北京邮电大学 User access method
WO2019052076A1 (en) * 2017-09-18 2019-03-21 中国科学院声学研究所 Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium
CN109525407A (en) * 2017-09-18 2019-03-26 中国科学院声学研究所 A kind of same layer is without intersection all standing nested generation method and readable storage medium storing program for executing
JP2020533915A (en) * 2017-09-18 2020-11-19 中国科学院声学研究所Ｉｎｓｔｉｔｕｔｅ Ｏｆ Ａｃｏｕｓｔｉｃｓ， Ｃｈｉｎｅｓｅ Ａｃａｄｅｍｙ Ｏｆ Ｓｃｉｅｎｃｅｓ Nested container generation method and readable storage medium
US11231954B2 (en) 2017-09-18 2022-01-25 Institute Of Acoustics, Chinese Academy Of Sciences Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium
CN110138814A (en) * 2018-02-02 2019-08-16 中国科学院声学研究所 A kind of centrality probability dispositions method for network flow unloading
CN110138814B (en) * 2018-02-02 2020-04-24 中国科学院声学研究所 Centrality probability deployment method for network flow unloading

Also Published As

Publication number Publication date
CN103888982B (en) 2018-10-16

Similar Documents

Publication Publication Date Title
Yao et al. EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks
US8259736B2 (en) Selecting a path through a network
Guo et al. Multi-objective OLSR for proactive routing in MANET with delay, energy, and link lifetime predictions
Al-Turjman et al. A value-based cache replacement approach for information-centric networks
Sadagopan et al. Decentralized utility-based sensor network design
Zhao et al. Social-community-aware long-range link establishment for multihop D2D communication networks
Chen et al. Energy-efficient itinerary planning for mobile agents in wireless sensor networks
Wu et al. Energy-latency aware offloading for hierarchical mobile edge computing
Kumar et al. EMEEDP: Enhanced multi-hop energy efficient distributed protocol for heterogeneous wireless sensor network
Choudhury et al. A proactive context-aware service replication scheme for adhoc IoT scenarios
Abd et al. Game theoretic energy balanced (GTEB) routing protocol for wireless sensor networks
Bhandari et al. Resource oriented topology construction to ensure high reliability in IoT based smart city networks
Izaddoost et al. Energy efficient data transmission in iot platforms
CN103888982A (en) Management and control node selection method in content center wireless network
De Rango et al. Swarm intelligence based energy saving and load balancing in wireless ad hoc networks
Bhunia et al. EMCR: routing in WSN using multi criteria decision analysis and entropy weights
Das et al. Multi criteria routing in wireless sensor network using weighted product model and relative rating
Han et al. Space edge cloud enabling service migration for on-orbit service
Zungeru et al. Performance evaluation of ant-based routing protocols for wireless sensor networks
György et al. Adaptive routing using expert advice
Dominguez et al. Energy-efficient and location-aware ant colony based routing algorithms for wireless sensor networks
Bhattacharjee et al. Energy efficient multiple sink placement in wireless sensor networks
Le et al. A load balanced social-tie routing strategy for dtns based on queue length control
Varma et al. Congestion games in caching enabled heterogeneous cellular networks
Silva et al. A percolation-based approach to model DTN congestion control

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