CN109041230A - It is a kind of based on limited preferential by wheel incrementally slot allocation method - Google Patents
It is a kind of based on limited preferential by wheel incrementally slot allocation method Download PDFInfo
- Publication number
- CN109041230A CN109041230A CN201810734667.2A CN201810734667A CN109041230A CN 109041230 A CN109041230 A CN 109041230A CN 201810734667 A CN201810734667 A CN 201810734667A CN 109041230 A CN109041230 A CN 109041230A
- Authority
- CN
- China
- Prior art keywords
- time slot
- link
- slot
- wheel
- preferential
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000004364 calculation method Methods 0.000 abstract description 7
- 238000013459 approach Methods 0.000 abstract description 3
- 238000004886 process control Methods 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Time-Division Multiplex Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of based on limited preferential by wheel incrementally slot allocation method, it uses by wheel incremented circulation control algolithm as path allocation time interval resource, in every round time slot allocation, it executes following steps: Step 1: selecting the link set of available time slot minimum number by preferential link selection algorithm, determining the link of time slot to be allocated；Step 2: being the link of time slot to be allocated by priority slot selection algorithm, is concentrated in available time slot and search the smallest time slot of annoyance level；Step 3: the smallest time slot of annoyance level obtained by the link allocation step two that Slot Allocation Algorithm is time slot to be allocated, and the available time slot collection of a jump, two-hop neighbors link is updated.It is difficult to meet simultaneously that calculation amount is small and to acquisite approachs maximum bandwidth these two aspects demand the present invention overcomes existing slot allocation method, selects to provide theoretical foundation for the assessment of TDMA network path transmittability and QoS path.
Description
Technical field
The present invention relates to a kind of based on limited preferential by wheel incrementally slot allocation method.
Background technique
It is mobile ad-hoc network that time division multiple acess, which accesses (Time Division Multiple Aceess, TDMA),
Common channel access protocol in (Mobile Ad Hoc Networks, MANET), passes through dynamic time slot allocation and Lothrus apterus
Spatial reuse, the utilization rate and overall performance of network of channel resource can be effectively improved.MSNET network based on TDMA is (following
Referred to as " TDMA network ") path maximum bandwidth be carry out path transmission capability evaluation important indicator, and carry out QoS routing
The judgement foundation of selection, but the path bandwidth calculating of TDMA network belongs to typical NP (Non-Determination
Polynomial) complete problem, path bandwidth size are determined that existing path bandwidth calculates and time slot point by slot allocation method
Method of completing the square mainly has following three classes:
First is that using the minimum bandwidth for constituting each link in the path as path maximum bandwidth, this is clearly incorrect
's.
Second is that using based on the preceding inspiration to/backward algorithm (Forwarding/Backward Algorithm, FA/BA)
Formula distribution method, hop-by-hop calculates locally optimal solution, until reaching after purpose/source node, the party since source/destination node
Method matches very much with the addressing mechanism of AODV Routing Protocol, and computational efficiency is high, but due to solution is local maximum bandwidth, can not
Globally optimal solution is obtained, that is, does not obtain path maximum bandwidth.
Third is that from global angle carry out time slot allocation (Slot Assignment by Global Overview,
It SAGO), is preferably the few link distribution time slot of available time slot resource；The preferential distribution time slot small to other link interferences；When depositing
In the least link of a plurality of time interval resource, the time slot small to other link interferences is therefrom found out, is preferably corresponding to the time slot
Link distribute time slot.Compared with the heuristic slot allocation method based on local optimum, SAGO slot allocation method is more advantageous
In the time slot allocation scheme for obtaining global optimum；But SAGO is mainly used for judging whether path meets given bandwidth demand, without
It is to solve for path maximum bandwidth, if definition " calculation amount for distributing 1 time slot for 1 link is equal to 1 ", the time slot allocation side SAGO
The calculation amount of method to acquisite approachs maximum bandwidth is slightly larger thanWherein N is the number of links for constituting path, rmaxMost for path
Big bandwidth.Work as rmaxWhen larger, the calculation amount of SAGO slot allocation methodMuch larger than the calculating of heuristic distribution method
Measure Nrmax。
Summary of the invention
In order to overcome the disadvantages mentioned above of the prior art, when the present invention provides a kind of based on limited preferential by wheel incrementally
Gap distribution method, it is intended to solve existing TDMA network route band width calculate with slot allocation method be difficult to solve simultaneously calculation amount and
The problem of globally optimal solution.
The technical solution adopted by the present invention to solve the technical problems is: it is a kind of based on limited preferential by wheel incrementally when
Gap distribution method is used by wheel incremented circulation control algolithm as path allocation time interval resource, in every round time slot allocation, is executed
Following steps:
Step 1: the link set of available time slot minimum number is selected by preferential link selection algorithm, when determining to be allocated
The link of gap；
Step 2: being the link of time slot to be allocated by priority slot selection algorithm, is concentrated in available time slot and search interference
The smallest time slot of degree；
Step 3: minimum by the annoyance level that the link allocation step two that Slot Allocation Algorithm is time slot to be allocated obtains
Time slot, and jumped to one, the available time slot collection of two-hop neighbors link is updated.
Compared with prior art, the positive effect of the present invention is:
Proposed by the present invention preferentially distribute by the distribution of wheel incremented circulation, limitation link is mutually tied with the distribution of low interference time slots priority
The combined distributing method of conjunction overcomes existing slot allocation method and is difficult to meet simultaneously that calculation amount is small and to acquisite approachs maximum belt
Wide these two aspects demand provides theoretical foundation for the assessment of TDMA network path transmittability and QoS path selection.
Detailed description of the invention
Examples of the present invention will be described by way of reference to the accompanying drawings, in which:
Fig. 1 is TDMA network link time slot interference schematic diagram；
Fig. 2 is based on limited preferential by wheel incrementally time slot allocation procedures；
Fig. 3 is preceding to heuristic time slot allocation procedures；
Fig. 4 is SAGO time slot allocation procedures.
Specific embodiment
It is a kind of based on limited preferential by wheel incrementally slot allocation method, including following content:
In MSNET network, if R is indicated by N link li, the path that i ∈ [1, N] is constituted, i.e. R=l1→l2→L lN,
As shown in Figure 1.Link liAvailable time slot collection be denoted as x (i), as link liTime slot j is chosen, when j ∈ x (i) is communicated, if
Link liOne hop neighbor link li-1、li+1With two-hop neighbors link li-2、li+2Also it is communicated using time slot j, then due to wireless
The broadcast characteristic of signal can interfere with each other between link；Defining time slot j in x (i) is m to the annoyance level of remaining link
(i, j) is equal to time slot j in link liA hop neighbor link available time slot collection x (i-1), x (i+1) and two-hop neighbors link can
With the number occurred in time slot collection x (i-2), x (i+2), value range [0,4].
1. time slot allocation principle
Based on limited preferential, by wheel, incrementally slot allocation method follows following principle:
Principle one: it according to the sequence incremental by wheel, recycles as path allocation time interval resource, i.e., every wheel is that each link distributes 1
Time slot, one wheel after start next round time slot allocation again, until all available time slots distribute；
Principle two: from the link that current round not yet distributes time slot, when the link for selecting available time slot quantity few distributes
Gap；
Principle three: when there are the link of a plurality of available time slot minimum number, each time slot of each link is calculated to remaining chain
The interference size on road is preferably link distribution time slot corresponding to the smallest time slot of interference；
Principle four: when there are the links of a plurality of available time slot minimum number, and have it is multiple minimum to remaining link interference and
Equal time slot, and multiple time slots belong to different links, then are preferably the smallest link distribution time slot of link serial number；
Principle five: being its preferential distribution time slot small to remaining link interference after selecting link to be allocated；
Principle six: after selecting link to be allocated, multiple time slots small to remaining link interference and equal if it exists, then preferentially
Distribute the smallest time slot of slot index；
Principle seven: when the link of any not yet distribution time slot of current round is without available time slot, time slot allocation procedures are terminated.
2. algorithm is realized
If the business time-slot quantity of every time frame is T, the maximum bandwidth of path R is rmaxA time slot distributes to link liWhen
Gap collection is denoted as y (i)；The link set that current round is not yet distributed to time slot is denoted as L1, L1The link set of middle available time slot minimum number
It is denoted as L2.Corresponding time slot allocation principle, time slot allocation procedures mainly include following algorithm:
(1) by wheel incremented circulation control algolithm
Time slot allocation principle one is corresponded to by wheel incremented circulation control algolithm, for ensuring that current round is each point of all links
With just allow after 1 time slot start next one time slot allocation.By wheel incremented circulation control algolithm pseudocode are as follows:
(2) preferential link selection algorithm
Preferential link selection algorithm corresponds to time slot allocation principle two, three, four, for ensuring that it is excellent that resource-constrained link is enjoyed
First distribute the right of time slot.Preferential link selection algorithm pseudocode are as follows:
(3) priority slot selection algorithm
Priority slot selection algorithm corresponds to time slot allocation principle five, six, for ensuring that the smallest time slot of annoyance level is enjoyed
The right preferentially distributed.Priority slot selection algorithm pseudocode are as follows:
(4) Slot Allocation Algorithm
Slot Allocation Algorithm is used for the time slot selected for selected link distribution, and to available time slot collection and distribution time slot collection
It is updated.Slot Allocation Algorithm pseudocode are as follows:
(5) process control algorithm
Process control algorithm is used to control the starting, operation and end of time slot allocation scheme, corresponding time slot allocation principle one
~seven.Process control algorithm pseudocode are as follows:
3. illustrating
Assuming that path R=l1→l2→l3→l4→l5, every time frame business time-slot quantity is 6, each link available time slot collection point
Not Wei x (1)={ 1,2,5,6 }, x (2)={ 1,3,4 }, x (3)={ 1,2,5,6 }, x (4)={ 3,4,5,6 }, x (5)=1,3,
4 }, using based on limited preferential, by wheel, incrementally slot allocation method, time slot allocation procedures are as shown in Figure 2:
Stepi indicates to execute i-th time slot allocation.
In the Step1 stage, the link set L of available time slot minimum number is selected by LinkSelection () algorithm first2
={ l2,l5, determine that the link of time slot to be allocated is l2, then pass through SlotSelection () algorithm lookup link l2Available time slot
Collect the smallest time slot 3 of annoyance level in x (2)#, it is link l finally by SlotAssignment () algorithm2Distribute time slot 3#,
And a jump, two-hop neighbors link available time slot collection are updated；
The time slot allocation procedures in Step2-10 stage are identical with Step1, and calculation amount is equal to 10, finally obtain each link
Distribution time slot collection is respectively y (1)={ 5,6 }, y (2)={ 3,4 }, y (3)={ 1,2 }, y (4)={ 5,6 }, y (5)={ 3,4 },
Path R=l1→l2→l3→l4→l5Maximum bandwidth rmax=2.
It will be apparent that the minimum bandwidth of each link of path R is 3, and path maximum bandwidth is 2, and further demonstrating cannot incite somebody to action
The minimum bandwidth of each link in path is constituted as path maximum bandwidth.
According to the heuristic slot allocation method of forward direction, time slot allocation procedures are as shown in Figure 3:
In the Step1-6 stage, according to l1、l2、l3Three link available time slot collection x (1)={ 1,2,5,6 }, x (2)=1,
3,4 }, x (3)={ 1,2,5,6 } determines that distribution time slot collection is respectively y (1)={ 1,2 }, y (2)={ 3,4 }, y (3)={ 5,6 }；
In the Step7 stage, according to l2、l3Both links distribute (2)={ 3,4 } time slot collection y, y (3)={ 5,6 } and link l4Can
With time slot collection x (4)={ 3,4,5,6 }, l is determined4Distribution time slot integrate as φ.That is, using preceding to heuristic time slot point
Method of completing the square, acquiring path bandwidth is 0, further demonstrates heuristic slot allocation method and is unable to get globally optimal solution, is obtained
Not path maximum bandwidth.
If taking SAGO overall situation slot allocation method, time slot allocation procedures are as shown in Figure 4:
Assume initially that path R is capable of providing the bandwidth of 1 time slot, by take with " based on it is limited preferential by wheel incrementally
Slot allocation method " identical Step1-5 stage, confirmation are assumed to set up；It assumes again that path R is capable of providing the bandwidth of 2 time slots, leads to
Step6-15 node is crossed, confirms that the hypothesis is set up；It assumes again that path R is capable of providing the bandwidth of 3 time slots, by Step16-18, is
Link l5Time slot y (5)={ 1,3,4 } is distributed, then detects link l4Available time slot quantity be 2, the 3 time slot bandwidth less than path R
It is required that confirmation hypothesis is invalid.That is, acquiring path maximum bandwidth is 2, but is calculated using SAGO slot allocation method
Amount is 18, further demonstrates the computationally intensive problem of SAGO slot allocation method.
Claims (7)
1. it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that: using by wheel incremented circulation control
Algorithm processed is path allocation time interval resource, in every round time slot allocation, executes following steps:
Step 1: selecting the link set of available time slot minimum number by preferential link selection algorithm, time slot to be allocated is determined
Link；
Step 2: being the link of time slot to be allocated by priority slot selection algorithm, is concentrated in available time slot and search annoyance level
The smallest time slot；
Step 3: when the smallest by the annoyance level that the link allocation step two that Slot Allocation Algorithm is time slot to be allocated obtains
Gap, and the available time slot collection of a jump, two-hop neighbors link is updated.
2. it is according to claim 1 it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that:
It is described to refer to that every wheel is that each link distributes 1 time slot by wheel incremented circulation control algolithm, when starting next round again after a wheel
Gap distribution, until all available time slots distribute.
3. it is according to claim 2 it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that:
The preferential link selection algorithm refers to: from the link that current round not yet distributes time slot, selecting available time slot minimum number
Link, for its distribute time slot.
4. it is according to claim 3 it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that:
When there are the link of a plurality of available time slot minimum number, each time slot of each link is calculated to the interference size of remaining link, it is excellent
First time slot is distributed for link corresponding to the smallest time slot of interference.
5. it is according to claim 4 it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that:
When there are the links of a plurality of available time slot minimum number, and there are multiple time slots minimum and equal to remaining link interference, and more
It is preferably the smallest link distribution time slot of link serial number when a time slot belongs to different links.
6. it is according to claim 5 it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that:
The priority slot selection algorithm refers to: being its preferential distribution time slot small to remaining link interference after selecting link to be allocated.
7. it is according to claim 6 it is a kind of based on limited preferential by wheel incrementally slot allocation method, it is characterised in that:
After selecting link to be allocated, multiple time slots small to remaining link interference and equal, then preferentially distribute slot index most if it exists
Small time slot.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810734667.2A CN109041230B (en) | 2018-07-06 | 2018-07-06 | Round-by-round incremental time slot allocation method based on limited priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810734667.2A CN109041230B (en) | 2018-07-06 | 2018-07-06 | Round-by-round incremental time slot allocation method based on limited priority |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109041230A true CN109041230A (en) | 2018-12-18 |
| CN109041230B CN109041230B (en) | 2022-03-18 |
Family
ID=64641424
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810734667.2A Active CN109041230B (en) | 2018-07-06 | 2018-07-06 | Round-by-round incremental time slot allocation method based on limited priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109041230B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1568032A (en) * | 2003-06-20 | 2005-01-19 | 大唐移动通信设备有限公司 | A wireless resource distribution method for mobile communication system |
| CN101167391A (en) * | 2005-04-26 | 2008-04-23 | 艾利森电话股份有限公司 | Channel allocation for channel allocation tiering |
| CN101340220A (en) * | 2007-07-03 | 2009-01-07 | 鼎桥通信技术有限公司 | Time slot distribution method and apparatus based on adaptive wave beam shaping |
| WO2009065958A1 (en) * | 2007-11-23 | 2009-05-28 | Thales | Method of reservation with guarantee of latency and of bit rate in a time slot dynamic allocation network |
| CN101611571A (en) * | 2006-12-07 | 2009-12-23 | 米索尼莫奇获取有限公司 | Time slot and channel assigning system and method |
| WO2010006468A1 (en) * | 2008-07-18 | 2010-01-21 | 上海贝尔阿尔卡特股份有限公司 | Method and device for configuring time slots for a buffer region among multiple cell clusters |
| US20100176926A1 (en) * | 2007-09-21 | 2010-07-15 | Inha-Industry Partnership Institute | Time slot allocation apparatus and method for preventing collisions between time slots in tdma-based rfid network |
| CN102007789A (en) * | 2009-11-12 | 2011-04-06 | 高通股份有限公司 | Apparatus and method for facilitating dynamic time slot allocation |
| US20120155441A1 (en) * | 2010-12-17 | 2012-06-21 | Thales | Method for Allocating Resources, in a Mobile and Meshed Communications Network, with Limitation of the Inter-Cluster Interference, System and Network Implementing the Method |
| CN105392199A (en) * | 2014-08-12 | 2016-03-09 | 华为技术有限公司 | Time slot allocation ratio adaptive method, controller, and base station |
| CN106792972A (en) * | 2016-11-30 | 2017-05-31 | 暨南大学 | A kind of slot allocation method for meeting real time data bandwidth demand |
| CN107682924A (en) * | 2017-09-30 | 2018-02-09 | 中国科学院计算技术研究所 | A kind of link scheduling method and system suitable for long delay SIC networks |
-
2018
- 2018-07-06 CN CN201810734667.2A patent/CN109041230B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1568032A (en) * | 2003-06-20 | 2005-01-19 | 大唐移动通信设备有限公司 | A wireless resource distribution method for mobile communication system |
| CN101167391A (en) * | 2005-04-26 | 2008-04-23 | 艾利森电话股份有限公司 | Channel allocation for channel allocation tiering |
| CN101611571A (en) * | 2006-12-07 | 2009-12-23 | 米索尼莫奇获取有限公司 | Time slot and channel assigning system and method |
| CN101340220A (en) * | 2007-07-03 | 2009-01-07 | 鼎桥通信技术有限公司 | Time slot distribution method and apparatus based on adaptive wave beam shaping |
| US20100176926A1 (en) * | 2007-09-21 | 2010-07-15 | Inha-Industry Partnership Institute | Time slot allocation apparatus and method for preventing collisions between time slots in tdma-based rfid network |
| WO2009065958A1 (en) * | 2007-11-23 | 2009-05-28 | Thales | Method of reservation with guarantee of latency and of bit rate in a time slot dynamic allocation network |
| US20100318661A1 (en) * | 2007-11-23 | 2010-12-16 | Thales | Method of reservation with guarantee of latency and of bit rate in a time slot dynamic allocation network |
| WO2010006468A1 (en) * | 2008-07-18 | 2010-01-21 | 上海贝尔阿尔卡特股份有限公司 | Method and device for configuring time slots for a buffer region among multiple cell clusters |
| CN102007789A (en) * | 2009-11-12 | 2011-04-06 | 高通股份有限公司 | Apparatus and method for facilitating dynamic time slot allocation |
| US20120155441A1 (en) * | 2010-12-17 | 2012-06-21 | Thales | Method for Allocating Resources, in a Mobile and Meshed Communications Network, with Limitation of the Inter-Cluster Interference, System and Network Implementing the Method |
| CN105392199A (en) * | 2014-08-12 | 2016-03-09 | 华为技术有限公司 | Time slot allocation ratio adaptive method, controller, and base station |
| CN106792972A (en) * | 2016-11-30 | 2017-05-31 | 暨南大学 | A kind of slot allocation method for meeting real time data bandwidth demand |
| CN107682924A (en) * | 2017-09-30 | 2018-02-09 | 中国科学院计算技术研究所 | A kind of link scheduling method and system suitable for long delay SIC networks |
Non-Patent Citations (2)
| Title |
|---|
| KOUDJO M.KOUMADI,ET AL: "TDD time slot allocation and interference analysis for HDD cellular systems", 《2006 ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS》 * |
| 邱鹏飞: "基于TDMA的无线Mesh网络时隙分配算法研究与实现", 《中国优秀硕士学位论文辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109041230B (en) | 2022-03-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106879071B (en) | Wireless Mesh network low-delay optimization method based on dynamic time slot allocation | |
| US7046639B2 (en) | System and method for ad hoc network access employing the distributed election of a shared transmission schedule | |
| US8432820B2 (en) | Radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks | |
| CN104427621B (en) | Slot allocation method and device | |
| CN111434150A (en) | Multi-level, density-aware, location-based channel assignment and adaptive power control methods for mobile ad-hoc networks | |
| JP4517060B2 (en) | Wireless device and mesh network including the same | |
| US20070280153A1 (en) | Optimal time slot assignment for networks | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN102625362A (en) | Distributed channel allocating method in multi-channel multi-radio wireless Mesh network | |
| Manikandan et al. | A score based link delay aware routing protocol to improve energy optimization in wireless sensor network | |
| CN111565153B (en) | Method and system for maintaining routing table based on Q-learning algorithm and OLSR routing mechanism | |
| Garcia-Luna-Aceves et al. | STORM: A framework for integrated routing, scheduling, and traffic management in ad hoc networks | |
| CN109041230A (en) | It is a kind of based on limited preferential by wheel incrementally slot allocation method | |
| CN105704756A (en) | Multirate wireless Mesh network routing metric and channel distribution combination method | |
| Li et al. | Multi-hop effective bandwidth based routing in multi-radio wireless mesh networks | |
| Tan et al. | Dynamically adapting mobile ad hoc routing protocols to improve scalability | |
| Dai et al. | Efficient channel assignment under dynamic source routing in cognitive radio networks | |
| Wang et al. | Collaborative routing, scheduling and frequency assignment for wireless ad hoc networks using spectrum-agile radios | |
| WO2014185768A1 (en) | A method of spectrum aware routing in a mesh network and a system derived thereof | |
| Zhen et al. | Bandwidth-aware routing for TDMA-based mobile ad hoc networks | |
| Dai et al. | Effective Channel Assignment Based on Dynamic Source Routing in Cognitive Radio Networks. | |
| Theoleyre et al. | Assignment of roles and channels for a multichannel mac in wireless mesh networks | |
| Darties et al. | A divide-and-conquer scheme for assigning roles in multi-channel wireless mesh networks | |
| Huang et al. | Exploiting the capacity of multichannel multiradio wireless mesh networks | |
| Avallone et al. | Layer-2.5 routing in multi-radio wireless mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |