CN102256362A - Link allocation method for multi-channel wireless network - Google Patents
Link allocation method for multi-channel wireless network Download PDFInfo
- Publication number
- CN102256362A CN102256362A CN2011102415227A CN201110241522A CN102256362A CN 102256362 A CN102256362 A CN 102256362A CN 2011102415227 A CN2011102415227 A CN 2011102415227A CN 201110241522 A CN201110241522 A CN 201110241522A CN 102256362 A CN102256362 A CN 102256362A
- Authority
- CN
- China
- Prior art keywords
- network
- independent set
- maximum independent
- wireless network
- channel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a link allocation method for a multi-channel wireless network. The method comprises the following steps of: (1) dividing the wireless network into m sub-networks with the same available channel number m of the multi-channel wireless network; (2) acquiring a network conflict graph G according to a topological graph of the multi-channel wireless network; (3) acquiring the maximum independent set sequence I of the network according to the network conflict graph G acquired in the step (2); and (4) allocating the maximum independent set sequence I acquired in the step (3) into various sub-networks which are divided in the step (1). The link allocation method for the multi-channel wireless network can be used for a single network interface multi-channel condition and a multi-network interface multi-channel condition and is simple in execution process and easy to implement; and so long as the network topology is not changed, the network does not need nodes to negotiate in the working process, channels are allocated for links, and load and delay brought by channel negotiation of the network are reduced.
Description
Technical field
The present invention relates to radio communication and information dissemination technology, relate in particular to a kind of link assignment method that is used for multi-channel wireless network.
Background technology
A subject matter that exists in the single channel wireless networks is exactly a plurality of nodes when transmitting simultaneously, the problem that the capacity that interference to each other brings reduces.At this problem, can adopt multi-channel wireless network.In multi-channel wireless network, node can be operated on the different channels by wireless network interface card, makes link can carry out the transmission of packet simultaneously.Owing to wireless network interface card and assignable channel number that node can be used are limited, therefore exist and how link assignment is arrived different channels, to reduce the problem of network interferences, increase network capacity.
Node mainly contains following several method with link assignment to different channels at present:
1, node switches at different interchannels according to certain rules: as SSCH (Slotted Seeded Channel Hopping) agreement, each node can be equipped with a wireless network card, to be divided into a plurality of time slots the time, each time slot switches according to the channel sequence of having set, adopt this method, each node need be known the channel hopping sequence of its adjacent node in the network, when communicating with, network interface card is operated in respective channels;
2, node adopts special control channel, consult the channel that each link transmission data bag is adopted by control channel: as DCA (Dynamic Channel Allocation) agreement, this agreement is divided into control channel and data channel with channel, node is equipped with a plurality of wireless network cards, a network interface card works in control channel and is used for the exchange of control information negotiated channel, and all the other can switch between a plurality of data channels and are used for link transfer data packets and response packet;
3, consider from the angle of a certain performance index of peak optimizating network (as network capacity, fairness etc.), utilize the method for linear programming or Non-Linear Programming, wireless network card and channel for the link assignment correspondence: as the method for people such as Mansoor Alicherry proposition, with maximization wireless Mesh netword client network capacity is Target Modeling, on linear foundation of planning, carry out channel allocation.
Summary of the invention
Goal of the invention: in order to overcome the deficiencies in the prior art, the invention provides a kind of link assignment method that is used for multi-channel wireless network, the link assignment of multi-channel wireless network is arrived each channel, make that the link in the network can be operated on the different channels.
Technical scheme: for achieving the above object, the technical solution used in the present invention is:
A kind of link assignment method that is used for multi-channel wireless network comprises the steps:
(1) the channel number m that can use according to multi-channel wireless network is divided into the m identical with a number of available channels subnet with this wireless network;
(2) topological diagram according to above-mentioned multi-channel wireless network obtains network conflict figure G;
(3) according to the network conflict figure G that obtains in the step (2), obtain the maximum independent set sequence I of above-mentioned network, the number of the maximum independent set in the maximum independent set sequence I is n;
(4) the maximum independent set sequence I that obtains in the step (3) is assigned to each subnet of dividing in the step (1);
Wherein, m, n are natural number.
In the described step (1), available channel is corresponding one by one with the subnet that division obtains.
In the described step (2), network conflict figure G obtains in the following manner:
Node vertex representation in the multi-channel wireless network topological diagram, link is represented with the limit; In network conflict figure G, if under single channel, there is conflict relationship in the link vertex representation in the multi-channel wireless network topological diagram between two links, then can have a limit between respective vertices.In the described step (2), only the limit in the multichannel network topological diagram need be converted to the summit among the network conflict figure G, will have the summit of conflict relationship to connect then, just can obtain network conflict figure G with the limit.
Described step (3) specifically comprises the steps:
(3.1) initialization, establishing maximum independent set sequence I is empty set, count value i=0, wherein i is a natural number;
(3.2) according to network conflict figure G, obtain the maximum independent set of this network conflict figure G, add this maximum independent set to maximum independent set sequence I, be designated as I
i
(3.3) from network conflict figure G, remove the maximum independent set I that obtains in the step (3.2)
iIn the summit that comprised and with the limit that links to each other on these summits, obtain new network conflict figure G;
(3.4) whether the network conflict figure G that obtains in the determining step (3.3) is empty graph, if judged result is that then i=i+1 does not return step (3.2);
(3.5) if the judged result of step (3.4) for being, stops to calculate, n=i+1 obtains maximum independent set sequence I.
In step 3,, then get the maximum independent set of the maximum independent set of all degree of vertex sum minimums in the independent sets as this network conflict figure G correspondence if having a plurality of maximum independent sets simultaneously among the network conflict figure G; If the maximum independent set that exists a plurality of degree of vertex sums to equate is simultaneously then therefrom selected one arbitrarily as maximum independent set.Here degree of vertex refers to the number on the limit that links to each other with this summit.
In the described step (4), the size of m and n at first relatively, if m 〉=n then selects n subnet arbitrarily from m subnet, it is on the net sub that n maximum independent set is assigned to n of selecting arbitrarily, and have and only have a maximum independent set in each subnet; If m＜n then is merged into n maximum independent set m collection, m collection after will merging then is assigned to arbitrarily on the m subnet, and has and only have a collection in each subnet.
If m＜n, the method that n maximum independent set is merged into m collection is as follows:
(a) each maximum independent set among the maximum independent set sequence I is weighted with the network conflict figure G moderate sum that each summit in this maximum independent set obtains in step (2);
(b) will collect that two collection of weighted value minimum merge in the sequence, obtain new collection after the merging, its weighted value is the weighted value sum of original two collection, the new collection that obtains is substituted two collection of original weighted value minimum, obtain new collection sequence I, and the number n=n-1 that collects in the collection sequence;
(c) judge whether m and n equate, if judged result is then returned step (b) for not;
(d) if the judged result of step (c) for being, stops to merge.Because the summit correspondence among the network conflict figure G is link in this wireless network, the subnet correspondence be different channels, therefore through step (4), each the bar link in this wireless network just has been assigned on the different channels, link will be operated on this channel when the network operation.
After the link in the multi-channel wireless network is assigned to each subnet, will on fixed channel, work, have only network topology structure to change, just repeat above-mentioned steps (1)～(4), carry out link assignment again; Therefore as long as network topology structure does not change, network does not just need node to hold consultation in the course of the work, is the link assignment channel, has reduced load and delay that the network negotiate channel is brought.
Beneficial effect: the link assignment method that is used for multi-channel wireless network provided by the invention, can be used for single network interfaces multichannel situation, also can be used for multi-network interface multichannel situation, simple, the easily realization of its implementation; And as long as network topology structure does not change, network does not just need node to hold consultation in the course of the work, is the link assignment channel, has reduced load and delay that the network negotiate channel is brought.
Description of drawings
Fig. 1 is a workflow diagram of the present invention;
Fig. 2 is for obtaining the workflow diagram of maximum independent set sequence among the present invention;
Fig. 3 is the multi-channel wireless network topological diagram in the embodiment of the invention;
Fig. 4 is the network conflict figure in the embodiment of the invention;
Fig. 5 upgrades the network conflict figure that obtains after trying to achieve first maximum independent set in the embodiment of the invention;
Fig. 6 upgrades the network conflict figure that obtains after trying to achieve second maximum independent set in the embodiment of the invention;
Fig. 7 upgrades the network conflict figure that obtains after trying to achieve the 3rd maximum independent set among this body embodiment;
Fig. 8 upgrades the network conflict figure that obtains after trying to achieve the 4th maximum independent set among this body embodiment;
Fig. 9 upgrades the network conflict figure that obtains after trying to achieve the 5th maximum independent set among this body embodiment;
Figure 10 is assigned to structural representation behind each subnet for link among this body embodiment.
Embodiment
Below in conjunction with accompanying drawing the present invention is done further explanation.
Be illustrated in figure 1 as a kind of flow chart that is used for the link assignment method of multi-channel wireless network, comprise the steps:
(1) the channel number m that can use according to multi-channel wireless network is divided into the m identical with a number of available channels subnet with this wireless network, and wherein available channel is corresponding one by one with subnet;
(2) topological diagram according to above-mentioned multi-channel wireless network obtains network conflict figure G;
(3) according to the network conflict figure G that obtains in the step (2), obtain the maximum independent set sequence I of above-mentioned network, the number of the maximum independent set in the maximum independent set sequence I is n;
(4) the maximum independent set sequence I that obtains in the step (3) is assigned to each subnet of dividing in the step (1);
Wherein, m, n are natural number.
The calculation flow chart of described step (3) specifically comprises the steps: as shown in Figure 2
(3.1) initialization, establishing maximum independent set sequence I is empty set, count value i=0, wherein i is a natural number;
(3.2) according to network conflict figure G, obtain the maximum independent set of this network conflict figure G, add this maximum independent set to maximum independent set sequence I, be designated as I
i
(3.3) from network conflict figure G, remove the maximum independent set I that obtains in the step (3.2)
iIn the summit that comprised and with the limit that links to each other on these summits, obtain new network conflict figure G;
(3.4) whether the network conflict figure G that obtains in the determining step (3.3) is empty graph, if judged result is that then i=i+1 does not return step (3.2);
(3.5) if the judged result of step (3.4) for being, stops to calculate, n=i+1 obtains maximum independent set sequence I.
With a multi-channel wireless network that comprises 5 nodes is example, specifies concrete enforcement of the present invention.
Be illustrated in figure 3 as this multi-channel wireless network topological diagram, comprised A, B, C, D, five nodes of E, and 8 links, suppose that this network has C
1, C
2, C
3Three non-interfering orthogonal wireless channels can be selected for node, and then the link assignment process is as follows:
(1) owing to there are three non-interfering orthogonal channels to use for node, m 3, therefore network are divided into three subnets, are designated as S respectively
1, S
2, S
3, the channel of the correspondence of each subnet is respectively C
1, C
2, C
3
(2) topological diagram of basis this multi-channel wireless network as shown in Figure 3 obtains network conflict figure G as shown in Figure 4; Each summit link identical with sequence number among Fig. 3 is corresponding one by one among Fig. 4, as link 1 in 1 corresponding diagram 3 of summit among Fig. 4; In Fig. 4, will there be the summit of conflict relationship to connect under the single channel with the limit, as link 1 and link 2, link 3, link 4, link 5, link 6, link 8 conflict relationship is arranged; Here have conflict between two links, refer under single channel, two links are transmits data packets simultaneously, otherwise can produce interference, makes packet correctly not receive.
(3) with reference to the accompanying drawings shown in 4, ask for network maximum independent set sequence I:
(3.1) maximum independent set sequence I at first being set is empty set, and i=0 is set;
(3.2) ask maximum independent set among Fig. 4: there are 4 maximum independent sets among Fig. 4, be respectively 1,7}, 2,8}, 3,8}, and 4,7}, the number of degrees sum of all summit correspondences is 11 in these 4 maximum independent sets in network conflict figure G.Therefore { 1,7} is an example, and wherein the number of degrees of summit 1 in network conflict figure G are 6, and the number of degrees of summit 7 in network conflict figure G are 5, two degree of vertexs and be 11 with set.Because the number of degrees equate, therefrom select a maximum independent set as Fig. 4 arbitrarily, select here 4,7}, and, be designated as I with its adding I
i, i=0;
Ask the maximum independent set among Fig. 5: there are 2 maximum independent sets among Fig. 5, be respectively 2, and 8}, { 3, the number of degrees sum of all summit correspondences is 7 in the 8}, these two maximum independent sets, selects here that { 2,8} is as the maximum independent set of Fig. 5, and it is added I, is designated as I
i, i=1;
Ask the maximum independent set among Fig. 6: each summit is connected to each other among Fig. 6, and each degree of vertex is identical, is 3, and each summit is the maximum independent set of this figure; Here select that { 1} is as the maximum independent set of Fig. 6, and it is added I, is designated as I
i, i=2;
Ask the maximum independent set among Fig. 7: each summit is connected to each other among Fig. 7, and each degree of vertex is identical, is 2, and each summit is the maximum independent set of this figure; Here select that { 3} is as the maximum independent set of Fig. 7, and it is added I, is designated as I
i, i=3;
Ask the maximum independent set among Fig. 8: each summit is connected to each other among Fig. 8, and each degree of vertex is identical, is 1, and each summit is the maximum independent set of this figure; Here select that { 5} is as the maximum independent set of Fig. 8, and it is added I, is designated as I
i, i=4;
Ask the maximum independent set among Fig. 9: only comprise a summit 6 among Fig. 9, the number of degrees are 0, and { 6} is the maximum independent set of this figure, and it is added I, is designated as I
i, i=5.
(4) because the subnet number is m 3, the number of maximum independent set is n=6 among the maximum independent set sequence I, n＞m, therefore 6 maximum independent sets will be merged into 3 collection: (a) each maximum independent set among the maximum independent set sequence I is weighted with the network conflict figure G moderate sum that each summit in this maximum independent set obtains in step (2), this network conflict figure G as shown in Figure 4; With I
0Weighted value be example, be calculated as follows: I
0In comprised summit 4 and summit 7, in network conflict figure G shown in Figure 4, the number of degrees on summit 4 are 6, the number of degrees on summit 7 are 5, so I
0Weighted value be 11, use D here
IiExpression independent sets I
iWeighted value, specific as follows:
D
I0＝11，D
I1＝11，D
I2＝6，D
I3＝6，D
I4＝7，D
I5＝7。
(b) with two maximum independent set I of weights minimum
2And I
3Merge, obtain new collection for { 1,3} substitutes original collection { 1} and { 3} obtains new collection sequence and is: I
0=4,7}, I
1=2,8}, I
2=1,3}, I
3={ 5}, I
4={ 6}, n=n-1=5.In the new sequence, the weighted value that each set pair is answered is respectively:
D
I0＝11，D
I1＝11，D
I2＝12，D
I3＝7，D
I4＝7；
Because n＞m, therefore once more with two collection I of weights minimum
3And I
4Merge, obtain new collection for { 5,6} substitutes original collection { 5} and { 6} obtains new sequence and is: I
0=4,7}, I
1=2,8}, I
2=1,3}, I
3=5, and 6}, in the new sequence of n=n-1=4, the weighted value that each set pair is answered is respectively:
D
I0＝11，D
I1＝11，D
I2＝12，D
I3＝14；
Because n＞m, therefore once more with two collection I of weights minimum
0And I
iMerge, obtain new collection for 4,7,2,8}, substitute original collection 4,7}, { 2,8} obtains new collection sequence and is: I
0=7,4,8,2}, I
1=1,3}, I
2=5,6}, n=n-1=3.
(c) because n=m stops merging; Each collection in the sequence is assigned to each subnet arbitrarily, has and only have a collection in each subnet.
As shown in figure 10, collection I0 is assigned to S1 after distributing in this example, and collection I1 is assigned to S2, and collection I3 is assigned to S3.If distribute each link of back topological structure in network operation process not change, will on the channel of subnet correspondence, work.
The above only is a preferred implementation of the present invention; be noted that for those skilled in the art; under the prerequisite that does not break away from the principle of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (5)
1. link assignment method that is used for multi-channel wireless network, it is characterized in that: this method comprises the steps:
(1) the channel number m that can use according to multi-channel wireless network is divided into the m identical with a number of available channels subnet with this wireless network;
(2) topological diagram according to above-mentioned multi-channel wireless network obtains network conflict figure G;
(3) according to the network conflict figure G that obtains in the step (2), obtain the maximum independent set sequence I of above-mentioned network, the number of the maximum independent set in the maximum independent set sequence I is n;
(4) the maximum independent set sequence I that obtains in the step (3) is assigned to each subnet of dividing in the step (1);
Wherein, m, n are natural number.
2. the link assignment method that is used for multi-channel wireless network according to claim 1 is characterized in that: in the described step (1), the subnet number is identical with number of available channels in the multi-channel wireless network, and available channel is corresponding one by one with subnet.
3. the link assignment method that is used for multi-channel wireless network according to claim 1 is characterized in that: described step (3) specifically comprises the steps:
(3.1) initialization, establishing maximum independent set sequence I is empty set, count value i=0, wherein i is a natural number;
(3.2) according to network conflict figure G, obtain the maximum independent set of this network conflict figure G, add this maximum independent set to maximum independent set sequence I, be designated as I
i
(3.3) from network conflict figure G, remove the maximum independent set I that obtains in the step (3.2)
iIn the summit that comprised and with the limit that links to each other on these summits, obtain new network conflict figure G;
(3.4) whether the network conflict figure G that obtains in the determining step (3.3) is empty graph, if judged result is that then i=i+1 does not return step (3.2);
(3.5) if the judged result of step (3.4) for being, stops to calculate, n=i+1 obtains maximum independent set sequence I.
4. the link assignment method that is used for multi-channel wireless network according to claim 1, it is characterized in that: in the described step (4), the size that at first compares m and n, if m 〉=n, then from m subnet, select n subnet arbitrarily, it is online that n maximum independent set is assigned to select n son arbitrarily, and have and only have a maximum independent set in each subnet; If m＜n then is merged into n maximum independent set m collection, m collection after will merging then is assigned to arbitrarily on the m subnet, and has and only have a collection in each subnet.
5. the link assignment method that is used for multi-channel wireless network according to claim 4 is characterized in that: if m＜n, the method that n maximum independent set is merged into m collection is as follows:
(a) each maximum independent set among the maximum independent set sequence I is weighted with the network conflict figure G moderate sum that each summit in this maximum independent set obtains in step (2);
(b) will collect that two collection of weighted value minimum merge in the sequence, obtain new collection after the merging, its weighted value is the weighted value sum of original two collection, the new collection that obtains is substituted two collection of original weighted value minimum, obtain new collection sequence, and the number that collects in the collection sequence is n=n-1;
(c) judge whether m and n equate, if judged result is then returned step (b) for not;
(d) if the judged result of step (c) for being, stops to merge.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110241522.7A CN102256362B (en) | 2011-08-22 | 2011-08-22 | Link allocation method for multi-channel wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110241522.7A CN102256362B (en) | 2011-08-22 | 2011-08-22 | Link allocation method for multi-channel wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102256362A true CN102256362A (en) | 2011-11-23 |
| CN102256362B CN102256362B (en) | 2014-01-29 |
Family
ID=44983282
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110241522.7A Expired - Fee Related CN102256362B (en) | 2011-08-22 | 2011-08-22 | Link allocation method for multi-channel wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102256362B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413577A (en) * | 2011-11-30 | 2012-04-11 | 东南大学 | Method for allocating link of multi-channel wireless network |
| CN102427592A (en) * | 2011-12-09 | 2012-04-25 | 东南大学 | Centralized link scheduling method for multi-channel wireless network |
| CN102752801A (en) * | 2012-07-24 | 2012-10-24 | 东南大学 | Link allocation method for single-interface multichannel wireless network |
| CN103052069A (en) * | 2012-12-14 | 2013-04-17 | 南京邮电大学 | Multi-radio-frequency multi-channel wireless Mesh network channel distribution method |
| CN103167619A (en) * | 2013-04-03 | 2013-06-19 | 东南大学 | Channel distribution method for multi-channel wireless sensor network |
| CN109756375A (en) * | 2019-01-11 | 2019-05-14 | 西安电子科技大学 | A kind of Lothrus apterus link scheduling method for independent multichannel TDMA network |
| CN112702793A (en) * | 2021-01-08 | 2021-04-23 | 重庆理工大学 | Method for solving wireless grid network conflict-free node set |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159758A (en) * | 2007-10-30 | 2008-04-09 | 中兴通讯股份有限公司 | Classification associated dynamic host machine configuring protocol option distribution method and device |
| CN102056304A (en) * | 2010-12-22 | 2011-05-11 | 东南大学 | Channel allocating method for multichannel fixed wireless network |
-
2011
- 2011-08-22 CN CN201110241522.7A patent/CN102256362B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159758A (en) * | 2007-10-30 | 2008-04-09 | 中兴通讯股份有限公司 | Classification associated dynamic host machine configuring protocol option distribution method and device |
| CN102056304A (en) * | 2010-12-22 | 2011-05-11 | 东南大学 | Channel allocating method for multichannel fixed wireless network |
Non-Patent Citations (3)
| Title |
|---|
| 冯文江 等: "认知无线电中联合功率控制的动态频谱分配算法", 《计算机应用研究》 * |
| 王茹茹: "《重庆大学硕士学位论文集》", 1 April 2011 * |
| 邓可: "《北京邮电大学硕士研究生学位论文集》", 11 January 2011 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413577B (en) * | 2011-11-30 | 2014-06-11 | 东南大学 | Method for allocating link of multi-channel wireless network |
| CN102413577A (en) * | 2011-11-30 | 2012-04-11 | 东南大学 | Method for allocating link of multi-channel wireless network |
| CN102427592A (en) * | 2011-12-09 | 2012-04-25 | 东南大学 | Centralized link scheduling method for multi-channel wireless network |
| CN102427592B (en) * | 2011-12-09 | 2014-03-12 | 东南大学 | Centralized link scheduling method for multi-channel wireless network |
| CN102752801A (en) * | 2012-07-24 | 2012-10-24 | 东南大学 | Link allocation method for single-interface multichannel wireless network |
| CN102752801B (en) * | 2012-07-24 | 2014-10-29 | 东南大学 | Link allocation method for single-interface multichannel wireless network |
| CN103052069A (en) * | 2012-12-14 | 2013-04-17 | 南京邮电大学 | Multi-radio-frequency multi-channel wireless Mesh network channel distribution method |
| CN103052069B (en) * | 2012-12-14 | 2015-04-15 | 南京邮电大学 | Multi-radio-frequency multi-channel wireless Mesh network channel distribution method |
| CN103167619A (en) * | 2013-04-03 | 2013-06-19 | 东南大学 | Channel distribution method for multi-channel wireless sensor network |
| CN103167619B (en) * | 2013-04-03 | 2015-10-07 | 东南大学 | A kind of method for channel allocation for multi-channel wireless sensor network |
| CN109756375A (en) * | 2019-01-11 | 2019-05-14 | 西安电子科技大学 | A kind of Lothrus apterus link scheduling method for independent multichannel TDMA network |
| CN109756375B (en) * | 2019-01-11 | 2021-04-06 | 西安电子科技大学 | Conflict-free link scheduling method for independent multi-channel TDMA network |
| CN112702793A (en) * | 2021-01-08 | 2021-04-23 | 重庆理工大学 | Method for solving wireless grid network conflict-free node set |
| CN112702793B (en) * | 2021-01-08 | 2022-06-24 | 重庆理工大学 | Method for solving conflict-free node set of wireless mesh network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102256362B (en) | 2014-01-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102256362B (en) | Link allocation method for multi-channel wireless network | |
| CN102413577B (en) | Method for allocating link of multi-channel wireless network | |
| CN104902424A (en) | Control method, device and system for wireless intelligent equipment | |
| CN103200689B (en) | A kind of link allocation method for multi-Channel Wireless Mesh Network | |
| CN107750056B (en) | Interference reduction method in ultra-dense network | |
| CN104144475A (en) | Method, access points and sites for realizing multipoint cooperative transmission | |
| CN105162897A (en) | System and method for allocating IP address for virtual machine and network virtual machine | |
| RU2598293C1 (en) | Method and apparatus for transmitting standard configuration data of improved system of selecting a transmitting protocol | |
| CN104080088B (en) | A kind of method for channel allocation and device | |
| CN102946443B (en) | Multitask scheduling method for realizing large-scale data transmission | |
| CN102427592B (en) | Centralized link scheduling method for multi-channel wireless network | |
| CN109640394A (en) | A kind of wireless mesh network method for channel allocation, device and electronic equipment | |
| CN103167619B (en) | A kind of method for channel allocation for multi-channel wireless sensor network | |
| CN104202247A (en) | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) | |
| Chen et al. | Scheduling for data collection in multi-hop IEEE 802.15. 4e TSCH networks | |
| KR20060130496A (en) | Non-agile channelelization method for multi-channel mac | |
| CN102907052A (en) | Topological information processing method and equipment | |
| CN103079275A (en) | Multiple knapsack problem-based aggregated spectrum allocation method | |
| CN103916949B (en) | Power distribution method and device for two-way relay transmission in wireless cognitive network | |
| CN105554173A (en) | Network node address assignment method in asymmetric ZigBee network | |
| CN112839337B (en) | Method for coordinating interference between ultra-dense micro base stations based on divide-and-conquer recursion strategy | |
| Naparstek et al. | Fully distributed auction algorithm for spectrum sharing in unlicensed bands | |
| CN104618912A (en) | Spectrum sensing-based heterogeneous cognitive wireless network resource distributing method | |
| CN106303983B (en) | Group data transmission method and device | |
| CN102752801B (en) | Link allocation method for single-interface multichannel wireless 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 |
Granted publication date: 20140129 Termination date: 20140822 |
|
| EXPY | Termination of patent right or utility model |