CN101674631A - Multi-channel routing method based on minimum channel switching in self-organizing network - Google Patents
Multi-channel routing method based on minimum channel switching in self-organizing network Download PDFInfo
- Publication number
- CN101674631A CN101674631A CN200910036192A CN200910036192A CN101674631A CN 101674631 A CN101674631 A CN 101674631A CN 200910036192 A CN200910036192 A CN 200910036192A CN 200910036192 A CN200910036192 A CN 200910036192A CN 101674631 A CN101674631 A CN 101674631A
- Authority
- CN
- China
- Prior art keywords
- channel
- node
- routing
- route
- grouping
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention relates to a multi-channel routing method based on minimum channel switching in a self-organizing network. The method demands that an originating node passes through self-maintained routing and channel use information, during routing updating and maintaining, each node in a network also needs to maintain the information of available-channels around the node and the available channelinformation of each leap in routing to a destination node beside necessary routing information, and a periodic global routing updating method and an event trigger local routing updating method are adopted; when connection is established, the originating node selects the best routing to the destination node according to the available channel gather of each leap in a routing list and finishes the distribution of channels by dint of RTS/CTS of a media access control layer, wherein the best routing means the routing needing least switching time delay. The invention aims to try best to reduce channel switching in routing and reduces time delay generated in channel switching as far as possible, thereby reducing the network time delay and enhancing the throughput.
Description
Technical field
The present invention relates to the implementation that a kind of multichannel user who is used in particular for switching based on minimum channel in the self-organizing network seeks route, belong to communication technical field.
Background technology
Ad Hoc network is a kind of special mobile radio networks, and it is made up of wireless mobile node, and its network topology has arbitrariness and provisional.The main feature of self-organizing network 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.
The routing mode of the routing mode of Ad Hoc network and traditional mobile communication system and WLAN (wireless local area network) is all different.Have the base station to be responsible for switching between the terminal in traditional mobile communication system, WLAN (wireless local area network) is the network of a single-hop, and Ad Hoc is the multihop network of a wireless Ad Hoc, and each terminal in the network is reciprocity.Each terminal in the Ad Hoc network sends or receiving terminal except can be used as, running face is outside application program of user, can also use as router, move corresponding Routing Protocol, participate in packet forward work and route maintenance work according to routing policy and routing table.And because radio node all may move at any time, and translational speed and direction also are unknown, so topology of networks all may change at any time, and the routing iinformation in the network then has certain ageing.
Its Routing Protocol need possess following characteristics: can carry out distributed operation, its routing algorithm should be distributed to analyzing based on above, and each node can be handled the operation of own adding or deviated from network independently; Dynamic self-adapting, because Ad Hoc topology of networks may change at any time, therefore require routing algorithm and agreement to have quick reaction capability to topology of networks, computational methods can restrain fast, thereby avoid occurring route loop, perhaps when route loop occurring, can in time eliminate its adverse effect; Support unidirectional route, the influence of actual wireless network environment, add the resource-constrained that each terminal has and be not quite similar, therefore the situation that occurs one-way channel probably, therefore in the design Routing Protocol, except considering to set up the route of forward, also to rediscover and set up reverse route simultaneously, avoid communication interruption and resource waste.
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.
Multichannel expansion to Ad Hoc network at present mainly contains following several mode: change the set of original MAC treatment mechanism, the improved routing algorithm of use and dual mode.DCA (Dynamic ChannelAssignment), MMAC (Multi-channel Media Access Control) and TA-MMAC are by improving existing MAC layer treatment mechanism, by many interfaces or specific time treatment mechanism, take place when realizing in the network a plurality of transmission.CA-AODV (Channel Assignment-Ad hoc On DemandDistance Vector Algorithm) and two kinds of algorithms of ECA-AODV (Enhanced CA-AODV) all are based on the improvement of AODV Routing Protocol, in routing, carry out channel allocation, Route Selection and channel allocation combination are carried out.Many achievements in research also all show at each jumps onto the selection of considering working frequency range when setting up route, and the mode performance of improvement MAC (Media Access Control) layer of treatment mechanism of independently carrying out than Route Selection and spectrum allocation may is well a lot.Because the latter does not consider the distribution of channel in selective channel, after Route Selection was finished, this route may be because its a certain jumping link can't use because of no available channel.DSDV-MC (Destination Sequenced Distance Vector-Multi-channel), OSPF-MCDS-MC (Open Shortest Path First-Minimal Connected Dominating Setwith Multiple Channels) and J-CAR (Joint Channel Assignment) do not change original MAC agreement, on the basis of existing route mechanism, take the principle of " K jumps independent " when selecting route, carry out channel allocation, just, each is jumped the employed channel of link to be adjacent the link employed channel of K within jumping all different.J-CAR/widest (joint channel assignment and routingwith widest path) agreement is the improvement to J-CAR, makes the routing interface among the J-CAR select to have the amphicheirality, and more accurate, more flexible.
But above-mentioned route is improved algorithm and is not all taken into full account the delay problem that frequent channel switching is brought.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 switches under the more situation at channel, and the network delay that brings thus also is very considerable.
In multichannel Ad Hoc network, each network node can dynamically be selected suitable channel and route according to the present situation of network, further improves network performance.Traditional route index such as jumping figure, congested etc. abundant inadequately as the foundation of Route Selection, thus need to introduce new route index, as channel switching times, channel switching frequency etc.Therefore in multichannel Ad Hoc network, route technology is very crucial technology.
Summary of the invention
Technical problem: the purpose of this invention is to provide the multi-channel routing method that switches based on minimum channel in a kind of self-organizing network, this method requires source node to use information by the route and the channel of self maintained, select to arrive the optimal path of destination node, i.e. the path of minimum channel switching.Channel switches to purpose to this method in the route to reduce as far as possible, adopts the channel allocation strategy of minimum handover delay, reduces channel as far as possible and switches the time delay that produces, thereby reduced network delay, has improved throughput.
Technical scheme: channel switches to purpose in the route to reduce as far as possible in the present invention, based on the aim sequence distance vector routing protocol, the distribution of Route Selection cochannel is combined, and has realized the route discovery in the self-organizing multichannel network.
This method comprises:
A. routing update and maintenance: require each node in the network except the routing iinformation of necessity, also need to safeguard following two kinds of channel informations, the set of available channels of the available channel information around this node and each jumping in the route of destination node, { CAS
1, CAS
2..., CAS
N, CAS wherein
kExpression is jumped set of available channels on the link apart from source node K, and N is the jumping figure of source node apart from destination node; When carrying out overall routing update, node also will be broadcasted the set of available channels information of every route correspondence except the broadcasting routing iinformation; The available channel list of node changes or transmission channel need switch the time, the broadcasting of local updating information is triggered in the capital, after receiving the routing update information grouping of neighbor node, if this node and neighbor node do not have common available channel, then abandon this grouping, the route relevant with this neighbor node also all can lose efficacy, and obtain the route and the channel operating position of neighbor node need wait until that for the node of new adding network the overall situation is upgraded the time, upgrade the routing table information of self maintained, and the existence of the neighbor node oneself around the notice, just can have then to send or receive requirement; The control interface of node is bundled on the control channel always, intercepts the situation of other nodes use data channels in the network, upgrades the set of available channels of oneself at any time;
B. connect: when source node has professional the transmission, whether at first intercept control channel idle, if it is idle, then select to arrive the best route of destination node according to the set of available channels of each jumping in the routing table, in this algorithm, be meant the route that needs minimum handover delay, and the request of being recorded in of the channel information that will distribute to each jumping sends in the control grouping, sends to destination node by control channel then; Request sends time D U, the destination address RA of transmission, source address TA, available channel list CL and the Frame Check Sequence FCS of transmission that grouping comprises frame control field FC, frame period, after node on the route receives that this request sends grouping, note the channel information of distributing to oneself, and data channel (FDC) interfacing switched on the corresponding channel, wait for that receiving the permission that destination node replys sends the control grouping; After the destination node request of receiving sends grouping, with the source node is destination node, search routing table and carry out same channel allocation, and the channel sequence of distributing is recorded in to allow to send in the grouping replies to source node, allow to send the grouping grouping and comprise the time D U of frame control field FC, frame period, destination address RA, available channel list CL and the Frame Check Sequence FCS of transmission, node on the path receives this permission and sends the corresponding channel allocation information of grouping back extraction, continues to transmit this grouping then; Shake hands after the success, source node and destination node are by prior channel switch data of distributing.
Beneficial effect: the invention provides in a kind of multichannel Ad Hoc network multi-channel routing method based on the aim sequence distance vector, this method requires source node to use information by the route and the channel of self maintained, select to arrive the optimal path of destination node, i.e. the path of minimum channel switching.Channel switches to purpose to this method in the route to reduce as far as possible, adopts the channel allocation strategy of minimum handover delay, reduces channel and switches the time delay that produces, thereby reduced network delay, has improved throughput.This routing algorithm is a kind of formula Routing Protocol of typically answering earlier, and it is slower to be applicable to that network topology structure changes, the network that real-time is had relatively high expectations.
Description of drawings
RTS frame structure in Fig. 1 OLCH-DSDV algorithm.
CTS frame structure in Fig. 2 OLCH-DSDV algorithm.
Fig. 3 network topology structure figure.
The part routing iinformation of Fig. 4 node A.
Embodiment
DSDV (Destination-Sequenced Distance-Vector) is a kind of tabledriven routing algorithm, each node is all being safeguarded a routing table, this routing table writing down node in network the destination node that might arrive, and needed jumping figure.The sequence number that each list item all has destination node to distribute is used for distinguishing new route and old route, and each node must be periodically and the neighbors exchanging routing information, can certainly trigger routing update according to the change of routing table.
DSDV can only provide the single-hop path between given source node and destination node, agreement need be selected following parameter: " sedimentation time " (the settling time) and the route time between failures of the cycle that timing is upgraded, maximum.Though these parameters are difficult to weigh to the influence of network, because its essence is the balance of will trading off between the validity of route and cost on network communication, the selection of these network parameters is most important.
In OLCH-DSDV of the present invention (the On-Least Channel Handoff-DSDV) routing algorithm, each communication node is by the broadcasting routing iinformation bag of periodicity or interval property, make the route information table of whole network of the instant maintenance update of each node or subnetwork, thereby realize each internodal proper communication.In sending the routing iinformation bag,, also increased the required channel information of channel allocation, to select the channel of minimum handover delay except that comprising the destination node address, arriving required jumping figure of destination node and the sequence number of receiving from this destination node.
The OLCH-DSDV routing algorithm is after determining channel, need divide into groups to finish channel allocation by means of the RTS/CTS of MAC layer, channel allocation work is mainly finished by source, destination node, and the handshake mechanism by the MAC layer is notified to respective nodes on the route with the channel information that distributes.Because control channel does not need to be used to broadcast route discovery packets in the process that communication is set up, only be used to transmit the channel information of having distributed, therefore significantly reduced the holding time of control channel, avoided " bottleneck problem " in the control channel.
In the OLCH-DSDV Routing Protocol, node maintenance the routing iinformation of whole network, when having packet to send, can transmit immediately like this, thereby be applicable to business and the network environment that some are had relatively high expectations to real-time.But in the frequent wireless network environment of topologies change, the cost of the accurate routing iinformation of node maintenance is higher, exchange topological lastest imformation continually.Characteristic at network, the present invention adopts two kinds of different routing table update methods: for network change situation faster, adopt periodic overall update method, lastest imformation comprises whole routing table, and such update mode can allow the timely awareness network topology of initiate node; Network change is situation slowly, adopts event driven local updating (progressively upgrading) method, has only and just trigger renewal when route changes, and only comprises the content of upgrading again after last time whole routing table being broadcasted.
It is as follows that the OLCH-DSDV route is set up process: when source node has the business of transmission, whether at first intercept control channel idle, if it is idle, then select to arrive the best route of destination node according to the set of available channels of each jumping in the routing table, in this algorithm, be meant the route that needs minimum handover delay, and the channel information that will distribute to each jumping is recorded in RTS (Request To Send) the control grouping, sends to destination node by control channel then.Node on the route is noted the channel information of distributing to oneself, and data channel (FDC) interfacing is switched on the corresponding channel after receiving this RTS grouping, waits for receiving CTS (Clear To Send) the control grouping that destination node is replied.After destination node receives RTS request grouping, with the source node is destination node, search routing table and carry out same channel allocation, and the channel sequence of distributing is recorded in the CTS control grouping, reply to source node, node on the path receives this CTS grouping back and extracts corresponding channel allocation information, continues to transmit this grouping then.Shake hands after the success, source node and destination node are by prior channel switch data of distributing.
Channel switches to purpose to OLCH-DSDV routing algorithm of the present invention in the route to reduce, and mainly is at answering the formula Routing Protocol earlier.
Traditional Routing Protocol is selected the principle of route be shortest path by, and because the target of OLCH-DSDV 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.
The OLCH-DSDV Routing Protocol increases the required channel information of channel allocation, to select the channel of minimum handover delay when sending the routing iinformation bag.
The OLCH-DSDV routing algorithm need divide into groups to finish channel allocation by means of the RTS/CTS of MAC layer after determining channel.To provide the route and the channel choice mechanism of OLCH-DSDV algorithm respectively from the route maintenance and two aspects that connect below.
Routing update and maintenance: as the expansion of DSDV agreement, the OLCH-DSDV algorithm requires each node in the network to need necessary routing iinformation with the maintenance update routing table except same, also need to safeguard following two kinds of channel informations: the set of available channels of the available channel information around this node and each jumping in the route of destination node, { CAS
1, CAS
2..., CAS
N, CAS wherein
kExpression is jumped set of available channels on the link apart from source node K, and N is the jumping figure of source node apart from destination node.When carrying out overall routing update, node also will be broadcasted the set of available channels information of every route correspondence except the broadcasting routing iinformation; The available channel list of node changes, and when perhaps transmission channel need switch, all can trigger the broadcasting of local updating information.After receiving the routing update message of neighbor node, if this node and neighbor node do not have common available channel, then abandon this grouping, the route relevant with this neighbor node also all can lose efficacy.And obtain the route and the channel operating position of neighbor node need wait until that for the node of new adding network the overall situation is upgraded the time, upgrade the routing table information of self maintained, and the existence of the neighbor node oneself around the notice, just can have then to send or the reception requirement.The control interface of node is bundled on the control channel always, intercepts the situation of other nodes use data channels in the network, upgrades the set of available channels of oneself at any time.
Connect: when source node has professional the transmission, whether at first intercept control channel idle, if it is idle, then select to arrive the best route of destination node according to the set of available channels of each jumping in the routing table, in this algorithm, be meant the route that needs minimum handover delay, and the channel information that will distribute to each jumping is recorded in the RTS control grouping, sends to destination node by control channel then.The RTS frame structure is as shown in Figure 1: FC is that frame control field, DU are that time, the RA of frame period is that destination address, the TA that transmits is that source address, the CL that transmits is that available channel list, FCS are Frame Check Sequences.Node on the route is noted the channel information of distributing to oneself, and data channel (FDC) interfacing is switched on the corresponding channel after receiving this RTS grouping, waits for receiving the CTS control grouping that destination node is replied.After destination node receives RTS request grouping, with the source node is destination node, search routing table and carry out same channel allocation, and the channel sequence of distributing is recorded in the CTS control grouping replies to source node, frame structure is (related definition is seen upward RTS frame) as shown in Figure 2, node on the path receives this CTS grouping back and extracts corresponding channel allocation information, continues to transmit this grouping then.Shake hands after the success, source node and destination node are by the prior channel interaction data that distributes.Behind the sign off, send local lastest imformation, the channel of release busy by control channel.
Fig. 3 is the topological structure of a certain mininet, the part routing iinformation that node A safeguards as shown in Figure 4, it is as follows that node A sets up process to the communication of node D:
1) source node A searches routing table, and is as shown in table 1, selects best route: as can be seen from the table, B and E are arranged, the required jumping figure of a wherein last route is less.
2) source node A jumps allocated channel for each: for next-hop node is the route of B, because
CAS
1∩ CAS
2=ch3},
CAS
2∩ CAS
3=ch2}, so the needed channel sequence of this route is ch3-ch3-ch2; Next is jumped to the route of E, and is required
3) channel sequence of wanting is ch3-ch3-ch2-ch2.Article two, the needed channel switching times of route is identical, but last route has less jumping figure, and therefore selecting next-hop node is the route of B.After the channel sequence of distributing to each jumping is written to RTS control grouping, should divide into groups to send to destination node D by control channel.
4) after Node B is received the RTS control grouping that has the allocated channel sequence, extract the communication channel ch3 that distributes between own and the source node A,, select next-hop node then according to channel of safeguarding in its routing table and routing iinformation.
5) after destination node D receives the RTS grouping that A sends, extracting and distribute to own channel information, is that destination node is searched route with node A then, allocated channel, and the channel sequence of distributing write during corresponding C TS divides into groups.
The channel allocation work of OLCH-DSDV routing algorithm of the present invention is mainly finished by source, destination node, and the handshake mechanism by the MAC layer is notified to respective nodes on the route with the channel information that distributes.Because control channel does not need to be used to broadcast route discovery packets in the process that communication is set up, only be used to transmit the channel information of having distributed, therefore significantly reduced the holding time of control channel, avoided " bottleneck problem " in the control channel.
Because each node need be safeguarded the routing table of whole network at any time, it is not very big that the OLCH-DSDV routing algorithm is mainly used in network size, network topology change is not very frequent network relatively, is applicable to business and network environment that some are had relatively high expectations to real-time.
Claims (1)
1, the multi-channel routing method that switches based on minimum channel in a kind of self-organizing network is characterized in that this method comprises:
A. routing update and maintenance: require each node in the network except the routing iinformation of necessity, also need to safeguard following two kinds of channel informations, the set of available channels of the available channel information around this node and each jumping in the route of destination node, { CAS
1, CAS
2..., CAS
N, CAS wherein
kExpression is jumped set of available channels on the link apart from source node K, and N is the jumping figure of source node apart from destination node; When carrying out overall routing update, node also will be broadcasted the set of available channels information of every route correspondence except the broadcasting routing iinformation; The available channel list of node changes or transmission channel need switch the time, the broadcasting of local updating information is triggered in the capital, after receiving the routing update information grouping of neighbor node, if this node and neighbor node do not have common available channel, then abandon this grouping, the route relevant with this neighbor node also all can lose efficacy, and obtain the route and the channel operating position of neighbor node need wait until that for the node of new adding network the overall situation is upgraded the time, upgrade the routing table information of self maintained, and the existence of the neighbor node oneself around the notice, just can have then to send or receive requirement; The control interface of node is bundled on the control channel always, intercepts the situation of other nodes use data channels in the network, upgrades the set of available channels of oneself at any time;
B. connect: when source node has professional the transmission, whether at first intercept control channel idle, if it is idle, then select to arrive the best route of destination node according to the set of available channels of each jumping in the routing table, in this algorithm, be meant the route that needs minimum handover delay, and the request of being recorded in of the channel information that will distribute to each jumping sends in the control grouping, sends to destination node by control channel then; Request sends time D U, the destination address RA of transmission, source address TA, available channel list CL and the Frame Check Sequence FCS of transmission that grouping comprises frame control field FC, frame period, after node on the route receives that this request sends grouping, note the channel information of distributing to oneself, and data channel (FDC) interfacing switched on the corresponding channel, wait for that receiving the permission that destination node replys sends the control grouping; After the destination node request of receiving sends grouping, with the source node is destination node, search routing table and carry out same channel allocation, and the channel sequence of distributing is recorded in to allow to send in the grouping replies to source node, allow to send the grouping grouping and comprise the time D U of frame control field FC, frame period, destination address RA, available channel list CL and the Frame Check Sequence FCS of transmission, node on the path receives this permission and sends the corresponding channel allocation information of grouping back extraction, continues to transmit this grouping then; Shake hands after the success, source node and destination node are by prior channel switch data of distributing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100361920A CN101674631B (en) | 2009-10-14 | 2009-10-14 | Multi-channel routing method based on minimum channel switching in self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100361920A CN101674631B (en) | 2009-10-14 | 2009-10-14 | Multi-channel routing method based on minimum channel switching in self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101674631A true CN101674631A (en) | 2010-03-17 |
| CN101674631B CN101674631B (en) | 2011-10-05 |
Family
ID=42021554
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100361920A Expired - Fee Related CN101674631B (en) | 2009-10-14 | 2009-10-14 | Multi-channel routing method based on minimum channel switching in self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101674631B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945052A (en) * | 2010-09-27 | 2011-01-12 | 广东威创视讯科技股份有限公司 | Matrix seek method and device for signal switching |
| CN102238683A (en) * | 2011-07-08 | 2011-11-09 | 华南理工大学 | Routing information acquisition and transmission method for wireless mesh network |
| CN102711209A (en) * | 2012-06-01 | 2012-10-03 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
| CN103687041A (en) * | 2013-12-17 | 2014-03-26 | 中国人民解放军国防科学技术大学 | Evolvable scheduling method for avoiding sending collision in wireless self-organizing network |
| CN104396338A (en) * | 2012-03-19 | 2015-03-04 | 泰科消防及安全有限公司 | Scalable protocol for large wsns having low duty cycle end nodes |
| EP2554009A4 (en) * | 2010-03-29 | 2016-06-01 | Intel Corp | Enhanced carrier sensing for multi-channel operation |
| CN106658650A (en) * | 2016-12-06 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Method and device for maintaining routing information based on ZigBee network |
| CN107222901A (en) * | 2017-05-27 | 2017-09-29 | 河南科技大学 | The implementation method of cognition wireless network Routing Protocol based on channel distribution |
| CN115714999A (en) * | 2022-11-15 | 2023-02-24 | 江苏怀业信息技术股份有限公司 | Multi-hop channel multiplexing method of multi-channel ad hoc network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7216282B2 (en) * | 2003-02-19 | 2007-05-08 | Harris Corporation | Mobile ad-hoc network (MANET) including forward error correction (FEC), interleaving, and multi-route communication features and related methods |
| CA2457909A1 (en) * | 2004-02-16 | 2005-08-16 | Christopher Davies | Method and system for self-organizing reliable, multiple path data flow transmission of data on a network |
-
2009
- 2009-10-14 CN CN2009100361920A patent/CN101674631B/en not_active Expired - Fee Related
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2554009A4 (en) * | 2010-03-29 | 2016-06-01 | Intel Corp | Enhanced carrier sensing for multi-channel operation |
| US9503339B2 (en) | 2010-03-29 | 2016-11-22 | Intel Corporation | Enhanced carrier sensing for multi-channel operation |
| CN101945052A (en) * | 2010-09-27 | 2011-01-12 | 广东威创视讯科技股份有限公司 | Matrix seek method and device for signal switching |
| CN102238683A (en) * | 2011-07-08 | 2011-11-09 | 华南理工大学 | Routing information acquisition and transmission method for wireless mesh network |
| CN104396338B (en) * | 2012-03-19 | 2018-11-16 | 泰科消防及安全有限公司 | The extensible protocol of large-scale WSN for the terminal node with low duty ratio |
| CN104396338A (en) * | 2012-03-19 | 2015-03-04 | 泰科消防及安全有限公司 | Scalable protocol for large wsns having low duty cycle end nodes |
| CN102711209B (en) * | 2012-06-01 | 2015-02-11 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
| CN102711209A (en) * | 2012-06-01 | 2012-10-03 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
| CN103687041B (en) * | 2013-12-17 | 2016-09-21 | 中国人民解放军国防科学技术大学 | A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method |
| CN103687041A (en) * | 2013-12-17 | 2014-03-26 | 中国人民解放军国防科学技术大学 | Evolvable scheduling method for avoiding sending collision in wireless self-organizing network |
| CN106658650A (en) * | 2016-12-06 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Method and device for maintaining routing information based on ZigBee network |
| CN106658650B (en) * | 2016-12-06 | 2021-01-08 | 台州市吉吉知识产权运营有限公司 | Routing information maintenance method and device based on ZigBee network |
| CN107222901A (en) * | 2017-05-27 | 2017-09-29 | 河南科技大学 | The implementation method of cognition wireless network Routing Protocol based on channel distribution |
| CN107222901B (en) * | 2017-05-27 | 2020-08-14 | 河南科技大学 | Method for realizing cognitive radio network routing protocol based on channel allocation |
| CN115714999A (en) * | 2022-11-15 | 2023-02-24 | 江苏怀业信息技术股份有限公司 | Multi-hop channel multiplexing method of multi-channel ad hoc network |
| CN115714999B (en) * | 2022-11-15 | 2024-02-23 | 江苏怀业信息技术股份有限公司 | Multi-hop channel multiplexing method for multi-channel ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101674631B (en) | 2011-10-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101674631B (en) | Multi-channel routing method based on minimum channel switching in self-organizing network | |
| EP2280517B1 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| Tang et al. | Interference-aware topology control and QoS routing in multi-channel wireless mesh networks | |
| US7502360B2 (en) | Method and apparatus for dynamic neighbor discovery within wireless networks using time division multiple access (TDMA) | |
| US8130654B2 (en) | Context-aware packet switching | |
| AU2007327566B2 (en) | Discovery of multiple inter-node links in wireless multi-hop networks | |
| KR20090090830A (en) | Wireless communication system for inter-connecting an ad-hoc network and an infra structure network with liscensed band, a wireless terminal and communication method thereof | |
| CN101674634B (en) | Multichannel based reactive routing method in cognitive radio system | |
| CN105072586B (en) | To the management method of the forwarding of broadcast message in embedded radio self-organizing network | |
| EP1610503B1 (en) | Controlling routing operations in communication networks | |
| CN103152143A (en) | Multi-point cooperative communication system and multi-point cooperative communication method for wireless Ad Hoc networks | |
| Soua et al. | Wave: a distributed scheduling algorithm for convergecast in ieee 802.15. 4e networks (extended version) | |
| Alazemi et al. | Fixed channel assignment algorithm for multi‐radio multi‐channel MESH networks | |
| He et al. | Channel assignment and routing in multi-channel, multi-interface wireless mesh networks | |
| Zheng et al. | A collision-free resident channel selection based solution for deafness problem in the cognitive radio networks | |
| CN103731835A (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| Pyo et al. | A QoS routing protocol for mobile Ad hoc networks based on a reservation pool | |
| Mahmud et al. | Meshed high data rate personal area networks | |
| Jin et al. | On a joint temporal–spatial multi-channel assignment and routing scheme in resource-constrained wireless mesh networks | |
| Lin et al. | A channel management protocol for multi-channel, single-radio 802.11-based wireless mesh networks | |
| Zhang et al. | Hop-Reservation Multiple Access with Variable Slots | |
| Kumar et al. | Simulation & Performance Evaluation of QoS Routing Protocol for Adhoc Networks Using Directional Communication | |
| Bakhsh et al. | A flexible relay selection technique for Bluetooth scatternet | |
| Abedi et al. | Agile Spectrum mobility aided spectrum-aware routing protocol for cognitive radio ad hoc networks | |
| Loyola et al. | Multi-channel wireless LAN mesh architecture with DCF-based inter-AP communication and idle channel search packet forwarding |
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: 20111005 Termination date: 20141014 |
|
| EXPY | Termination of patent right or utility model |