CN104581820A - Sub-region-based time slot distribution method and device - Google Patents
Sub-region-based time slot distribution method and device Download PDFInfo
- Publication number
- CN104581820A CN104581820A CN201310516596.6A CN201310516596A CN104581820A CN 104581820 A CN104581820 A CN 104581820A CN 201310516596 A CN201310516596 A CN 201310516596A CN 104581820 A CN104581820 A CN 104581820A
- Authority
- CN
- China
- Prior art keywords
- node
- subtree
- grouping
- time slot
- information
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1887—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The embodiment of the invention provides a sub-region-based time slot distribution method and a sub-region-based time slot distribution device. The method is applied to other nodes, except a convergent node, in a multi-hop sensor network, and comprises the following steps: a node sends a detection request packet including sub-tree information of a sub-tree on which the node is positioned in a broadcasting manner, wherein the sub-tree takes the node which is one hop away from the convergent node as a root node; the node determines whether the other nodes and the node are in the same sub-tree or not according to the received detection request packet which is sent by the other nodes and comprises the information of the sub-tree on which the node is positioned; if the other nodes and the node are not in the same sub-tree, the node stores the information of the sub-tree on which the other nodes are positioned in a local collision table, and transmits the local collision table to the parent node of the node. The distribution of a time slot in a relatively large network is changed into the distribution (on time and space) of a plurality of independent time slots in a plurality of relatively small networks, so that the problem of time slot distribution difficulty caused by a large number of nodes is solved.
Description
Technical field
The present invention relates to the communications field, particularly relate to a kind of slot allocation method based on subregion and device.
Background technology
In wireless sensor network, if neighbor node sends respective packet simultaneously, can clash, as shown in Figure 1, node A and node C takies identical time slot and sends respective packet, for neighbor node B, owing to receiving packet at this time slot, then create obvious conflict.
At present, in order to solve this conflict, the mode of time slot allocation is used, to ensure that neighbor node sends respective packet at different time-gap, as shown in Figure 2, node A sends its packet at time slot n, and node C sends its packet at time slot m, for neighbor node B, the packet of node A and node C transmission is received at different time slots, can avoid transmission collision thus, the bag lost is fewer, can realize higher data packets rate.
But inventor is realizing finding in process of the present invention, and network is larger, and time slot allocation is more difficult.In numerous node, for a time slot, the judgement which node can preengage this time slot becomes more complicated, and negotiation overhead (such as, the size on this earth's surface and the size of control bag in a node) is also large simultaneously.How to alleviate the research direction that the problems referred to above become industry.
Above it should be noted that, just conveniently to technical scheme of the present invention, clear, complete explanation is carried out to the introduction of technical background, and facilitate the understanding of those skilled in the art to set forth.Only can not think that technique scheme is conventionally known to one of skill in the art because these schemes have carried out setting forth in background technology part of the present invention.
Summary of the invention
The main purpose of the embodiment of the present invention is to provide a kind of slot allocation method based on subregion and device, by by changing into the some independently time slot allocation (on room and time) in several less networks compared with the time slot allocation in macroreticular, to solve the problem that background technology is pointed out.
According to the first aspect of the embodiment of the present invention, provide a kind of slot allocation method based on subregion, described method is applied to other nodes in multi-hop sensor network except aggregation node, and wherein, described method comprises:
Described node broadcasts sends the detection request bag comprising the subtree information of the subtree at its place, and this subtree is using the node of distance aggregation node 1 jumping as root node;
The detection request bag comprising respective place subtree information that described node sends according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
If other nodes described and described node be not in same subtree, then described node is by the place subtree information of other nodes described stored in the collision table of this locality, and sends local collision table to its father node.
According to the second aspect of the embodiment of the present invention, provide a kind of slot allocation method based on subregion, described method is applied to the aggregation node in multi-hop sensor network, and wherein, described method comprises:
Described aggregation node is according to the conflict relationship between the collision table bag determination subtree from its all 1 jumping child node received and subtree;
Described aggregation node is according to described conflict relationship, in units of subtree, all subtrees are divided into multiple groups, and described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
According to the third aspect of the embodiment of the present invention, provide the node in a kind of wireless network, wherein, described node comprises:
Transmitting element, its broadcast transmission comprises the detection request bag of the subtree information of the subtree at described node place, and this subtree is using the node of distance aggregation node 1 jumping as root node;
Determining unit, its detection request bag comprising respective place subtree information sent according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
Processing unit, it is when other nodes described and described node are not in same subtree, by the place subtree information of other nodes described stored in the collision table of this locality, and sends local collision table to its father node.
According to the fourth aspect of the embodiment of the present invention, provide the aggregation node in a kind of wireless network, wherein, described aggregation node comprises:
Determining unit, it is according to the conflict relationship between the collision table bag determination subtree of all 1 jumping child nodes from described aggregation node received and subtree;
Processing unit, it is according to described conflict relationship, in units of subtree, all subtrees is divided into multiple groups, and described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
According to other aspects of the embodiment of the present invention, provide a kind of network, wherein, described network comprises the node described at least one third aspect and the aggregation node described in fourth aspect.
The beneficial effect of the embodiment of the present invention is, by changing into the some independently time slot allocation (on room and time) in several less networks compared with the time slot allocation in macroreticular, solves the problems referred to above that background technology is pointed out thus.
With reference to explanation hereinafter and accompanying drawing, disclose in detail particular implementation of the present invention, specifying principle of the present invention can adopted mode.Should be appreciated that, thus embodiments of the present invention are not restricted in scope.In the spirit of claims and the scope of clause, embodiments of the present invention comprise many changes, amendment and are equal to.
The feature described for a kind of execution mode and/or illustrate can use in one or more other execution mode in same or similar mode, combined with the feature in other execution mode, or substitutes the feature in other execution mode.
Should emphasize, term " comprises/comprises " existence referring to feature, one integral piece, step or assembly when using herein, but does not get rid of the existence or additional of one or more further feature, one integral piece, step or assembly.
Accompanying drawing explanation
Included accompanying drawing is used to provide the further understanding to the embodiment of the present invention, which constituting a part for specification, for illustrating embodiments of the present invention, and coming together to explain principle of the present invention with text description.Apparently, the accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.In the accompanying drawings:
Fig. 1 is the schematic diagram not carrying out the conflict that time slot allocation produces;
Fig. 2 is through the schematic diagram that time slot allocation avoids produced conflict;
Fig. 3 is the schematic diagram of an example of the topological structure of wireless sensor network;
Fig. 4 is the flow chart of the slot allocation method based on subregion of one embodiment of the invention;
Fig. 5 is the form schematic diagram detecting request bag;
Fig. 6 is the form schematic diagram of conflict array (collision table);
Fig. 7 is the form schematic diagram of conflict array bag (collision table bag);
Fig. 8 is the flow chart of update inconsistency array;
Fig. 9 is the flow chart of reception and update inconsistency array bag;
Figure 10 is the flow chart of the slot allocation method based on subregion of another embodiment of the present invention;
Figure 11 is the method schematic diagram that sink node divides into groups to all 1 jumping subtrees;
Figure 12 is the time slot allocation flow chart of an execution mode of the embodiment of the present invention;
Figure 13 is the schematic diagram of an embodiment of wireless sensor network;
Figure 14 is the schematic diagram that each 1 in the wireless sensor network shown in Figure 13 jumps the conflict relationship array of subtree;
Figure 15 is group result schematic diagram;
The schematic diagram whether conflicted with the time slot of peer distribution of Figure 16 to be the inspection of sink node be 1 jumping subtree;
Figure 17 is time slot allocation schematic diagram;
Figure 18 is the composition schematic diagram of the ordinary node (relative to aggregation node) of the embodiment of the present invention;
Figure 19 is the composition schematic diagram of the aggregation node of the embodiment of the present invention.
Embodiment
Below in conjunction with accompanying drawing, various execution mode of the present invention is described.These execution modes are exemplary, are not limitations of the present invention.In order to enable those skilled in the art to easily to understand principle of the present invention and execution mode, embodiments of the present invention are described for the slot allocation method based on subregion in multi-hop sensor network, but be appreciated that, the embodiment of the present invention is not limited to above-mentioned network, for other networks relating to time slot allocation, such as ad hoc network, intelligent grid etc. are all applicable.Also namely, the slot allocation method of the embodiment of the present invention may be used on having in the network of the full tree topology connected, and to be decided data packets on which paths to sink(" root " by routing algorithm).
In order to make the method for the embodiment of the present invention clearly understandable, first some concepts that the embodiment of the present invention relates to are briefly described below.
In embodiments of the present invention, " sink " refers to and for convenience of description, is called aggregation node by the node that all data uploaded converge.
In embodiments of the present invention, 1 jump subtree refers to distance sink(aggregation node) 1 jumping node be the subtree of root, such as, in figure 3 with the subtree that H, L, P are root.
Embodiment 1
Embodiments provide a kind of slot allocation method based on subregion, described method is applied to wireless network, other nodes such as, in multi-hop sensor network except aggregation node.Fig. 4 is the flow chart of the method, please refer to Fig. 4, and the method comprises:
Step 401: described node broadcasts sends the detection request bag comprising the subtree information of the subtree at its place, this subtree is using the node of distance aggregation node 1 jumping as root node.
In the present embodiment, if established route and each node know oneself belong to which 1 jump subtree.Then each node carries out potential conflicting nodes detection, to find out the conflict relationship in each 1 jumping subtree.In step 401, each node sends 1 jumping and broadcasts to belong to which 1 jumping subtree to allow its neighbor node know this node.Fig. 5 is the schematic diagram of an embodiment of this detection request bag (also referred to as broadcast data packet).As shown in Figure 5, this detection request bag mainly comprises: type (Type), source address (Source Addr), destination address (Destination Addr) and root mark (Root ID), and root mark here refers to that 1 belonging to this source address jumps the root of subtree.Certainly, the present embodiment is not in this, as restriction, and this detection request bag also can comprise other content and have other form, as long as can show that 1 belonging to this node jumps subtree.
In the present embodiment, as the node receiving this detection request bag, the method for the present embodiment also comprises:
Step 402: the detection request bag comprising respective place subtree information that described node sends according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
Step 403: if other nodes described and described node be not in same subtree, then described node is by the place subtree information of other nodes described stored in the collision table of this locality, and sends the collision table bag comprising local collision table to its father node.
In the present embodiment, when a node receives the detection request bag from transmit leg, by inspection, whether it belongs to same 1 jumping subtree with this transmit leg to this node itself.If do not belong to same 1 to jump subtree, also namely these two nodes can not send data concurrently, so recipient jumps the information of subtree (such as by different 1, the ID of the root node of this 1 jumping subtree) be stored in a conflict array, be called collision table in the present embodiment, and upload to its father node.Such as, suppose that Node B can receive the information of node I, and Node B and node I belong to 1 different jumping subtrees, as shown in Figure 6, wherein, L is conflict root node to conflict array then in Node B, also namely 1 of node I jump subtree with node L for root, L is the root node that 1 of node I jumps subtree.
In the present embodiment, as the node receiving this collision table bag, also namely send the father node of the node of collision table bag, the method for the present embodiment also comprises:
Step 404: described node receives the collision table bag from its all 1 jumping child node;
Step 405: described node, according to the collision table bag received, upgrades local collision table, and the collision table bag of the collision table of this locality after comprising renewal is sent to its father node.
In the present embodiment, because the leaf node in network does not have child node, therefore these nodes are without the need to performing step 404-405, only perform step 401-403.Except leaf node, each node needs to upgrade its conflict array according to step 404-405, and the conflict array of renewal is uploaded to its father node.
In step 404, in order to fully upgrade the collision table of this locality, this node can first wait for a period of time, and to receive the collision table bag from its all 1 jumping child node, then upgrades local collision table according to the collision table bag received again.
Fig. 7 is the form schematic diagram of an execution mode of collision table bag (also referred to as conflict array data bag), as shown in Figure 7, this collision table bag mainly comprises: type (Type), source address (Source Addr), destination address (Destination Addr) and at least one root mark (Root ID), wherein, root mark is exactly the mark of the root node of the subtree at the conflicting nodes place of this node, and this at least one root mark is also aforesaid collision table (conflict array).Certain the present embodiment is not using the form of the collision table bag shown in Fig. 7 and the content that comprises as the restriction to collision table bag, this collision table bag also can comprise other content and have other form, as long as can show to jump with 1 belonging to this node, subtree conflicts 1 jumps subtree which has.
In step 405, this node can upgrade local collision table by the mode of each the subtree information (being also aforesaid mark) traveling through each collision table bag received, if described subtree information is included in local collision table, then described subtree information is not processed; If described subtree information is not included in local collision table, then described subtree information is added in local collision table.Thus achieve the renewal of the collision table to this locality.
In the present embodiment, above upload procedure runs to sink node from leaf node one by one.When a node receives a conflict array data bag from a child node, its handling process as shown in Figure 8.
Please refer to Fig. 8, this flow process comprises:
Step 801: receive a conflict array bag, and set i as 1;
Step 802: scan i-th root mark (Root ID) in the bag received;
Step 803: judge whether i is greater than n, the number of root mark of n for comprising in the conflict array bag that receives; If so, then end process, otherwise perform step 804;
Step 804: judge that this root mark is whether in local collision array; If so, then this root mark is not processed, continue the next root mark of scanning, otherwise perform step 805;
Step 805: this root mark is added in local collision array, and continue the next root mark of scanning.
When a node have received all conflict array data bags from its all 1 jumping child node, complete the renewal of the conflict array of this node, the conflict array upgraded will upload to its father node, as shown in Figure 9.
Please refer to Fig. 9, this flow process comprises:
Step 901: wait for the bag (setting j as 0) from child node;
Step 902: receive a jth bag, upgrade local collision array;
Step 903: judge whether j equals n, n is the number of 1 jumping child node; If so, then perform step 904, otherwise get back to step 901;
Step 904: upload local collision array to father node.
Finally, sink node will obtain the conflict array of final updated.Thus, sink node can divide into groups to all 1 jumping subtrees according to the conflict array of this final updated.Wherein, sink node can distinguish any two 1 are jumped in subtree whether Lothrus apterus (jumps subtree conflict for two 1 to mean: if preengage same time slot at these two 1 two nodes of jumping in subtree, then may clash), and divide into groups according to this, to ensure Lothrus apterus between 1 jumping subtree of the difference group of same bout.Concrete group technology will be described below in an example.
In the present embodiment, after sink node is complete to all 1 jumping subtree groupings, time slot allocation information can be issued to next stage one-level, this time slot allocation information not only comprises the grouping at each node place, also comprise the time interval resource scope that each node can be preengage, thus, each node according to this time slot allocation information received, can carry out time slot allocation within the scope of respective time interval resource.
In the present embodiment, as the node receiving this time slot allocation information, the method for the present embodiment also comprises:
Step 406: described node receives the time slot allocation information that its father node sends, described time slot allocation information comprises the relevant information of described node place grouping and the scope of the time interval resource that can preengage;
Step 407: described node, according to the grouping at its place, carries out time slot allocation in the time interval resource of this grouping correspondence.
In the present embodiment, sink node is by setting up the conflict relationship (conflict relationship shows whether two nodes of jumping in subtree when two differences 1 exist conflict when same time slot sends data) in each 1 jumping subtree, and according to this conflict relationship, jumping subtree from all 1 selects several 1 jumping subtrees as one group, can be formed some groups (spatially), this process will continue some bouts (from the time) until do not have 1 jumping subtree to be left.In the different group of one bout, time slot allocation can be completed at each group in self, and without the need to considering the impact from other groups.According to the method for the present embodiment, the conflict caused by two nodes preengaging same time slot in two different groups is minimum.Thus, time slot allocation in the entire network becomes the independently time slot allocation in several groups of some bouts, solves the problem that background technology is pointed out.
In the present embodiment; although carrying out step performed in time slot allocation procedures with the node that the sequence list of step 401-407 understands in network; but the present embodiment is not using this order as the method restriction in the process of implementation to the embodiment of the present invention; in specific implementation process; some additional step can be increased as required; or reduce some steps as required; or adjust the sequencing that each step performs as required; etc.; only otherwise depart from the essence of the embodiment of the present invention, the protection range of the embodiment of the present invention is all contained in.Such as, in certain embodiments, this node may be the detection request bag that the detection request bag first receiving other nodes sends oneself again, also namely first performs step 402-403 and performs step 401 again, or carry out simultaneously.Again such as, for the leaf node in network, owing to there is no child node, therefore do not need to perform step 404-405.
By the method for the present embodiment, the time slot allocation in large wireless sensor network can be completed in several bouts.In one bout, the part being only this network distributes time slot.In one bout, this part can be further divided into several groups, and in these groups, time slot allocation can be independently.Thus, not only reduce the carrying cost (size of GTS table diminishes) for node, and time slot allocation in a group becomes simply (time slot allocation is in a group independently, and interstitial content is little), also makes network become and is easy to safeguard.
Embodiment 2
Embodiments provide a kind of slot allocation method based on subregion, the method is applied to wireless network, such as, aggregation node (sink) in multi-hop sensor network.Figure 10 is the flow chart of the method, please refer to Figure 10, and the method comprises:
Step 1001: described aggregation node is according to the conflict relationship between the collision table bag determination subtree from its all 1 jumping child node received and subtree;
Step 1002: described aggregation node is according to described conflict relationship, in units of subtree, all subtrees are divided into multiple groups, and described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
In the present embodiment, as previously mentioned, sink node can divide into groups to 1 jumping subtree according to the conflict array of final updated.Further, sink node can distinguish that any two 1 to be jumped in subtrees whether Lothrus apterus (jumping subtree conflict for two 1 to mean: if preengage same time slot at these two 1 two nodes of jumping in subtree, then may clash).
In step 1001, first sink node sets up a conflict relationship matrix according to this final updated conflict array.Table 1 is the schematic diagram of an execution mode of this conflict relationship matrix, but the present embodiment is not in this, as restriction.As shown in table 1, by this conflict relationship matrix, can confirm which the 1 jumping subtree in network exists conflict, and which 1 jumping subtree is not conflicted.
Table 1
| S 1 | S 2 | S 3 | ... | S i | ... | S n-1 | S n | |
| S 1 | 0 | 1 | ... | 0 | ... | 1 | 0 | |
| S 2 | 0 | 1 | ... | 0 | ... | 1 | 0 | |
| S 3 | 1 | 1 | ... | 0 | ... | 0 | 1 | |
| ... | ... | ... | ... | ... | ... | ... | ... | |
| S i | 0 | 0 | 0 | ... | ... | 1 | 0 | |
| ... | ... | ... | ... | ... | ... | ... | ... | |
| S n-1 | 1 | 1 | 0 | ... | 1 | ... | 1 | |
| S n | 0 | 0 | 1 | ... | 0 | ... | 1 |
Wherein, the implication of the parameter in this matrix is as follows:
S
i: the root ID of i-th 1 jumping subtree, it can represent this 1 jumping subtree;
0: these two 1 jump subtree Lothrus apterus (can be in different groups in same bout);
1: these two 1 jump subtree conflict (can not be in different groups in same bout).
In addition, 1 the nodes n in subtree Si is jumped
irepresent.
In step 1002, sink node according to above conflict relationship, can be jumped subtree to all 1 and divides into groups, and ensures that 1 of the different grouping at identical bout jumps Lothrus apterus between subtree, jump between subtree as 1 of the same grouping at identical bout and have Lothrus apterus, the present embodiment is not limited.Preferably, suitable at the interstitial content of the different grouping of identical bout, to realize more uniform time slot allocation.Preferably, the time interval resource scope that in identical bout, each grouping can arrange use is identical.Preferably, the time interval resource scope that in different bout, each grouping can arrange use is non-intersect, to realize conflict free time slot allocation substantially.
In an execution mode of step 1002, sink node can be realized by the method shown in Figure 11 the method that all 1 jumping subtrees are divided into groups, and please refer to Figure 11, the method comprises:
Step 1101: determine current pass;
Step 1102: according to predetermined policy, selects the subtree of the first predetermined quantity as first grouping of current pass from optional subtree;
Step 1103: judge in remaining subtree, whether there is at least one subtree meeting first condition, this first condition refers to that the subtree in the every other grouping of this at least one subtree and current pass is noiseless, and the difference of the summation of other arbitrary grouping interior joint numbers of the summation of the nodes of this at least one subtree and current pass is less than first threshold; If had, then perform step 1104, otherwise perform step 1105;
Step 1104: from remaining subtree, selects the subtree in the next one grouping of current pass, and gets back to step 1103;
Step 1105: judge whether to still have non-selected subtree; If had, then enter next bout, continue the grouping of next bout, group technology is identical with the group technology of current pass, does not repeat them here; If no, then ended process.
In step 1104, this sink node can from the glitch-free subtree of subtree the every other grouping of current pass, the subtree of the second predetermined quantity is selected to divide into groups as the next one of this bout, wherein, the difference of the described summation of next one grouping interior joint number and the summation of described first interior joint number that divides into groups is less than first threshold.
In an execution mode of the present embodiment, this sink node subtree (subtrees that also namely node is maximum) that can nodes be selected maximum from optional subtree is as first grouping of current pass, and, from remaining subtree, subtree at least one subtree glitch-free in dividing into groups with first of current pass is selected to divide into groups as second of current pass, and the summation of nodes in second grouping and the difference of the summation of first interior joint number that divides into groups are less than first threshold, and also namely number is suitable.If still have non-selected subtree, then enter next bout and continue to divide into groups according to preceding method.Also namely, in this embodiment, each bout has maximum two groupings, and first grouping only has a subtree, and the subtree of first grouping is that all optional subtree interior joint numbers are maximum.
In the another one execution mode of the present embodiment, the subtree in first grouping of each bout is not limited to be the subtree that nodes is maximum, is also not limited to only have a subtree.
In the another one execution mode of the present embodiment, each bout is not limited to two groupings, can have multiple grouping, but noiseless between each grouping.
Below only to divide two groups in one bout, the method for the present embodiment is described.Figure 12 is the flow chart of the method, please refer to Figure 12, and this flow process comprises:
Step 1201: select that there is maximum node number (n
x) 1 jump subtree (S
x) as the unique member in group 1.
Step 1202: jump subtree the member selecting some other 1 jumping subtrees as group 2 from remaining 1, selected 1 jumps subtree (if having individual arbitrarily) need meet following two conditions:
1) and S
xlothrus apterus (being represented by 0 in conflict relationship matrix);
2) node total number that 1 selected by are jumped in subtree needs and n
xclose to (keeping two to organize balance).
Step 1203: after above-mentioned two steps, the grouping in one bout completes.The grouping of next bout starts, and jumps in subtree repeat step 1201 and 1202 until do not have 1 jumping subtree to be left remaining 1.
The group result of the present embodiment as illustrated in figs. 13-15, wherein, Figure 13 is the schematic diagram of an embodiment of wireless sensor network, this wireless sensor network has five 1 and jumps subtree, respectively with node A1, B1, C1, D1 and E1 for root, also referred to as 1 jump subtree A1,1 jump subtree B1,1 jump subtree C1,1 jump subtree D1 and 1 jump subtree E1; Figure 14 is the schematic diagram that each 1 in the wireless sensor network shown in Figure 13 jumps the conflict relationship array of subtree, in this example, as shown in figure 14,1 jumps that subtree A1 jumps subtree B1 with 1, D1, E1 have and conflict, 1 jumps that subtree B1 jumps subtree A1 with 1, D1 has and conflicts, 1 jumps that subtree C1 jumps subtree D1 with 1, E1 has and conflicts, and 1 jumping subtree D1 jumps subtree B1 with 1, C1 has and conflicts, and 1 jumping subtree E1 jumps subtree A1 with 1, C1 has and conflicts; Figure 15 is group result schematic diagram, and as shown in figure 15, first leg (round1) has two groupings, and the first grouping (group1) comprises 1 jumping subtree C1, and the second grouping (group2) comprises 1 jumping subtree A1 and B1; Second leg (round2) has two groupings, and the first grouping (group1) comprises 1 jumping subtree E1, and the second grouping (group2) comprises 1 jumping subtree D1, and the rest may be inferred.
The example of Figure 12 just illustrates, as previously mentioned, the present embodiment is not in this, as restriction, in concrete implementation procedure, following group technology is also feasible: 1) in one bout point more than two groups, as long as Lothrus apterus between any two groups (any one 1 any one of jumping in subtree and other any one groups in a group 1 jumps subtree Lothrus apterus); 2) more than one 1 can be had in a group to jump subtree, as long as the nodes in each group quite; 3) nodes in a group is optional, as step 1201, selects 1 with maximum node number to jump subtree not necessarily.
In the present embodiment, after 1 in network being jumped to subtree grouping and is complete, this sink can send the root node place bout of each subtree and the information of place grouping and the information of available time slot scope of resource, so that the node in each subtree carries out time slot allocation accordingly in respective grouping respectively to each the 1 root node child node of this sink (also i.e.) of jumping subtree.Wherein, the available time slot scope of resource of each grouping of each bout can be distributed according to predetermined policy by sink node, and the present embodiment is not in this, as restriction.
1 GTS jumping subtree root node that table 2 distributes for sink node shows an example of (Guaranteed Time Slot, guarantee time slot), and certainly, this table is citing just, and the present embodiment is not in this, as restriction.
| Root mark (Root ID) | Distribute time slot (Assigned slots) |
| ID1 | s 11,s 12,...,s 1l |
| ID2 | s 21,s 22,...,s 2m |
| ID3 | s 31,s 32,...,s 3n |
| ... | ... |
In the present embodiment, in network 1 jumps the root node (being also the child node of sink node) of subtree after receiving above-mentioned information, each node in its place subtree this information can be issued step by step, so that according to the above-mentioned information received, can complete time slot allocation in group self.
In the present embodiment, in order to avoid clashing in sink node, this sink node also needs to distribute different time slots, so that each node completes time slot allocation in group self for each 1 root node (being also its child node) of jumping subtree.For the network topology structure shown in Fig. 3, need in group, all 1 each root node (node H, L, P as Fig. 3) of jumping subtree distributes different time slots.
Figure 16 ensures time slot by sink node according to GTS(as shown in table 2) show the checking process schematic diagram checking the time slot of jumping the root node distribution of subtree into each 1.As shown in figure 16, this flow process comprises:
Step 1601: be that 1 jumping subtree root node distributes time slot;
The time slot of the above-mentioned distribution of step 1602:sink nodal test;
Step 1603: judge whether the time slot distributed is shown to conflict with GTS; If so, then getting back to step 1601 is that 1 jumping subtree root node distributes time slot again, otherwise performs step 1604;
Step 1604: the time slot of root node ID and distribution is added in GTS table.
In the present embodiment, the concrete slot allocation method that the node in the different subtrees in same grouping uses can be identical, and, any existing slot allocation method can be used in a group.In the present embodiment, the concrete slot allocation method that the node in the different subtrees in different grouping uses can be identical, also can be different.But in each group of one bout, the timeslot number that slot allocation method uses is preferably similar.
Figure 17 is the schematic diagram of the execution mode carrying out time slot allocation according to the method for the present embodiment, as shown in figure 17, in this embodiment, all 1 in network is jumped subtree and is divided into three bouts, have several to divide into groups at each time, each grouping can have one or more 1 jumping subtree.
By the method for the present embodiment, the time slot allocation in large wireless sensor network can be completed in several bouts.In one bout, the part being only this network distributes time slot.In one bout, this part can be further divided into several groups, and in these groups, time slot allocation can be independently.Thus, not only reduce the carrying cost (size of GTS table diminishes) for node, and time slot allocation in a group becomes simply (time slot allocation is in a group independently, and interstitial content is little), also makes network become and is easy to safeguard.
The embodiment of the present invention additionally provides a kind of node, as as described in the following examples 3, the method of the principle of dealing with problems due to this node and embodiment 1 is similar, and therefore its concrete enforcement can with reference to the enforcement of the method for embodiment 1, the no longer repeat specification of content something in common.
Embodiment 3
Embodiments provide a kind of node, this node is wireless network, such as, node in multi-hop sensor network.Figure 18 is the composition schematic diagram of this node, please refer to Figure 18, and this node comprises:
Transmitting element 181, its broadcast transmission comprises the detection request bag of the subtree information of the subtree at described node place, and this subtree is using the node of distance aggregation node 1 jumping as root node;
Determining unit 182, its detection request bag comprising respective place subtree information sent according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
Processing unit 183, it is when other nodes described and described node are not in same subtree, by the place subtree information of other nodes described stored in the collision table of this locality, and sends local collision table to its father node.
In an execution mode of the present embodiment, described node also comprises:
First receiving element 184, it receives the collision table bag of jumping child node from all 1 of described node;
Updating block 185, it upgrades local collision table according to the collision table bag received, and sends the collision table of this locality after upgrading to its father node.
In the present embodiment, described updating block 185 can comprise:
Spider module 1851, it travels through each the subtree information in each the collision table bag received;
Processing module 1852, it, when described subtree information is included in local collision table, does not process described subtree information; When described subtree information is not included in local collision table, described subtree information is added in local collision table.
In the another one execution mode of the present embodiment, described node also comprises:
Second receiving element 186, the time slot allocation information that its father node receiving described node sends, described time slot allocation information comprises the relevant information of described node place grouping and the scope of the time interval resource that can preengage;
Time slot allocating unit 187, it carries out time slot allocation according to the grouping at described node place in the time interval resource of this grouping correspondence.
By the node of the present embodiment, only within the scope of the time interval resource of oneself place group, carry out Resourse Distribute, not only reduce the carrying cost (size of GTS table diminishes) for node, and time slot allocation in a group becomes simply, and (time slot allocation is in a group independently, interstitial content is little), also make network become and be easy to safeguard.
The embodiment of the present invention additionally provides a kind of node, as as described in the following examples 4, the method of the principle of dealing with problems due to this node and embodiment 2 is similar, and therefore its concrete enforcement can with reference to the enforcement of the method for embodiment 2, the no longer repeat specification of content something in common.
Embodiment 4
Embodiments provide a kind of node, this node is wireless network, such as, node in multi-hop sensor network, but the present embodiment is not in this, as restriction.Figure 19 is the composition schematic diagram of this node, please refer to Figure 19, and this node comprises:
Determining unit 191, it is according to the conflict relationship between the collision table bag determination subtree of all 1 jumping child nodes from described aggregation node received and subtree;
Processing unit 192, it is according to described conflict relationship, in units of subtree, all subtrees is divided into multiple groups, described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
In the present embodiment, the time interval resource scope that in identical bout, each grouping can arrange use is identical, and in identical bout, the node of each grouping is noiseless each other, and the time interval resource scope that in different bout, each grouping can arrange use is non-intersect.
In an execution mode of the present embodiment, described processing unit 192 can comprise:
Determination module 1921, it determines current pass;
First selects module 1922, and it is according to predetermined policy, selects the subtree of the first predetermined quantity as first grouping of current pass from optional subtree;
First judge module 1923, it judges in remaining subtree, whether have at least one subtree glitch-free with the subtree in the every other grouping of current pass, and the difference of the summation of other arbitrary grouping interior joint numbers of the summation of the nodes of this at least one subtree and current pass is less than first threshold;
Second selects module 1924, and it is judged as sometimes at described first judge module 1923, from remaining subtree, selects the subtree in the next one grouping of current pass;
Second judge module 1925, it, when described first judge module 1923 is judged as not having, judges whether to still have non-selected subtree;
Processing module 1926, it is judged as sometimes at described second judge module 1925, enters next bout, and when described second judge module 1825 is judged as not having, ends process.
In the present embodiment, described second selects module 1924 may be used for: from the glitch-free subtree of subtree the every other grouping of current pass, the subtree of the second predetermined quantity is selected to divide into groups as the next one of this bout, wherein, the difference of the described summation of next one grouping interior joint number and the summation of described first interior joint number that divides into groups is less than first threshold.
In the another one execution mode of the present embodiment, described aggregation node can also comprise:
Transmitting element 193, its root node to each subtree sends the information of root node place grouping and the information of available time slot scope of resource of each subtree respectively, so that the node in each subtree carries out time slot allocation accordingly in respective grouping.
In the another one execution mode of the present embodiment, described aggregation node can also comprise:
Allocation units 194, it is that the root node of each subtree described distributes different time slots;
The time slot that the root node that described allocation units 194 are each subtree by described transmitting element 193 distributes sends to the root node of each subtree.
By the aggregation node of the present embodiment, jump subtree to all 1 to divide into groups, each grouping is positioned at again identical or different bout, the each node in network is made only within the scope of the time interval resource of oneself place group, to carry out Resourse Distribute thus, not only reduce the carrying cost (size of GTS table diminishes) for node, and time slot allocation in a group becomes simply (time slot allocation is in a group independently, and interstitial content is little), also make network become and be easy to safeguard.
The embodiment of the present invention additionally provides a kind of network, and wherein, described network comprises at least one node described in embodiment 3 and the aggregation node described in embodiment 4.
The embodiment of the present invention additionally provides a kind of wireless network, such as multi-hop sensor network, and wherein, described wireless network comprises at least one node described in embodiment 2, or comprises the combination in any of at least one node described in embodiment 2.
Apparatus and method more than the present invention can by hardware implementing, also can by combination of hardware software simulating.The present invention relates to such computer-readable program, when this program is performed by logical block, this logical block can be made to realize device mentioned above or component parts, or make this logical block realize various method mentioned above or step.The processor etc. used in logical block such as field programmable logic parts, microprocessor, computer.The invention still further relates to the storage medium for storing above program, as hard disk, disk, CD, DVD, flash memory etc.
More than in conjunction with concrete execution mode, invention has been described, but it will be apparent to those skilled in the art that these descriptions are all exemplary, is not limiting the scope of the invention.Those skilled in the art can make various variants and modifications according to spirit of the present invention and principle to the present invention, and these variants and modifications also within the scope of the invention.
About the execution mode comprising above multiple embodiment, following remarks is also disclosed.
Remarks 1, a kind of slot allocation method based on subregion, described method is applied to other nodes in multi-hop sensor network except aggregation node, and wherein, described method comprises:
Described node broadcasts sends the detection request bag comprising the subtree information of the subtree at its place, and this subtree is using the node of distance aggregation node 1 jumping as root node;
The detection request bag comprising respective place subtree information that described node sends according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
If other nodes described and described node be not in same subtree, then described node is by the place subtree information of other nodes described stored in the collision table of this locality, and sends local collision table to its father node.
Remarks 2, method according to remarks 1, wherein, described method also comprises:
Described node receives the collision table bag from its all 1 jumping child node;
Described node, according to the collision table bag received, upgrades local collision table, and sends the collision table of this locality after upgrading to its father node.
Remarks 3, method according to remarks 2, wherein, described node is according to the collision table bag received, and the step upgrading local collision table comprises:
Travel through each the subtree information in each the collision table bag received;
If described subtree information is included in local collision table, then described subtree information is not processed;
If described subtree information is not included in local collision table, then described subtree information is added in local collision table.
Remarks 4, method according to remarks 1, wherein, described method also comprises:
Described node receives the time slot allocation information that its father node sends, and described time slot allocation information comprises the relevant information of described node place grouping and the scope of the time interval resource that can preengage;
Described node, according to the grouping at its place, carries out time slot allocation in the time interval resource of this grouping correspondence.
Remarks 5, a kind of slot allocation method based on subregion, described method is applied to the aggregation node in multi-hop sensor network, and wherein, described method comprises:
Described aggregation node is according to the conflict relationship between the collision table bag determination subtree from its all 1 jumping child node received and subtree;
Described aggregation node is according to described conflict relationship, in units of subtree, all subtrees are divided into multiple groups, and described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
Remarks 6, method according to remarks 5, wherein, the time interval resource scope that in identical bout, each grouping can arrange use is identical, and in identical bout, the node of each grouping is noiseless each other, and the time interval resource scope that in different bout, each grouping can arrange use is non-intersect.
Remarks 7, method according to remarks 5, wherein, be divided into the step of multiple groups to comprise all subtrees:
Determine current pass;
According to predetermined policy, from optional subtree, select the subtree of the first predetermined quantity as first grouping of current pass;
Judge in remaining subtree, whether have at least one subtree glitch-free with the subtree in the every other grouping of current pass, and the difference of the summation of other arbitrary grouping interior joint numbers of the summation of the nodes of this at least one subtree and current pass is less than first threshold;
If had, then from remaining subtree, select the subtree in the next one grouping of current pass, and get back to the step of above-mentioned judgement;
Otherwise judge whether to still have non-selected subtree, if had, then enter next bout; If no, then ended process.
Remarks 8, method according to remarks 7, wherein, select the step of the subtree in the grouping of the next one of current pass to comprise:
From with the glitch-free subtree of subtree the every other grouping of current pass, the subtree of the second predetermined quantity is selected to divide into groups as the next one of this bout, wherein, the difference of the described summation of next one grouping interior joint number and the summation of described first interior joint number that divides into groups is less than first threshold.
Remarks 9, method according to remarks 5, wherein, described method also comprises:
Described aggregation node sends the information of root node place grouping and the information of available time slot scope of resource of each subtree, so that the node in each subtree carries out time slot allocation accordingly in respective grouping respectively to the root node of each subtree.
Remarks 10, method according to remarks 9, wherein, described method also comprises:
Described aggregation node is that the root node of each subtree described distributes different time slots.
Node in remarks 11, a kind of wireless network, wherein, described node comprises:
Transmitting element, its broadcast transmission comprises the detection request bag of the subtree information of the subtree at described node place, and this subtree is using the node of distance aggregation node 1 jumping as root node;
Determining unit, its detection request bag comprising respective place subtree information sent according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
Processing unit, it is when other nodes described and described node are not in same subtree, by the place subtree information of other nodes described stored in the collision table of this locality, and sends local collision table to its father node.
Remarks 12, node according to remarks 11, wherein, described node also comprises:
First receiving element, it receives the collision table bag of jumping child node from all 1 of described node;
Updating block, it upgrades local collision table according to the collision table bag received, and sends the collision table of this locality after upgrading to its father node.
Remarks 13, node according to remarks 12, wherein, described updating block comprises:
Spider module, it travels through each the subtree information in each the collision table bag received;
Processing module, it, when described subtree information is included in local collision table, does not process described subtree information; When described subtree information is not included in local collision table, described subtree information is added in local collision table.
Remarks 14, node according to remarks 11, wherein, described node also comprises:
Second receiving element, the time slot allocation information that its father node receiving described node sends, described time slot allocation information comprises the relevant information of described node place grouping and the scope of the time interval resource that can preengage;
Time slot allocating unit, it carries out time slot allocation according to the grouping at described node place in the time interval resource of this grouping correspondence.
Aggregation node in remarks 15, a kind of wireless network, wherein, described aggregation node comprises:
Determining unit, it is according to the conflict relationship between the collision table bag determination subtree of all 1 jumping child nodes from described aggregation node received and subtree;
Processing unit, it is according to described conflict relationship, in units of subtree, all subtrees is divided into multiple groups, and described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
Remarks 16, aggregation node according to remarks 15, wherein, the time interval resource scope that in identical bout, each grouping can arrange use is identical, and in identical bout, the node of each grouping is noiseless each other, and the time interval resource scope that in different bout, each grouping can arrange use is non-intersect.
Remarks 17, aggregation node according to remarks 15, wherein, described processing unit comprises:
Determination module, it determines current pass;
First selects module, and it is according to predetermined policy, selects the subtree of the first predetermined quantity as first grouping of current pass from optional subtree;
First judge module, it judges in remaining subtree, whether have at least one subtree glitch-free with the subtree in the every other grouping of current pass, and the difference of the summation of other arbitrary grouping interior joint numbers of the summation of the nodes of this at least one subtree and current pass is less than first threshold;
Second selects module, and it is judged as sometimes at described first judge module, from remaining subtree, selects the subtree in the next one grouping of current pass;
Second judge module, it, when described first judge module is judged as not having, judges whether to still have non-selected subtree;
Processing module, it is judged as sometimes at described second judge module, enters next bout, and when described second judge module is judged as not having, ends process.
Remarks 18, aggregation node according to remarks 17, wherein, described second selects module to be used for:
From with the glitch-free subtree of subtree the every other grouping of current pass, the subtree of the second predetermined quantity is selected to divide into groups as the next one of this bout, wherein, the difference of the described summation of next one grouping interior joint number and the summation of described first interior joint number that divides into groups is less than first threshold.
Remarks 19, aggregation node according to remarks 15, wherein, described aggregation node also comprises:
Transmitting element, its root node to each subtree sends the information of root node place grouping and the information of available time slot scope of resource of each subtree respectively, so that the node in each subtree carries out time slot allocation accordingly in respective grouping.
Remarks 20, aggregation node according to remarks 19, wherein, described aggregation node also comprises:
Allocation units, it is that the root node of each subtree described distributes different time slots;
Described allocation units are that the time slot that the root node of each subtree distributes sends to the root node of each subtree by described transmitting element.
Remarks 21, a kind of network, wherein, described network comprises the node described in any one of at least one remarks 11-14 and the aggregation node described in any one of remarks 15-20.
Claims (10)
1. the node in wireless network, wherein, described node comprises:
Transmitting element, its broadcast transmission comprises the detection request bag of the subtree information of the subtree at described node place, and this subtree is using the node of distance aggregation node 1 jumping as root node;
Determining unit, its detection request bag comprising respective place subtree information sent according to other nodes of receiving, determines other nodes described and described node whether in same subtree;
Processing unit, it is when other nodes described and described node are not in same subtree, by the place subtree information of other nodes described stored in the collision table of this locality, and sends local collision table to its father node.
2. node according to claim 1, wherein, described node also comprises:
First receiving element, it receives the collision table bag of jumping child node from all 1 of described node;
Updating block, it upgrades local collision table according to the collision table bag received, and sends the collision table of this locality after upgrading to its father node.
3. node according to claim 2, wherein, described updating block comprises:
Spider module, it travels through each the subtree information in each the collision table bag received;
Processing module, it, when described subtree information is included in local collision table, does not process described subtree information; When described subtree information is not included in local collision table, described subtree information is added in local collision table.
4. node according to claim 1, wherein, described node also comprises:
Second receiving element, the time slot allocation information that its father node receiving described node sends, described time slot allocation information comprises the relevant information of described node place grouping and the scope of the time interval resource that can preengage;
Time slot allocating unit, it carries out time slot allocation according to the grouping at described node place in the time interval resource of this grouping correspondence.
5. the aggregation node in wireless network, wherein, described aggregation node comprises:
Determining unit, it is according to the conflict relationship between the collision table bag determination subtree of all 1 jumping child nodes from described aggregation node received and subtree;
Processing unit, it is according to described conflict relationship, in units of subtree, all subtrees is divided into multiple groups, and described multiple groups are positioned at identical bout or different bouts, so that each node carries out time slot allocation in the time interval resource of the grouping correspondence at oneself place.
6. aggregation node according to claim 5, wherein, the time interval resource scope that in identical bout, each grouping can arrange use is identical, and in identical bout, the node of each grouping is noiseless each other, and the time interval resource scope that in different bout, each grouping can arrange use is non-intersect.
7. aggregation node according to claim 5, wherein, described processing unit comprises:
Determination module, it determines current pass;
First selects module, and it is according to predetermined policy, selects the subtree of the first predetermined quantity as first grouping of current pass from optional subtree;
First judge module, it judges in remaining subtree, whether have at least one subtree glitch-free with the subtree in the every other grouping of current pass, and the difference of the summation of other arbitrary grouping interior joint numbers of the summation of the nodes of this at least one subtree and current pass is less than first threshold;
Second selects module, and it is judged as sometimes at described first judge module, from remaining subtree, selects the subtree in the next one grouping of current pass;
Second judge module, it, when described first judge module is judged as not having, judges whether to still have non-selected subtree;
Processing module, it is judged as sometimes at described second judge module, enters next bout, and when described second judge module is judged as not having, ends process.
8. aggregation node according to claim 7, wherein, described second selects module to be used for:
From with the glitch-free subtree of subtree the every other grouping of current pass, the subtree of the second predetermined quantity is selected to divide into groups as the next one of this bout, wherein, the difference of the described summation of next one grouping interior joint number and the summation of described first interior joint number that divides into groups is less than first threshold.
9. aggregation node according to claim 5, wherein, described aggregation node also comprises:
Transmitting element, its root node to each subtree sends the information of root node place grouping and the information of available time slot scope of resource of each subtree respectively, so that the node in each subtree carries out time slot allocation accordingly in respective grouping.
10. aggregation node according to claim 9, wherein, described aggregation node also comprises:
Allocation units, it is that the root node of each subtree described distributes different time slots;
Described allocation units are that the time slot that the root node of each subtree distributes sends to the root node of each subtree by described transmitting element.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310516596.6A CN104581820B (en) | 2013-10-28 | 2013-10-28 | Slot allocation method and device based on subregion |
| JP2014214631A JP6402582B2 (en) | 2013-10-28 | 2014-10-21 | Partition-based slot allocation method and apparatus |
| US14/524,369 US9935729B2 (en) | 2013-10-28 | 2014-10-27 | Sink node in a wireless network executing a slot assignment method based on partitions |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310516596.6A CN104581820B (en) | 2013-10-28 | 2013-10-28 | Slot allocation method and device based on subregion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104581820A true CN104581820A (en) | 2015-04-29 |
| CN104581820B CN104581820B (en) | 2018-05-04 |
Family
ID=52995343
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310516596.6A Expired - Fee Related CN104581820B (en) | 2013-10-28 | 2013-10-28 | Slot allocation method and device based on subregion |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US9935729B2 (en) |
| JP (1) | JP6402582B2 (en) |
| CN (1) | CN104581820B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108966281A (en) * | 2018-07-20 | 2018-12-07 | 乐鑫信息科技（上海）有限公司 | Mesh network processing method, device, equipment and storage medium |
| CN111601387A (en) * | 2020-05-22 | 2020-08-28 | 电子科技大学 | Medium access control mechanism for digital energy integrated wireless sensor network |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014191052A1 (en) * | 2013-05-31 | 2014-12-04 | Fundació Per A La Universitat Oberta De Catalunya | Method and apparatus for sending and receiving data in a machine to machine wireless network |
| US10028276B2 (en) * | 2016-02-25 | 2018-07-17 | Electronics And Telecommunications Research Institute | Node device and method of allocating resources in wireless sensor networks |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179410A (en) * | 2006-11-08 | 2008-05-14 | 中国科学院沈阳自动化研究所 | Wireless meshed network broadcast communication method facing to industry monitoring application |
| CN101237366A (en) * | 2008-03-05 | 2008-08-06 | 中科院嘉兴中心微系统所分中心 | A valid wireless sensor network architecture for collaborative energy sensing |
| CN101938805A (en) * | 2010-09-16 | 2011-01-05 | 北京邮电大学 | Routing method based on tree in cognitive radio network |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
| CN102036419A (en) * | 2009-09-30 | 2011-04-27 | 华为技术有限公司 | Network node configuration information processing method, network node and communication system |
| US20120155463A1 (en) * | 2010-12-17 | 2012-06-21 | Cisco Technology Inc. | Increased Communication Opportunities with Low-Contact Nodes in a Computer Network |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6920171B2 (en) * | 2000-12-14 | 2005-07-19 | Motorola, Inc. | Multiple access frequency hopping network with interference anticipation |
| JP2004274192A (en) * | 2003-03-06 | 2004-09-30 | Sony Corp | Wireless ad-hoc communication system, terminal, processing method for the terminal and program for the terminal to implement the method |
| US8005002B2 (en) * | 2006-11-09 | 2011-08-23 | Palo Alto Research Center Incorporated | Method and apparatus for performing a query-based convergecast scheduling in a wireless sensor network |
| JP2010074691A (en) * | 2008-09-22 | 2010-04-02 | Nec Tokin Corp | Ad-hoc network wireless communication method |
| JP5861090B2 (en) * | 2011-06-06 | 2016-02-16 | パナソニックＩｐマネジメント株式会社 | Multi-hop communication method, multi-hop communication system, and communication terminal |
| JP5853797B2 (en) * | 2012-03-19 | 2016-02-09 | 富士通株式会社 | Gateway device, node device, communication system, operation period control method, and computer program |
| US9351301B2 (en) * | 2012-08-16 | 2016-05-24 | Daniel Chonghwan LEE | Maintenance of time slot usage indicators and self-organizing networking |
-
2013
- 2013-10-28 CN CN201310516596.6A patent/CN104581820B/en not_active Expired - Fee Related
-
2014
- 2014-10-21 JP JP2014214631A patent/JP6402582B2/en not_active Expired - Fee Related
- 2014-10-27 US US14/524,369 patent/US9935729B2/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179410A (en) * | 2006-11-08 | 2008-05-14 | 中国科学院沈阳自动化研究所 | Wireless meshed network broadcast communication method facing to industry monitoring application |
| CN101237366A (en) * | 2008-03-05 | 2008-08-06 | 中科院嘉兴中心微系统所分中心 | A valid wireless sensor network architecture for collaborative energy sensing |
| CN102036419A (en) * | 2009-09-30 | 2011-04-27 | 华为技术有限公司 | Network node configuration information processing method, network node and communication system |
| CN101938805A (en) * | 2010-09-16 | 2011-01-05 | 北京邮电大学 | Routing method based on tree in cognitive radio network |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
| US20120155463A1 (en) * | 2010-12-17 | 2012-06-21 | Cisco Technology Inc. | Increased Communication Opportunities with Low-Contact Nodes in a Computer Network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108966281A (en) * | 2018-07-20 | 2018-12-07 | 乐鑫信息科技（上海）有限公司 | Mesh network processing method, device, equipment and storage medium |
| US11528184B2 (en) | 2018-07-20 | 2022-12-13 | Espressif Systems (Shanghai) Co., Ltd. | Processing method, device and apparatus for mesh network, and storage medium |
| CN111601387A (en) * | 2020-05-22 | 2020-08-28 | 电子科技大学 | Medium access control mechanism for digital energy integrated wireless sensor network |
| CN111601387B (en) * | 2020-05-22 | 2022-07-12 | 电子科技大学 | Medium access control mechanism for digital energy integrated wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| US9935729B2 (en) | 2018-04-03 |
| JP2015089121A (en) | 2015-05-07 |
| US20150117257A1 (en) | 2015-04-30 |
| CN104581820B (en) | 2018-05-04 |
| JP6402582B2 (en) | 2018-10-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20050036486A1 (en) | Route discovery in ad-hoc networks with data packets | |
| CN102364970B (en) | Implementation method for automatically configuring address of mobile ad hoc network | |
| JP2013522997A (en) | Method and apparatus for relocating address space | |
| US20120230222A1 (en) | Gravitational Parent Selection in Directed Acyclic Graphs | |
| CN104581820A (en) | Sub-region-based time slot distribution method and device | |
| CN105530328B (en) | The method and apparatus that unique address calculates are used for using Bloom filter parameter | |
| Chlebus et al. | Efficient distributed communication in ad-hoc radio networks | |
| US7869384B2 (en) | Network address assignment method and routing method for a long thin zigbee network | |
| US20110149958A1 (en) | Multi-hop communication method based on distributed medium access control | |
| CN102428690B (en) | A method for assigning a network address for communicating in a segmented network | |
| Selvakumar et al. | Channel assinment using tabu search in wireless mesh networks | |
| CN105208661A (en) | Wireless network channel distribution method and system | |
| US20070258425A1 (en) | Method of assigning address in wireless personal area network | |
| CN104427619A (en) | Time slot allocation method and device | |
| KR101294973B1 (en) | Multi-channel/multi-interface mesh router and method for fixed-distirbuted channel assignment | |
| JP2009253473A (en) | Communication control method, communication apparatus, and multi-hop ad hoc network | |
| CN103037361A (en) | Internet protocol (IP) distribution system in wireless Mesh network based on Ad-hoc and IP distribution method in the wireless Mesh network based on the Ad-hoc | |
| CN104427620A (en) | Time slot allocation method and device | |
| Fuchs et al. | On local broadcasting schedules and CONGEST algorithms in the SINR model | |
| CN103347101A (en) | 6LoWPAN wireless sensor network address configuration method based on cluster | |
| Murmu et al. | A distributed minimum spanning tree for cognitive radio networks | |
| CN101789930A (en) | Route advertising method and network equipment | |
| CN110049082A (en) | Device and method for the data dissemination in distributed network | |
| Tan et al. | Clonal-selection-based minimum-interference channel assignment algorithms for multiradio wireless mesh networks | |
| KR20140116675A (en) | Data channel scheduling system and method for ofdma based 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180504 Termination date: 20201028 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |