CN101674634B - Multichannel based reactive routing method in cognitive radio system - Google Patents
Multichannel based reactive routing method in cognitive radio system Download PDFInfo
- Publication number
- CN101674634B CN101674634B CN2009100361916A CN200910036191A CN101674634B CN 101674634 B CN101674634 B CN 101674634B CN 2009100361916 A CN2009100361916 A CN 2009100361916A CN 200910036191 A CN200910036191 A CN 200910036191A CN 101674634 B CN101674634 B CN 101674634B
- Authority
- CN
- China
- Prior art keywords
- channel
- node
- grouping
- route
- available
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multichannel based reactive routing method in a cognitive radio system and relates to an implementation method particularly used for a cognitive user to find routing in a self-organizing network based on a cognitive radio technology. The method is realized as follows: during establishing routing, nodes on one routing try best to select the same channel for avoiding confliction, available-channel information of the nodes is recorded in routing grouping, and the nodes receive the grouping select channels according to the information and gather and add available channels maintained by self into the grouping. The method aims to reduce channel switching during routing, carries out available-channel information of the nodes during finding routing aiming to a demand routing protocol, and distributes channels for each leap in routing through decision nodes. The routing method combines routing selection and channel distribution, reduces the occurrence of infliction, greatly enhances the throughput of a system, is simple and practical, and can be wieldy applied to multi-channel minitype distributed cognitive networks.
Description
Technical field
The present invention relates to a kind of implementation that is used in particular for seeking route, belong to communication technical field based on cognitive user in the self-organizing network of cognitive radio technology.
Background technology
Because the quick growth of radio communication service demand, the usable spectrum resource becomes more and more rare, how to effectively utilize the focus that those idle frequency spectrums become numerous scholar's research jointly.FCC (the FederalCommunications Commission) in the issue in the end of the year 2003 about the policy-making motion of cognitive radio technology and application thereof, point out that the utilance of the frequency range of distribution is not wait from 15%-85% at present, the frequency band of some frequency band such as cell phone network is an excess load, but the utilance such as reasonable low-frequency range frequency spectrums of some signal propagation characteristicses such as TV band is extremely low, and the availability of frequency spectrum also is different in different room and time sections.The limited usable spectrum and the problems such as poor efficiency of frequency spectrum make a kind of brand-new, use the wireless communication technology of frequency spectrum to become very necessary flexibly.Therefore, the researcher is consistent thinks: the dynamic spectrum based on cognitive radio technology inserts the effective technology that (Dynamic Spectrum Access) is the present frequency spectrum poor efficiency utilization of solution.
Cognitive radio (CR:Cognitive Radio) is as a kind of more intelligent frequency spectrum share technology, can rely on the support of artificial intelligence, the cognitive radio communication environment, according to certain study and decision making algorithm, real-time adaptive ground changes system operational parameters, dynamically detect and effectively utilize idle frequency spectrum, allow to carry out the spectrum reuse of multidimensional in theory on time, frequency and space, this will reduce the constraint to the wireless technology development of frequency spectrum and bandwidth constraints greatly.Therefore, CR is also referred to as spectrum agile radio, opportunistic spectrum inserts radio etc., and this technology also is following the most popular wireless technology by prophesy.
Cognitive radio technology can obtain utilizing in a lot of fields, especially will be used widely in distributed Ad Hoc network.For the Ad Hoc network based on cognitive radio, because the characteristic that its open frequency spectrum and dynamic spectrum insert, traditional Routing Protocol can't satisfy the demand of this type of network to dynamic routing, therefore needs the new route selection algorithm of design.
Ad Hoc network is a kind of special mobile radio networks, and it is formed, had the dynamic self-organization network system of any and provisional network topology by wireless mobile node.Its main feature has: independent networking, need not to depend on any network facilities of hypothesis in advance, and network node can be formed an independently network quickly and automatically; The self-organizing of no center, all nodes are equal, and the fortuitous event of any node can not influence the existence and the operation of whole network, and each node criterion is according to a preconcerted arrangement regulated factum; The multi-hop route when node need communicate with the node outside the coverage, just need be finished by the switching of other nodes; Dynamic topology, this is can be moved at any time by the node in the network, and can add at any time or deviated from network determined; Poor stability because each node can be used as terminal or transit node, therefore is more prone to receive malicious sabotage behaviors such as invasion or eavesdropping.When cable network can't use, use the self-organization network that Ad Hoc network has been set up fast that the access of communication and information can be provided, thereby guaranteed the communication under this environment, Ad Hoc network is widely used in fields such as military communication, emergency communication.
In multi channel wireless multi-hop network, use multichannel effectively, allow a plurality of transmission to take place simultaneously, not only can improve the throughput of network, the wait time delay that increases for competitive channel in the transmission data procedures be can also reduce, network congestion and conflict collision reduced.Because existing Routing Protocol substantially all is based on the beeline route in the Ad Hoc network, can the effective choice route in the single channel network, but owing to do not consider the diversity of available channel in the network, so this quasi-protocol just can't be protected in the performance of multi-channel wireless network.
In multichannel Ad Hoc cognition network, can allow each network node all have learning ability in conjunction with study in the cognitive radio and decision making algorithm, according to the present situation of network, dynamically select suitable channel and route, further improve network performance.In Ad Hoc network, introduce the CR technology route agreement has also been brought some influences, traditional route index such as jumping figure, congested etc. abundant inadequately as the foundation of Route Selection, so need to introduce new route index, as channel switching times, channel switching frequency etc.In addition, general multi-hop Ad Hoc network need pre-determine the communication route when sending grouping, after the employing CR technology, because of the disturbance fluctuation from wireless system on every side bigger, need constantly change route, so in the Ad Hoc cognition network, the technology that route technology is very crucial.
Summary of the invention
Technical problem: the purpose of this invention is to provide in a kind of cognitive radio Ad Hoc network multi-channel routing method based on the shortest path distributed algorithm, channel switches to purpose to this method in the route to reduce as far as possible, at on-demand routing protocol, carrying the available channel information of node in the process of route discovery, is that in the route each is jumped allocated channel by " decision node ".
Technical scheme: channel switches to purpose in the route to reduce as far as possible in the present invention, based on on-demand routing protocol, the distribution of Route Selection cochannel is combined, and has realized the discovery of route in the self-organizing cognitive network.
AODV (Ad-hoc On-Demand Distance VectorAlgorithm) has adopted the broadcast type route discovery mechanisms, depends on the dynamic routing table that intermediate node is set up and safeguarded, rather than by carrying routing iinformation in the route discovery packet.
The route finding process of AODV is made up of the foundation of reverse route and the two parts of setting up of forward direction route: oppositely route refers to the route from the destination node to the source node, is used for the route respective packets is returned to source node.Oppositely route is that source node is set up in the process of broadcasting route requests grouping; The forward direction route is meant the route from source node to the destination node direction, is used for the transmission of packet, and the forward direction route is to set up in the process of node loopback route response grouping.
Channel switches to purpose in the route to reduce as far as possible based on multi channel reactive route method in the self-organizing cognitive network, at on-demand routing protocol, in the process of route discovery, carry the available channel information of node, by decision node is that in the route each is jumped allocated channel, and this method comprises:
A. source node is when having data to send, at first intercept the busy idle condition of control channel, route requests grouping of broadcasting when control channel is idle, the available channel table that is comprising source node in the grouping, the value of channel switching times ChanHandoff and acknowledgement channel Chan_Conf all is initialized as 0 simultaneously.
B. receive the node of this route requests grouping, the set of available channels of a nearest node in the available channel table wherein channel use table with self maintained compared, decide to abandon or continues this grouping of forwarding:
If when b1. the channel of the set of available channels of a nearest node and node self maintained uses set of available channels common factor in the table as sky in the available channel table of route requests grouping, this node will abandon this route requests and divide into groups;
If b2. have only a common signal channel, illustrate that forward node can only select this channel to set up communication with its upstream node, this node will be noted this channel so, and be written in the affirmation channel Chan_Conf unit of route requests grouping, again the information of this channel is notified to its downstream node in reverse route when replying the route replies grouping, available channel table during node divides into groups with the available channel information replacement in the channel use tabulation of oneself then, and this grouping is transmitted in continuation, because this forward node can determine its use channel at reverse route middle and lower reaches node, therefore be referred to as " decision node ";
If b3. two common signal channels are arranged, because this node can't be determined the communication channel of which channel as a same hop node, therefore only the available channel information of oneself is added in the available channel table as a set so, continue to transmit this grouping then;
Find that the value of Chan_Conf unit is not 0 if c. receive the node of route requests grouping, just known that also a last hop node is a decision node, the value of available channel table only is the set of available channels of upstream node in the grouping, if this node can't be selected the selected channel in front, and it is not empty that the channel of node self uses the common factor of the set of available channels of a nearest node in table and the available channel table, the value of ChanHandoff adds 1 in just will dividing into groups, be illustrated in this node place and will carry out a secondary channel and switch, continue this grouping of forwarding after again oneself available channel information being added to the available channel table;
D. after destination node was received the route requests grouping, the information of at first checking Chan_Conf unit in the grouping if be not empty, illustrated that a hop node is a decision node, as long as select an available channel common with this decision node; If a last hop node is not " decision node ", destination node will be used table according to the channel of oneself safeguarding, get common factor with the set of available channels in the route request grouping available channel table, determine communication channel.
The present invention is OLCH-AODV (On-Least Channel Handoff-AODV) method for routing; its purpose is to reduce channel switching in the route as far as possible; because in the spectral range of 20MHz-3GHz; the every change of the working frequency range of transceiver 10MHz can bring the time delay of 10ms usually; therefore switch under the more situation at channel, the network delay that brings thus also is very considerable.
Traditional Routing Protocol is selected the principle of route be shortest path by, and because the target of OLCH-AODV algorithm is the channel handover delay that reduces in the route, therefore what they were at first considered is the channel switching times, has under the situation of identical switching times, consider again shortest path by.
The basic principle of OLCH-AODV agreement is in the process that route is set up, article one, the node on the route is selected same channel as far as possible when avoiding conflict, writing down the available channel information of node in the routing packets, the node of receiving grouping is according to this Information Selection channel, and the set of available channels of self maintained is joined in the grouping.
The OLCH-AODV algorithm only is the active node allocated channel, and the node that just enlivens in the route just can be assigned with channel, but not active node is not owing to having transmission or reception task can not be assigned with channel, so that save Internet resources.Channel of each node maintenance in the network uses tabulation CUL (Channel Usage List), the information of node busy channel around writing down, and the size of tabulation is determined by the number of channel in the network.Non-active node is intercepted the information of channel occupancy in the network when not sending or receiving business, and upgrades the CUL tabulation of its maintenance at any time.The route requests grouping (RREQ) of OLCH-AODV agreement is except comprising routing iinformations such as necessary destination node address, route record and request ID, also increased by three kinds of information units relevant with channel allocation: channel switching times ChanHandoff, available channel list Chan_Avail_List and acknowledgement channel Chan_Conf, wherein available channel list Chan_Avail_List is writing down the set of available channels of node in the route.Route replies grouping (RREP) has also increased allocated channel unit ChanAlct except comprising unit such as necessary jumping figure, aim sequence number, source IP and purpose IP.
Introduced the notion of " decision node " here: can determine the node of channel that upstream node uses in route finding process, introducing " decision node " mainly is the control information expense that is used for reducing in route requests grouping and the route replies grouping.
In setting up the process of reverse route, node can be safeguarded an ACTIVE-ROUTE-TIMEOUT variable, has only set up the forward direction route in this time, oppositely route is just effective, even otherwise received the route replies grouping, and also will be abandoned, the channel of having selected also will be released.Destination node also can decide and select which bar route according to the value of ChanHandoff and the jumping figure of route in the route requests grouping.In the RREP grouping of replying, writing down the information that each node uses channel, if destination node is " decision node ", will write the channel information that distributes in the ChanAlct unit, be notified to downstream node; If not, destination node only writes the channel that oneself is selected in the ChanAlct unit so, the node in notice downstream.In the process of transmitting the RREP grouping, " decision node " will be with the channel sequence replacement ChanAlct unit of distributing in advance.
Beneficial effect: the invention provides in a kind of cognitive radio Ad Hoc network multi-channel routing method based on the shortest path distributed algorithm, channel switches to purpose to this method in the route to reduce as far as possible, at on-demand routing protocol, carrying the available channel information of node in the process of route discovery, is that in the route each is jumped allocated channel by " decision node ".This method for routing combines the distribution of Route Selection cochannel, has reduced the generation of conflict, has improved the throughput of system greatly, and the present invention is simple and practical, can be widely used in multichannel small distributed cognition network.
Description of drawings
Fig. 1 network topological diagram.
Route between Fig. 2 node A-G is set up process.
Embodiment
Based on reduce the purpose OLCH-AODV (On-Least ChannelHandoff-AODV) that channel switches in the route as far as possible, mainly be at the reaction equation Routing Protocol.
Traditional Routing Protocol is selected the principle of route be shortest path by, and because the target of OLCH-AODV algorithm is the channel handover delay that reduces in the route, therefore what they were at first considered is the channel switching times, has under the situation of identical switching times, consider again shortest path by.Propagation delay time on one paths can be calculated with the following methods:
T
delay＝d×t
hop+s×t
sd
Wherein, d and s represent the jumping figure and the channel switching times of route, t respectively
HopThe propagation delay time of representing each jumping, t
SdThe expression channel switches the needed time.Therefore,, when selecting route, should at first consider the channel switching times, need select the route of less switching times as far as possible in order to reduce time delay.
Suppose to have a Common Control Channel in the network, be used for control information transmission, each network node all disposes two interfaces, and one is bundled on the control channel, and another can switch between data channel.Need use frequency range if occurred authorized user in the network, can broadcast one by control channel so and take grouping, the band limits that this main user of node will use around the notice uses the inferior user of this frequency range will abandon immediately continuing to use, and seeks route again.
The basic principle of OLCH-AODV agreement is in the process that route is set up, article one, the node on the route is selected same channel as far as possible when avoiding conflict, writing down the available channel information of node in the routing packets, the node of receiving grouping is according to this Information Selection channel, and the set of available channels of self maintained is joined in the grouping.
The OLCH-AODV algorithm only is the active node allocated channel, and the node that just enlivens in the route just can be assigned with channel, but not active node is not owing to having transmission or reception task can not be assigned with channel, so that save Internet resources.Channel of each node maintenance in the network uses tabulation CUL (Channel Usage List), the information of node busy channel around writing down, and the size of tabulation is determined by the number of channel in the network.Non-active node is intercepted the use information of channel in the network when not sending or receiving business, and upgrades the CUL tabulation of its maintenance at any time.The route requests grouping (RREQ) of OLCH-AODV agreement is except comprising necessary routing iinformation, three kinds of information relevant have also been increased: channel switching times ChanHandoff, available channel list Chan_Avail_List and acknowledgement channel Chan_Conf with channel allocation, wherein available channel list Chan_Avail_List is writing down the set of available channels of node in the route, has increased allocated channel unit ChanAlct in the route replies grouping (RREP).
Introduced the notion of " decision node " here: can determine the node of the use channel of upstream node in route finding process, introducing " decision node " mainly is the control information expense that is used for reducing in route requests grouping and the route replies grouping.
Route discovery mechanisms:
(1) source node is when having data to send, at first intercept the busy idle condition of control channel, when control channel is idle, will broadcast a RREQ grouping, writing down the available channel information of source node in the grouping, the value of channel switching times ChanHandoff and acknowledgement channel Chan_Conf all is initialized as 0 simultaneously.
(2) receive the node that this RREQ divides into groups, with the set of available channels CAL of a nearest node among the Chan_Avail_List
iCUL with self maintained compares, wherein CAL
iThe expression node i set of available channels, decide abandon or continues the forwarding this grouping:
1) if the set of available channels of a nearest node and the set of available channels among the CUL are occured simultaneously when empty among the Chan_Avail_List, this node will abandon this route requests grouping.
2) if having only a common signal channel, illustrate that forward node can only select this channel to set up communication with its upstream node, this node will be noted this channel so, and be written in the route requests grouping Chan_Conf unit, again the information of this channel is notified to its downstream node in reverse route when replying the RREP grouping; Chan_Avail_List value during node divides into groups with the available channel information replacement in the own CUL tabulation then, and this grouping is transmitted in continuation, because this forward node can determine its use channel at reverse route middle and lower reaches node, therefore be referred to as " decision node ".
3) if two common signal channels are arranged, so because this node can't be determined the communication channel of which channel as a same hop node, therefore only the available channel information of oneself is added in the Chan_Avail_List unit as a set, continue to transmit this grouping then.
(3) find that the value of Chan_Conf unit is not 0 if receive the node of route requests grouping, just known that also a last hop node is " decision node ", the value of Chan_Avail_List only is the set of available channels of upstream node in the grouping, if this node can't be selected the channel among the Chan_Conf, and the common factor of the set of available channels of a nearest node is not empty in CUL and the Chan_Avail_List unit, the value of ChanHandoff adds 1 in just will dividing into groups, be illustrated in this node place and will carry out secondary channel switching, again the available channel information of oneself is added to this grouping of continuation forwarding behind the Chan_Avail_List unit.
(4) after destination node is received the route requests grouping, at first check the information of Chan_Conf unit in the grouping, if be not empty, illustrate that a hop node is " decision node ", as long as select one with should " decision node " common available channel, if a last hop node is not " decision node ", destination node will be tabulated according to the CUL of oneself maintenance, get common factor with the set of available channels in the Chan_Avail_List unit, determine communication channel.
In setting up the process of reverse route, node can be safeguarded an ACTIVE-ROUTE-TIMEOUT variable, has only set up the forward direction route in this time, and oppositely route is just effective, even otherwise received that the route replies grouping also will be abandoned, the channel of having selected also will be released.Destination node also can be weighed decision and be selected which bar route according to the value of ChanHandoff and the jumping figure of route in the route requests grouping.In the RREP grouping of replying, writing down the information that each node uses channel, if destination node is " decision node ", will write the channel information that distributes in the ChanAlct unit, be notified to downstream node; If not, destination node only writes the channel that oneself is selected in the ChanAlct unit so, the node in notice downstream.In the process of transmitting the RREP grouping, " decision node " will be with the channel sequence replacement ChanAlct unit of distributing in advance.
Analyze the route discovery and the route respective process of OLCH-AODV routing algorithm below with concrete example.As shown in Figure 1, suppose to have in the network four available channel: ch1, ch2, ch3, ch4.Wherein ch1 is a Common Control Channel, is used for transmission route and finds and route replies information that also can be used for system broadcasts, each node provides in the drawings at the available channel of current time.
Route finding process:
(1) node A has data will send to node G, at first intercepts Common Control Channel, RREQ grouping of broadcasting when control channel is idle, and the Chan_Avail_List unit in the grouping is initialized as the set of available channels CAL of source node
a={ value of ChanHandoff and Chan_Conf all is initialized as 0 for ch2, ch3}.
(2) after node C receives the RREQ grouping, check the set CAL of available channel in the CUL tabulation of itself safeguarding
c={ ch2, ch3} is because CAL
c∩ CAL
a={ ch2, ch3} comprise two common signal channels, therefore will gather CAL
cAdd in the Chan_Avail_List unit, the value of ChanHandoff and Chan_Conf is constant, continues to transmit this grouping then.
(3) node E checks CUL after receiving the RREQ grouping, obtains CAL
e={ ch2, ch4} is with the set of available channels CAL of a nearest node in the Chan_Avail_List unit
cCommon factor be ch2} only has a common available channel, and this moment E become one " decision node ", it can in the process of route discovery, determine oneself with the communication channel between the node C, node E CAL
eValue replacement Chan_Avail_List unit, and the value of Chan_Conf is updated to ch2, continue to transmit the RREQ grouping then.
(4) after node F receives the RREQ grouping, because CAL
f∩ CAL
e={ ch4}, a common signal channel is only arranged, therefore F also is one " decision node ", it has determined that the communication channel between the own the same hop node E is ch4, because the value of Chan_Conf is ch2, so this route will carry out secondary channel switching at node E place, and the value of ChanHandoff adds 1, the value of Chan_Conf is updated to ch4, and the value of Chan_Avail_List unit is updated to CAL
f={ ch3, ch4}.
(5) after destination node G receives the RREQ grouping, because CAL
g∩ CAL
f={ ch3, ch4}, comprise two channels, therefore can choose at random the communication channel between ch3 or ch4 conduct and the node F, but from the Chan_Conf unit be worth know, node F and on it communication channel between hop node be ch4, in order to reduce handover overhead, G will select ch4 as and F between communication channel.
In the process that the forward route is set up, just to transmit in the process of the RREP grouping that destination node G sends, all " decision nodes " all can be written to the channel of confirming the ChanAlct unit of grouping, is notified to next-hop node.When receiving this RREP grouping, be the next-hop node in its forward route except knowing node F as node E, with own communication channel be ch4, and will tell node C the channel ch2 that communicates by letter between oneself definite and node C by this grouping.After node C receives the grouping of this route replies, know that also itself and communication channel between the node E are ch2, switch the expense of bringing in order to reduce channel, node C also can select the communication channel between ch2 conduct and the source node A equally.So far, when having set up route, also finished the channel allocation of each node in the route between source node A and the destination node G.
Claims (1)
- In the self-organizing cognitive network based on multi channel reactive route method, it is characterized in that this method comprises:A. source node is when having data to send, at first intercept the busy idle condition of control channel, route requests grouping of broadcasting when control channel is idle, the available channel table that is comprising source node in the grouping, the value of channel switching times ChanHandoff and acknowledgement channel Chan_Conf all is initialized as 0 simultaneously;B. receive the node of this route requests grouping, the set of available channels of a nearest node in the available channel table wherein channel use table with self maintained compared, decide to abandon or continues this grouping of forwarding:If when b1. the channel of the set of available channels of a nearest node and node self maintained uses set of available channels common factor in the table as sky in the available channel table of route requests grouping, this node will abandon this route requests and divide into groups;If b2. have only a common signal channel, illustrate that forward node can only select this channel to set up communication with its nearest node, this node will be noted this channel so, and be written in the affirmation channel Chan_Conf unit of route requests grouping, again the information of this channel is notified to its downstream node in reverse route when replying the route replies grouping, available channel table during node divides into groups with the available channel information replacement in the channel use table of oneself then, and this grouping is transmitted in continuation, because this forward node can determine its use channel at reverse route middle and lower reaches node, therefore be referred to as " decision node ";If b3. two common signal channels are arranged, so because this node can't determine which channel is as the communication channel with a nearest node, therefore only the available channel information of oneself is added in the available channel table as a set, continue to transmit this grouping then;Find that the value of Chan_Conf unit is not 0 if c. receive the node of route requests grouping, just known that also a nearest node is a decision node, the value of available channel table only is nearest one set of available channels in the grouping, if this node can't be selected the channel among the Chan_Conf, and it is not empty that the channel of node self uses the common factor of the set of available channels of a nearest node in table and the available channel table, the value of ChanHandoff adds 1 in just will dividing into groups, be illustrated in this node place and will carry out a secondary channel and switch, continue this grouping of forwarding after again oneself available channel information being added to the available channel table;D. after destination node was received the route requests grouping, the information of at first checking Chan_Conf unit in the grouping if be not empty, illustrated that a nearest node is a decision node, as long as select an available channel common with this decision node; If a nearest node is not " decision node ", destination node will be used table according to the channel of oneself safeguarding, get common factor with the set of available channels in the route request grouping available channel table, determine communication channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100361916A CN101674634B (en) | 2009-10-14 | 2009-10-14 | Multichannel based reactive routing method in cognitive radio system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100361916A CN101674634B (en) | 2009-10-14 | 2009-10-14 | Multichannel based reactive routing method in cognitive radio system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101674634A CN101674634A (en) | 2010-03-17 |
| CN101674634B true CN101674634B (en) | 2011-09-14 |
Family
ID=42021557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100361916A Expired - Fee Related CN101674634B (en) | 2009-10-14 | 2009-10-14 | Multichannel based reactive routing method in cognitive radio system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101674634B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101815337B (en) * | 2010-04-21 | 2012-04-18 | 无锡泛联软件科技有限公司 | Wireless ad hoc network reactive route method based on probability |
| CN101951655B (en) * | 2010-09-28 | 2013-01-09 | 北京航空航天大学 | Reactive routing protocol based on geographic information in wireless sensor network |
| CN107222901B (en) * | 2017-05-27 | 2020-08-14 | 河南科技大学 | Method for realizing cognitive radio network routing protocol based on channel allocation |
| CN109041152A (en) * | 2018-07-13 | 2018-12-18 | 青岛海信智慧家居系统股份有限公司 | A kind of method and apparatus of network reconfiguration |
| CN113825200B (en) * | 2021-11-24 | 2022-03-11 | 航天神舟科技发展有限公司 | LoRa-based half-duplex multi-frequency ad hoc network method and device |
| CN115529668B (en) * | 2022-02-28 | 2023-07-21 | 荣耀终端有限公司 | Channel selection method, electronic equipment and storage medium |
-
2009
- 2009-10-14 CN CN2009100361916A patent/CN101674634B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101674634A (en) | 2010-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks | |
| Bian et al. | Control channel establishment in cognitive radio networks using channel hopping | |
| Wu et al. | Realistic and efficient multi-channel communications in wireless sensor networks | |
| CN101674634B (en) | Multichannel based reactive routing method in cognitive radio system | |
| CN101674631B (en) | Multi-channel routing method based on minimum channel switching in self-organizing network | |
| Das et al. | WLC30-4: static channel assignment in multi-radio multi-channel 802.11 wireless mesh networks: issues, metrics and algorithms | |
| KR100918399B1 (en) | Apparatus and method for communication in wireless sensor network | |
| US8010121B2 (en) | Channel allocation for wireless mesh networks | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| CN103237330A (en) | Node-disjoint multipath routing method in cognitive wireless sensor network | |
| EP2253100A2 (en) | Discovering neighbors in wireless personal area networks | |
| CN102857988A (en) | Realization method of routing in accordance with requirements in cognitive wireless Ad Hoc network | |
| CN102946627A (en) | On spectrum utility-synergy routing algorithm in cognitive radio systems | |
| CN105282851A (en) | Channel distribution method and system | |
| Dai et al. | On capacity and delay of multichannel wireless networks with infrastructure support | |
| CN101938805A (en) | Routing method based on tree in cognitive radio network | |
| CN101854641A (en) | Method for perceiving Mesh network route | |
| Nayyar | Comprehensive analysis of routing protocols for cognitive radio ad-hoc networks (crahns) | |
| CN103731835A (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| KR101674182B1 (en) | Broadcasting method in wireless sensor networks | |
| Mathew et al. | Modified AODV routing protocol for multi-hop cognitive radio ad hoc networks | |
| Leu et al. | A coordinated multiple channel assignment scheme and AP deployment for channel reuse in metropolitan scale wireless networks | |
| Seo et al. | Multi-channel MAC protocol for multi-hop wireless networks: Handling multi-channel hidden node problem using snooping | |
| Tyagi et al. | Channel Assignment Schemes for Multi-Radio Multi Channel in Wireless Mesh Network | |
| Valentini et al. | Performance analysis of IEEE 802.15. 3c-Based mmW wireless 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110914 Termination date: 20141014 |
|
| EXPY | Termination of patent right or utility model |