CN103596276A - Wireless network channel distribution strategy based on channel interval - Google Patents
Wireless network channel distribution strategy based on channel interval Download PDFInfo
- Publication number
- CN103596276A CN103596276A CN201310590758.0A CN201310590758A CN103596276A CN 103596276 A CN103596276 A CN 103596276A CN 201310590758 A CN201310590758 A CN 201310590758A CN 103596276 A CN103596276 A CN 103596276A
- Authority
- CN
- China
- Prior art keywords
- channel
- node
- information
- interference
- disturbance
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless network channel distribution strategy based on a channel interval. Interference information, a network layer protocol and MAC layer channel information of the channel interval are integrated, so that when node pairs are communicated, good communication links can be distributed to the node pairs to the largest extent. The packet loss probability of time and different channel intervals serves as measurement and interference is avoided through combination of a queue. By means of the wireless network channel distribution strategy, the channel resources can be dynamically distributed and the channels are distributed only when being needed. The channels will be released after being used, so that waste of the channels will not be caused and the channel sources are relatively added. By means of the concept of layer-cross design, the MAC layer channel information is added into routing information so that nodes can carry out routing according to the capacity condition of the current network to reasonably distribute the channels. Each node in the algorithm only needs to exchange information with a node in a self signal interference range and influences on nodes out of the range do not exist. A simple channel interference measurement standard is used for reducing time in calculation of the threshold value by the nodes.
Description
Technical field
The present invention relates to routing algorithm, method for channel allocation before the inter-node communication in wireless network, a kind of channel assignment strategy combining with route is specifically provided.
Technical background
Wireless mesh network (WMN) is a kind of static wireless network being connected with wireless link form with Mesh terminal equipment by Mesh router, and is considered to the wireless version of Internet.WMN has significantly reduced the complexity of network design, so and owing to using wireless connections to reduce the demand to wired connection with high costs.As a kind of novel network, Mesh structure has been included in IEEE 802.11, IEEE 802.15 and IEEE 802.16 standards.Along with the development of business in wireless network, the sharply increase of number of users and traffic carrying capacity, user to the demand of bandwidth also in continuous growth.How meeting consumers' demand, improving network capacity is a key issue of wireless Mesh netword development, and in Mesh network, using multichannel is to address this problem simple effective method.
Existing wireless technology standard, as IEEE 802.11b/g, is operated in 2.4～2.4835GHz frequency range, and these frequency ranges are divided into 11 channels, wherein, only has 3 to be orthogonal channel (being that frequency is not overlapping).In the use procedure of channel, not every channel can be used simultaneously, because adjacent channel interferes with each other because of the intersection of frequency phase.Conventionally, channel 1, channel 6 and channel 11(are that channel spacing is more than or equal to 5) can be used in simultaneously and communicate by letter and non-interference, along with channel spacing reduces (core frequency of channel approaches), it is large that the interference of interchannel can become, while particularly having other nodes to use two same channel communication in the interference range of node, almost can think and can not communicate by letter.IEEE 802.11a has expanded the physical layer of standard, stipulates the frequency band of this layer of use 5GHz.This standard adopts OFDM modulation technique, and 12 non-overlapped transmission channels are provided, and its transmission rate scope is 6Mbps-54Mbps.But, also formally because the frequency range that 802.11a is used is higher, its transmission range is had a greatly reduced quality, the coverage of its wireless aps is even less than half of 802.11b/g.With actual conditions, if a wireless aps of having used 802.11b standard be covered as 80 meters, use so the wireless aps of 802.11a standard just can only reach 30 meters of left and right.In addition, because design is complicated, the cost of the wireless product based on 802.11a standard is more much higher than the wireless product based on 802.11b.So current wireless Mesh netword is used 802.11b standard in the majority.Only have so and rationally effectively distribute very limited channel resource, can eliminate to a great extent the internodal signal of Mesh disturbs, thereby improve the throughput of wireless Mesh netword, guarantee the transmitting of Wireless Mesh network data, reduce packet loss, make wireless Mesh netword can apply to every field.
Traditional wireless Mesh netword Research on Channel obtain often be single channel MAC agreement, its design difficulty mainly concentrates on and solves concealed terminal and exposed terminal problem, most agreement all adopts the booking-mechanism of RTS/CTS grouping to solve this problem.Adopting a single-channel common issue is exactly that the movable joint increase of counting will the internodal competition of aggravation and the conflict that sends of grouping, and network performance is sharply declined thereupon, and channel utilization reduces.Adopt many interfaces multichannel technology effectively to reduce network interferences for the node in network or link assignment different channels, promote network capacity.And aspect channel allocation, mainly concentrate on static allocation and dynamic assignment two aspects.Static allocation need to be readjusted the channel distribution of network at set intervals, and performance loss is larger.Dynamic assignment is distribution network as required, but needs according to rationally effectively distributing foundation.
Summary of the invention
The technical problem to be solved in the present invention is: the invention provides a kind of radio network information channel allocation strategy based on channel spacing.
The technical solution adopted in the present invention is:
A kind of channel assignment strategy combining with route based on cross-layer design, interfere information, network layer protocol and the MAC layer channel information of channel spacing have been integrated, make node to can be assigned to good communication link when communicating by letter as far as possible, and service time with the packet loss at different channels interval as measuring and combining to avoid interference with queue, this strategy comprises: (1) obtains MAC layer data, (2) in Routing Protocol, add MAC layer data, (3) according to the data that obtain, calculate degree of disturbance and select preferably link, (4) avoid interference mechanism, wherein:
(1) obtain the data basis that MAC layer data is channel allocation, node carries out route and avoids interference according to the data of MAC layer;
(2) in Routing Protocol, add MAC layer data be mainly responsible for setting up node between link;
(3) select link to be preferably mainly responsible for calculating degree of disturbance according to the MAC layer data obtaining, network layer data and pre-set threshold value, and decision node link and operation of avoiding interference when route on this basis; Channel spacing when wherein, pre-set threshold value represents the poorest channel disturbance of network acceptable;
(4) avoiding interference mechanism is channel assignment strategy core, has solved this problem how as far as possible to avoid interference when the situation lower node communication of different links and signal interference.
Described strategy is usingd the time as measuring and combining to avoid interference with queue, the interference relationships at service time and different channels interval combines and measures as node load situation, and realize preferably channel allocation by a queue, by changing the link circuit condition in network to the operation of time, busy channel and queue.
When node communicates, in channel coordination and assigning process, needing has a fixing control channel carry out carrier sense and coordinate channel the node in interference range in network, with this, avoids multi channel hidden terminal problem, the channel that other channel is used as transfer of data.
When node A will communicate with Node B, the step of described node allocated channel is as follows:
(1) pre-set threshold value;
(2) node A checks the channel information table (CIT) of oneself, selects operable channel (C_USE) and this information is joined in routing iinformation, uses Common Control Channel to carry out spot broadcasting, finds Node B; In this process, all neighbor nodes in the interference range of A all can be received the routing iinformation of A, and according to the CIT of the information updating of receiving oneself; Node A interference range can calculate degree of disturbance according to the channel information in the CIT of oneself with interior node like this, in being less than or equal to the degree of disturbance of threshold values, with degree of disturbance order-assigned channel from low to high; If the node beyond A interference range listens to control channel and is used, choose the channel employing that degree of disturbance is less as far as possible and evade algorithm picks channel, until obtain the good channel of communication quality;
(3) Node B is received after routing iinformation bag, calculates the threshold values (C_CUR) of the current occupied channel in own CIT according to the channel information of receiving, determines upgrade the channel C_USE that can use CIT, and communicate with this channel according to threshold values;
(4) after communication, node A notice Node B channel C_USE finishes using, and abdicates the control of this channel, and two nodes upgrade respectively CIT.
For A, B, tri-nodes of C, when node A will set up the route with C node, RREQ broadcast and channel allocation are as follows:
(1) node A is as communication originating end, take control channel as basis, according to the disturbed condition at the total time in own waiting list and different channels interval calculate in A node interference range the degree of disturbance of each channel, and in being less than the degree of disturbance of preset value, choose the corresponding channel of least interference degree as reservation channel, then on control channel, broadcasting one carries channel condition information and (mainly comprises the channel usage C_USE in A interference range, reservation channel C_CUR, stand-by period T, size of data etc.) RREQ(route requests) message is to down hop neighbor node B,
(2) Node B is as communication receiver, from receiving the RREQ of source node A, by contrasting the channel information table of oneself, the C_CUR of the A that receives of take is basis, use and calculate channel booking time T _ PRE, degree of disturbance, whether the C_CUR that determines A is available, if available, continue to select another available channel to carry out next step co-ordination as reservation channel and next node, and as communication originating end, the value of channel information after upgrading and subscription time is attached in RREQ, be broadcast to next-hop node C;
(3) now, as the node C of communication receiver, receive after the RREQ of Node B, by the method for step (2), determine channel, then, B upgrades own CIT and shows; Because C is destination node, do not need to forward again RREQ.
When each node has operable channel to select, node C sends RREP(route response to node A) bag, each node is attached to upper hop node in RREQ by own channel information and replys, and sets up reverse link.Now, the channel of whole link is assigned.Because the link between every two nodes has all been used different channels, so avoided interference.
The channel of preengaging when upper hop node can not be used, and node returns to the channel information of oneself, and upper hop is upgraded after the channel information table of oneself, reselects the most measured channel of communication quality and re-starts the work of coordinating channel.
Beneficial effect of the present invention is:
(1) allocation of channel resources dynamically, channel is only just being assigned with whenever necessary, after using, is released, and can not cause waste, and channel resource is relatively increased.
(2) utilize the thought of cross-layer design, the channel information of MAC layer is joined in routing iinformation, make node carry out route according to the capacity condition of current network, carry out reasonably channel allocation.
(3) each node in algorithm only need with self signal interference range in node switching information, on the not impact of extraneous node.
(4) adopt the module of fairly simple channel disturbance, reduced the time that node calculates this threshold values.
Accompanying drawing explanation
Fig. 1 is node allocated channel schematic diagram;
Fig. 2 is RREQ broadcast and channel allocation schematic diagram;
Fig. 3 is RREP process schematic diagram;
When Fig. 4 is routing failure, avoid interference process schematic diagram.
Embodiment
With reference to the accompanying drawings, in conjunction with the embodiments to the detailed description of the invention.
Embodiment 1:
A kind of channel assignment strategy combining with route based on cross-layer design, described strategy has been integrated interfere information, network layer protocol and the MAC layer channel information of channel spacing, make node to can be assigned to good communication link when communicating by letter as far as possible, and service time with the packet loss at different channels interval as measuring and combining to avoid interference with queue, this strategy comprises: (1) obtains MAC layer data, (2) in Routing Protocol, add MAC layer data, (3) according to the data that obtain, calculate degree of disturbance and select preferably link, (4) avoid interference mechanism, wherein:
(1) obtain the data basis that MAC layer data is channel allocation, node carries out route and avoids interference according to the data of MAC layer;
(2) in Routing Protocol, add MAC layer data be mainly responsible for setting up node between link;
(3) select link to be preferably mainly responsible for calculating degree of disturbance according to the MAC layer data obtaining, network layer data and pre-set threshold value, and decision node link and operation of avoiding interference when route on this basis; Channel spacing when wherein, pre-set threshold value represents the poorest channel disturbance of network acceptable;
(4) avoiding interference mechanism is channel assignment strategy core, has solved this problem how as far as possible to avoid interference when the situation lower node communication of different links and signal interference.
Embodiment 2:
On the basis of embodiment 1, described in the present embodiment, strategy is usingd the time as measuring and combining to avoid interference with queue, the interference relationships at service time and different channels interval combines and measures as node load situation, and realize preferably channel allocation by a queue, by changing the link circuit condition in network to the operation of time, busy channel and queue.
Embodiment 3:
On the basis of embodiment 1 or 2, the present embodiment is when two nodes communicate, in channel coordination and assigning process, needing has a fixing control channel carry out carrier sense and coordinate channel the node in interference range in network, with this, avoid multi channel hidden terminal problem, the channel that other channel is used as transfer of data.
Embodiment 4:
As shown in Figure 1, on the basis of embodiment 3, the present embodiment is when node A will communicate with Node B, and the step of described node allocated channel is as follows:
(1) pre-set threshold value;
(2) node A checks the channel information table (CIT) of oneself, selects operable channel (C_USE) and this information is joined in routing iinformation, uses Common Control Channel to carry out spot broadcasting, finds Node B; In this process, all neighbor nodes in the interference range of A all can be received the routing iinformation of A, and according to the CIT of the information updating of receiving oneself; Node A interference range can calculate degree of disturbance according to the channel information in the CIT of oneself with interior node like this, in being less than or equal to the degree of disturbance of threshold values, with degree of disturbance order-assigned channel from low to high; If the node beyond A interference range listens to control channel and is used, choose the channel employing that degree of disturbance is less as far as possible and evade algorithm picks channel, until obtain the good channel of communication quality;
(3) Node B is received after routing iinformation bag, calculates the threshold values (C_CUR) of the current occupied channel in own CIT according to the channel information of receiving, determines upgrade the channel C_USE that can use CIT, and communicate with this channel according to threshold values;
(4) after communication, node A notice Node B channel C_USE finishes using, and abdicates the control of this channel, and two nodes upgrade respectively CIT.
Embodiment 5:
As shown in Figure 2, be route mounting phase, supposing has 6 channels in network, and channel number is 1 to 6, and channel spacing is 0 to 5, and pre-set threshold value is that 3 channels 1 are control channel, 2 to 6 is data channel.Each node has a CIT table, and in CIT, the initial value of each data is 0.On the basis of embodiment 1 or 2, the present embodiment is in A, B, tri-nodes of C, and when node A will set up the route with C node, RREQ broadcast and channel allocation are as follows:
(1) node A is as communication originating end, take control channel as basis, according to the disturbed condition at the total time in own waiting list and different channels interval calculate in A node interference range the degree of disturbance of each channel, and in being less than the degree of disturbance of preset value, choose the corresponding channel of least interference degree as reservation channel, then on control channel, broadcasting one carries channel condition information and (mainly comprises the channel usage C_USE in A interference range, reservation channel C_CUR, stand-by period T, size of data etc.) RREQ(route requests) message is to down hop neighbor node B,
(2) Node B is as communication receiver, from receiving the RREQ of source node A, by contrasting the channel information table of oneself, the C_CUR of the A that receives of take is basis, use and calculate channel booking time T _ PRE, degree of disturbance, whether the C_CUR that determines A is available, if available, continue to select another available channel to carry out next step co-ordination as reservation channel and next node, and as communication originating end, the value of channel information after upgrading and subscription time is attached in RREQ, be broadcast to next-hop node C;
(3) now, as the node C of communication receiver, receive after the RREQ of Node B, by the method for step (2), determine channel, then, B upgrades own CIT and shows; Because C is destination node, do not need to forward again RREQ.
Embodiment 6:
As shown in Figure 3, on the basis of embodiment 5, in the present embodiment, when each node has operable channel to select, node C sends RREP(route response to node A) bag, each node is attached to upper hop node in RREQ by own channel information and replys, and sets up reverse link.Now, the channel of whole link is assigned.Because the link between every two nodes has all been used different channels, so avoided interference.
Embodiment 7:
On the basis of embodiment 5, channel when the reservation of upper hop node in the present embodiment can not be used, node returns to the channel information of oneself, and upper hop is upgraded after the channel information table of oneself, reselects the most measured channel of communication quality and re-starts the work of coordinating channel.As shown in Figure 4, Node B is received after the RREQ of node A, finds that the channel of reservation can not be used, and returns to information in own channel table, after the channel information table of A renewal oneself, again coordinates channel with B.
Claims (7)
1. the radio network information channel allocation strategy based on channel spacing, it is characterized in that: described strategy has been integrated interfere information, network layer protocol and the MAC layer channel information of channel spacing, make node to can be assigned to good communication link when communicating by letter as far as possible, and service time with the packet loss at different channels interval as measuring and combining to avoid interference with queue, this strategy comprises: 1) obtain MAC layer data, 2) in Routing Protocol, add MAC layer data, 3) according to the data that obtain, calculate degree of disturbance and select preferably link, 4) avoid interference mechanism, wherein:
1) obtaining MAC layer data, is the data basis of channel allocation, and node carries out route and avoids interference according to the data of MAC layer;
2) in Routing Protocol, add MAC layer data, be mainly responsible for setting up node between link;
3) select preferably link, main being responsible for calculated degree of disturbance according to the MAC layer data obtaining, network layer data and pre-set threshold value, and decision node link and operation of avoiding interference when route on this basis; Channel spacing when wherein, pre-set threshold value represents the poorest channel disturbance of network acceptable;
4) avoiding interference mechanism, is channel assignment strategy core, has solved this problem how as far as possible to avoid interference when the situation lower node communication of different links and signal interference.
2. a kind of radio network information channel allocation strategy based on channel spacing according to claim 1, it is characterized in that: described strategy is usingd the time as measuring and combining to avoid interference with queue, the interference relationships at service time and different channels interval combines and measures as node load situation, and realize preferably channel allocation by a queue, by changing the link circuit condition in network to the operation of time, busy channel and queue.
3. a kind of radio network information channel allocation strategy based on channel spacing according to claim 1 and 2, it is characterized in that: when two nodes communicate, in channel coordination and assigning process, needing has a fixing control channel carry out carrier sense and coordinate channel the node in interference range in network, with this, avoid multi channel hidden terminal problem, the channel that other channel is used as transfer of data.
4. a kind of radio network information channel allocation strategy based on channel spacing according to claim 3, is characterized in that, when node A will communicate with Node B, the step of described node allocated channel is as follows:
1) pre-set threshold value;
2) node A checks the channel information table CIT of oneself, selects operable channel C_USE, and this information is joined in routing iinformation, uses Common Control Channel to carry out spot broadcasting, finds Node B; In this process, all neighbor nodes in the interference range of A all can be received the routing iinformation of A, and according to the CIT of the information updating of receiving oneself; Node A interference range can calculate degree of disturbance according to the channel information in the CIT of oneself with interior node like this, in being less than or equal to the degree of disturbance of threshold values, with degree of disturbance order-assigned channel from low to high; If the node beyond A interference range listens to control channel and is used, choose the channel employing that degree of disturbance is less as far as possible and evade algorithm picks channel, until obtain the good channel of communication quality;
3) Node B is received after routing iinformation bag, calculates the threshold values C_CUR of the current occupied channel in own CIT according to the channel information of receiving, determines upgrade the channel C_USE that can use CIT, and communicate with this channel according to threshold values;
4) after communication, node A notice Node B channel C_USE finishes using, and abdicates the control of this channel, and two nodes upgrade respectively CIT.
5. a kind of radio network information channel allocation strategy based on channel spacing according to claim 1 and 2, is characterized in that, for A, B, tri-nodes of C, when node A will set up the route with C node, RREQ broadcast and channel allocation are as follows:
1) node A is as communication originating end, take control channel as basis, according to the disturbed condition at the total time in own waiting list and different channels interval calculate in A node interference range the degree of disturbance of each channel, and in being less than the degree of disturbance of preset value, choose the corresponding channel of least interference degree as reservation channel, then on control channel, broadcast a RREQ message of carrying channel condition information to down hop neighbor node B;
2) Node B is as communication receiver, from receiving the RREQ of source node A, by contrasting the channel information table of oneself, the C_CUR of the A that receives of take is basis, use and calculate channel booking time T _ PRE, degree of disturbance, whether the C_CUR that determines A is available, if available, continue to select another available channel to carry out next step co-ordination as reservation channel and next node, and as communication originating end, the value of channel information after upgrading and subscription time is attached in RREQ, be broadcast to next-hop node C;
3) now, as the node C of communication receiver, receive after the RREQ of Node B, by step 2) method determine channel, then, B upgrades own CIT and shows; Because C is destination node, do not need to forward again RREQ.
6. a kind of radio network information channel allocation strategy based on channel spacing according to claim 5, it is characterized in that: when each node has operable channel to select, node C sends RREP bag to node A, each node is attached to upper hop node in RREQ by own channel information and replys, and sets up reverse link.
7. a kind of radio network information channel allocation strategy based on channel spacing according to claim 5, it is characterized in that: the channel of preengaging when upper hop node can not be used, node returns to the channel information of oneself, upper hop is upgraded after the channel information table of oneself, reselects the most measured channel of communication quality and re-starts the work of coordinating channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310590758.0A CN103596276A (en) | 2013-11-22 | 2013-11-22 | Wireless network channel distribution strategy based on channel interval |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310590758.0A CN103596276A (en) | 2013-11-22 | 2013-11-22 | Wireless network channel distribution strategy based on channel interval |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103596276A true CN103596276A (en) | 2014-02-19 |
Family
ID=50086206
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310590758.0A Pending CN103596276A (en) | 2013-11-22 | 2013-11-22 | Wireless network channel distribution strategy based on channel interval |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103596276A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105208661A (en) * | 2015-11-04 | 2015-12-30 | 浪潮(北京)电子信息产业有限公司 | Wireless network channel distribution method and system |
| CN105282851A (en) * | 2015-09-28 | 2016-01-27 | 浪潮(北京)电子信息产业有限公司 | Channel distribution method and system |
| CN105357767A (en) * | 2015-11-27 | 2016-02-24 | 中国舰船研究设计中心 | Shipboard wireless network channel distribution method based on minimum interference cost |
| CN105722177A (en) * | 2016-02-25 | 2016-06-29 | 浪潮(北京)电子信息产业有限公司 | Wireless network channel allocation method and device |
| CN110913373A (en) * | 2019-09-17 | 2020-03-24 | 上海大学 | In-vehicle wireless communication platform based on joint time-frequency priority strategy and anti-interference method thereof |
| WO2022000354A1 (en) * | 2020-06-30 | 2022-01-06 | Oppo广东移动通信有限公司 | Method for ranging and terminal device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101056261A (en) * | 2007-05-21 | 2007-10-17 | 中南大学 | Active congestion processing method of the access node in the multi-rate WLAN |
| CN101098301A (en) * | 2006-06-27 | 2008-01-02 | 华为技术有限公司 | Two-layer congestion control method of wireless network |
| WO2009002347A1 (en) * | 2007-06-26 | 2008-12-31 | Azalea Networks | A method and system for dynamic metric and wireless hello protocol |
| CN101765117A (en) * | 2008-12-26 | 2010-06-30 | 华为技术有限公司 | Method, device and system for allocating channels and realizing communication |
-
2013
- 2013-11-22 CN CN201310590758.0A patent/CN103596276A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101098301A (en) * | 2006-06-27 | 2008-01-02 | 华为技术有限公司 | Two-layer congestion control method of wireless network |
| CN101056261A (en) * | 2007-05-21 | 2007-10-17 | 中南大学 | Active congestion processing method of the access node in the multi-rate WLAN |
| WO2009002347A1 (en) * | 2007-06-26 | 2008-12-31 | Azalea Networks | A method and system for dynamic metric and wireless hello protocol |
| CN101765117A (en) * | 2008-12-26 | 2010-06-30 | 华为技术有限公司 | Method, device and system for allocating channels and realizing communication |
Non-Patent Citations (1)
| Title |
|---|
| 丛戎: "基于跨层设计的无线信道分配策略的研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105282851A (en) * | 2015-09-28 | 2016-01-27 | 浪潮(北京)电子信息产业有限公司 | Channel distribution method and system |
| CN105208661A (en) * | 2015-11-04 | 2015-12-30 | 浪潮(北京)电子信息产业有限公司 | Wireless network channel distribution method and system |
| CN105357767A (en) * | 2015-11-27 | 2016-02-24 | 中国舰船研究设计中心 | Shipboard wireless network channel distribution method based on minimum interference cost |
| CN105722177A (en) * | 2016-02-25 | 2016-06-29 | 浪潮(北京)电子信息产业有限公司 | Wireless network channel allocation method and device |
| CN105722177B (en) * | 2016-02-25 | 2019-01-18 | 浪潮(北京)电子信息产业有限公司 | A kind of radio network information channel distribution method and device |
| CN110913373A (en) * | 2019-09-17 | 2020-03-24 | 上海大学 | In-vehicle wireless communication platform based on joint time-frequency priority strategy and anti-interference method thereof |
| WO2022000354A1 (en) * | 2020-06-30 | 2022-01-06 | Oppo广东移动通信有限公司 | Method for ranging and terminal device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Crichigno et al. | Protocols and architectures for channel assignment in wireless mesh networks | |
| US9288066B2 (en) | Dynamic multicast mode selection in a communication network | |
| Raniwala et al. | Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network | |
| CN110891294B (en) | Wireless ad hoc network routing method based on service type | |
| CN103596276A (en) | Wireless network channel distribution strategy based on channel interval | |
| CN102625362B (en) | Distributed channel distributing method in a kind of more wireless radiofrequency Mesh networks of multichannel | |
| Chaudhry et al. | Improving throughput and fairness by improved channel assignment using topology control based on power control for multi-radio multi-channel wireless mesh networks | |
| CN102857988B (en) | Realization method of routing in accordance with requirements in cognitive wireless Ad Hoc network | |
| CN106454984A (en) | Route method and apparatus | |
| Zhang et al. | Joint routing and channel assignment algorithms in cognitive wireless mesh networks | |
| CN105282851A (en) | Channel distribution method and system | |
| Avokh et al. | Interference-aware multicast and broadcast routing in wireless mesh networks using both rate and channel diversity | |
| CN110446264A (en) | A kind of wireless self-networking multi-hop broadcast scheduling method and device | |
| CN105208661A (en) | Wireless network channel distribution method and system | |
| Wu et al. | Large-scale access scheduling in wireless mesh networks using social centrality | |
| Hong et al. | Exploring multiple radios and multiple channels in wireless mesh networks [accepted from open call] | |
| CN102946627B (en) | On spectrum utility-synergy routing algorithm in cognitive radio systems | |
| CN104754589A (en) | Traffic awareness based dynamic networking method | |
| Pham et al. | A throughput-aware routing for distributed industrial cognitive radio sensor networks | |
| CN101854641A (en) | Method for perceiving Mesh network route | |
| Mansoor et al. | CoAd: A cluster based adhoc cognitive radio networks architecture with broadcasting protocol | |
| Zhang et al. | Distributed joint routing and channel allocation algorithm in cognitive wireless mesh networks | |
| Mansoor et al. | A novel on-demand routing protocol for cluster-based cognitive radio ad-hoc network | |
| Yuanyuan et al. | An interference-aware multichannel media access control protocol for wireless sensor networks | |
| Wang et al. | Collaborative routing, scheduling and frequency assignment for wireless ad hoc networks using spectrum-agile radios |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140219 |