CN102395181B - Method and device for scheduling resources - Google Patents
Method and device for scheduling resources Download PDFInfo
- Publication number
- CN102395181B CN102395181B CN201110348285.4A CN201110348285A CN102395181B CN 102395181 B CN102395181 B CN 102395181B CN 201110348285 A CN201110348285 A CN 201110348285A CN 102395181 B CN102395181 B CN 102395181B
- Authority
- CN
- China
- Prior art keywords
- ffd
- described current
- data
- neighbours
- current
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- 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
Take IEEE802.15.4 in basic purple honeybee Zigbee, conventionally the networking mode that adopts bunch tree and wireless mesh network (MESH) to combine, be FFD (Full Function Device, full-function device) with RFD (Reduced Function Device, simplification function device) between, adopt bunch tree, between FFD, adopt MESH, between FFD, can carry out point-to-point data interaction, now, between each communication equipment, between accepting state or each communication equipment, keep phase mutually synchronization all the time.
Prior art, by a superframe is divided into four region: BOP, CAP, TDMA1, TDMA2, wherein, is used to MESH synchronous in BOP region, and FFD selects the non-active period of surrounding devices to send information lock in time of oneself; Telegon networks for the treatment of solicited message and wait node in CAP region, be that me sh network is after synchronous, telegon is collected the solicited message that each FFD sends in CAP region, then according to the data flow between routing algorithm and two FFD equipment of channel allocation algorithm definition, like this for each FFD distributes a dispatch list, wherein dispatch list comprises time slot, channel, data flow direction, indication on TDMA1 region 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; In TDMA2 region, be mainly used in transmitting bursty data.
Yet, when carrying out transfer of data, telegon distributes time slot to FFD randomly, discretely in prior art, cause FFD to start continually communication module, make the energy consumption of FFD higher.
Summary of the invention
Embodiments of the invention provide a kind of resource regulating method and device, can intensively forward the data to gateway, reduce the energy consumption of FFD.
For achieving the above object, embodiments of the invention adopt following technical scheme:
A resource regulating method, 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 described current FFD to the link cost of described neighbours FFD;
According to described link cost, determine that described current FFD is to the energy consumption optimal path of gateway;
Described energy consumption optimal path is converted to tree structure, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data.
A resource scheduling device, comprising:
Receiving element, the solicited message sending for receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD;
The first determining unit, for according to described link cost, determines that described current FFD is to the energy consumption optimal path of gateway;
The second determining unit, for described energy consumption optimal path is converted to tree structure, and determines time slot and the channel of described current FFD transceiving data according to described tree structure and described neighbours RFD.
A kind of resource regulating method and device that the embodiment of the present invention provides, the solicited message sending by receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD, then according to described link cost, determine that described current FFD is to the energy consumption optimal path of gateway, described energy consumption optimal path is converted to tree structure, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data.With in prior art, compare, the scheme that the embodiment of the present invention provides can intensively forward the data to gateway, reduces the energy consumption of FFD.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
The flow chart of a kind of resource regulating method that Fig. 1 provides for the embodiment of the present invention 1;
The block diagram of a kind of resource scheduling device that Fig. 2 provides for the embodiment of the present invention 1;
The flow chart of a kind of resource regulating method that Fig. 3 provides for the embodiment of the present invention 2;
The FFD network topology structure schematic diagram that Fig. 4 provides for the embodiment of the present invention 2;
The FFD that Fig. 5 provides for the embodiment of the present invention 2 sends to the schematic diagram of the solicited message table of gateway;
The adjacency matrix schematic diagram that Fig. 6 provides for the embodiment of the present invention 2;
The energy consumption optimal path schematic diagram of each FFD that Fig. 7 provides for the embodiment of the present invention 2;
The tree structure schematic diagram that Fig. 8 provides for the embodiment of the present invention 2;
Each FFD that Fig. 9 provides for the embodiment of the present invention 2 distributes the schematic diagram of time slot;
The FFD that Figure 10 provides for the embodiment of the present invention 2 receives/sends the schematic diagram of the time slot section of data;
The schematic diagram of the schedule information that Figure 11 provides for the embodiment of the present invention 2;
Figure 12 provide for the embodiment of the present invention 2 each described in FFD in the time slot section of regulation, open that transceiver receives or the schematic diagram of forwarding data;
The block diagram of a kind of resource scheduling device that Figure 13 provides for the embodiment of the present invention 2.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
Embodiment 1
The embodiment of the present invention provides a kind of resource regulating method, and as shown in Figure 1, the 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 described current FFD to the link cost of described neighbours FFD;
Link cost is the energy of required consumption while sending data from current FFD to neighbours FFD, can be also the jumping figure experiencing to object FFD from current FFD, when concrete application, can select according to actual needs the expression mode of link cost.
Step 102, according to described link cost, determines that described current FFD is to the energy consumption optimal path of gateway;
Particularly, according to described neighbours FFD, create the adjacency matrix between described current FFD and described neighbours FFD; According to described link cost and described adjacency matrix, determine that described current FFD is to the energy consumption optimal path of gateway.
Step 103, is converted to tree structure by described energy consumption optimal path, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data.
Particularly, described energy consumption optimal path is converted to tree structure, and according to described neighbours RFD, determines the time slot of described current FFD transceiving data;
According to the time slot of described current FFD transceiving data and described adjacency matrix, determine the channel of described current FFD transceiving data.
Further, after described method, also need according to the time slot of described current FFD transceiving data and channel, determine the schedule information of described current FFD, and described schedule information is sent to described current FFD.
A kind of resource regulating method that the embodiment of the present invention provides, the solicited message sending by receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD, then according to described link cost, determine that described current FFD is to the energy consumption optimal path of gateway, described energy consumption optimal path is converted to tree structure, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data.With in prior art when carrying out transfer of data, telegon distributes time slot to FFD randomly, discretely, causes FFD to start continually communication module, makes higher the comparing of energy consumption of FFD, the scheme that the embodiment of the present invention provides can intensively forward the data to gateway, reduces the energy consumption of FFD.
The embodiment of the present invention provides a kind of resource scheduling device, and this device can be gateway, and this device can be FFD particularly, and as shown in Figure 2, this device comprises: receiving element 201, the first determining unit 202, the second determining units 203.
Receiving element 201, the solicited message sending for receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD;
The first determining unit 202, for according to described link cost, determines that described current FFD is to the energy consumption optimal path of gateway;
The second determining unit 203, for described energy consumption optimal path is converted to tree structure, and determines time slot and the channel of described current FFD transceiving data according to described tree structure and described neighbours RFD.
A kind of resource scheduling device that the embodiment of the present invention provides, by receiving element, receive the solicited message that at least one current FFD sends, link cost according to the described current FFD in described request information to described neighbours FFD, by the first determining unit, determine that described current FFD is to the energy consumption optimal path of gateway, the second determining unit is converted to tree structure by described energy consumption optimal path, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data.With in prior art when carrying out transfer of data, telegon distributes time slot to FFD randomly, discretely, causes FFD to start continually communication module, makes higher the comparing of energy consumption of FFD, the scheme that the embodiment of the present invention provides can intensively forward the data to gateway, reduces the energy consumption of FFD.
Embodiment 2
The embodiment of the present invention provides a kind of resource regulating method, and as shown in Figure 3, the method comprises:
It should be noted that, purple honeybee is divided into three parts: BOP (Beacon Only Period by superframe, beacon frame sends period), CAP (Contention Access Period, contention access time slot), CFP (Contention Free Period, exempt from competition slot), wherein, in BOP region, between FFD (Full Function Device, full-function device), by beacon beacon frame, undertaken synchronously; In CAP region, to carry out FFD solicited message and be uploaded to gateway, gateway processes also issues schedule information; In CFP region, each node operation dispatching information, node refers to FFD and RFD (Reduced Function Device simplifies function device) here.In addition, gateway can be also FFD, and the function of only carrying out is different from common FFD.
Step 301, each FFD in MESH network is device transmits beacons frame towards periphery;
In BOP region, MESH network comprises at least one FFD (Full Function Device, full-function device), it is synchronous to carry out that FFD sends beacon beacon frame each other, in described beacon frame, carry the FFD that described beacon frame is corresponding and to upper level FFD, send the time of data, so that can send data to upper level FFD with the FFD of one-level simultaneously, reach synchronous.It should be noted that, FFD sends beacon frame in the non-active period of its neighbor device.In addition, the FFD in 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 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 of same one-level, and the next stage FFD that E is A, the upper level FFD that A is E.
Step 302, described current FFD sends request information to gateway, and described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and described current FFD to the link cost of described neighbours FFD;
It should be noted that, enter CAF region after synchronous, each FFD upload request information in MESH network is to gateway, and the embodiment of the present invention is in order to be described clearly, and the current FFD of take is described as example.Described request information comprises that neighbours simplify function device RFD sign, neighbours FFD sign and described current FFD to the link cost of described neighbours FFD, also comprises the type of equipment self, is illustrated in figure 4 network topology structure, wherein, GW is gateway, and circle represents FFD or RFD, wherein, entity circle represents FFD, A, B, E, F, I, J represent FFD, and in addition, A, B are first order FFD, E, F are second level FFD, and I, J are third level FFD; Empty circles represents RFD, and C, D, G, H, K, M, N, L represent RFD.
Fig. 5 is the table that solicited message that FFD uploads forms, the first behavior gateway of table, and device type is 0x00, there is no adjacent RFD, 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 be 2, A is 1, A to the link cost of E to the link cost of B is 2 to the link cost of F.
Step 303, gateway receives the solicited message that described current FFD sends;
It should be noted that, gateway receives the solicited message that in MESH network, all FFD send.
Step 304, described gateway, according to described link cost, determines that described current FFD is to the energy consumption optimal path of gateway;
Particularly, 1. according to described neighbours FFD, create the adjacency matrix between described current FFD and described neighbours FFDFFD; As shown in Figure 6, two FFD are adjacent is designated as 1, non-conterminously be 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 described link cost and described adjacency matrix, determine that described current FFD is to the energy consumption optimal path of gateway.
Particularly, can adopt dijkstra's algorithm to determine that current FFD is to the energy consumption optimal path of gateway.It should be noted that, if when wherein certain equipment has many feasible paths, should avoid selecting to have with FFD at the same level the path of same intermediate node as far as possible.Illustrate, ask node I to the energy consumption optimal path of gateway:
If: Vp, Vq are any two points in topological structure, if non-conterminous between 2 of Vp and Vq, limit weight w { Vp, Vq}=∞;
for?i：＝1?to?n
L(Vi)：＝∞
L(I)＝0
While GW does not belong to S
begin
U:=does not belong to a minimum summit of L (u) of S
S：＝SU{u}
The all fixed point v that do not belong to S of for
if?L(u)+w(u，v)＜L(v)
then?L(v)：＝L(u)+w(u，v)
{ give so and in S, add with the summit of minimum mark and upgrade the not mark on the summit in S }
The length of the shortest path of end{L (GW)=from I to GW }
It should be noted that, Vi be except I institute a little, initialization tag, I is labeled as 0, is designated as L (I)=0, all the other nodes are labeled as ∞, L (Vi) :=∞, S is empty set,
so give and in S, add with the summit of minimum mark and upgrade the not mark on the summit in S, until find the length of shortest path.
Concrete steps are as follows:
According to method above, can obtain current FFD (I) to the energy consumption optimal path of gateway, in like manner, also can obtain other FFD to the energy consumption optimal path of gateway, if Fig. 7 is the energy consumption optimal path of each FFD to gateway.When if wherein certain equipment has many feasible paths, should avoid selecting to have with FFD at the same level the path of same intermediate node 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, is converted to tree structure by described energy consumption optimal path, and according to described tree structure and described neighbours RFD, determines the time slot of described current FFD transceiving data;
Can adopt breadth-first search, bonding apparatus type, as shown in Figure 8, can, according to following steps, be converted to tree structure by described energy consumption optimal path particularly:
1. the root node for tree by the evaluation of end point of described energy consumption optimal path, is the root node that gateway is elected to be tree by 0x00 equipment;
2. add all limits that are associated with described root node in described energy consumption optimal path, determine the ground floor summit of described tree; It should be noted that, A, B can at random sort.
3. access in order described ground floor summit, according to the method for determining described ground floor summit, determine the second layer summit of described tree, until produce the spanning tree of described energy consumption optimal path.
Access in order ground floor summit A, B, in the situation that not producing loop, interpolation and each limit that A, B summit are associated, so just produced the second layer summit E, the F that set, it should be noted that, 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 summit I, the J of the 3rd layer, after limited step, just produced like this spanning tree of energy consumption optimal path.
Convert to after tree structure, according to the tree converting to and described neighbours RFD, determine the time slot of FFD transceiving data described in each, it should be noted that, be first from gateway one-level node farthest as I, J distribute time slot, then successively to gateway, advance, concrete steps are as follows:
1. according to described neighbours RFD, calculate the data volume that described current FFD need to forward;
The data volume that 2. need to forward according to described current FFD, for distributing, described current FFD receives data slot section, wherein, the reception data slot section of distributing with the described FFD of one-level is identical, and the described reception data slot section of distributing is determined according to the data volume of the FFD of the maximum amount of data receiving in the described whole FFD with one-level;
3. according to described reception data slot section, determine the transmission data slot section of described current FFD.
For convenience of description, suppose each RFD, FFD has the data volume of a time slot to need to send, can calculate respectively like this data volume that FFD need to forward described in each, illustrate, as shown in Figure 9, the I of the 3rd utmost point, needing the data volume forwarding is 1 time slot, need to forward the data volume of K, with the FFD J of I with one-level, needing the data volume forwarding is 3 time slots, need to forward L, M, the data volume of N, like this, the number of time slots that the third level need to be distributed is 3, concrete receiving slot section of distributing is 1-3, the reception data slot section that is the third level is identical, and the maximum amount of data that the described FFD of the described reception data slot Duan Weitong one-level of distributing receives, described in each, FFD sends the reception data slot section of FFD that data slot section is the upper level of described FFD, particularly, FFD as described in Figure 10 receives/sends the time slot section of data, the reception data slot section of I, J is 1-3, the reception data slot section of E, F is 4-8, like this, the transmission data slot section of I, J is 4-8.
It should be noted that, when described in each during FFD transceiving data, the sub-RFD of described FFD, described FFD and the next stage FFD of described FFD are that same class equipment is at same period transceiving data.Here, if RFD is directly connected with FFD (A), RFD can be described as the sub-RFD of described FFD (A).Illustrate, in FFD topological structure as shown in Figure 4, it is a class that E gathers I and G, same period transceiving data, and by that analogy, the data of all devices all send to gateway the most at last.
Step 306, according to time slot and the described adjacency matrix of the described current FFD transceiving data of determining, determines the channel of described current FFD transceiving data;
Due to E, F is in same one-level, therefore around link all in same time slot section in active period, like this, if I sends data to E, J sends data in same channel to F, when J sends data to E, E is in the communication range of J, E can be subject to interference physically, therefore, in the scheme that the embodiment of the present invention provides, gateway adopts edge coloring algorithm to two FFD different channel of link assignment around, edge coloring is for all specifying a color to each limit being connected in the figure forming by a plurality of nodes, making not have two adjacent limits is all same color.
The edge coloring of the embodiment of the present invention for be in each time slot section between FFD when node associated with it communicates, each limit should different colors, and no matter whether they are within communication range each other, in addition, when the present invention also can be according to FFD transceiving data, the link between same class equipment same color, illustrate, for I, J, E, F, these equipment of G, H, the link between I, G and E blueness, and the link between J, H and F crocus.
Step 307, according to the time slot of described current FFD transceiving data and channel, determines the schedule information of described current FFD, and described schedule information is sent to described current FFD;
Like this, gateway can be determined the schedule information of each FFD in MESH network, and schedule information can be sent to corresponding FFD.Particularly, as shown in figure 11, according to determine each described in time slot and the channel of FFD transceiving data, determine time slot that each FFD transmits and receive data and the schedule information of channel, as A equipment in table, sending time slots section is 16-29, channel is X, and receiving slot section is 9-15, and channel is X; It should be noted that, X is the sign of channel here, and different time slots can only be used a channel.
Step 308, the schedule information that described current FFD distributes according to described gateway is opened transceiver and is received or forwarding data in the time slot section of regulation.
Particularly, in CFP region, FFD opens transceiver and receives or forwarding data in the time slot section of regulation described in each, and as shown in figure 12, I and J receive respectively the data of K, L, M, N in the first time slot section, and other equipment are not worked; E and F receive respectively the data of I, G, J, H transmission in the second time slot section, other equipment are not worked; A and B receive respectively the data of C, D, E, F transmission in the 3rd time slot section, other equipment are not worked; Gateway GW receives respectively in the 4th time slot section the data that A, B send, and other equipment are not worked.
It should be noted that, in wireless device, nearly 95% energy is by communication module consumed.And FFD equipment in traditional zigbee network is all the time in listening state, or FFD starts communication module continually, make the energy consumption of FFD higher, the scheme that the embodiment of the present invention provides makes the FFD far away apart from gateway start to draw near to work at times, FFD can close transceiver at all the other time slots, in resting state, when having guaranteed to forward the data to gateway, fundamentally reduce energy consumption.
A kind of resource regulating method that the embodiment of the present invention provides, the solicited message sending by receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD, then according to described link cost, determine that described current FFD is to the energy consumption optimal path of gateway, described energy consumption optimal path is converted to tree structure, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data.With in prior art when carrying out transfer of data, telegon distributes time slot to FFD randomly, discretely, cause FFD to start continually communication module, make higher the comparing of energy consumption of FFD, the scheme that the embodiment of the present invention provides can intensively forward the data to gateway, reduce the energy consumption of FFD, in the time of can avoiding subset to send upstream data, situation about bumping.
The embodiment of the present invention provides a kind of resource scheduling device, and this device can be gateway, and this device can be FFD particularly, as shown in figure 13, this device comprises: receiving element 1301, the first determining units 1302, creation module 1303, determination module 1304, the second determining units 1305, modular converter 1306, the first determination modules 1307, calculating sub module 1308, first determines submodule 1309, second determines submodule 1310, the second determination modules 1311, transmitting element 1312.
Receiving element 1301, the solicited message sending for receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD;
It should be noted that, before receiving element 1301 receives the solicited message of FFD transmission, it is synchronous to carry out that FFD in MESH network sends beacon beacon frame each other, in described beacon frame, carry the FFD that described beacon frame is corresponding and to upper level FFD, send the time of data, so that can send data to upper level FFD with the FFD of one-level simultaneously, reach synchronous.In addition, FFD sends beacon frame in the non-active period of its neighbor device.
The first determining unit 1302, for according to described link cost, determines that described current FFD is to the energy consumption optimal path of gateway;
Particularly, the creation module 1303 in described the first determining unit 1302, for according to described neighbours FFD, creates the adjacency matrix between described current FFD and described neighbours FFD; Determination module 1304, for according to described link cost and described adjacency matrix, determines that described current FFD is to the energy consumption optimal path of gateway; The embodiment of the present invention adopts dijkstra's algorithm to determine described in each that FFD is to the energy consumption optimal path of gateway;
The second determining unit 1305, for described energy consumption optimal path is converted to tree structure, and determines time slot and the channel of described current FFD transceiving data according to described tree structure and described neighbours RFD;
Particularly, the modular converter 1306 in described the second determining unit 1305, utilizes breadth-first search, and bonding apparatus type is converted to tree structure by described energy consumption optimal path;
Wherein, the root node for tree by the evaluation of end point of the described energy consumption optimal path of determining; Add again all limits that are associated with described root node in described energy consumption optimal path, determine the ground floor summit of described tree; Then access in order described ground floor summit, according to the method for determining described ground floor summit, determine the second layer summit of described tree, until produce the spanning tree of described energy consumption optimal path;
After having determined tree structure, according to the described tree structure of conversion, the first determination module 1309 in described the second determining unit 1305 is determined the time slot of described current FFD transceiving data according to described tree structure and described neighbours RFD;
Particularly, the calculating sub module 1310 in described the first determination module 1309, according to described neighbours RFD, is calculated the data volume that described current FFD need to forward;
The data volume that need to forward according to described current FFD, first determines submodule 1311, for described current FFD distributes, receives data slot section, the data that the described FFD of described reception data slot Duan Youtong one-level receives are that maximum amount of data is determined;
According to described reception data slot section, second determines submodule 1312, determines the transmission data slot section of described current FFD.
According to the time slot of described current FFD transceiving data and described adjacency matrix, the second determination module 1313 is determined the channel of described current FFD transceiving data, particularly, the embodiment of the present invention can adopt edge coloring algorithm in graph theory to determine the described channel of FFD transceiving data described in each;
After the time slot and channel of transmission data of having determined each FFD, transmitting element 1314, for according to the time slot of described current FFD transceiving data and channel, determines the schedule information of described current FFD, and described schedule information is sent to described current FFD.
It should be noted that, each FFD receives after the schedule information of gateway transmission, according to the transceiving data time slot in schedule information and channel, opens transceiver reception or forwarding data.
A kind of resource scheduling device that the embodiment of the present invention provides, by receiving element, receive the solicited message that at least one current FFD sends, then the first determining unit is according to the described link cost in solicited message, determine that described current FFD is to the energy consumption optimal path of gateway, the second determining unit is converted to by described energy consumption optimal path time slot and the channel that tree structure and described neighbours RFD determine described current FFD transceiving data.With in prior art when carrying out transfer of data, telegon distributes time slot to FFD randomly, discretely, causes FFD to start continually communication module, makes higher the comparing of energy consumption of FFD, the scheme that the embodiment of the present invention provides can intensively forward the data to gateway, reduces the energy consumption of FFD.
It should be noted that, this programme is except the MESH topological structure in the zigbee agreement for based on 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 only the specific embodiment of the present invention, but protection scope of the present invention is not limited to this, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion by the described protection range with claim.
Claims (10)
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 described current FFD to the link cost of described neighbours FFD;
According to described link cost, determine that described current FFD is to the energy consumption optimal path of gateway;
Described energy consumption optimal path is converted to tree structure, and according to described tree structure and described neighbours RFD, determines time slot and the channel of described current FFD transceiving data;
Other other FFD are at same period transceiving data for the same level of described current FFD and described current FFD;
The sub-RFD of described current FFD and described current FFD is at same period transceiving data;
The time slot of the reception data of described current FFD is identical with the time slot of the transmission data of the next stage FFD of described current FFD.
2. resource regulating method according to claim 1, is characterized in that, described according to described link cost, determines that described current FFD comprises to the energy consumption optimal path of gateway:
According to described neighbours FFD, create the adjacency matrix between described current FFD and described neighbours FFD;
According to described link cost and described adjacency matrix, determine that described current FFD is to the energy consumption optimal path of gateway.
3. resource regulating method according to claim 2, is characterized in that, described described energy consumption optimal path is converted to tree structure, and determines that according to described tree structure and described neighbours RFD the time slot of described current FFD transceiving data and channel comprise:
Described energy consumption optimal path is converted to tree structure, and according to described neighbours RFD, determines the time slot of described current FFD transceiving data;
According to the time slot of described current FFD transceiving data and described adjacency matrix, determine the channel of described current FFD transceiving data.
4. resource regulating method according to claim 3, is characterized in that, describedly according to described neighbours RFD, determines that the time slot of described current FFD transceiving data comprises:
According to described neighbours RFD, calculate the data volume that described current FFD need to forward;
The data volume that need to forward according to described current FFD, receives data slot section for described current FFD distributes, and described reception data slot section is determined according to the maximum amount of data that receives each FFD of data in described reception data slot section;
According to described reception data slot section, determine the transmission data slot section of described current FFD.
5. according to the resource regulating method described in any one in claim 1-4, it is characterized in that, also comprise:
According to the time slot of described current FFD transceiving data and channel, determine the schedule information of described current FFD, and described schedule information is sent to described current FFD.
6. a resource scheduling device, is characterized in that, comprising:
Receiving element, the solicited message sending for receiving at least one current FFD, described request information comprises that neighbours RFD sign, neighbours FFD sign and described current FFD are to the link cost of described neighbours FFD;
The first determining unit, for according to described link cost, determines that described current FFD is to the energy consumption optimal path of gateway;
The second determining unit, for described energy consumption optimal path is converted to tree structure, and determines time slot and the channel of described current FFD transceiving data according to described tree structure and described neighbours RFD;
Other other FFD are at same period transceiving data for the same level of described current FFD and described current FFD;
The sub-RFD of described current FFD and described current FFD is at same period transceiving data;
The time slot of the reception data of described current FFD is identical with the time slot of the transmission data of the next stage FFD of described current FFD.
7. resource scheduling device according to claim 6, is characterized in that, described the first determining unit comprises:
Creation module, for according to described neighbours FFD, creates the adjacency matrix between described current FFD and described neighbours FFD;
Determination module, for according to described link cost and described adjacency matrix, determines that described current FFD is to the energy consumption optimal path of gateway.
8. resource scheduling device according to claim 6, is characterized in that, described the second determining unit comprises:
Modular converter, for being converted to tree structure by described energy consumption optimal path;
The first determination module, for determining the time slot of described current FFD transceiving data according to described tree structure and described neighbours RFD;
The second determination module, for according to the time slot of described current FFD transceiving data and adjacency matrix, determines the channel of described current FFD transceiving data.
9. resource scheduling device according to claim 8, is characterized in that, described the first determination module comprises:
Calculating sub module, for according to described neighbours RFD, calculates the data volume that described current FFD need to forward;
First determines submodule, for the data volume that need to forward according to described current FFD, for described current FFD distributes, receive data slot section, described reception data slot section is determined according to the maximum amount of data that receives each FFD of data in described reception data slot section;
Second determines submodule, for according to described reception data slot section, determines the transmission data slot section of described current FFD.
10. according to the resource scheduling device described in any one in claim 6-9, it is characterized in that, described device also comprises:
Transmitting element, for according to the time slot of described current FFD transceiving data and channel, determines the schedule information of described current FFD, and described schedule information is sent to described 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 CN102395181A (en) | 2012-03-28 |
| CN102395181B true 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) |
Families Citing this family (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 |
| CN113542371B (en) * | 2021-06-29 | 2022-05-17 | 西南大学 | Resource scheduling method and system based on edge gateway |
Citations (3)
| 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 |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7801079B2 (en) * | 2007-03-02 | 2010-09-21 | Motorola, Inc. | Method and apparatus for battery-aware dynamic bandwidth allocation for groups of wireless sensor nodes in a wireless sensor network |
-
2011
- 2011-11-07 CN CN201110348285.4A patent/CN102395181B/en not_active Expired - Fee Related
Patent Citations (3)
| 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 |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102395181A (en) | 2012-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8380072B2 (en) | Integrated sensor networks with optical and wireless links | |
| CN108028802A (en) | Self-organizing mesh network is built using 802.11AD technologies | |
| CN101420463B (en) | Wireless sensor network address allocation mechanism | |
| CN109462662A (en) | A kind of gateway, Internet of Things net equipment, Internet of things system and control method | |
| CN103262481A (en) | Dynamic reroute scheduling in a directed acyclic graph (DAG) | |
| CN102395181B (en) | Method and device for scheduling resources | |
| CN104135751B (en) | A kind of Uneven Cluster method for routing suitable for subway tunnel | |
| CN102104875B (en) | A kind of Novel cognitive radio multi-channel MAC protocol method | |
| CN114553697B (en) | Industrial wireless and TSN fusion-oriented network scheduling method | |
| CN103826306B (en) | A kind of descending dynamic interference coordination method in highly dense set network based on game | |
| CN102130705B (en) | WLAN (Wireless Local Area Network) MESH communication method and device based on fast frequency hopping | |
| CN108064064A (en) | Wireless sensor network Ad Hoc is by method and apparatus | |
| CN101867920B (en) | Grading type wireless sensor networking method | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN102413577A (en) | Method for allocating link of multi-channel wireless network | |
| CN103139073A (en) | Cognitive routing method based on Ad Hoc network form | |
| CN109413752A (en) | A kind of real time resources dispatching method towards wireless low-power consumption network | |
| CN103596276A (en) | Wireless network channel distribution strategy based on channel interval | |
| US10165621B2 (en) | Directional mobile ad-hoc network | |
| CN110545559B (en) | Access control method and equipment based on sensing equipment of Internet of things | |
| CN103298153A (en) | Nest cellular wireless sensor network and networking method | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| KR102209576B1 (en) | The method of link scheduling for data processing and the apparatus thereof | |
| CN101848032A (en) | Conflict avoidance-based dispatching method for wireless MESH network | |
| CN106454940A (en) | Load balancing method in wireless mesh network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141105 Termination date: 20161107 |