CN103167619B - A kind of method for channel allocation for multi-channel wireless sensor network - Google Patents
A kind of method for channel allocation for multi-channel wireless sensor network Download PDFInfo
- Publication number
- CN103167619B CN103167619B CN201310116926.2A CN201310116926A CN103167619B CN 103167619 B CN103167619 B CN 103167619B CN 201310116926 A CN201310116926 A CN 201310116926A CN 103167619 B CN103167619 B CN 103167619B
- Authority
- CN
- China
- Prior art keywords
- channel
- summit
- weight
- network
- maximal independent
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of method for channel allocation for multi-channel wireless sensor network, the method comprises the steps: (1) according to multi-channel wireless sensor network topological figure G, obtains network link conflict graph CG; (2) according to the network link conflict graph CG obtained in step (1), the maximal independent set sequence I of above-mentioned network is obtained; (3) according to above-mentioned network topological diagram G, the weight of each maximal independent set in above-mentioned maximal independent set sequence I is obtained; (4) according to the weight of each maximal independent set, the link assignment channel that each maximal independent set is corresponding is given successively.Channel allocation to each bar link of multi-channel wireless sensor network, makes the link in network can work on a different channel by the present invention.
Description
Technical field
The present invention relates to radio communication and information dissemination technology field, particularly relate to a kind of method for channel allocation for multi-channel wireless sensor network.
Background technology
Along with the development of wireless radio-frequency, the equipment cost being equipped with multiple radio frequency interface to the node of wireless sensor network reduces greatly, applies multichannel technology and become feasible in wireless sensor network.Under single channel environment, conflicting link cannot transmit data simultaneously, and in the wireless sensor network that node is comparatively intensive, the number of links in conflict range is more, and mutual afoul link competes a channel resource simultaneously, causes network throughput to reduce.
Use multichannel technology, node according to the demand of route, can be coordinated multiple radio-frequency (RF) transceiver and transmits data on a different channel simultaneously, improves network throughput.Because node can use the Limited Number of the number of channel and radio-frequency (RF) transceiver, so how existence gives internodal link assignment channel, to reduce the conflict between link, improve the problem of throughput.
In multi-channel wireless sensor network, set up after link completes between node, need to solve to the problem of link assignment channel, the link in conflict range uses different channels as far as possible, to enable these links communicate on a different channel concurrently, improve the capacity of wireless sensor network.At present, the existing method of link assignment channel of giving is divided into two kinds:
1, channel allocation is carried out at media access control layer
Carry out channel allocation at media access control layer, only need to modify to medium access control layer protocol, medium access control layer protocol and network layer Routing Protocol independent operating.Channel allocation is carried out at media access control layer, and detailed gives the method for link assignment channel relevant with spendable channel number, radio-frequency (RF) transceiver number and service regeulations thereof.
As in dynamic channel assignment method, there are a control channel and several data channels, node is equipped with multiple network interface card, and network interface card number is less than spendable channel number, a network interface card works in control channel for exchange of control information negotiated channel, all the other network interface cards switch for transmitting packet and response packet between data channel, and the method is subsidiary channel usage in RTS, CTS message of media access control layer, carries out channel allocation to link.The method needs additionally to take RTS, CTS message source, and the quantity of network central control message bag is many.
As time division way realizes the method for channel allocation, node is equipped with a wireless network card, channel negotiation stage and data exchange phase will be divided into the time, must carry out on the same channel intercepting and channel negotiation at channel negotiation stage all nodes, jump in data exchange phase the channel consulted and carry out data transmission, the method needs to carry out the whole network synchronously, and complexity is high.
2, channel allocation is carried out in routing layer
Carry out in the method for channel allocation in routing layer, channel allocation is carried out in routing layer, in Route establishment process, determines the channel that relevant link uses, and does not need to revise medium access control layer protocol.If use the channel of sending node to depend on the method for receiving node, then after path has been set up, the channel that on path, each node uses according to its next-hop node, selective channel communicates with receiving node; If use channel to depend on the coordination approach of sending node and receiving node simultaneously, then node considers other node channel service conditions in its communication range as far as possible, selects corresponding channel to communicate.
As in the method for channel allocation that the people such as Kyasanur propose, the radio-frequency (RF) transceiver number of node is less than it and can uses channel number, calculates its communication quality by link relevant parameter, carries out Path selection and the selection of corresponding link channel according to link communication quality.
Carry out link channel distribution in routing layer and belong to cross layer design, need to carry out comparatively complicated interlayer interaction design.
Summary of the invention
Goal of the invention: for above-mentioned prior art Problems existing and deficiency, the object of this invention is to provide a kind of method for channel allocation for multi-channel wireless sensor network, by channel allocation to each bar link of multi-channel wireless sensor network, the link in network can be worked on a different channel.
Technical scheme: for achieving the above object, the technical solution used in the present invention is a kind of method for channel allocation for multi-channel wireless sensor network, and the method comprises the steps:
(1) according to multi-channel wireless sensor network topological figure (being called for short " network topological diagram ") G, network link conflict graph CG is obtained;
(2) according to the network link conflict graph CG obtained in step (1), the maximal independent set sequence I of above-mentioned network is obtained;
(3) according to above-mentioned network topological diagram G, the weight of each maximal independent set in above-mentioned maximal independent set sequence I is obtained;
(4) according to the weight of each maximal independent set, the link assignment channel that each maximal independent set is corresponding is given successively.
Further, in described step (1), multi-channel wireless sensor network topological figure G is non-directed graph, and the network link conflict graph CG of its correspondence obtains in the following manner:
Wireless sensor node vertex representation in multi-channel wireless sensor network topological figure G, link limit represents; In wireless network links conflict graph CG, if under Single Channel Case, there is conflict relationship between two links in the link vertex representation in multi-channel wireless sensor network topological figure, then there is a limit between corresponding summit.In described step (1), only need the summit be converted on the limit in multi-channel wireless sensor network topological figure G in network link conflict graph CG, then will the summit of conflict relationship be had to connect with limit, just can obtain network link conflict graph CG.
In described step (2), each independent sets in the maximal independent set sequence I of network, corresponding to the set on non-conterminous summit mutual in network link conflict graph CG, and the summit of each network link conflict graph CG is only present in a maximal independent set.
In described step (3), suppose that in network topological diagram G, each summit is designated as v
1, v
2, v
3..., v
n, wherein, vertex v
p, v
qbetween limit be designated as
vertex v
pand v
qthe shortest jumping figure that distance converges summit is designated as H (v respectively
p) and H (v
q), in maximal independent set sequence I, the weight of each maximal independent set obtains in the following manner:
1) according to each vertex v in network topological diagram G
1, v
2, v
3..., v
ndistance converges the shortest jumping figure on summit, obtains each bar back gauge in network topological diagram G and converges the jumping figure on summit, limit
distance converges the shortest jumping figure on summit
；
2) jumping figure on summit is converged according to bar back gauge each in network topological diagram G, the weight on each bar limit in network link conflict graph CG, limit
weight
Wherein
represent the limit that distance aggregation node jumping figure is maximum jumping figure and; Again according to the weight on bar limit each in network link conflict graph CG, obtain the weight on each summit in network link conflict graph CG;
3) according to the weight on each summit in above-mentioned network link conflict graph CG, the weight of each maximal independent set is obtained.
In described step (4), if vertex set A to be allocated is all summits in network link conflict graph CG, having distributed vertex set B is empty set, the total conflict value M distributed in vertex set between summit is 0, and channel set can be used to be { 1,2, K}, count value i=1, the channel that network topological diagram G link is corresponding obtains in the following manner:
A each maximal independent set in the maximal independent set sequence I obtained in step (2) arranges according to weight by () from big to small;
B summit in i-th maximal independent set in maximal independent set sequence I adds and distributes vertex set B by (), and delete from vertex set A to be allocated;
When () calculates respectively to i-th maximal independent set allocated channel j (1≤j≤K) c, distributed limit between all summits in vertex set B weight and, get the weight that makes to distribute limit between all summits in vertex set B and minimum channel k and distribute to summit in i-th maximal independent set;
D () judges whether vertex set A to be allocated is empty set, if judged result is no, then i=i+1, returns step (c); If judged result is yes, then stops calculating, obtain the link assignment channel in each network topological diagram G.
After the link in multi-channel wireless sensor network is assigned to each channel, will be fixed on this operate on channels, until network topology structure changes, just repeating above-mentioned steps (1) ~ (4), is link assignment channel again; As long as therefore network topology structure does not change, network does not just need node to hold consultation in the course of the work, is link assignment channel, decreases load and delay that network negotiate channel brings.
Beneficial effect: the link allocation method for multi-channel wireless sensor network provided by the invention, reduces the conflict between link in network, improve can the number of links of parallel communications, is conducive to the raising of network throughput; As long as and network topology structure does not change, network does not just need to hold consultation between node in the course of the work, is link assignment channel, decreases load and delay that network negotiate channel brings.
Accompanying drawing explanation
Fig. 1 is flow chart of the present invention;
Fig. 2 is the flow chart of the weight obtaining each maximal independent set in the present invention;
Fig. 3 is to the flow chart of link assignment channel in the present invention;
Fig. 4 is the multi-channel wireless sensor network topological figure in the embodiment of the present invention;
Fig. 5 is the network link conflict graph in the embodiment of the present invention;
Fig. 6 is the channel schematic diagram that embodiment of the present invention link is assigned to.
Embodiment
Below in conjunction with the drawings and specific embodiments, illustrate the present invention further, these embodiments should be understood only be not used in for illustration of the present invention and limit the scope of the invention, after having read the present invention, the amendment of those skilled in the art to the various equivalent form of value of the present invention has all fallen within the application's claims limited range.
Be illustrated in figure 1 the flow chart of the link allocation method for multi-channel wireless sensor network, comprise the steps:
(1) according to multi-channel wireless sensor network topological figure G, network link conflict graph CG is obtained;
(2) according to the network link conflict graph CG obtained in step (1), the maximal independent set sequence I of above-mentioned network is obtained;
(3) according to above-mentioned network topological diagram G, the weight of each maximal independent set in above-mentioned maximal independent set sequence I is obtained;
(4) according to the weight of each maximal independent set, the link assignment channel that each maximal independent set is corresponding is given successively
The calculation flow chart of described step (3) as shown in Figure 2, specifically comprises the steps:
(3.1) converge the shortest jumping figure on summit according to each vertex distance in network topological diagram G, obtain each bar back gauge in topological diagram G and converge the jumping figure on summit;
(3.2) converge the jumping figure on summit according to bar back gauge each in network topological diagram G, obtain the weight on each bar limit in network link conflict graph CG, thus obtain the weight on each summit in network link conflict graph CG;
(3.3) according to the weight on each summit in above-mentioned network link conflict graph CG, the weight of each maximal independent set is obtained;
The calculation flow chart of described step (4) as shown in Figure 3, specifically comprises the steps:
(4.1) initialization sets vertex set A to be allocated as all summits in network link conflict graph CG, and having distributed vertex set B is empty set, and the total conflict value M distributed in vertex set between summit is 0, can use channel set be 1,2 ..., K}, count value i=1;
(4.2) each maximal independent set in the maximal independent set sequence I obtained in step (2) is arranged from big to small according to weight;
(4.3) summit in i-th maximal independent set in maximal independent set sequence I is added distribute vertex set B, and delete from vertex set A to be allocated;
(4.4) when calculating respectively to i-th maximal independent set allocated channel j (1≤j≤K), distributed limit between all summits in vertex set B weight and;
(4.5) get the weight making to distribute limit between all summits in vertex set B and minimum channel k and distribute to summit in i-th maximal independent set;
(4.6) judge whether vertex set A to be allocated is empty set, if judged result is no, then i=i+1, returns step (4.3); If judged result is yes, then stops calculating, obtain the link assignment channel in each network topological diagram G.
Comprise the multi-channel wireless sensor network of 11 nodes for one, illustrate specific embodiment of the invention.
Be illustrated in figure 4 this multi-channel wireless sensor network topological figure, contain S, A, B, C, D, E, F, G, H, I, J 11 nodes, and 17 links, suppose that this network has 1,2,3,4,5,6 six non-interfering orthogonal wireless channel and can supply link selection, then channel allocation is as follows:
(1) basis multi-channel wireless sensor network topological figure G as shown in Figure 4, obtain network link conflict graph CG as shown in Figure 5, limit is there is between summit in link conflict graph CG, represent to there is conflict between the link in the network topological diagram G of vertex correspondence, wherein there is with all limits conflict in limit SA, SB, SC.
(2) according to the network link conflict graph CG obtained in step (1), the maximal independent set sequence I obtaining above-mentioned network is { { SA}, { SB}, { SC}, { BC, AD, EF, GH, IJ}, { AB, DG, FI, HJ}, { BE, CF, HJ}, { EH}, { DE}}.
(3), with reference to the accompanying drawings shown in 2, the weight of each maximal independent set in the network topological diagram G shown in accompanying drawing 4 is asked:
(3.1) the shortest jumping figure on summit is converged according to each vertex distance in network topological diagram G, obtain each bar back gauge in topological diagram G and converge the jumping figure on summit, the shortest jumping figure that summit A, B, C, D, E, F, G, H, I, J distance converges summit is 1,1,1,2,2,2,3,3,3,4, and the jumping figure obtaining SA, SB, SC, AB, BC, AD, BE, CF, DE, EF, DG, EH, FI, GH, HI, HJ, IJ distance convergence summit, limit is 0.5,0.5,0.5,1,1,1.5,1.5,1.5,2,2,2.5,2.5,2.5,3,3,3.5,3.5.
(3.2) jumping figure on summit is converged according to bar back gauge each in network topological diagram G, obtain the weight on each bar limit in network link conflict graph CG, the weight of limit SA-AB, SA-BC, SA-AD, SA-BE, SA-CF, SA-DE, SA-EF, SA-DG, SA-EH, SA-FI, SA-GH, SA-HI, SA-HJ, SA-IJ of being connected with summit SA is respectively 0.8125,0.8125,0.75,0.75,0.75,0.6875,0.6875,0.625,0.625,0.625,0.5625,0.5625,0.5,0.5, and in network link conflict graph CG, summit SA weight is 9.25; In like manner, SB weight in summit is 9.25; Summit SC weight is 9.25.
The weight of limit AB-SA, AB-SB, AB-SC, AB-BC, AB-AD, AB-BE, AB-SA of being connected with summit AB is respectively 0.8125,0.8125,0.8125,0.75,0.6875,0.6875, and the weight of summit AB is 4.5625.
The weight of limit BC-SA, BC-SB, BC-SC, BC-AB, BC-BE, BC-CF of being connected with summit BC is respectively 0.8125,0.8125,0.8125,0.75,0.6875,0.6875, and the weight of summit BC is 4.5625.
The weight of limit AD-SA, AD-SB, AD-SC, AD-AB, AD-DE, AD-DG of being connected with summit AD is respectively 0.75,0.75,0.75,0.6875,05625,0.5, and the weight of summit AD is 4.
The weight of limit BE-SA, BE-SB, BE-SC, BE-AB, BE-BC, BE-DE, BE-EF, BE-EH of being connected with summit BE is respectively 0.75,0.75,0.75,0.6875,0.6875,0.5625,0.5625,0.5, and the weight of summit BE is 5.25; In like manner, the weight of summit CF is 4.
The weight of limit DE-SA, DE-SB, DE-SC, DE-AD, DE-BE, DE-EF, DE-DG, DE-EH of being connected with summit DE is respectively 0.6875,0.6875,0.6875,0.5625,0.5625,0.5,0.4375,0.4375, and the weight of summit DE is 4.6525; In like manner, the weight of summit EF is 4.
The weight of limit DG-SA, DG-SB, DG-SC, DG-AD, DG-DE, DG-GH of being connected with summit DG is respectively 0.625,0.625,0.625,0.5,0.4375,0.3125, and the weight of summit DG is 3.125.
In like manner, the weight of summit EH is 4.125; The weight of summit FI is 3.3125; The weight of summit GH is 2.75; The weight of summit HI is 2.9375; The weight of summit HJ is 2.25; The weight of summit IJ is 2.8125.
(3.3) { SA}, { SB}, { SC}, { BC, AD, EF, GH, IJ}, { AB, DG, FI, HJ}, { BE, CF, HI}, { EH}, { weight of DE} is respectively 9.25,9.25,9.25,18.125,13.25,10.9375,4.125,4.6525 to maximal independent set.
(4) with reference to the accompanying drawings shown in 3, to each maximal independent set allocated channel in the network link conflict graph CG shown in accompanying drawing 4:
Be { BC, AD, EF, GH, IJ}, { AB, DG, FI, HJ}, { BE, CF, HI}, { SA}, { SB}, { SC}, { DE}, { EH} by maximal independent set according to its weight sequencing; { BC, AD, EF, GH, IJ}, { AB, DG, FI, HJ}, { BE, CF, HI}, { SA}, { SB}, { SC} allocated channel 1,2,3,4,5,6, the conflict value M now in maximal independent set between summit is 0 to give maximal independent set successively.
Then, to maximal independent set, { DE} allocated channel, supposes to limit DE allocated channel 1, then between corresponding summit, the weight sum M on limit is 1.0625; Suppose to limit DE allocated channel 2, then between corresponding summit, the weight sum M on limit is 0.4375; Suppose to limit DE allocated channel 3, then between corresponding summit, the weight sum M on limit is 0.5625; Suppose to limit DE allocated channel 4, then between corresponding summit, the weight sum M on limit is 0.6875; Suppose to limit DE allocated channel 5, then between corresponding summit, the weight sum M on limit is 0.6875; Suppose to limit DE allocated channel 6, then between corresponding summit, the weight sum M on limit is 0.6875.
Get the channel 2 that the weight sum that makes to distribute limit between summit is minimum, distribute to the 7th maximal independent set { DE} in network link conflict graph CG.
{ EH} allocated channel, supposes to limit EH allocated channel 1, then between corresponding summit, the weight sum M on limit is 1.1875 finally to give maximal independent set; Suppose to limit EH allocated channel 2, then between corresponding summit, the weight sum M on limit is 0.6875; Suppose to limit EH allocated channel 3, then between corresponding summit, the weight sum M on limit is 1.25; Suppose to limit EH allocated channel 4, then between corresponding summit, the weight sum M on limit is 1.0625; Suppose to limit EH allocated channel 5, then between corresponding summit, the weight sum M on limit is 1.0625; Suppose to limit EH allocated channel 6, then between corresponding summit, the weight sum M on limit is 1.0625.
Get the channel 2 that the weight sum that makes to distribute limit between summit is minimum, distribute to the 8th maximal independent set { EH} in network link conflict graph CG.
In this example, after link assignment, independent sets { BC, AD, EF, GH, IJ}, { AB, DG, FI, HJ}, { BE, CF, HI}, { SA}, { SB}, { SC}, { DE}, { EH} difference respective channels 1,2,3,4,5,6,2,2.After distributing as shown in Figure 6, in topological diagram, be labeled on corresponding link to the channel of link assignment, if each link topological structure in network operation process does not change, by continuous firing on the channel of correspondence after distributing.
The link channel distribution method that the present invention uses belongs to carries out channel allocation at media access control layer, as long as and network topology does not change after distributing, network does not just need node to hold consultation in the course of the work, for link assignment channel, decrease load and delay that channel negotiation between nodes brings.
Claims (1)
1. for a method for channel allocation for multi-channel wireless sensor network, it is characterized in that: the method comprises the steps:
(1) according to multi-channel wireless sensor network topological figure G, network link conflict graph CG is obtained;
(2) according to the network link conflict graph CG obtained in step (1), the maximal independent set sequence I of above-mentioned network is obtained;
(3) according to above-mentioned network topological diagram G, obtain the weight of each maximal independent set in above-mentioned maximal independent set sequence I, suppose that in network topological diagram G, each summit is designated as v
1, v
2, v
3..., v
n, wherein, vertex v
p, v
qbetween limit be designated as
vertex v
pand v
qthe shortest jumping figure that distance converges summit is designated as H (v respectively
p) and H (v
q), in maximal independent set sequence I, the weight of each maximal independent set obtains in the following manner:
A () is according to each vertex v in network topological diagram G
1, v
2, v
3..., v
ndistance converges the shortest jumping figure on summit, obtains each bar back gauge in network topological diagram G and converges the jumping figure on summit, limit
distance converges the shortest jumping figure on summit
B () converges the jumping figure on summit according to bar back gauge each in network topological diagram G, the weight on each bar limit in network link conflict graph CG, limit
weight
Wherein
Represent the limit that distance aggregation node jumping figure is maximum jumping figure and; Again according to the weight on bar limit each in network link conflict graph CG, obtain the weight on each summit in network link conflict graph CG;
C (), according to the weight on each summit in above-mentioned network link conflict graph CG, obtains the weight of each maximal independent set;
(4) according to the weight of each maximal independent set, give the link assignment channel that each maximal independent set is corresponding successively, comprise following step:
(a) initialization, if vertex set A to be allocated is all summits in network link conflict graph CG, having distributed vertex set B is empty set, the total conflict value M distributed in vertex set between summit is 0, and channel set can be used to be { 1,2,, K}, count value i=1;
B each maximal independent set in maximal independent set sequence I arranges according to weight by () from big to small;
C summit in i-th maximal independent set in maximal independent set sequence I adds and distributes vertex set B by (), and delete from vertex set A to be allocated;
When () calculates respectively to i-th maximal independent set allocated channel j d, 1≤j≤K, distribute the total conflict value M in vertex set between summit, M be limit between all summits in set B weight and, get the weight that makes to distribute limit between all summits in vertex set B and the minimum channel k of M and distribute to summit in i-th maximal independent set;
E () judges whether vertex set A to be allocated is empty set, if judged result is no, then i=i+1, returns step (c); If judged result is yes, then stops calculating, obtain the link assignment channel in each network topological diagram G.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310116926.2A CN103167619B (en) | 2013-04-03 | 2013-04-03 | A kind of method for channel allocation for multi-channel wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310116926.2A CN103167619B (en) | 2013-04-03 | 2013-04-03 | A kind of method for channel allocation for multi-channel wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103167619A CN103167619A (en) | 2013-06-19 |
| CN103167619B true CN103167619B (en) | 2015-10-07 |
Family
ID=48590270
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310116926.2A Active CN103167619B (en) | 2013-04-03 | 2013-04-03 | A kind of method for channel allocation for multi-channel wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103167619B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105451351A (en) * | 2015-12-03 | 2016-03-30 | 天津大学 | Centralized spectrum allocation method in underwater sensor network |
| CN105744641B (en) * | 2016-01-14 | 2019-03-05 | 南京航空航天大学 | A kind of orientation time-division link scheduling method suitable for wireless mesh network |
| CN112702793B (en) * | 2021-01-08 | 2022-06-24 | 重庆理工大学 | Method for solving conflict-free node set of wireless mesh network |
| CN117375790A (en) * | 2023-10-16 | 2024-01-09 | 北京慧清科技有限公司 | Full duplex communication realization method under multi-channel condition |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101517932A (en) * | 2006-09-19 | 2009-08-26 | 发尔泰公司 | A multi-channel assignment method for multi-radio multi-hop wireless mesh networks |
| CN102256362A (en) * | 2011-08-22 | 2011-11-23 | 东南大学 | Link allocation method for multi-channel wireless network |
| CN102413577A (en) * | 2011-11-30 | 2012-04-11 | 东南大学 | Method for allocating link of multi-channel wireless network |
-
2013
- 2013-04-03 CN CN201310116926.2A patent/CN103167619B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101517932A (en) * | 2006-09-19 | 2009-08-26 | 发尔泰公司 | A multi-channel assignment method for multi-radio multi-hop wireless mesh networks |
| CN102256362A (en) * | 2011-08-22 | 2011-11-23 | 东南大学 | Link allocation method for multi-channel wireless network |
| CN102413577A (en) * | 2011-11-30 | 2012-04-11 | 东南大学 | Method for allocating link of multi-channel wireless network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103167619A (en) | 2013-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| Zhang et al. | Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks | |
| KR100918399B1 (en) | Apparatus and method for communication in wireless sensor network | |
| CN101534557B (en) | Method for allocating resources optimally in distributed mode by self-organizing cognitive wireless network | |
| CN103167619B (en) | A kind of method for channel allocation for multi-channel wireless sensor network | |
| CN102355670A (en) | Multichannel wireless mesh network channel distribution method | |
| CN102413577B (en) | Method for allocating link of multi-channel wireless network | |
| CN104396209B (en) | Multiple level of abstractions in communication equipment | |
| CN105451322A (en) | Channel allocation and power control method based on QoS in D2D network | |
| CN107770869A (en) | The collocation method and device of information of radio resource allocation | |
| CN102256362B (en) | Link allocation method for multi-channel wireless network | |
| CN102857874A (en) | Distributed management method for direct connection communication users in cellular network | |
| CN102387585B (en) | Communication method and communication nodes for wireless communication network | |
| CN100499552C (en) | Channel distributing method and device in wireless mesh network | |
| CN103200689A (en) | Link distribution method used for multichannel wireless Mesh network | |
| CN103596276A (en) | Wireless network channel distribution strategy based on channel interval | |
| CN102546025B (en) | Optimal distribution method for optical network units in optical fiber wireless hybrid access network | |
| Selvakumar et al. | Channel assinment using tabu search in wireless mesh networks | |
| Chowdhury | Matching theory for cognitive radio networks: An overview | |
| Buragohain et al. | Improved throughput bounds for interference-aware routing in wireless networks | |
| CN104754589A (en) | Traffic awareness based dynamic networking method | |
| CN103475992A (en) | Method and device for allocating resources | |
| CN104080088A (en) | Method and device of channel allocation | |
| Yao et al. | Dynamic Spectrum Management with Movement Prediction in Vehicular Ad Hoc Networks. | |
| Musaddiq et al. | Survey of channel assignment algorithms for multi-radio multi-channel wireless mesh networks |
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 |