CN101399574B - Power management method and device - Google Patents
Power management method and device Download PDFInfo
- Publication number
- CN101399574B CN101399574B CN200710151588A CN200710151588A CN101399574B CN 101399574 B CN101399574 B CN 101399574B CN 200710151588 A CN200710151588 A CN 200710151588A CN 200710151588 A CN200710151588 A CN 200710151588A CN 101399574 B CN101399574 B CN 101399574B
- Authority
- CN
- China
- Prior art keywords
- summit
- limit
- cut edge
- vertex set
- vertex
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a power management method, which comprises the following steps: nodes and communication flow in a system are respectively mapped to vertex and sides in a diagram to generate the diagram which is corresponding to the system; the vertexes with the largest degree are selected in the generated map to make up a vertex set; the vertex with the least side in a correlative side which is selected from the vertex set is cut off; the sides which are associated with the selected vertex are obtained to make up a side set; the concentrated sides of the sides are sorted; services are provided to the communication flow between the nodes represented by the concentrated sides of the sides according to the sorted sequence. Meanwhile, the invention discloses a power management device. The energy loss of the system can be better reduced by applying the embodiment of the invention.
Description
Technical field
The present invention relates to radio network technique, power management method and device in particularly a kind of wireless personal domain network.
Background technology
Wireless personal domain network (WPAN) is a kind of low rate, low-power consumption, low complex degree and the network that comprises a large amount of radio nodes, and its potential application has transducer, remote-control toy, intelligent badge, remote controller and household automatic device etc.U.S.'s Institute of Electrical and Electronics Engineers IEEE (IEEE) 802.15.4 standard is that media interviews control (MAC) layer protocol has been formulated in the realization of WPAN, and its transmission range is about the typical transmission scope 10m of WPAN.This standard code three kinds of optional data rate: 250kbit/s, 40kbit/s and 20kbit/s of WPAN; Two kinds of addressing systems: 16 bits and 64 bit addressing; Three kinds of working frequency range: 16 channels on the 2.4GHz frequency range, 1 channel on 10 channels and the 868MHz frequency range on the 915MHz frequency range.
Stipulate in the IEEE802.15.4 standard that use superframe to come the periodically communication between the organization network interior nodes, the telegon among the WPAN utilizes superframe structure to come limiting bandwidth.Fig. 1 is existing superframe structure sketch map.As shown in Figure 1, a superframe is made up of active period and inactive phase two parts usually, and during inactive, node gets into resting state to save energy.The active period of each superframe specifically is divided into three parts again: beacon frame, competition period (CAP) and non-competing period (CFP).Wherein, beacon frame is the CAP period at the section start of transmission time slot 0 subsequently, is the CFP period after the CAP period, and lasts till that the superframe active period finishes.Three parts of active period specifically are divided into the individual isometric time slot of superframe number of time slot (aNumberSuperframeSlots), and the duration of each time slot is 2
SO* aBaseSlotDuration.In the CAP period, node uses the carrier sense multiple spot to insert (CSMA)/conflict and avoids (CA) algorithm competition access channel; In the CFP period; Node need not to use the CSMA/CA algorithm to come competitive channel; The time slot that telegon in the network is applied in the CAP period according to node guarantees mechanism (GTS) situation; CFP is divided into several GTS, and each GTS is made up of several continuous slots, so the duration of CFP is depended on the length of all GTS.
Generally, for saving energy, can make each node enter into the very low resting state of power with the GTS that oneself has nothing to do; And if realize more reasonable energy utilization on this basis, then need carry out certain optimization to existing power management method.
A kind of power management optimization method has been proposed, i.e. chaining service algorithm (LSA, Linked Service Algorithm) in the prior art.Before the concrete realization of introducing this algorithm, at first introduce notion and theorem in some relevant with it graph theorys.
Define 1 figure
So-called figure is meant a tlv triple; Note is made G=< V (G); E (G);
(G) >, wherein:
(1) V (G)={ v
1, v
2..., v
n, V (G) ≠ φ is called summit (vertex) set of G;
(2) E (G)={ e
1, e
2..., e
mIt is limit (edge) set of G; E wherein
iBe { v
j, v
tOr<v
j, v
t>, j ≠ t; If e
iBe { v
j, v
t, then claim e
iFor with v
jAnd v
tBe the nonoriented edge (undirectededge) of end points (end vertices), the figure that every limit all is a nonoriented edge is called non-directed graph (undirected graph); If e
iWith v
jBe starting point (origin), v
tFor terminal point (terminus), then claim e
iBe directed edge (directed edge) that the figure that every limit all is a directed edge is called directed graph (directed graph).
(3)
(G): E → V * V is called correlation function (incidence function).
Definition 2 degree (degree)
G is any figure, x ∈ G, and the limit number related with x is called the degree of x, and note is made deg (x) or d (x); Two summits that are associated with same limit are called adjacent vertex (adjacent vertex); The summit that is not connected with any summit, promptly degree is that zero summit is called isolated vertex (isolated vertex); The limit that is associated with same summit is called adjacent side (adjacent sides); Only there is the figure of some isolated vertexs to be called null graph (null graph) or empty graph (empty graph); Have only the figure of an isolated vertex to be called trivial graph (trivial graph); All there is the continuous simple non-directed graph in limit to be called complete graph (complete graph) between any two different summits.
Define 3 tunnel (path) and connected graph (connected graph)
Given figure G=< V (G); E (G);
(G) >, a path among the figure is a sequence that point, limit replace:
u
0e
1u
1e
2...u
n-1e
nu
n(u＝u
0，v＝u
n)
Wherein, u
i∈ V (G), e
i∈ E (G), u=u
0And v=u
nBe called the starting point and the terminal point of path respectively, this path is called the loop when it overlaps; Among the non-directed graph G,, claim that then u and v are communicated with if having path between summit u and the v; Stipulate that any summit is communicated with self; If G is any 2 all connections among trivial graph or the G, claims that then G is a connected graph, otherwise claim that G is unconnected graph or separation graph.
Define 4 Eulers (Euler) figure
The non-directed graph G of given no isolated vertex is called Euler road (Euler path) through the every limit of G mark once.Through figure G every limit once and only once return be called Euler's circuit (Euler circuit)); The undirected connected graph that contains Euler's circuit is an Euler diagram.
Theorem 5
The condition that has Euler's circuit among the connected graph G is that and if only if, and all there is the even number degree on its each summit.
Define 6 Hamilton (Hamilton) figure
Given non-directed graph G is if exist a road through each summit of G once and only once, then this road is called Hamiltonian path (Hamilton path); Through figure G each summit once and only once circle be called Hamiltonian cycle (Hamilton cycle) or hamiltonian circuit (Hamilton circuit); The non-directed graph that contains Hamilton is a Hamiltonian graph.
Based on above-mentioned graph theory content, a kind of LSA algorithm that is used to realize power management has been proposed in the prior art.This algorithm is regarded each node in the system as among the figure a summit, and communication stream mutual between the node is seen the limit in the mapping, thereby generates a figure, through this figure is analyzed, realizes power management, i.e. communication stream scheduling.Those skilled in the art can know, for any one given figure, must comprise an optimal sequence, and can find this optimal sequence through the method for exhaustion, but its algorithm complex be N! Obviously, such complexity be along with the increase of N will become unacceptable, so, proposed to seek the thought of suboptimum order in the LSA algorithm, promptly when confirming communication stream that next one need to dispatch, make remaining stream link each as far as possible, be implemented as follows:
(1) each communication stream in the system is represented with the mode of figure G.
(2) the maximum node v of selectance in G
i, its corresponding connection component is represented with G1, makes G=G1; With all and v
iThe set note on the limit that is associated is made f={e
I1, e
I2..., e
Ik;
(3) to e
I1, e
I2..., e
IkSort, for the corresponding stream in each limit after the ordering provides service continuously;
Such as, with v
iSelect to remove v in all summits of adjacency
iThe maximum vertex v of outer degree
jAnd corresponding limit e
Ij, with e
IjBanishing in the end of representative selects to remove v afterwards again
iAnd v
jThe corresponding limit, summit that outer degree is maximum is with banishing at e of its representative
IjHandle, other is analogized before;
Make G=G-f, if G is sky, then process ends; Otherwise, execution in step (4);
(4) the maximum vertex v of selectance in G
j, and execution in step (2);
Though above-mentioned LSA algorithm can be realized the communication stream scheduling; But this algorithm exists certain defective; Promptly when having the node of degree maximum more than in the system; First node in the time of can only selecting one of them node as scheduling in this algorithm randomly, but in the practical application, influence is discrepant to subsequent process as first node to select which node.
Illustrate: Fig. 2 is for having now the sketch map after the diagrammatic representation of the communication stream in the system.Shown in Fig. 2 (a), five nodes in v1 wherein, v2, v3, v4 and the v5 expression system respectively; According to the LSA algorithm, the maximum summit of degree is v6 and v2, is 3, supposes to select at random node v6 as first node, and the communication stream dispatching sequence of system is e shown in Fig. 2 (a) so
5→ e
3→ e
6→ e
1→ e
2→ e
4, total wake-up times is 8 times; Because with v
6After relevant communication stream finished, just only remaining disconnected two sub-graphs mutually shown in Fig. 2 (b), had increased wake-up times among the figure.If select v
2As first node, with v
2After relevant communication stream finished, remaining figure still was communicated with, shown in Fig. 2 (c); The dispatching sequence of communication stream is e
1→ e
2→ e
6→ e
3→ e
5→ e
4, total wake-up times is 7 times.
It is thus clear that; When a certain node in the identical node of selectance as the scheduling in first node the time; If this node can cause the appearance of cut edge; So with this node first node as scheduling, will be than need more wake-up times during as first node of scheduling with the node that can not cause cut edge to occur; Here the cut edge of being mentioned is to instigate figure to become the limit of disconnected graph, like the e5 among Fig. 2 (a).
In realizing process of the present invention; The inventor finds to exist at least in the prior art following problem: because in the CFP period, node does not exist because the energy loss that cross-talk is brought according to the GTS transceive data of distributing to oneself; Therefore; The state exchange of node just becomes the main source of energy loss, and the energy expense of wake up/sleep conversion will be far longer than the energy expense of transmitting-receiving conversion.And can know that according to the analysis of Fig. 1 the existing LSA algorithm maximum a certain node of selectance randomly can not be selected optimum communication stream dispatching sequence exactly as first node of scheduling, the energy loss in CFP stage is just big.
Summary of the invention
The embodiment of the invention provides a kind of power management method, uses the energy loss that this method can reduce system preferably.
The embodiment of the invention provides a kind of power management apparatus, uses the energy loss that this device can reduce system preferably.
The technical scheme of the embodiment of the invention is achieved in that
A kind of power management method, this method comprises:
Node in the system and communication stream are corresponded to summit and limit among the figure respectively, generate the corresponding figure of said system;
Vertex set is formed on the maximum summit of selectance in the figure of said generation, from said vertex set, selects the minimum summit of cut edge in the limit that is associated; Wherein, degree is meant that the limit number that is associated, cut edge are to instigate figure to become the limit of disconnected graph, and connected graph is meant that all there is the figure of path in any point-to-point transmission, is associated to be meant and to have annexation;
Obtaining the limit that is associated with said selected summit, form the limit collection, sorted in the limit that concentrate on said limit, is that the inter-node communication stream that concentrated limit, said limit is represented provides service according to the order after the ordering;
The method that sorts in the limit that said opposite side is concentrated comprises:
Select except that selected summit, to spend maximum summit in all summits with said selected summit adjacency, the limit that this summit is corresponding comes the last of said limit collection; Select in all summits with said selected summit adjacency except that degree time big summit, selected summit, the limit that this summit is corresponding come said limit collection time after the position, all the other summits.
A kind of power management apparatus, this device comprises:
Generation unit is used for the node and the communication stream of system are corresponded to summit and limit among the figure respectively, generates the corresponding figure of said system;
Selected cell is used for forming vertex set from the maximum summit of said figure selectance, from said vertex set, selects the minimum summit of cut edge in the limit that is associated; Wherein, degree is meant that the limit number that is associated, cut edge are to instigate figure to become the limit of disconnected graph, and connected graph is meant that all there is the figure of path in any point-to-point transmission, is associated to be meant and to have annexation;
Service unit is used to obtain the limit that is associated with said selected summit, forms the limit collection, sorted in the limit that concentrate on said limit, and be that the inter-node communication stream that concentrated limit, said limit is represented provides service according to the order after the ordering;
Said service unit specifically comprises:
Obtain subelement, be used to obtain the limit that is associated with said selected summit, form the limit collection;
The ordering subelement is used for selecting all summits with said selected summit adjacency except that selected summit, to spend maximum summit, and the limit that this summit is corresponding comes the last of said limit collection; Select in all summits with said selected summit adjacency except that degree time big summit, selected summit, the limit that this summit is corresponding come said limit collection time after the position, all the other summits;
Service provides subelement, and being used for according to the order after the ordering is that the inter-node communication stream that concentrated limit, said limit is represented provides service.
It is thus clear that; Adopt the technical scheme of the embodiment of the invention, when the degree maximum node that comprises among the figure that generates is one when above, and begin scheduling unlike the same some summits corresponding nodes wherein of selecting at random of LSA algorithm of the prior art; But through analyzing; The minimum summit corresponding nodes of cut edge is as the communication stream scheduling node in the limit that selection is associated, thereby reduces total wake-up times of system, reduces the energy loss of system.
Description of drawings
Fig. 1 is existing superframe structure sketch map.
Fig. 2 is for having now the sketch map after the diagrammatic representation of the communication stream in the system.
Fig. 3 is the flow chart of the inventive method first embodiment.
Fig. 4 is the flow chart of the inventive method second embodiment.
Fig. 5 is the composition structural representation of apparatus of the present invention embodiment.
Fig. 6 is a simulated effect sketch map in the embodiment of the invention.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is done to specify further.
In the execution mode of the present invention, node in the system and communication stream are corresponded to summit and limit among the figure respectively, generate the corresponding figure of this system; Vertex set is formed on the maximum summit of selectance in the figure that is generated, and from this vertex set, selects the minimum summit of cut edge in the limit that is associated; The limit collection is formed on the limit that obtains and should selected summit be associated, and sorts in the limit that opposite side is concentrated, and the communication stream that the limit of concentrating for this limit according to the order after the ordering is represented provides service.Through reducing node wake up/sleep conversion times, i.e. wake-up times, being implemented in the CFP period reduces energy loss.
That is to say; When the degree maximum node that comprises among the figure that generates is one or more; And begin scheduling, but, can cause the appearance of cut edge in case find the summit of current selection through analyzing unlike the same some summits corresponding nodes wherein of selecting at random of LSA algorithm of the prior art; Then select other node, up to find qualified till; If the maximum node of all degree all can cause the appearance of cut edge, mutual not that minimum summit corresponding nodes of connected subgraph began the scheduling of communication stream after then cut edge was removed in selection; In a word, select to make the minimum node of the total wake-up times of system, thereby reach the purpose that reduces the system capacity loss as scheduling node.
Through first embodiment scheme according to the invention is done to specify further below:
Fig. 3 is the flow chart of the inventive method first embodiment.As shown in Figure 3, may further comprise the steps:
Step 301: the communication stream of system is represented with the mode of figure.
In this step, each node in the communication system as a summit among the figure, is added to the communication stream that exists between any two nodes between the summit corresponding with these two nodes as a limit, thereby obtains the figure G corresponding with this system.
Step 302: the maximum summit of selectance from the figure that generates forms vertex set V
Max
In this step, the maximum summit of selectance forms vertex set V from the figure G that generates
Max={ v
1, v
j..., v
l, comprising number of vertices possibly be one, also maybe be for more than one.
Step 303: from vertex set V
MaxThe minimum vertex v of cut edge in limit that is associated of middle selection
i
Before this step, further comprise: judge vertex set V
MaxIn number of vertices whether be one, if be one, direct execution in step 304 then; If be not one, optional vertex set V
MaxIn a summit, judge in the limit that is associated on this summit whether have cut edge, if do not exist, then this summit is required vertex v
iIf exist, then other summit beyond this summit is judged, in finding the corresponding associated limit, do not exist till the summit of cut edge.
If vertex set V
MaxIn all have cut edge in the limit that is associated on all summits, then select to remove behind the cut edge remaining mutually not the minimum summit of connected subgraph as vertex v
i
Step 304: obtain the limit that is associated with vertex v i, form set f, f={e
I1, e
I2..., e
Ik.
Step 305: sort in the limit among the pair set f.
Concrete sort method is: select and vertex v
iRemove v in all summits of adjacency
iThe summit that degree is maximum, the limit that this summit is corresponding come last among the set f; Select and vertex v
iAll summit moderates of adjacency time big summit, time back position of the limit ordering that this summit is corresponding in set f, all the other summits and the like.
Step 306: according to the order after the ordering is that the communication stream that the limit among the f is represented provides service.
For the corresponding communication stream in each limit among the f after the ordering provides service successively,, be at last and vertex v promptly earlier for the communication stream that comes first locational limit representative provides service
iRemove v in all summits of adjacency
iThe communication stream that the maximum corresponding limit, summit of outer degree is represented provides service.
Therefore, through the said process in step 301～306, promptly realized the scheduling of the communication stream of each limit representative among the pair set f; But the limit among the set f has only comprised vertex v
iEach limit in the corresponding subgraph, and in the practical application, remove and v among the figure G
iOutside the limit that is associated, also can comprise other limit usually, and the corresponding communication stream in these other limits needing scheduling equally, so, also will further comprise in the present embodiment: from figure G, deduct the content among the set f, obtain new figure G, i.e. G=G-f; Judge whether this new figure G is empty, if be sky, then process ends; If be not empty, the G of G in the execution in step 302～306 again then, this moment each step for newly obtaining.
Through second embodiment scheme according to the invention is done to specify further below:
Fig. 4 is the flow chart of the inventive method second embodiment.Suppose that the system in the present embodiment is a WPAN network system that comprises multinode, many communication stream, its corresponding figure G is shown in Fig. 1 (a).As shown in Figure 4, this embodiment may further comprise the steps:
Step 401: each communication stream in the WPAN network system is represented with the mode of figure G, promptly shown in Fig. 1 (a).
Step 402: the maximum summit of selectance from figure G forms vertex set V
Max
Shown in Fig. 2 (a), comprise five summits among this figure altogether, i.e. vertex v 1, v2, v3, v4 and v5; Wherein the degree of v1 and v3 is 1, and the degree of v2 and v6 is 3, and the degree of v4 and v5 is 2; So the maximum summit of the degree of selecting in this step is v2 and v6, corresponding vertex set V
Max={ v
2, v
6.
Step 403: judge vertex set V
MaxIn included number of vertices n whether be 1, if then execution in step 404; Otherwise, execution in step 405.
Step 404: select this summit as the required summit of subsequent treatment, and execution in step 410.
Step 405: select vertex set V
MaxIn some vertex v
iAnd the set f on the limit that is associated, this summit, f={e
I1, e
I2..., e
Ik.
Suppose that the summit of selecting in this step is v6, its corresponding f is f={e6 so, e3, e5}.
Step 406: judge whether there is cut edge among the f, if do not exist, execution in step 410; Otherwise, execution in step 407.
Because in the included limit of f, can make figure G become disconnected figure like e5, promptly this limit is a cut edge, so, execution in step 407 after this step.
Step 407: the n value is subtracted 1.
Step 408: judge whether n is 0, if be not 0, then execution in step 405; If be 0, then execution in step 409.
Because the n in the present embodiment is 2, deducting 1 is 1 afterwards, so execution in step 405 is promptly reselected vertex set V
MaxIn a summit, vertex v 2 is analyzed owing to have cut edge equally in the vertex v 2, so, after execution of step 408 once more, will execution in step 409.
Step 409: find vertex set V
MaxIn the remaining minimum vertex v of connected subgraph not mutually behind the cut edge appears
j
Shown in Fig. 2 (b) and 2 (c), vertex v 6 occurs being left 2 mutual disconnected subgraphs shown in Fig. 2 (b) behind the cut edge, and vertex v 2 occurs only remaining next connected subgraph behind the cut edge, so v2 is the v that selects
j
Step 410: obtain and vertex v
jSet f is formed, f={e in the limit that is associated
J1, e
J2..., e
Jk.
In present embodiment, this set f is: f={e1, e6, e2}.
Step 411: sort in the limit among the pair set f, is about to come the position of leaning on the back more with the big more corresponding limit, summit of the summit moderate of v2 adjacency.
Because the degree of the vertex v 1 that e1 is corresponding is 1, the degree of the vertex v 6 that e6 is corresponding is 3, and the degree of the vertex v 4 that e2 is corresponding is 2, so the f after the ordering is f={e1, e2, e6}.
Step 412: the communication stream of representing for the limit among the set f provides service continuously.
Step 413: in figure G, deduct the content among the set f, obtain new figure G.
Step 414: judge whether the figure G newly obtain is empty set, if, process ends then; If not, then execution in step 402.
In present embodiment, the figure G that newly obtains is not sky, so; Need be at this figure G that newly obtains; Be maximum vertex v 6 and the v5 of selectance among the figure shown in Fig. 2 (c), because the dispatching effect of v6 and v5 is the same, so select one of them summit at random; As this scheduling node of taking turns, the dispatching sequence is e3, e5 such as the v6 corresponding nodes; Afterwards, from Fig. 2 (c) institute diagrammatic sketch, deduct e3, e5, obtain e4, the communication stream of this limit representative is dispatched, so far, the communication stream in the system all scheduling finishes.
Based on said method, Fig. 5 is the composition structural representation of apparatus of the present invention embodiment.As shown in Figure 5, this device comprises:
Generation unit 501 is used for the node and the communication stream of system are corresponded to summit and limit among the figure respectively, generates the corresponding figure of this system;
Selected cell 502 is used for forming vertex set, and from this vertex set, selecting the minimum summit of cut edge in the limit that is associated from the maximum summit of figure selectance that generates;
Service unit 503 is used to obtain the limit that is associated with the summit of selecting, and forms the limit collection, is sorted in the limit that concentrate on this limit, and the communication stream of representing for concentrated limit, this limit according to the order after the ordering provides service.
Wherein, selected cell 502 specifically comprises:
The first chooser unit 5021 is used for forming vertex set from the maximum summit of figure selectance that generates; The second chooser unit 5022 is used for selecting arbitrary summit of vertex set, judges in the limit that this summit is associated whether have cut edge; If do not exist, then this summit is selected summit; If exist, then other summit beyond this summit is judged, in finding a limit that is associated, there is not the summit of cut edge.
In addition, further comprise in the selected cell 502:
The 3rd chooser unit 5023, when being used in judge the limit that all summits of vertex set are associated when the said second chooser unit 5022, all having cut edge, select to remove behind the cut edge remaining mutually not the minimum summit of connected subgraph as the summit.
Judgment sub-unit 5024 is used for judging whether the number of vertices of vertex set is one, if then directly notification service 503 is carried out himself function; If not, then notify the second chooser unit 5022 to carry out himself function.
Service unit 503 specifically comprises:
Obtain subelement 5031, be used to obtain the limit that is associated with selected summit, form the limit collection;
Ordering subelement 5032 is used for selecting all summits with selected summit adjacency except that selected summit, to spend maximum summit, and it is last that the limit ordering that this summit is corresponding is concentrated on said limit; Except that selected summit, spend time big summit in all summits of selection and selected summit adjacency, with the position of sorting and concentrate on said limit in the limit of this summit correspondence, inferior back, all the other summits and the like;
Service provides subelement 5033, and being used for according to the order after the ordering is that the communication stream that concentrated limit, limit is represented provides service.
Except that above-mentioned each the unit, can further include a judging unit 504 in this device, be used for removing the content that concentrate on corresponding limit, selected summit from said figure, obtain new figure; When this new figure was not sky, notice selected cell 502 was carried out the function of selected cell 502 again according to new figure.
In order to estimate the performance of the said scheme of the embodiment of the invention; (because the scheme that is proposed in the embodiment of the invention is the improvement that existing LSA algorithm is carried out; So for ease of describing; The said scheme of the embodiment of the invention is called senior LSA (ALSA) algorithm), be directed against the dispatching effect that different communication flows topology situation through emulation comparison LSA algorithm and ALSA algorithm.Concrete mode is: under the more different node situation, the ALSA algorithm promptly adopts the probability that makes the wake-up times minimizing behind the ALSA algorithm than the improvement efficient of LSA algorithm; The improvement definitions of efficiency is following:
Improve the improvement number of times/simulation times of efficient=ALSA algorithm than the LSA algorithm.
Fig. 6 is a simulated effect sketch map in the embodiment of the invention, 1000 emulation of each node operation, and each emulation generates communication stream at random.As shown in Figure 6, abscissa wherein is the node number, and ordinate is for improving efficient.
Can find out that before the node number was less than 5, the performance of LSA algorithm and ALSA algorithm was about the same, this is that it is very little to produce disconnected possibility because under the less situation of node number, so adopt ALSA algorithm or LSA algorithm effects the same basically; And along with the increase of node number, the possibility that produces cut edge increases, and adopts the ALSA algorithm to address this problem very effectively, and its performance obviously is better than the LSA algorithm; Along with the continuation increase of node number, this advantage is more and more obvious; Be 10 between 30 the time just, improve efficient and descend to some extent at the node number; But after the node number is greater than 30, improves efficient and just maintain about in the of 8%; That is to say that the performance LSA algorithm of ALSA algorithm is more superior, and stable performance.
It is thus clear that; Adopt the technical scheme of the embodiment of the invention,, and begin scheduling unlike the same some summits corresponding nodes wherein of selecting at random of LSA algorithm of the prior art when the degree maximum node that comprises among the figure G that generates during for one or more; But through analyzing; Can cause the appearance of cut edge in case find the summit of current selection, then remove to select other node, up to find qualified till; If the maximum node of all degree all can cause the appearance of cut edge, mutual not that minimum summit corresponding nodes of connected subgraph began the scheduling of communication stream after then cut edge was removed in selection; In a word, select to make the minimum node of the total wake-up times of system, thereby reached the purpose of saving energy as scheduling node.
In sum, more than being merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a power management method is characterized in that, this method comprises:
Node in the system and communication stream are corresponded to summit and limit among the figure respectively, generate the corresponding figure of said system;
Vertex set is formed on the maximum summit of selectance in the figure of said generation, from said vertex set, selects the minimum summit of cut edge in the limit that is associated; Wherein, degree is meant that the limit number that is associated, cut edge are to instigate figure to become the limit of disconnected graph, and connected graph is meant that all there is the figure of path in any point-to-point transmission, is associated to be meant and to have annexation;
Obtaining the limit that is associated with said selected summit, form the limit collection, sorted in the limit that concentrate on said limit, is that the inter-node communication stream that concentrated limit, said limit is represented provides service according to the order after the ordering;
The method that sorts in the limit that said opposite side is concentrated comprises:
Select except that selected summit, to spend maximum summit in all summits with said selected summit adjacency, the limit that this summit is corresponding comes the last of said limit collection; Select in all summits with said selected summit adjacency except that degree time big summit, selected summit, the limit that this summit is corresponding come said limit collection time after the position, all the other summits.
2. method according to claim 1 is characterized in that, the said method on the minimum summit of cut edge in the limit that is associated of from vertex set, selecting comprises:
Judge whether the number of vertices in the said vertex set is one, if then this summit is the minimum summit of cut edge in the selected limit that is associated.
3. method according to claim 1 is characterized in that, the said method on the minimum summit of cut edge in the limit that is associated of from vertex set, selecting comprises:
Select the arbitrary summit in the said vertex set, judge in the limit that this summit is associated whether have cut edge; If do not exist, then this summit is selected summit; If exist, then other summit beyond this summit is judged, in finding a limit that is associated, there is not the summit of cut edge.
4. method according to claim 3 is characterized in that, the said method on the minimum summit of cut edge in the limit that is associated of from vertex set, selecting further comprises:
When all having cut edge in the limit that all summits in the said vertex set are associated, select to remove a minimum summit of mutual disconnected subgraph behind the cut edge as selected summit.
5. according to each described method in the claim 1～4, it is characterized in that this method further comprises:
From said figure, remove the content that concentrate on said selected corresponding limit, summit, obtain new figure;
When said new figure was not sky, the maximum summit of selectance generated new vertex set from said new figure, from said vertex set, selected the minimum summit of cut edge in the limit that is associated; Obtaining the limit that is associated with said selected summit, form the limit collection, sorted in the limit that concentrate on said limit, is that the inter-node communication stream that concentrated limit, said limit is represented provides service according to the order after the ordering.
6. a power management apparatus is characterized in that, this device comprises:
Generation unit is used for the node and the communication stream of system are corresponded to summit and limit among the figure respectively, generates the corresponding figure of said system;
Selected cell is used for forming vertex set from the maximum summit of said figure selectance, from said vertex set, selects the minimum summit of cut edge in the limit that is associated; Wherein, degree is meant that the limit number that is associated, cut edge are to instigate figure to become the limit of disconnected graph, and connected graph is meant that all there is the figure of path in any point-to-point transmission, is associated to be meant and to have annexation;
Service unit is used to obtain the limit that is associated with said selected summit, forms the limit collection, sorted in the limit that concentrate on said limit, and be that the inter-node communication stream that concentrated limit, said limit is represented provides service according to the order after the ordering;
Said service unit specifically comprises:
Obtain subelement, be used to obtain the limit that is associated with said selected summit, form the limit collection;
The ordering subelement is used for selecting all summits with said selected summit adjacency except that selected summit, to spend maximum summit, and the limit that this summit is corresponding comes the last of said limit collection; Select in all summits with said selected summit adjacency except that degree time big summit, selected summit, the limit that this summit is corresponding come said limit collection time after the position, all the other summits;
Service provides subelement, and being used for according to the order after the ordering is that the inter-node communication stream that concentrated limit, said limit is represented provides service.
7. device according to claim 6 is characterized in that, said selected cell specifically comprises:
The first chooser unit is used for forming vertex set from the maximum summit of said figure selectance;
The second chooser unit is used for selecting arbitrary summit of said vertex set, judges in the limit that is associated on this summit whether have cut edge; If do not exist, then this summit is selected summit; If exist, then other summit beyond this summit is judged, in finding a limit that is associated, there is not the summit of cut edge.
8. device according to claim 7 is characterized in that, further comprises in the said selected cell:
The 3rd chooser unit, when being used in go out the limit that all summits of said vertex set are associated when the said second chooser unit judges, all having cut edge, select to remove behind the cut edge remaining mutually not the minimum summit of connected subgraph as said selected summit.
9. device according to claim 7 is characterized in that, further comprises in the said selected cell:
Judgment sub-unit is used for judging whether the number of vertices of said vertex set is one, if then notify said service unit to carry out himself function; If not, then notify the said second chooser unit to carry out himself function.
10. based on each described device in the claim 6～9, it is characterized in that, further comprise in this device:
Judging unit is used for removing the content that concentrate on said selected corresponding limit, summit from said figure, obtains new figure; When said new figure is not sky, notify said selected cell to carry out the function of said selected cell again according to said new figure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710151588A CN101399574B (en) | 2007-09-28 | 2007-09-28 | Power management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710151588A CN101399574B (en) | 2007-09-28 | 2007-09-28 | Power management method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101399574A CN101399574A (en) | 2009-04-01 |
| CN101399574B true CN101399574B (en) | 2012-09-05 |
Family
ID=40517870
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710151588A Active CN101399574B (en) | 2007-09-28 | 2007-09-28 | Power management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101399574B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1601934A (en) * | 2004-10-15 | 2005-03-30 | 清华大学 | Distributing topopology polymerization method of wave wavelength route optical network |
| CN1889467A (en) * | 2006-07-28 | 2007-01-03 | 西安电子科技大学 | Distributing wireless network key node detecting method |
| CN101043236A (en) * | 2006-05-10 | 2007-09-26 | 华为技术有限公司 | Method for controlling emission power of mesh network node and mesh network node |
-
2007
- 2007-09-28 CN CN200710151588A patent/CN101399574B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1601934A (en) * | 2004-10-15 | 2005-03-30 | 清华大学 | Distributing topopology polymerization method of wave wavelength route optical network |
| CN101043236A (en) * | 2006-05-10 | 2007-09-26 | 华为技术有限公司 | Method for controlling emission power of mesh network node and mesh network node |
| CN1889467A (en) * | 2006-07-28 | 2007-01-03 | 西安电子科技大学 | Distributing wireless network key node detecting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101399574A (en) | 2009-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | Fuzzy-TOPSIS based cluster head selection in mobile wireless sensor networks | |
| Abbasi-Daresari et al. | Toward cluster-based weighted compressive data aggregation in wireless sensor networks | |
| Gambhir et al. | Op-LEACH: an optimized LEACH method for busty traffic in WSNs | |
| CN103200643B (en) | Based on the distributed fault-tolerance topology control method of dump energy perception | |
| Aly et al. | Information gathering schemes for collaborative sensor devices | |
| Hanh et al. | Node placement for target coverage and network connectivity in WSNs with multiple sinks | |
| Yulan et al. | Research about improvement of LEACH protocol | |
| CN103634913A (en) | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method | |
| Nedham et al. | An improved energy efficient clustering protocol for wireless sensor networks | |
| Zhang et al. | An improved routing protocol for raw data collection in multihop wireless sensor networks | |
| CN109413752A (en) | A kind of real time resources dispatching method towards wireless low-power consumption network | |
| Gholami et al. | Adaptive and distributed TDMA scheduling protocol for wireless sensor networks | |
| Kumar et al. | Performance study of beacon-enabled IEEE 802.15. 4 standard in WSNs with clustering | |
| CN101399574B (en) | Power management method and device | |
| Tahmassebpour | Methods and algorithms of capacity calculation and increase throughput in wireless sensor networks base of ZigBee: A survey | |
| CN108307471B (en) | Energy balance cluster head node selection method | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| Gupta et al. | Modified LEACH-DT algorithm with hierarchical extension for wireless sensor networks | |
| Khamayseh et al. | Evolutionary Algorithm for Scheduling in Wireless Sensor Networks. | |
| CN103581838B (en) | A kind of Ad Hoc network information sharing method | |
| KR20120113064A (en) | Low power sensor network system using cluster network and method for establishing cluster network in sensor network | |
| Vo et al. | Minimal sleep delay driven aggregation tree construction in iot sensor networks | |
| Shen et al. | Automated protocol selection for energy efficient WSN applications | |
| Chen et al. | A four-layers hierarchical clustering topology architecture with sleep mode in a wireless sensor network | |
| Sharma et al. | Design of Caucus Medium Access Control (C-MAC) protocol for wireless sensor networks in smart grids |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: TENGXUN SCI-TECH (SHENZHEN) CO., LTD. Free format text: FORMER OWNER: HUAWEI TECHNOLOGY CO., LTD. Effective date: 20150518 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 518129 SHENZHEN, GUANGDONG PROVINCE TO: 518057 SHENZHEN, GUANGDONG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20150518 Address after: 518057 Tencent Building, Nanshan District hi tech park, Shenzhen, Guangdong Patentee after: Tencent Technology (Shenzhen) Co., Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: Huawei Technologies Co., Ltd. |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20151224 Address after: The South Road in Guangdong province Shenzhen city Fiyta building 518057 floor 5-10 Nanshan District high tech Zone Patentee after: Shenzhen Tencent Computer System Co., Ltd. Address before: 518057 Tencent Building, Nanshan District hi tech park, Shenzhen, Guangdong Patentee before: Tencent Technology (Shenzhen) Co., Ltd. |