CN106452545A - High-efficiency multicast transmission method of wireless mesh network - Google Patents

High-efficiency multicast transmission method of wireless mesh network Download PDF

Info

Publication number
CN106452545A
CN106452545A CN201610898246.4A CN201610898246A CN106452545A CN 106452545 A CN106452545 A CN 106452545A CN 201610898246 A CN201610898246 A CN 201610898246A CN 106452545 A CN106452545 A CN 106452545A
Authority
CN
China
Prior art keywords
information
wave beam
multicast tree
node
route
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201610898246.4A
Other languages
Chinese (zh)
Inventor
黄东
杨涌
龙华
张矩
沈俊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201610898246.4A priority Critical patent/CN106452545A/en
Publication of CN106452545A publication Critical patent/CN106452545A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

For the problem that random seamless migration management of resource scheduling in a wireless mesh network is difficultly realized, the service seamless smooth migration capability of the wireless mesh network is realized by establishing a minimum transmission delay model and a high-performance beam forming mechanism.

Description

A kind of efficient multicast transmission method of wireless mesh network
Technical field
The present invention relates to field of cloud computer technology, more particularly to traffic scheduling, and communication network.
Background technology
With the application of wireless mesh network, which combines the advantage of WLAN and mobile ad-hoc network, with automatic The features such as intelligence advantage such as networking, multi-hop, selfreparing and transfer rate are high, network capacity is big.In traditional WLAN In, each terminal is all directly set up wireless links to access Internet with AP, if mutually will communicate between each terminal Letter, then need to be relayed by the AP, and this structure is referred to as single-hop networks, and in wireless Mesh netword, each Mesh section Point can all be provided simultaneously with accessing and route forwarding function, carry out the transmitting-receiving operation of packet, permissible between each Mesh node Direction communication.This network topology is referred to as multihop network, and its great advantage having is：When certain node is due to load excessive When causing congestion, packet can adaptively be rerouted to another less neighbor node of load and carry out next step biography Defeated, the like, until arriving at destination node, wireless mesh network structure is as shown in Figure 1.
As following communication network is the network with data service as core, while supporting data, voice, image, shifting Dynamic multimedia, web page browsing and mobile interchange such as access at the multiple business.As various types of Business Stream converges to WMN In, this requires that network carrying platform has the demand of high throughput capacity, while can be to the real-time multimedia industry such as video, audio frequency Business provides higher QoS guarantee.Further, since frequency spectrum resource is limited, the presence of the factor such as air interference, noise, channel fading, Which proposes stern challenge to the transmission of WMN reliability data, and therefore for the QoS guarantee problem of wireless Mesh netword, having must Efficient multicast transmission mechanism is designed, the transmission quality of wireless mesh network is lifted, realizes efficient service bearer ability.
Content of the invention
The technical problem to be solved is：By setting up minimum transfer Time Delay Model and setting up high-performance wave beam shape Become mechanism, realize the seamless smooth transfer ability of business of wireless mesh network.
The present invention is comprised the following steps by solving the technical scheme that above-mentioned technical problem is adopted, as shown in Figure 2：
A, set up minimum transfer Time Delay Model；
B, set up high-performance Wave beam forming mechanism and routing mechanism.
In step A, Optimized model is specially：min{N(FAC,ζ),ζtotal,ζmax,ζaverage}
s.t.|{FCA((v,v′))|(v,v′)∈Eζ}|≤r(v),
Wherein X={ x1,x2,...,xnIt is decision variable,For object function, Pj′Father's kind for iteration j Group, Qj′For the sub- population of iteration j, V={ v1,v2,...,vNIt is set of network nodes, ε and v has a same physical meaning, but v ≠ ε, E are link set, and r (v), v ∈ V is the wave beam number of node v, and Src is the source node of multicast tree, R={ R1,R2,..., RrcFor multicast multicast tree destination node, RkFor R={ R1,R2,...,RrcIn element, confFCA((v,v′),(ε,ε′)) For decision variable, ζ (Vζ,Eζ) it is multicast tree,For multicast tree node,For multicast tree link, Φ (v, v ') is chain The utilization cost on road (v, v '), (v, v ') is the path of multicast tree ζ interior joint v and v ', and D (v, v ') prolongs for link (v, v's ') Late, GCH(VCH,ECH) it is conflict graph, CH={ 1,2 ..., ch } is orthogonal channel set, FCAFor orthogonal channel function, ErFor by mistake Difference variable, ζcostFor the utilization cost of multicast tree ζ, ζmaxFor the maximum transmitted time delay of multicast tree ζ, ζaverageFor the flat of multicast tree ζ Equal propagation delay time, N (FAC, ζ) and it is number of collisions after link by channel distribution to ζ, Pζ(Src,Rk) be in multicast tree ζ from many The source node of tree is broadcast to RkPath, ECHIt is the link set comprising orthogonal channel set CH, (vv ', ε ε ') is one group of orthogonal letter Road.
In step B, specially：Transmitting terminal and receiving terminal all using mimo system, specially：A. select with highest Feedback signal to noise ratio γiCorresponding wave beam i and feedback signal to noise ratio be only second to γiγjCorresponding wave beam j, wave beam i and j corresponding ripple Beam vector is respectively wiAnd wj；B. γ is obtainediWith γjRatioWherein wk,lFor antenna l's The element of beam vector k；C. argument quantized value is obtained, and the Wave beam forming number of antennas of receiving terminal is Mt, the wave beam shape of transmitting terminal Become number of antennas for Mr, wiFor vector in i-th transmission antennaElement, cjFor vector in j-th reception antenna Element, λ be wavelength,For gyration vector, d is flat between adjacent antennas Equal distance, x is input quantity, to be output as based on the mimo system of Wave beam formingIt is the channel matrix with multipath effect,For adding Property white Gaussian noise vector,It is the channel matrix comprising gyration vector information, ο is the matrix product with identical dimensional, θt For the departure angle of transmitting terminal, θrFor the departure angle of receiving terminal,Average be 0, variance is For unit battle array,Based on the mimo system output signal-to-noise ratio of Wave beam forming it isMode is as shown in Figure 3.
In step B, specially：The method that routing mechanism is combined using main routing mechanism and from routing mechanism, when When network is in non-congested state, using main routing mechanism, when network enters congestion state, using from routing mechanism；Main road By mechanism it is：A. convergence-level gateway is classified to the business that receives and route test information, and which includes service request information, returns Multiple control information, route response control information, and go to step b, d, e respectively；B. judge the vector set of service request information Whether it is the information for sending to destination node, if step c is then gone to, otherwise then stores the information and forward, and go to step f；C. judge whether which receives the service request information first by destination node, if then using the route of service request information Response information cache timing unit, and caching is waited, if cache-time sets threshold value less than artificial, the information is delayed Deposit and subsequently forwarded, and step f is gone to, otherwise then abandon the information；D. when reply control information is received, by destination node Routing iinformation be updated, and judge whether the node of the transmission reply control information is source node, if then having been deposited The routing iinformation of the destination node of storage is compared, otherwise then carries out unicasting to next adjacent node of route, and forwards this time Multiple control information, and go to step f；E. the routing information experienced by the route response control information for receiving is deleted；F. to purpose Node sends business and route test information.
In step B, specially：From routing mechanism it is：A. source node is judged using transmission route request information mode Whether there is to the physical pathway between destination node；B. route request information is received by destination node, and preferential to source section Point feedback route response information；C. after source node receives route response information, using route response information cache timing unit Timing is carried out, and all different route response information for receiving is stored, and be ranked up by the artificial rule that sets, so Afterwards after main transmission path is determined, Business Stream transmission is carried out；D. build in the route discovery stage some by source node to purpose section The standby transport path of point, and use the load condition in each possible transmission path and jumping figure as optimal transmission paths evaluation according to According to, and using the optimal path as main transmission path, remaining is then standby transport path；E. when congestion occurs in main transmission path When, then switch to the high effective transmission path of priority.
Description of the drawings
Fig. 1 wireless mesh network structural representation
The efficient multicast transfer process schematic diagram of Fig. 2 wireless mesh network
Fig. 3 mode schematic diagram
Specific embodiment
For reaching above-mentioned purpose, technical scheme is as follows：
The first step, sets up minimum transfer Time Delay Model, specially：
min{N(FAC,ζ),ζtotal,ζmax,ζaverage}
s.t.|{FCA((v,v′))|(v,v′)∈Eζ}|≤r(v),
Wherein X={ x1,x2,...,xnIt is decision variable,For object function, Pj′Father's kind for iteration j Group, Qj′For the sub- population of iteration j, V={ v1,v2,...,vNIt is set of network nodes, ε and v has a same physical meaning, but v ≠ ε, E are link set, and r (v), v ∈ V is the wave beam number of node v, and Src is the source node of multicast tree, R={ R1,R2,..., RrcFor multicast multicast tree destination node, RkFor R={ R1,R2,...,RrcIn element, confFCA((v,v′),(ε,ε′)) For decision variable, ζ (Vζ,Eζ) it is multicast tree,For multicast tree node,For multicast tree link, Φ (v, v ') is chain The utilization cost on road (v, v '), (v, v ') is the path of multicast tree ζ interior joint v and v ', and D (v, v ') prolongs for link (v, v's ') Late, GCH(VCH,ECH) it is conflict graph, CH={ 1,2 ..., ch } is orthogonal channel set, FCAFor orthogonal channel function, ErFor by mistake Difference variable, ζcostFor the utilization cost of multicast tree ζ, ζmaxFor the maximum transmitted time delay of multicast tree ζ, ζaverageFor the flat of multicast tree ζ Equal propagation delay time, N (FAC, ζ) and it is number of collisions after link by channel distribution to ζ, Pζ(Src,Rk) be in multicast tree ζ from many The source node of tree is broadcast to RkPath, ECHIt is the link set comprising orthogonal channel set CH, (vv ', ε ε ') is one group of orthogonal letter Road.
Second step, sets up high-performance Wave beam forming mechanism and routing mechanism, specially：Transmitting terminal and receiving terminal are all adopted Mimo system, specially：A. select to feed back signal to noise ratio γ with highestiCorresponding wave beam i and feedback signal to noise ratio be only second to γi's γjThe corresponding beam vector of corresponding wave beam j, wave beam i and j be respectively wiAnd wj；B. γ is obtainediWith γjRatioWherein wk,lElement for beam vector k of antenna l；C. argument quantized value, receiving terminal are obtained Wave beam forming number of antennas be Mt, the Wave beam forming number of antennas of transmitting terminal is Mr, wiFor vector in i-th transmission antennaElement, cjFor vector in j-th reception antennaElement, λ be wavelength,For gyration vector, d is the average distance between adjacent antennas, and x is input Amount, is output as based on the mimo system of Wave beam forming It is the channel matrix with multipath effect,For additive white Gaussian noise vector,It is the channel comprising gyration vector information Matrix, ο is the matrix product with identical dimensional, θtFor the departure angle of transmitting terminal, θrFor the departure angle of receiving terminal,Equal It is worth for 0, variance is For unit battle array,Mimo system based on Wave beam forming exports noise Than for
3rd step, the method that routing mechanism is combined using main routing mechanism and from routing mechanism, when network is gathered around in non- During plug-like state, using main routing mechanism, when network enters congestion state, using from routing mechanism；Main routing mechanism is：A. converge Poly layer gateway is classified to the business that receives and route test information, and which includes service request information, replys control information, road By response control information, and go to step b, d, e respectively；B. judge service request information vector set be whether to purpose section The information that point sends, if then going to step c, otherwise then stores the information and forwards, and go to step f；C. pass through purpose section Point judges whether which receives the service request information first, if then fixed using the route response information cache of service request information Shi Danyuan, and caching is waited, if cache-time sets threshold value less than artificial, enter row cache subsequently carries out turning to the information Send out, and step f is gone to, otherwise then abandon the information；D., when reply control information is received, the routing iinformation of destination node is entered Row updates, and judges whether the node of the transmission reply control information is source node, if then by the destination node for having stored Routing iinformation be compared, otherwise then carry out unicasting to next adjacent node of route, and forward the reply control information, and Go to step f；E. the routing information experienced by the route response control information for receiving is deleted；F. to destination node send business and Route test information.
4th step, from routing mechanism be：A. using send route request information mode judge source node to destination node it Between physical pathway whether there is；B. route request information is received by destination node, and preferential to source node feedback route sound Answer information；C., after source node receives route response information, using route response information cache timing unit, timing is carried out, and right The all different route response information for receiving is stored, and is ranked up by the artificial rule that sets, and is then determining main biography Behind defeated path, Business Stream transmission is carried out；D. in the route discovery stage, some standby transport by source node to destination node are built Path, and the load condition in each possible transmission path and jumping figure is used as the Appreciation gist of optimal transmission paths, and by this most Shortest path is used as main transmission path, and remaining is then standby transport path；E. when congestion occurs in main transmission path, then switch to excellent The high effective transmission path of first level.
The present invention proposes a kind of efficient multicast transmission method of wireless mesh network, by setting up minimum transfer time delay mould Type simultaneously sets up high-performance Wave beam forming mechanism routing mechanism, realizes the seamless smooth transfer ability of business of wireless mesh network.

Claims (5)

1. the efficient multicast transmission method of a kind of wireless mesh network, by setting up minimum transfer Time Delay Model and high-performance wave beam Forming Mechanism and routing mechanism, realize the seamless smooth transfer ability of business of wireless mesh network, comprise the steps：
A, set up minimum transfer Time Delay Model；
B, set up high-performance Wave beam forming mechanism and routing mechanism.
2. method according to claim 1, for step A it is characterized in that：Optimized model is specially：
min{N(FAC,ζ),ζtotal,ζmax,ζaverage}
Wherein X={ x1,x2,...,xnIt is decision variable,For object function, Pj′For the father population of iteration j, Qj′ For the sub- population of iteration j, V={ v1,v2,...,vNIt is set of network nodes, ε and v has a same physical meaning, but v ≠ ε, E For link set, r (v), v ∈ V is the wave beam number of node v, and Src is the source node of multicast tree, R={ R1,R2,...,RrcBe The destination node of multicast multicast tree, RkFor R={ R1,R2,...,RrcIn element,Become for decision-making Amount, ζ (Vζ,Eζ) it is multicast tree,For multicast tree node,For multicast tree link, Φ (v, v ') is link (v, v ') Utilization cost, (v, v ') for multicast tree ζ interior joint v and v ' path, D (v, v ') for link (v, v ') delay, GCH(VCH, ECH) it is conflict graph, CH={ 1,2 ..., ch } is orthogonal channel set, FCAFor orthogonal channel function, ErFor error variance, ζcost For the utilization cost of multicast tree ζ, ζmaxFor the maximum transmitted time delay of multicast tree ζ, ζaverageFor the mean transit delay of multicast tree ζ, N(FAC, ζ) and it is number of collisions after link by channel distribution to ζ, Pζ(Src,Rk) it is to save from the source of multicast tree in multicast tree ζ Put to RkPath, ECHIt is the link set comprising orthogonal channel set CH, (vv ', ε ε ') is one group of orthogonal channel.
3. method according to claim 1, for step B it is characterized in that：Transmitting terminal and receiving terminal are all using MIMO system System, specially：A. select to feed back signal to noise ratio γ with highestiCorresponding wave beam i and feedback signal to noise ratio be only second to γiγjRight The corresponding beam vector of wave beam j, wave beam i and j is answered to be respectively wiAnd wj；B. γ is obtainediWith γjRatioWherein wk,lElement for beam vector k of antenna l；C. argument quantized value is obtained, receives The Wave beam forming number of antennas at end is Mt, the Wave beam forming number of antennas of transmitting terminal is Mr, wiFor vector in i-th transmission antennaElement, cjFor vector in j-th reception antennaElement, λ be wavelength,For gyration vector, d is the average distance between adjacent antennas, and x is input Amount, is output as based on the mimo system of Wave beam forming For Channel matrix with multipath effect,For additive white Gaussian noise vector,It is the channel square comprising gyration vector information Battle array,It is the matrix product with identical dimensional, θtFor the departure angle of transmitting terminal, θrFor the departure angle of receiving terminal,Average For 0, variance is For unit battle array,Based on the mimo system output signal-to-noise ratio of Wave beam forming it is
4. method according to claim 1, for step B it is characterized in that：Routing mechanism using main routing mechanism and from The method that routing mechanism combines, when network is in non-congested state, using main routing mechanism, when network enters congestion state When, using from routing mechanism；Main routing mechanism is：A. convergence-level gateway is carried out to the business that receives and route test information point Class, which includes service request information, replys control information, route response control information, and goes to step b, d, e respectively；B. sentence Whether the vector set of disconnected service request information is the information for sending to destination node, if then going to step c, otherwise then stores The information is simultaneously forwarded, and go to step f；C. judge whether which receives the service request information first by destination node, if Then using the route response information cache timing unit of service request information, and caching is waited, if cache-time is less than manually setting Determine threshold value, then row cache is entered to the information and subsequently forward, and step f is gone to, otherwise then abandon the information；D. when receiving When control information is replied, the routing iinformation of destination node is updated, and judges the node of the transmission reply control information Whether being source node, if being then compared the routing iinformation of the destination node for having stored, otherwise then carrying out unicasting to route Next adjacent node, and forward the reply control information, and go to step f；E. the route response control information for receiving is deleted The routing information for being experienced；F. to destination node, business and route test information are sent.
5. method according to claim 1, for step B it is characterized in that：From routing mechanism it is：A. it is route using transmission Request message mode judges that source node whether there is to the physical pathway between destination node；B. route is received by destination node Request message, and preferential to source node feedback route response information；C. after source node receives route response information, using route Response information cache timing unit carries out timing, and all different route response information for receiving is stored, and presses people Work sets rule and is ranked up, and then after main transmission path is determined, carries out Business Stream transmission；D. build in the route discovery stage Some standby transport path by source node to destination node, and use load condition and the jumping figure conduct in each possible transmission path The Appreciation gist of optimal transmission paths, and using the optimal path as main transmission path, remaining is then standby transport path；E. when When congestion occurs in main transmission path, then switch to the high effective transmission path of priority.
CN201610898246.4A 2016-10-15 2016-10-15 High-efficiency multicast transmission method of wireless mesh network Pending CN106452545A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610898246.4A CN106452545A (en) 2016-10-15 2016-10-15 High-efficiency multicast transmission method of wireless mesh network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610898246.4A CN106452545A (en) 2016-10-15 2016-10-15 High-efficiency multicast transmission method of wireless mesh network

Publications (1)

Publication Number Publication Date
CN106452545A true CN106452545A (en) 2017-02-22

Family

ID=58175047

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610898246.4A Pending CN106452545A (en) 2016-10-15 2016-10-15 High-efficiency multicast transmission method of wireless mesh network

Country Status (1)

Country Link
CN (1) CN106452545A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108390945A (en) * 2018-04-02 2018-08-10 北京理工大学 A kind of file transmission of wireless buffer network and wave beam forming design method
CN109889928A (en) * 2018-12-07 2019-06-14 中国南方电网有限责任公司 Multicast light tree transmission quality prediction technique, device, equipment and storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090160707A1 (en) * 2007-12-19 2009-06-25 Ismail Lakkis Beamforming in MIMO Systems
US20100309781A1 (en) * 2009-06-03 2010-12-09 Qualcomm Incorporated Switching between mimo and receiver beam forming in a peer-to-peer network
CN103200641A (en) * 2013-03-29 2013-07-10 南京邮电大学 Routing method of multi-radiofrequency multi-channel wireless mesh network
CN103312606A (en) * 2013-05-23 2013-09-18 杭州卓沃电子商务有限公司 Wireless Mesh network routing based on multi-path concurrence and method thereof
CN104093187A (en) * 2014-07-24 2014-10-08 吉林大学 Multi-gateway wireless Mesh network interference and load aware routing method
CN104393903A (en) * 2014-10-30 2015-03-04 深圳市国创新能源研究院 Wave beam forming method and device of LTE (Long Term Evolution) MIMO (Multiple Input Multiple Output) system
CN105721308A (en) * 2016-02-24 2016-06-29 陕西师范大学 Routing method and system of multi-hop cognitive radio network based on average delay estimation

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090160707A1 (en) * 2007-12-19 2009-06-25 Ismail Lakkis Beamforming in MIMO Systems
US20100309781A1 (en) * 2009-06-03 2010-12-09 Qualcomm Incorporated Switching between mimo and receiver beam forming in a peer-to-peer network
CN103200641A (en) * 2013-03-29 2013-07-10 南京邮电大学 Routing method of multi-radiofrequency multi-channel wireless mesh network
CN103312606A (en) * 2013-05-23 2013-09-18 杭州卓沃电子商务有限公司 Wireless Mesh network routing based on multi-path concurrence and method thereof
CN104093187A (en) * 2014-07-24 2014-10-08 吉林大学 Multi-gateway wireless Mesh network interference and load aware routing method
CN104393903A (en) * 2014-10-30 2015-03-04 深圳市国创新能源研究院 Wave beam forming method and device of LTE (Long Term Evolution) MIMO (Multiple Input Multiple Output) system
CN105721308A (en) * 2016-02-24 2016-06-29 陕西师范大学 Routing method and system of multi-hop cognitive radio network based on average delay estimation

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108390945A (en) * 2018-04-02 2018-08-10 北京理工大学 A kind of file transmission of wireless buffer network and wave beam forming design method
CN109889928A (en) * 2018-12-07 2019-06-14 中国南方电网有限责任公司 Multicast light tree transmission quality prediction technique, device, equipment and storage medium
CN109889928B (en) * 2018-12-07 2022-01-25 中国南方电网有限责任公司 Multicast optical tree transmission quality prediction method, device, equipment and storage medium

Similar Documents

Publication Publication Date Title
US8964773B2 (en) Method and system for establishing cooperative routing in wireless networks
JP4714274B2 (en) System and method for increasing the capacity of a wireless communication network using multiple radios
CN101674630B (en) Implementation method of cross-layer routing capable of perceiving congestion
Fekair et al. CBQoS-Vanet: Cluster-based artificial bee colony algorithm for QoS routing protocol in VANET
US20150055506A1 (en) Hybrid mesh network
CN101854697B (en) Multi-constraint quality-of-service control routing method and system for wireless mesh network
CN103607750A (en) Relay selection method based on terminal straight-through communication in next-generation cellular system
CN100555993C (en) The optimizing load-sharing route method and apparatus of network business flow
US9596619B2 (en) Mobile infrastructure assisted ad-hoc network
EP1610503B1 (en) Controlling routing operations in communication networks
CN106452545A (en) High-efficiency multicast transmission method of wireless mesh network
CN113660710A (en) Routing method of mobile ad hoc network based on reinforcement learning
Kannan et al. Ant colony optimization for routing in mobile ad-hoc networks
CN106454940A (en) Load balancing method in wireless mesh network
CN111132236A (en) Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol
Quy et al. PRP: A high-performance routing protocol for mobile ad-hoc networks
Shojafar et al. LLLA: New efficient channel assignment method in wireless mesh networks
CN110856231B (en) Multi-data stream transmission method based on multi-hop network
Zhao et al. Multi-path routing protocol for the video service in UAV-assisted VANETs
Haque et al. Efficient congestion minimisation by successive load shifting in multilayer wireless networks
Trong et al. End-to-end throughput improvement for single radio multi-channel multi-path wireless mesh networks: a cross layer design
Kolipaka et al. Performance analysis of AODV with multi-radio in hybrid wireless mesh network
Sarı et al. Chain RTS/CTS scheme with Opportunistic Channel Allocation
Adekiigbe et al. Development of a routing framework for a cluster-based congestion avoidance and load balancing algorithm for IEEE802. 11s mesh network
Yadav et al. Location and Signal Strength Based Predictive approach for Routing in FANET

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170222