CN102395181A - Method and device for scheduling resources - Google Patents
Method and device for scheduling resources Download PDFInfo
- Publication number
- CN102395181A CN102395181A CN2011103482854A CN201110348285A CN102395181A CN 102395181 A CN102395181 A CN 102395181A CN 2011103482854 A CN2011103482854 A CN 2011103482854A CN 201110348285 A CN201110348285 A CN 201110348285A CN 102395181 A CN102395181 A CN 102395181A
- Authority
- CN
- China
- Prior art keywords
- ffd
- current
- data
- neighbours
- rfd
- 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
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/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a method and a device for scheduling resources, which relates to the field of communication technology, and is capable of intensively transmitting data to a gateway and lowering the energy consumption of an FFD (Full Function Device). The method provided by the embodiment of the invention comprises the following steps: request information sent by at least one present FFD is received, wherein the request information comprising neighbor RFD (Reduced Functionality Device) identification, neighbor FFD identification and a link cost from the present FFD to the neighbor FFD; according to the link cost, an optimal energy consumption path from the present FFD to the gateway is determined; and the optimal energy consumption path is converted into a tree structure, and the time slot and the signal channel of transmitting and receiving data of the present FFD are determined according to the tree structure and the neighbor RFD. The method provided by the embodiment of the invention is suitable for being used for an MESH topological structure in a Zigbee protocol, as well as an MESH network adopting centralized resources scheduling.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of resource regulating method and device.
Background technology
In the purple honeybee Zigbee that with IEEE802.15.4 is the basis, the networking mode that adopts bunch tree and wireless mesh network (MESH) to combine usually, i.e. FFD (Full Function Device; Full-function device) with RFD (Reduced Function Device; The simplification function device) adopts bunch tree between, adopt MESH between the FFD, can carry out the point-to-point data interaction between the FFD; At this moment, be in maintenance phase mutually synchronization between accepting state or each communication equipment between each communication equipment all the time.
Prior art is through being divided into four zone: BOP, CAP, TDMA1, TDMA2 with a superframe, and wherein, it is synchronous to be used to MESH in the BOP zone, and promptly FFD selects the non-active period of surrounding devices to send information lock in time of oneself; Telegon is used to handle solicited message and wait node and networks in the CAP zone; Be me sh network after synchronously, telegon is collected the solicited message that each FFD sends in the CAP zone, then according to the data flow between routing scheduling algorithm and two FFD equipment of channel allocation algorithm definition; Distribute a dispatch list for each FFD like this; Wherein comprise time slot, channel in the dispatch list, data flow direction, the indication on TDMA1 zone FFD meeting adhere rigidly to dispatch list like this; At time slot, channel transmitter on (X-on) or the receiver of regulation, transmit periodic data; Be mainly used in the transmitting burst data in the TDMA2 zone.
Yet when carrying out transfer of data, telegon randomly, discretely distributes time slot to give FFD in the prior art, causes FFD to start communication module continually, makes that the energy consumption of FFD is higher.
Summary of the invention
Embodiments of the invention provide a kind of resource regulating method and device, can forward the data to gateway in the concentrated area, reduce the energy consumption of FFD.
For achieving the above object, embodiments of the invention adopt following technical scheme:
A kind of resource regulating method comprises:
Receive the solicited message that at least one current full-function device FFD sends, described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
According to said link cost, confirm the energy consumption optimal path of said current FFD to gateway;
Convert said energy consumption optimal path into tree structure, and confirm the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.
A kind of resource scheduling device comprises:
Receiving element is used to receive the solicited message that at least one current FFD sends, and described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
First confirms the unit, is used for according to said link cost, confirms the energy consumption optimal path of said current FFD to gateway;
Second confirms to be used for converting said energy consumption optimal path into tree structure in the unit, and confirms the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.
A kind of resource regulating method and device that the embodiment of the invention provides; Through receiving the solicited message that at least one current FFD sends; Described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD; Then according to said link cost; Confirm the energy consumption optimal path of said current FFD, convert said energy consumption optimal path into tree structure, and confirm the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD to gateway.With compare in the prior art, the scheme that the embodiment of the invention provides can forward the data to gateway in the concentrated area, reduces the energy consumption of FFD.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art; To do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below; Obviously, the accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills; Under the prerequisite of not paying creative work property, can also obtain other accompanying drawing according to these accompanying drawings.
The flow chart of a kind of resource regulating method that Fig. 1 provides for the embodiment of the invention 1;
The block diagram of a kind of resource scheduling device that Fig. 2 provides for the embodiment of the invention 1;
The flow chart of a kind of resource regulating method that Fig. 3 provides for the embodiment of the invention 2;
The FFD network topology structure sketch map that Fig. 4 provides for the embodiment of the invention 2;
The FFD that Fig. 5 provides for the embodiment of the invention 2 sends to the sketch map of the solicited message table of gateway;
The adjacency matrix sketch map that Fig. 6 provides for the embodiment of the invention 2;
The energy consumption optimal path sketch map of each FFD that Fig. 7 provides for the embodiment of the invention 2;
The tree structure sketch map that Fig. 8 provides for the embodiment of the invention 2;
Each FFD that Fig. 9 provides for the embodiment of the invention 2 distributes the sketch map of time slot;
The sketch map of the time slot section of the FFD reception/transmission data that Figure 10 provides for the embodiment of the invention 2;
The sketch map of the schedule information that Figure 11 provides for the embodiment of the invention 2;
Each said FFD that Figure 12 provides for the embodiment of the invention 2 opens the sketch map that transceiver received or transmitted data in the time slot section of regulation;
The block diagram of a kind of resource scheduling device that Figure 13 provides for the embodiment of the invention 2.
Embodiment
To combine the accompanying drawing in the embodiment of the invention below, the technical scheme in the embodiment of the invention is carried out clear, intactly description, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all belong to the scope of the present invention's protection.
The embodiment of the invention provides a kind of resource regulating method, and is as shown in Figure 1, and this method comprises:
Step 101 receives the solicited message that at least one current full-function device FFD sends, and described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
Link cost is from the energy of current FFD required consumption when neighbours FFD sends data, also can be the jumping figure that is experienced to purpose FFD from current FFD, when concrete the application, can select the expression mode of link cost according to actual needs.
Step 102 according to said link cost, is confirmed the energy consumption optimal path of said current FFD to gateway;
Particularly, according to said neighbours FFD, create the adjacency matrix between said current FFD and the said neighbours FFD; According to said link cost and said adjacency matrix, confirm the energy consumption optimal path of said current FFD to gateway.
Step 103 converts said energy consumption optimal path into tree structure, and confirms the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.
Particularly, convert said energy consumption optimal path into tree structure, and confirm the time slot of said current FFD transceive data according to said neighbours RFD;
According to the time slot and the said adjacency matrix of said current FFD transceive data, confirm the channel of said current FFD transceive data.
Further, after said method, also need confirm the schedule information of said current FFD, and said schedule information is sent to said current FFD according to the time slot and the channel of said current FFD transceive data.
A kind of resource regulating method that the embodiment of the invention provides; Through receiving the solicited message that at least one current FFD sends; Described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD; Then according to said link cost; Confirm the energy consumption optimal path of said current FFD, convert said energy consumption optimal path into tree structure, and confirm the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD to gateway.With in the prior art when carrying out transfer of data; Telegon randomly, discretely distributes time slot to give FFD, causes FFD to start communication module continually, makes higher the comparing of energy consumption of FFD; The scheme that the embodiment of the invention provides can forward the data to gateway in the concentrated area, reduces the energy consumption of FFD.
The embodiment of the invention provides a kind of resource scheduling device, and this device can be gateway, and this device can be FFD particularly, and is as shown in Figure 2, and this device comprises: receiving element 201, the first is confirmed 202, the second definite unit 203, unit.
Receiving element 201 is used to receive the solicited message that at least one current FFD sends, and described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
First confirms unit 202, is used for according to said link cost, confirms the energy consumption optimal path of said current FFD to gateway;
Second confirms to be used for converting said energy consumption optimal path into tree structure in unit 203, and confirms the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.
A kind of resource scheduling device that the embodiment of the invention provides; Receive the solicited message that at least one current FFD sends through receiving element; According to the link cost of the said current FFD in the described request information to said neighbours FFD; Confirm that by first the unit confirms the energy consumption optimal path of said current FFD to gateway, second definite unit converts said energy consumption optimal path into tree structure, and confirms the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.With in the prior art when carrying out transfer of data; Telegon randomly, discretely distributes time slot to give FFD, causes FFD to start communication module continually, makes higher the comparing of energy consumption of FFD; The scheme that the embodiment of the invention provides can forward the data to gateway in the concentrated area, reduces the energy consumption of FFD.
The embodiment of the invention provides a kind of resource regulating method, and is as shown in Figure 3, and this method comprises:
Need to prove that purple honeybee is divided into three parts: BOP (Beacon Only Period, beacon frame sends period), CAP (Contention Access Period with superframe; The competition access slot), CFP (Contention Free Period; Exempt from competition slot), wherein, in the BOP zone; Carry out synchronously through the beacon beacon frame between the FFD (Full Function Device, full-function device); In the CAP zone, to carry out the FFD solicited message and be uploaded to gateway, gateway processes also issues schedule information; In the CFP zone, each node operation dispatching information, node refers to FFD and RFD (Reduced Function Device simplifies function device) here.In addition, gateway also can be FFD, and the function of only carrying out is different with common FFD.
Step 301, each FFD in the MESH network is the device transmits beacons frame towards periphery;
In the BOP zone; Comprise at least one FFD (Full Function Device in the MESH network; Full-function device), FFD sends the beacon beacon frame each other to carry out synchronously, carries the corresponding FFD of said beacon frame sends time from data to upper level FFD in the said beacon frame; So that can send data to upper level FFD simultaneously, reach synchronous with the FFD of one-level.Need to prove that FFD sends beacon frame in the non-active period of its neighbor device.In addition, the FFD in the MESH network can carry out classification according to the distance to network, wherein, apart from gateway nearest be the first order, apart from gateway farther be followed successively by the second level, the third level, by that analogy.Therefore rank has reflected the distance of FFD and gateway.In the network topology structure as shown in Figure 4, A, B are first order FFD, and E, F are second level FFD, and I, J are third level FFD.A and B are the FFD with one-level, and E is the next stage FFD of A, and A is the upper level FFD of E.
Step 302, said current FFD sends solicited message to gateway, and described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
Need to prove that promptly get into the CAF zone afterwards synchronously, each FFD upload request information in the MESH network is to gateway, the embodiment of the invention is clear in order to describe, and is that example is described with current FFD.Described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD, also comprises the type of equipment self, is illustrated in figure 4 as network topology structure, wherein; GW is a gateway, and circle is represented FFD or RFD, wherein; The entity circle is represented FFD, and A, B, E, F, I, J represent FFD, in addition; A, B are first order FFD, and E, F are second level FFD, and I, J are third level FFD; Empty circles is represented RFD, and C, D, G, H, K, M, N, L represent RFD.
The table that solicited message constituted that Fig. 5 uploads for FFD, the first behavior gateway of table, device type is 0x00, does not have adjacent RFD, and adjacent FFD is A and B, and gateway is 2 to adjacent FFD (A) link cost, and gateway is 1 to adjacent FFD (B) link cost; The second behavior FFD (A) of table, wherein, the device type of A is 0x01, and adjacent RFD is C, and adjacent FFD is B, E and F, and A is 2 to the link cost of B, and A is 1 to the link cost of E, and A is 2 to the link cost of F.
Step 303, gateway receive the solicited message that said current FFD sends;
Need to prove that gateway receives the solicited message that all FFD send in the MESH network.
Step 304, said gateway are confirmed the energy consumption optimal path of said current FFD to gateway according to said link cost;
Particularly, 1. according to said neighbours FFD, create the adjacency matrix between said current FFD and the said neighbours FFDFFD; As shown in Figure 6, two FFD are adjacent to be designated as 1, non-conterminously is designated as 0; Oneself be designated as 2, the 2 row GW and the 2nd row GW is same FFD, in it intersects square frame, be designated as 2; The 2nd row GW and the 3rd row A are adjacent FFD; In it intersects square frame, be designated as 1, the 2 row GW and the 5th row E is non-conterminous FFD, in it intersects square frame, be designated as 0.
2. according to said link cost and said adjacency matrix, confirm the energy consumption optimal path of said current FFD to gateway.
Particularly, can adopt dijkstra's algorithm to confirm the energy consumption optimal path of current FFD to gateway.Need to prove,, should avoid selecting to have the path of same intermediate node as far as possible with FFD at the same level if wherein when certain equipment has many feasible paths.Illustrate, ask the energy consumption optimal path of node I to gateway:
If: Vp, Vq are any 2 points in the topological structure, if non-conterminous between 2 of Vp and the Vq, limit weight w { Vp, Vq}=∞ then;
for?i：＝1?to?n
L(Vi)：＝∞
L(I)＝0
While GW does not belong to S
begin
U:=does not belong to the minimum summit of L (u) of S
S：＝SU{u}
All do not belong to the fixed point v of S for
if?L(u)+w(u，v)＜L(v)
then?L(v)：＝L(u)+w(u，v)
{ so just give the summit of adding the band minimum mark among the S and upgrade the not mark on the summit in S }
The length of the shortest path of end{L (GW)=from I to GW }
Need to prove; Vi be except that I have a few, initialization tag, I is labeled as 0; Be designated as L (I)=0; All the other nodes are labeled as ∞, and L (Vi) :=∞, S are empty sets;
so just gives the summit of adding the band minimum mark among the S and upgrades the not mark on the summit in S, up to the length that finds shortest path.
Concrete steps are following:
Can obtain the energy consumption optimal path of current FFD (I) according to top method, in like manner, also can obtain the energy consumption optimal path of other FFD, be the energy consumption optimal path of each FFD to gateway like Fig. 7 to gateway to gateway.When if wherein certain equipment has many feasible paths, should avoid selecting to have the path of same intermediate node with FFD at the same level as far as possible.That is:
GW←A；
GW←B；
GW←A←E；
GW←B←F；
GW←A←E←I；
GW←B←F←J。
Step 305 converts said energy consumption optimal path into tree structure, and confirms the time slot of said current FFD transceive data according to said tree structure and said neighbours RFD;
Can adopt the BFS algorithm, the bonding apparatus type, as shown in Figure 8, can convert said energy consumption optimal path into tree structure according to following steps particularly:
1. the terminal point of said energy consumption optimal path being confirmed as the root node of tree, is the root node that gateway is elected to be tree with 0x00 equipment;
2. add all limits that are associated with said root node in the said energy consumption optimal path, confirm the ground floor summit of said tree; Need to prove that A, B can at random sort.
3. visit said ground floor summit in order, confirm the second layer summit of said tree according to the method for confirming said ground floor summit, up to the generation tree that produces said energy consumption optimal path.
Visit ground floor summit A, B in order, under the situation that does not produce the loop, each bar limit that interpolation is associated with A, B summit has so just produced the second layer summit E, the F that set, need to prove that the road is recalled on the road that two-end-point is identical.By that analogy, visit again each summit on the second layer, can obtain the 3rd layer summit I, J, like this through just having produced the generation tree of energy consumption optimal path after the limited step.
After converting tree structure to, confirm to need to prove the time slot of each said FFD transceive data that for distributing time slot from gateway one-level node such as I, J farthest, one by one to the gateway propelling, concrete steps are following then earlier according to the tree that converts to and said neighbours RFD:
1. according to said neighbours RFD, calculate the data volume that said current FFD need transmit;
2. the data volume of transmitting according to said current FFD needs; For distributing, said current FFD receives the data slot section; Wherein, The reception data slot section of distributing with the said FFD of one-level is identical, and the said reception data slot section of distributing is confirmed according to the data volume of the FFD of the maximum amount of data that receives among the said whole FFD with one-level;
3. according to said reception data slot section, confirm the transmission data slot section of said current FFD.
Describe for ease, suppose that each RFD, FFD have the data volume of a time slot to need to send, can calculate the data volume that each said FFD need transmit respectively like this, illustrate; As shown in Figure 9, the I of the 3rd utmost point, the data volume that needs to transmit is 1 time slot; Promptly need transmit the data volume of K, with the FFD J of I with one-level, the data volume that needs to transmit is 3 time slots; Promptly need transmit the data volume of L, M, N, like this, it is 3 that the third level needs the distributed time slot number; Concrete receiving slot section of distributing is 1-3, and promptly the reception data slot section of the third level is identical, and the maximum amount of data of the said FFD reception of the said reception data slot Duan Weitong one-level of distributing; Each said FFD sends the reception data slot section of the FFD of the upper level that data slot section is said FFD; Particularly; Like the time slot section of the described FFD reception/transmission of Figure 10 data, the reception data slot section of I, J is 1-3, and the reception data slot section of E, F is 4-8; Like this, the transmission data slot section of I, J is 4-8.
Need to prove that when each said FFD transceive data, the sub-RFD of said FFD, said FFD and the next stage FFD of said FFD are that same kind equipment is in same period transceive data.Here, if RFD directly is connected with FFD (A), then RFD promptly can be described as the sub-RFD of said FFD (A).Illustrate, in the FFD topological structure as shown in Figure 4, it is one type that E gathers I and G, same period transceive data, and by that analogy, the data of all devices all send to gateway the most at last.
Step 306 according to the time slot and the said adjacency matrix of the said current FFD transceive data of confirming, is confirmed the channel of said current FFD transceive data;
Because E, F are in on the one-level, the link around therefore all is in active period in same time slot section, like this; If I sends data to E, J sends data to F and is in same channel, when J sends data to E; E is in the communication range of J; E can receive interference physically, and therefore, gateway adopts the edge coloring algorithm to the different channel of link assignment around two FFD in the scheme that the embodiment of the invention provides; Edge coloring is for all specifying a color to each the bar limit among the figure that constitutes that linked to each other by a plurality of nodes, and making does not have two adjacent Bian Douwei with a kind of color.
The edge coloring of the embodiment of the invention is directed against be in each time slot section between the FFD when the node that is associated with it communicates, each limit should various colors, and no matter they whether within communication range each other; In addition, when the present invention also can be according to the FFD transceive data, the link between the same kind equipment with a kind of color; Illustrate; For I, J, E, F, G, these several equipment of H, the link between I, G and the E blueness, and the link between J, H and the F crocus.
Step 307 according to the time slot and the channel of said current FFD transceive data, is confirmed the schedule information of said current FFD, and said schedule information is sent to said current FFD;
Like this, gateway can be confirmed the schedule information of each FFD in the MESH network, and can schedule information be sent to corresponding FFD.Particularly, shown in figure 11, according to the time slot and the channel of each said FFD transceive data of confirming; Confirm the time slot that each FFD transmits and receive data and the schedule information of channel, like A equipment in the table, the sending time slots section is 16-29; Channel is X, and the receiving slot section is 9-15, and channel is X; Need to prove that X is the sign of channel here, different time slots can only use a channel.
Step 308, the schedule information that said current FFD distributes according to said gateway is opened transceiver and is received or transmit data in the time slot section of regulation.
Particularly, in the time slot section of regulation, open transceiver at each said FFD of CFP zone and receive or transmit data, shown in figure 12, I and J receive the data of K, L, M, N respectively in the first time slot section, and other equipment are not worked; E and F receive the data that I, G, J, H send respectively in the second time slot section, and other equipment are not worked; A and B receive the data that C, D, E, F send respectively in the 3rd time slot section, and other equipment are not worked; Gateway GW receives the data that A, B send respectively in the 4th time slot section, and other equipment are not worked.
Need to prove that in wireless device, nearly 95% energy is by communication module consumed.And the FFD equipment in traditional zigbee network is in listening state all the time; Perhaps FFD starts communication module continually, makes that the energy consumption of FFD is higher, and the scheme that the embodiment of the invention provides makes the FFD far away apart from gateway begin to draw near to work at times; FFD can close transceiver at all the other time slots; Be in resting state, when having guaranteed to forward the data to gateway, fundamentally cut down the consumption of energy.
A kind of resource regulating method that the embodiment of the invention provides; Through receiving the solicited message that at least one current FFD sends; Described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD; Then according to said link cost; Confirm the energy consumption optimal path of said current FFD, convert said energy consumption optimal path into tree structure, and confirm the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD to gateway.With in the prior art when carrying out transfer of data; Telegon randomly, discretely distributes time slot to give FFD, causes FFD to start communication module continually, makes higher the comparing of energy consumption of FFD; The scheme that the embodiment of the invention provides can forward the data to gateway in the concentrated area; Reduce the energy consumption of FFD, in the time of can avoiding subset to send upstream data, situation about bumping.
The embodiment of the invention provides a kind of resource scheduling device, and this device can be gateway, and this device can be FFD particularly, and is shown in figure 13; This device comprises: receiving element 1301, the first is confirmed unit 1302, creates module 1303, determination module 1304; Second confirms unit 1305, modular converter 1306, the first determination modules 1307, calculating sub module 1308; First confirms submodule 1309, the second definite submodule 1310, the second determination modules 1311, transmitting element 1312.
Receiving element 1301 is used to receive the solicited message that at least one current FFD sends, and described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
Need to prove; Before receiving element 1301 receives the solicited message of FFD transmission; FFD in the MESH network sends the beacon beacon frame each other to carry out synchronously; Carry the corresponding FFD of said beacon frame in the said beacon frame to the time that upper level FFD sends data,, reach synchronous so that can send data to upper level FFD simultaneously with the FFD of one-level.In addition, FFD sends beacon frame in the non-active period of its neighbor device.
First confirms unit 1302, is used for according to said link cost, confirms the energy consumption optimal path of said current FFD to gateway;
Particularly, said first confirms the establishment module 1303 in the unit 1302, is used for according to said neighbours FFD, creates the adjacency matrix between said current FFD and the said neighbours FFD; Determination module 1304 is used for according to said link cost and said adjacency matrix, confirms the energy consumption optimal path of said current FFD to gateway; The embodiment of the invention adopts dijkstra's algorithm to confirm the energy consumption optimal path of each said FFD to gateway;
Second confirms to be used for converting said energy consumption optimal path into tree structure in unit 1305, and confirms the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD;
Particularly, said second confirms the modular converter 1306 in the unit 1305, utilizes the BFS algorithm, and the bonding apparatus type converts said energy consumption optimal path into tree structure;
Wherein, the terminal point of the said energy consumption optimal path of confirming is confirmed as the root node of tree; Add all limits that are associated with said root node in the said energy consumption optimal path again, confirm the ground floor summit of said tree; Visit said ground floor summit then in order, confirm the second layer summit of said tree according to the method for confirming said ground floor summit, up to the generation tree that produces said energy consumption optimal path;
After having confirmed tree structure, according to the said tree structure of conversion, first determination module 1309 in said second definite unit 1305 is confirmed the time slot of said current FFD transceive data according to said tree structure and said neighbours RFD;
Particularly, the calculating sub module 1310 in said first determination module 1309 is calculated the data volume that said current FFD need transmit according to said neighbours RFD;
According to the data volume that said current FFD needs are transmitted, first confirms submodule 1311, receives the data slot section for said current FFD distributes, and the data that the said FFD of said reception data slot Duan Youtong one-level receives are that maximum amount of data is confirmed;
According to said reception data slot section, second confirms submodule 1312, confirms the transmission data slot section of said current FFD.
Time slot and said adjacency matrix according to said current FFD transceive data; Second determination module 1313 is confirmed the channel of said current FFD transceive data; Particularly, the embodiment of the invention can adopt edge coloring algorithm in the graph theory to confirm the channel of said each said FFD transceive data;
Behind the time slot and channel of the transmission data of having confirmed each FFD, transmitting element 1314 is used for time slot and channel according to said current FFD transceive data, confirms the schedule information of said current FFD, and said schedule information is sent to said current FFD.
Need to prove, after each FFD receives the schedule information of gateway transmission, open the transceiver reception or transmit data according to transceive data time slot in the schedule information and channel.
A kind of resource scheduling device that the embodiment of the invention provides; Receive the solicited message that at least one current FFD sends through receiving element; First confirms that the unit is according to the said link cost in the solicited message then; Confirm the energy consumption optimal path of said current FFD to gateway, second confirms that the unit converts said energy consumption optimal path into time slot and channel that tree structure and said neighbours RFD confirm said current FFD transceive data.With in the prior art when carrying out transfer of data; Telegon randomly, discretely distributes time slot to give FFD, causes FFD to start communication module continually, makes higher the comparing of energy consumption of FFD; The scheme that the embodiment of the invention provides can forward the data to gateway in the concentrated area, reduces the energy consumption of FFD.
Need to prove; This programme is except being directed against based on the MESH topological structure in the zigbee agreement of 802.15.4; Can also expand to the MESH network with pooling of resources scheduling, the scheduling feature of gateway can also be replaced by Pan telegon or Sink node in embodiments of the present invention in addition.
The above; Be merely embodiment of the present invention, but protection scope of the present invention is not limited thereto, any technical staff who is familiar with the present technique field is in the technical scope that the present invention discloses; Can expect easily changing or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion by said protection range with claim.
Claims (12)
1. a resource regulating method is characterized in that, comprising:
Receive the solicited message that at least one current full-function device FFD sends, described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
According to said link cost, confirm the energy consumption optimal path of said current FFD to gateway;
Convert said energy consumption optimal path into tree structure, and confirm the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.
2. resource regulating method according to claim 1 is characterized in that, and is said according to said link cost, confirms that said current FFD comprises to the energy consumption optimal path of gateway:
According to said neighbours FFD, create the adjacency matrix between said current FFD and the said neighbours FFD;
According to said link cost and said adjacency matrix, confirm the energy consumption optimal path of said current FFD to gateway.
3. resource regulating method according to claim 2 is characterized in that, saidly converts said energy consumption optimal path into tree structure, and confirms that according to said tree structure and said neighbours RFD the time slot of said current FFD transceive data and channel comprise:
Convert said energy consumption optimal path into tree structure, and confirm the time slot of said current FFD transceive data according to said neighbours RFD;
According to the time slot and the said adjacency matrix of said current FFD transceive data, confirm the channel of said current FFD transceive data.
4. according to each described resource regulating method among the claim 1-3, it is characterized in that, also comprise:
The sub-RFD of said current FFD and said current FFD, said current FFD and the next stage FFD of said current FFD are in same period transceive data.
5. resource regulating method according to claim 3 is characterized in that, saidly confirms that according to said neighbours RFD the time slot of said current FFD transceive data comprises:
According to said neighbours RFD, calculate the data volume that said current FFD need transmit;
Data volume according to said current FFD needs are transmitted receives the data slot section for said current FFD distributes, and said reception data slot section is confirmed according to the maximum amount of data of each FFD that in said reception data slot section, receives data;
According to said reception data slot section, confirm the transmission data slot section of said current FFD.
6. according to each described resource regulating method among the claim 1-5, it is characterized in that, also comprise:
According to the time slot and the channel of said current FFD transceive data, confirm the schedule information of said current FFD, and said schedule information is sent to said current FFD.
7. a resource scheduling device is characterized in that, comprising:
Receiving element is used to receive the solicited message that at least one current FFD sends, and described request information comprises neighbours RFD sign, neighbours FFD sign and the said current FFD link cost to said neighbours FFD;
First confirms the unit, is used for according to said link cost, confirms the energy consumption optimal path of said current FFD to gateway;
Second confirms to be used for converting said energy consumption optimal path into tree structure in the unit, and confirms the time slot and the channel of said current FFD transceive data according to said tree structure and said neighbours RFD.
8. resource scheduling device according to claim 7 is characterized in that, said first confirms that the unit comprises:
Create module, be used for, create the adjacency matrix between said current FFD and the said neighbours FFD according to said neighbours FFD;
Determination module is used for according to said link cost and said adjacency matrix, confirms the energy consumption optimal path of said current FFD to gateway.
9. resource scheduling device according to claim 7 is characterized in that, said second confirms that the unit comprises:
Modular converter is used for converting said energy consumption optimal path into tree structure;
First determination module is used for confirming according to said tree structure and said neighbours RFD the time slot of said current FFD transceive data;
Second determination module is used for time slot and said adjacency matrix according to said current FFD transceive data, confirms the channel of said current FFD transceive data.
10. according to each described resource scheduling device among the claim 7-9, it is characterized in that the sub-RFD of said current FFD and said current FFD, said current FFD and the next stage FFD of said current FFD are in same period transceive data.
11. resource scheduling device according to claim 9 is characterized in that, said first determination module comprises:
Calculating sub module is used for calculating the data volume that said current FFD need transmit according to said neighbours RFD;
First confirms submodule; Be used for data volume according to said current FFD needs forwarding; Receive the data slot section for said current FFD distributes, said reception data slot section is confirmed according to the maximum amount of data of each FFD that in said reception data slot section, receives data;
Second confirms submodule, is used for confirming the transmission data slot section of said current FFD according to said reception data slot section.
12., it is characterized in that said device also comprises according to each described resource scheduling device among the claim 7-11:
Transmitting element is used for time slot and channel according to said current FFD transceive data, confirms the schedule information of said current FFD, and said schedule information is sent to said current FFD.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110348285.4A CN102395181B (en) | 2011-11-07 | 2011-11-07 | Method and device for scheduling resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110348285.4A CN102395181B (en) | 2011-11-07 | 2011-11-07 | Method and device for scheduling resources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102395181A true CN102395181A (en) | 2012-03-28 |
| CN102395181B CN102395181B (en) | 2014-11-05 |
Family
ID=45862364
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110348285.4A Expired - Fee Related CN102395181B (en) | 2011-11-07 | 2011-11-07 | Method and device for scheduling resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102395181B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105744637A (en) * | 2016-04-01 | 2016-07-06 | 中国科学院信息工程研究所 | Broadcast scheduling method for industrial wireless Mesh network |
| CN108111483A (en) * | 2017-11-29 | 2018-06-01 | 浙江工商大学 | A kind of MAC protocol design method at long range Wireless Mesh network |
| CN108738107A (en) * | 2018-06-13 | 2018-11-02 | 上海华章信息科技有限公司 | A kind of wireless connection means of communication of factory production system |
| CN113542371A (en) * | 2021-06-29 | 2021-10-22 | 西南大学 | Resource scheduling method and system based on edge gateway |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| CN101188535A (en) * | 2007-12-06 | 2008-05-28 | 上海大学 | Method for identifying the section energy balance route of wireless sensor network based on 2-child tree |
| WO2008109250A1 (en) * | 2007-03-02 | 2008-09-12 | Motorola, Inc. | Method and apparatus for battery-aware dynamic bandwidth allocation for groups of wireless sensor nodes in a wireless sensor network |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
-
2011
- 2011-11-07 CN CN201110348285.4A patent/CN102395181B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| WO2008109250A1 (en) * | 2007-03-02 | 2008-09-12 | Motorola, Inc. | Method and apparatus for battery-aware dynamic bandwidth allocation for groups of wireless sensor nodes in a wireless sensor network |
| CN101188535A (en) * | 2007-12-06 | 2008-05-28 | 上海大学 | Method for identifying the section energy balance route of wireless sensor network based on 2-child tree |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105744637A (en) * | 2016-04-01 | 2016-07-06 | 中国科学院信息工程研究所 | Broadcast scheduling method for industrial wireless Mesh network |
| CN108111483A (en) * | 2017-11-29 | 2018-06-01 | 浙江工商大学 | A kind of MAC protocol design method at long range Wireless Mesh network |
| CN108738107A (en) * | 2018-06-13 | 2018-11-02 | 上海华章信息科技有限公司 | A kind of wireless connection means of communication of factory production system |
| CN113542371A (en) * | 2021-06-29 | 2021-10-22 | 西南大学 | Resource scheduling method and system based on edge gateway |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102395181B (en) | 2014-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108028802A (en) | Self-organizing mesh network is built using 802.11AD technologies | |
| CN101420463B (en) | Wireless sensor network address allocation mechanism | |
| US8380072B2 (en) | Integrated sensor networks with optical and wireless links | |
| CN101222746B (en) | For the system and method for allocated channel in the wireless network | |
| CN109462662A (en) | A kind of gateway, Internet of Things net equipment, Internet of things system and control method | |
| CN102971988A (en) | Alternate down paths for directed acyclic graph (DAG) routing | |
| CN102196458A (en) | Networking method and devices of wireless broadband sensor network | |
| CN110167032A (en) | The network-building method and system of the software definition wireless self-organization network of unmanned aerial vehicle (UAV) control | |
| CN102395181B (en) | Method and device for scheduling resources | |
| CN114553697B (en) | Industrial wireless and TSN fusion-oriented network scheduling method | |
| CN101686459A (en) | A method of structuring an ad hoc network | |
| Theodorou et al. | A versatile out-of-band software-defined networking solution for the Internet of Things | |
| CN102130705B (en) | WLAN (Wireless Local Area Network) MESH communication method and device based on fast frequency hopping | |
| CN101682581A (en) | Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system | |
| CN101867920B (en) | Grading type wireless sensor networking method | |
| CN105530679A (en) | Wireless sensor network routing method based on software defined network | |
| CN110446264A (en) | A kind of wireless self-networking multi-hop broadcast scheduling method and device | |
| CN104796188A (en) | Microwave-assisted spatial information network backbone networking transmission method | |
| CN101742559B (en) | Parallel RTS (remote terminal system) processing multiple access method supporting MIMO (multiple input multiple output) in ad hoc network | |
| CN104427412B (en) | A kind of method and device that bandwidth map updates | |
| CN103841605A (en) | Method and device for achieving coprocessing of baseband signal among multipe BBU devices | |
| WO2022001332A1 (en) | Networking device and method for nsa, and mobile communication system | |
| US10165621B2 (en) | Directional mobile ad-hoc network | |
| CN102761883B (en) | Multi-hop broadband wireless communication system and wireless node device thereof | |
| CN102572907A (en) | Wireless communication mode of industrial information corridor |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141105 Termination date: 20161107 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |