CN111741499B - Multi-band convergence method for intelligent wireless networking - Google Patents

Multi-band convergence method for intelligent wireless networking Download PDF

Info

Publication number
CN111741499B
CN111741499B CN202010758796.2A CN202010758796A CN111741499B CN 111741499 B CN111741499 B CN 111741499B CN 202010758796 A CN202010758796 A CN 202010758796A CN 111741499 B CN111741499 B CN 111741499B
Authority
CN
China
Prior art keywords
flow
frequency band
interface
busy
band
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.)
Active
Application number
CN202010758796.2A
Other languages
Chinese (zh)
Other versions
CN111741499A (en
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.)
Shenzhen Tenda Technology Co Ltd
Original Assignee
Shenzhen Tenda Technology Co Ltd
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 Shenzhen Tenda Technology Co Ltd filed Critical Shenzhen Tenda Technology Co Ltd
Priority to CN202010758796.2A priority Critical patent/CN111741499B/en
Publication of CN111741499A publication Critical patent/CN111741499A/en
Application granted granted Critical
Publication of CN111741499B publication Critical patent/CN111741499B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0055—Transmission or use of information for re-establishing the radio link
    • H04W36/0058—Transmission of hand-off measurement information, e.g. measurement reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
    • H04W36/00835—Determination of neighbour cell lists
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention provides a method for multi-band convergence of intelligent wireless networking, which comprises the following steps: s1, intercommunication and interconnection of multi-band MESH links; s2, respectively summarizing neighbor table updating information, link quality statistical information and data flow statistical information to a flow scheduling decision module; the neighbor table is updated, and information of a plurality of frequency bands of neighbor points is acquired and sent to the flow scheduling decision module; link quality statistics, wherein link quality information is collected and sent to a flow scheduling decision module; counting data streams, wherein the statistical information of the current data streams is counted and sent to a stream scheduling decision module; and S3, making a flow scheduling decision, wherein the flow scheduling decision module judges whether the requirement of the data flow decision migration forwarding is met, if the requirement of the data flow decision migration forwarding is met, the maximum data flow decision migration forwarding is carried out, and the step S2 is returned, otherwise, the step S2 is returned. The invention has the beneficial effects that: the traditional data transmission based on the multi-band MESH single path is promoted and optimized, and the bandwidth and the data volume of the limit link are greatly improved.

Description

Multi-band convergence method for intelligent wireless networking
Technical Field
The invention relates to wireless communication, in particular to a method for multi-band convergence of intelligent wireless networking.
Background
After MESH networking of MESH (wireless MESH network) multi-band, each device connects two MESH links, only one of the links is used as an interworking interconnection data link, the bandwidth of the link is limited by the maximum negotiation rate of the link, the transmission efficiency is low, and the frequency band usage rate is high, so that interference is caused.
The transmission of a single data link is limited by the maximum negotiation of the link, real-time interference reduces the maximum negotiation rate of the link, influences the sending of data and the reduction of flow, and has the phenomena of poor experience and poor performance under high-speed limit transmission.
In a family, a business and an enterprise network, the access service of the network reaches hundreds of megabytes and even giga rate, in the MESH network networking, aiming at the scene situation that the bandwidth of a single wireless link is small and the bandwidth among networking multilinks is restricted, how to improve the transmission rate of the link among the networking is realized, so that the restriction of the rate factor of the single networking link is avoided, the flow and the performance experience of a user are improved, and the technical problem to be solved urgently by technical personnel in the field is solved.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a method for multi-band convergence of intelligent wireless networking.
The invention provides a method for multi-band convergence of intelligent wireless networking, which comprises the following steps:
s1, intercommunication and interconnection of multi-band MESH links;
s2, respectively summarizing neighbor table updating information, link quality statistical information and data flow statistical information to a flow scheduling decision module; the neighbor table is updated, and information of a plurality of frequency bands of neighbor points is acquired and sent to the flow scheduling decision module; link quality statistics, wherein link quality information is collected and sent to a flow scheduling decision module; counting data streams, wherein the statistical information of the current data streams is counted and sent to a stream scheduling decision module;
and S3, making a flow scheduling decision, wherein the flow scheduling decision module judges whether the requirement of the data flow decision migration forwarding is met, if the requirement of the data flow decision migration forwarding is met, the maximum data flow decision migration forwarding is carried out, and the step S2 is returned, otherwise, the step S2 is returned.
As a further improvement of the present invention, in step S2, the link quality statistics include the following procedures:
a1, start;
a2, timing time;
a3, calculating the average value of the sending time, the receiving time and the channel utilization rate;
a4, calculating the busy degree of the main frequency band;
a5, calculating the busy degree of the sub-frequency band;
a6, when the time point of the last set switching protection mark reaches the set condition, clearing the flag bit;
and A7, ending.
As a further improvement of the present invention, in step S2, the data flow statistics include: counting the maximum data flow on each frequency band, counting the frequency band quality, counting the state of each frequency band, maintaining a neighbor table, counting the number of MESH links established with the frequency bands of neighbor nodes, establishing connection with the frequency bands, counting the maximum data flow on each frequency band for sending the MESH data, triggering flow collection every time when a data packet comes, and sequencing flow tables at regular time.
As a further improvement of the present invention, the flow table sorting flow is as follows:
b1, start;
b2, judging whether the current frequency band flow table is full, if not, filling the current flow into the flow table and ending, if yes, entering the next step;
b3, judging whether the current flow is larger than the minimum flow in the flow table, if not, ending, if yes, replacing the minimum flow in the current flow table and ending.
As a further improvement of the present invention, in step S2, the neighbor table update includes: maintaining a neighbor table and transmitting a neighbor table data packet, wherein the maintaining of the neighbor table comprises: each MESH node maintains a neighbor table, and the neighbor table comprises the number of MESH links to the neighbor node and the MAC address of the next hop; the transmission of the neighbor table packet comprises: a MESH node broadcasts a PU frame to surrounding neighbor nodes periodically, the PU frame comprises a MAC address of br0 and a MAC address of a sending interface, and the neighbor nodes extract the MAC of br0 and the MAC of the sending interface after receiving the PU frame.
As a further improvement of the invention, the maintenance of the neighbor table comprises the following procedures:
c1, start;
c2, receiving a PU frame;
c3, acquiring the MAC address of br0 and the MAC address of a sending interface;
c4, acquiring the current receiving time and interface name;
c5, storing or updating in a neighbor table;
and C5, ending.
As a further improvement of the present invention, in step S3, the flow scheduling execution flow includes: firstly, judging whether a protection zone bit is switched, if the protection zone bit is switched, ending, if the protection zone bit is not switched, judging whether a main frequency band is busy, if the main frequency band is busy, transferring a stream to other idle frequency bands on the main frequency band, if the main frequency band is not busy, judging whether a secondary frequency band is busy, if the secondary frequency band is busy, moving the stream on the secondary frequency band to other idle frequency bands, and if the secondary frequency band is not busy, ending.
As a further improvement of the present invention, in step S3, the flow scheduling execution flow includes:
switching the primary interface to the secondary interface: the size of the flow table is N at present, the maximum flow in the flow table is tried to be transferred to each sub-frequency band from the maximum flow in the flow table, if the sub-frequency band meeting the condition exists, the maximum flow in the flow table is transferred to the frequency band meeting the condition, if the sub-frequency band does not exist, the second-order flow is tried, and polling is carried out in sequence until one flow is transferred or the flow table is traversed;
the secondary interface is busy and the flow is migrated to the other interface: and traversing the secondary frequency bands, and if the secondary frequency bands are in a busy state, switching back the largest one of the streams from the stream table of the secondary frequency bands to the main frequency band.
As a further improvement of the present invention, step S3 includes a flow scheduling execution flow, and the steps are as follows:
d1, judging whether the interface is marked, if so, judging whether the index of the data packet is the stream index to be switched, if not, entering the next step, if so, calling a kernel interface to set the interface index to be switched when the stream is distinguished, setting a switching protection mark and entering the next step;
d2, the configured identifier of the switching sending end is an identifier of the index number index;
d3, switching the next hop configured by the sending end to be the next hop of the index number;
d4, and finishing.
As a further improvement of the present invention, step S3 includes a primary interface switching secondary interface flow, and the steps are as follows:
e1, acquiring N MESH link connections at the same time;
e2, judging whether j is smaller than the maximum data flow, if not, ending, and if yes, entering the next step;
e3, finding the jth flow and its rate from the sorted flow tables;
e4, judging whether i is smaller than N, if not, increasing j by 1 and returning to the step E2, and if so, entering the next step;
e5, obtaining the frequency band quality of the established ith MESH link;
e6, judging whether the minimum sending available throughput is larger than the speed, if not, increasing 1 by i and returning to the step E4, and if so, entering the next step;
e7, setting the mark position as 1;
e8, recording the index of the current switched stream and the index value of the frequency band to be switched;
e9, end.
As a further improvement of the present invention, step S3 includes that the secondary interface flow is migrated to another interface flow, and the steps are as follows:
f1, checking the state of the next sub-frequency band;
f2, judging whether the secondary frequency band is busy, if the secondary frequency band is busy, entering the next step, if the secondary frequency band is not busy, judging whether the frequency band is traversed completely, if the frequency band is traversed completely, ending, and if the frequency band is not traversed completely, returning to the step F1;
f3, finding the largest flow from the sorted flow tables;
f4, setting the mark position to be 1;
f5, recording the ID of the current switched stream and the index value of the main frequency band;
f6, clearing the migrated flow in the flow table of the current frequency band;
f7, end.
The invention has the beneficial effects that: the traditional data transmission based on the multi-band MESH single path is promoted and optimized, and the bandwidth and the data volume of the limit link are greatly improved.
Drawings
FIG. 1 is a logic general diagram of a method for multi-band convergence in intelligent wireless networking according to the present invention.
Fig. 2 is a flow chart of main modules of the method for multi-band convergence in intelligent wireless networking of the invention.
FIG. 3 is a flow chart of link quality statistics of the method for multi-band convergence in intelligent wireless networking according to the present invention.
Fig. 4 is a flow chart illustrating a flow chart arranging procedure of a method for multi-band aggregation in an intelligent wireless networking system according to the present invention.
FIG. 5 is a flowchart of link quality determination of a method for multiband convergence in intelligent wireless networking according to the present invention.
FIG. 6 is a flow chart of the primary interface switching secondary interface of the method for multi-band convergence in intelligent wireless networking according to the present invention.
FIG. 7 is a flow chart of secondary interface flow migrating to other interfaces of the method for multi-band convergence in intelligent wireless networking according to the present invention.
FIG. 8 is a flow chart of neighbor table packet transmission in the method for multiband aggregation in intelligent wireless networking according to the present invention.
FIG. 9 is a flowchart of neighbor table maintenance in the method for multiband convergence in intelligent wireless networking according to the present invention.
Fig. 10 is a flow chart of flow scheduling execution of the method for multi-band convergence in intelligent wireless networking.
Detailed Description
The invention is further described with reference to the following description and embodiments in conjunction with the accompanying drawings.
As shown in the figure, the method for multi-band convergence of the intelligent wireless networking mainly comprises four parts, namely link quality statistics, neighbor table maintenance and updating, flow scheduling decision and flow statistics, wherein the link quality statistics, the neighbor table maintenance and updating, the flow statistics is given to flow decision information, and the flow decision determines partial migration and decision actions of how to migrate of a data flow according to feedback data information (see figure 1). The migration switching of the data stream is performed according to the self-traffic and the conditions of the neighboring nodes in the link aggregation, so as to achieve the aggregation effect of the total transmission data stream (see fig. 2).
1) Link quality statistics (fig. 3);
a) the transmission time (the time taken to transmit data in 1000 ms) is related to the negotiated rate, and the actual throughput and the transmission time are in a linear relationship:
actual throughput = negotiated rate (transmission time/1000), which may reflect the throughput occupied by its own transmission. Reflecting the capability of transmitting data in a certain frequency band;
b) the reception time (the time taken to transmit data in 1000 ms) is the same as the transmission time.
As shown in fig. 3, the specific flow of the link quality statistics is as follows:
a1, start;
a2, timing time;
a3, calculating the average value of the sending time, the receiving time and the channel utilization rate;
a4, calculating the busy degree of the main frequency band;
a5, calculating the busy degree of the sub-frequency band;
a6, when the time point of the last set switching protection mark reaches the set condition, clearing the flag bit;
and A7, finishing.
2) Flow statistics;
the maximum several streams in each frequency band are counted. And (4) counting the frequency band quality, and counting the state of each frequency band. And maintaining a neighbor table, counting the number of MESH links established with the frequency bands of neighbor nodes, establishing connection with the frequency bands, counting several streams with the maximum rate on each frequency band for sending MESH data, triggering stream collection every time when a data packet comes, and sequencing the flow table at regular time.
The following data were mainly counted:
the main frequency band stores several maximum streams transmitted by the main frequency band, and the secondary frequency band stores several maximum streams transferred to the interface of the main frequency band;
a) flow information of kernel statistics;
comprises the following steps: stream id, stream rate, original data stream index and migrated data stream index;
b) number of MESH links;
flow statistics process: and when the MESH data is sent, collecting the flow into a flow table of a corresponding frequency band, and sequencing the flow in the flow table every 1 s. The pre-sequencing process may not necessarily pick the largest of all flows.
As shown in fig. 4, the flow table sorting flow is as follows:
b1, start;
b2, judging whether the current frequency band flow table is full, if not, filling the current flow into the flow table and ending, if yes, entering the next step;
b3, judging whether the current flow is larger than the minimum flow in the flow table, if not, ending, if yes, replacing the minimum flow in the current flow table and ending.
3) Updating a neighbor table;
each MESH node maintains a neighbor table (fig. 9) containing the number of MESH links to the neighbor node (used in flow scheduling decisions) and the MAC address of the next hop (used in flow scheduling execution);
as shown in fig. 9, the maintenance of the neighbor table includes the following processes:
c1, start;
c2, receiving a PU frame;
c3, acquiring the MAC address of br0 and the MAC address of a sending interface;
c4, acquiring the current receiving time and interface name;
c5, storing or updating in the neighbor table;
and C5, ending.
A MESH node periodically broadcasts PU frames (fig. 8) to surrounding neighbor nodes, where the PU frames contain the MAC address of br0 and the MAC address of the sending interface. The neighbor receives the PU frame and extracts the MAC of br0 and the MAC of the transmitting interface.
4) Flow scheduling decisions (fig. 10);
when the main frequency band is busy, the decision is made as to which flow is switched to which idle frequency band. When the sub-band is busy, the decision is moved back to the main band for flow decision.
And (3) scheduling flow:
first, the switching protection flag bit is judged to switch the protection flag bit, if the flag bit is the switching protection flag bit, no processing is performed. If not, then judging whether the main frequency band is busy, if so, transferring a proper stream from the main frequency band to other idle frequency bands (if not, the stream is not transferred, and the priority of the frequency band is 5G first). If not busy, it starts to judge if the sub-band is busy, if busy, it moves the upper stream of the sub-band to other bands, if not busy, it does not process any treatment.
As shown in fig. 10, the flow scheduling execution flow includes:
d1, judging whether the interface is marked, if so, judging whether the index of the data packet is the stream index to be switched, if not, entering the next step, if so, calling a kernel interface to set the interface index to be switched when the stream is distinguished, setting a switching protection mark and entering the next step;
d2, the configured identifier of the switching sending end is an identifier of the index number index;
d3, switching the next hop configured by the sending end to be the next hop of the index number;
d4, and finishing.
Switching the primary interface to the secondary interface: (FIG. 6)
a) The flow table size is currently N (configurable), and the transition to each sub-band is attempted from the largest flow in the flow table, and if there are sub-bands satisfying the condition, the largest flow in the table is transitioned to the band satisfying the condition (traversing the sub-band priority, 5G priority). If not, the next largest flow is tried, and polling is carried out in sequence until one flow is transferred or the flow table is traversed;
b) the secondary interface is busy and the flow is migrated to the other interface: (FIG. 7)
The secondary frequency band is traversed (priority 5G takes precedence), and if any secondary frequency band is in a busy state, the largest flow is switched back to the main frequency band from the flow table of the secondary frequency band.
As shown in fig. 6, the primary interface switching secondary interface process includes:
e1, acquiring N MESH link connections at the same time;
e2, judging whether j is smaller than the maximum data flow, if not, ending, and if yes, entering the next step;
e3, finding the jth flow and its rate from the sorted flow tables;
e4, judging whether i is smaller than N, if not, increasing j by 1 and returning to the step E2, and if yes, entering the next step;
e5, obtaining the frequency band quality of the established MESH link of the ith item;
e6, judging whether the minimum sending available throughput is larger than the speed, if not, increasing 1 by i and returning to the step E4, and if so, entering the next step;
e7, setting the mark position as 1;
e8, recording the index of the current switched stream and the index value of the frequency band to be switched;
e9, end.
As shown in fig. 7, the process of migrating the secondary interface flow to other interfaces includes:
f1, checking the state of the next sub-frequency band;
f2, judging whether the sub frequency band is busy, if the sub frequency band is busy, entering the next step, if the sub frequency band is not busy, judging whether the frequency band is traversed, if the frequency band is traversed, ending, if the frequency band is not traversed, returning to the step F1;
f3, finding the largest flow from the sorted flow tables;
f4, setting the mark position to be 1;
f5, recording the ID of the current switched stream and the index value of the main frequency band;
f6, clearing the migrated flow in the flow table of the current frequency band;
f7, end.
A method for multi-band convergence of intelligent wireless networking comprises the following specific processes:
1. multi-band MESH link interworking interconnection
2. Obtaining information of a plurality of frequency bands of neighbor nodes to flow scheduling decision module
3. Collecting link quality information to a flow scheduling decision module
4. And counting the statistical information of the current data stream to a stream decision module.
5. The flow scheduling decision module decides the data flow to transfer and forward, if the flow transfer and forward requirement is met, the step 6 is carried out, otherwise, the step 2 is carried out
6. Maximum N (configurable) data stream migration forwarding
7. Go back to step 2.
For convenience of description, it is assumed that there are two devices in the MESH network, multiple networking (for example, networking with two devices) may be performed, where the device is an a device and a B device, the device has two 5GHz and 2.4G, one 5G operates over 100 channels, and one 5G operates between 48 and 100 channels, when the networking link of the two devices is 5GHz, two rates negotiate to 866Mbps, if only 433Mbps is possible due to distance and attenuation, then a link bandwidth greater than 433Mbps becomes a bottleneck, then transmission using another link of the 5G band becomes the most preferable, and two 5G bands are aggregated into one link to transmit data. May no longer be limited by a 5G rate transmission. At this time, the link transmitted by the device a to the device B is not one 5G, but two 5G bandwidths, if the two loads are high and reach a threshold, the 2.4G band links are also used for aggregation and superposition to perform link transmission, so that the bandwidth and data volume of the limit link can be greatly improved.
The invention provides a method for multi-band convergence of intelligent wireless networking, which promotes and optimizes the traditional multi-band MESH-based single path data transmission from the following aspects:
1. the transmission flow rate is improved by 100 to 200 percent compared with the limit transmission flow rate of a single path.
And 2, MESH link multi-path transmission.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (6)

1. A method for multi-band convergence in intelligent wireless networking is characterized by comprising the following steps:
s1, intercommunication and interconnection of multi-band MESH links;
s2, respectively summarizing neighbor table updating information, link quality statistical information and data flow statistical information to a flow scheduling decision module; the neighbor table is updated, and information of a plurality of frequency bands of neighbor points is acquired and sent to the flow scheduling decision module; link quality statistics, wherein link quality information is collected and sent to a flow scheduling decision module; counting data streams, wherein the statistical information of the current data streams is counted and sent to a stream scheduling decision module;
s3, flow scheduling decision, wherein the flow scheduling decision module judges whether the requirement of the data flow decision migration forwarding is met, if the requirement of the data flow decision migration forwarding is met, the maximum data flow decision migration forwarding is carried out, and the step S2 is returned, otherwise, the step S2 is returned;
in step S3, the flow scheduling execution flow includes: firstly, judging whether a protection zone bit is switched, if the protection zone bit is switched, ending, if the protection zone bit is not switched, judging whether a main frequency band is busy, if the main frequency band is busy, transferring a stream to other idle frequency bands on the main frequency band, if the main frequency band is not busy, judging whether a secondary frequency band is busy, if the secondary frequency band is busy, moving the stream on the secondary frequency band to other idle frequency bands, and if the secondary frequency band is not busy, ending;
in step S3, the flow scheduling execution flow includes:
switching the primary interface to the secondary interface: the size of the flow table is N at present, the maximum flow in the flow table is tried to be transferred to each sub-frequency band from the maximum flow in the flow table, if the sub-frequency band meeting the condition exists, the maximum flow in the flow table is transferred to the frequency band meeting the condition, if the sub-frequency band does not exist, the second-order flow is tried, and polling is carried out in sequence until one flow is transferred or the flow table is traversed;
the secondary interface is busy and the flow is migrated to the other interface: traversing the secondary frequency bands, and if any secondary frequency band is in a busy state, switching back the largest flow from a flow table of the secondary frequency band to the main frequency band;
the flow scheduling execution flow comprises the following steps:
d1, judging whether the interface is marked, if so, judging whether the index of the data packet is the stream index to be switched, if not, entering the next step, if so, calling a kernel interface to set the interface index to be switched when the stream is distinguished, setting a switching protection mark and entering the next step;
d2, the configured identifier of the switching sending end is an identifier of the index number index;
d3, switching the next hop configured by the sending end to be the next hop of the index number;
d4, ending;
the steps of the flow of switching the primary interface to the secondary interface are as follows:
e1, acquiring N MESH link connections at the same time;
e2, judging whether j is smaller than the maximum data flow, if not, ending, and if yes, entering the next step;
e3, finding the jth flow and the speed thereof from the sorted flow tables;
e4, judging whether i is smaller than N, if not, increasing j by 1 and returning to the step E2, and if so, entering the next step;
e5, obtaining the frequency band quality of the established ith MESH link;
e6, judging whether the minimum sending available throughput is larger than the speed, if not, increasing 1 by i and returning to the step E4, and if so, entering the next step;
e7, setting the mark position as 1;
e8, recording the index of the current switched stream and the index value of the frequency band to be switched;
e9, finishing;
step S3 includes the process of migrating the secondary interface flow to another interface, which includes the following steps:
f1, checking the state of the next sub-frequency band;
f2, judging whether the secondary frequency band is busy, if the secondary frequency band is busy, entering the next step, if the secondary frequency band is not busy, judging whether the frequency band is traversed completely, if the frequency band is traversed completely, ending, and if the frequency band is not traversed completely, returning to the step F1;
f3, finding the largest flow from the sorted flow tables;
f4, setting the mark position to be 1;
f5, recording the ID of the current switched stream and the index value of the main frequency band;
f6, clearing the migrated flow in the flow table of the current frequency band;
f7, end.
2. The method for intelligent wireless networking multi-band convergence according to claim 1, wherein: in step S2, the link quality statistics include the following procedures:
a1, start;
a2, timing time;
a3, calculating the average value of the sending time, the receiving time and the channel utilization rate;
a4, calculating the busy degree of the main frequency band;
a5, calculating the busy degree of the sub-frequency band;
a6, when the time point of the last set switching protection mark reaches the set condition, clearing the flag bit;
and A7, ending.
3. The method for intelligent wireless networking multi-band convergence according to claim 1, wherein: in step S2, the data flow statistics include: counting the maximum data flow on each frequency band, counting the frequency band quality, counting the state of each frequency band, maintaining a neighbor table, counting the number of MESH links established with the frequency bands of neighbor nodes, establishing connection with the frequency bands, counting the maximum data flow on each frequency band for sending the MESH data, triggering flow collection every time when a data packet comes, and sequencing flow tables at regular time.
4. The method for intelligent wireless networking multi-band convergence according to claim 3, wherein: the flow table ordering flow is as follows:
b1, starting;
b2, judging whether the current frequency band flow table is full, if not, filling the current flow into the flow table and ending, if yes, entering the next step;
b3, judging whether the current flow is larger than the minimum flow in the flow table, if not, ending, if yes, replacing the minimum flow in the current flow table and ending.
5. The method for multiband convergence of intelligent wireless networking according to claim 1, wherein: in step S2, the neighbor table update includes: maintaining a neighbor table and transmitting a neighbor table data packet, wherein the maintaining of the neighbor table comprises: each MESH node maintains a neighbor table, and the neighbor table comprises the number of MESH links to the neighbor node and the MAC address of the next hop; the transmission of the neighbor table packet comprises: a MESH node broadcasts a PU frame to surrounding neighbor nodes periodically, the PU frame comprises a MAC address of br0 and a MAC address of a sending interface, and the neighbor nodes extract the MAC of br0 and the MAC of the sending interface after receiving the PU frame.
6. The method for intelligent wireless networking multi-band convergence according to claim 5, wherein: the maintenance of the neighbor table includes the following processes:
c1, start;
c2, receiving a PU frame;
c3, acquiring the MAC address of br0 and the MAC address of a sending interface;
c4, acquiring the current receiving time and interface name;
c5, storing or updating in the neighbor table;
and C5, ending.
CN202010758796.2A 2020-07-31 2020-07-31 Multi-band convergence method for intelligent wireless networking Active CN111741499B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010758796.2A CN111741499B (en) 2020-07-31 2020-07-31 Multi-band convergence method for intelligent wireless networking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010758796.2A CN111741499B (en) 2020-07-31 2020-07-31 Multi-band convergence method for intelligent wireless networking

Publications (2)

Publication Number Publication Date
CN111741499A CN111741499A (en) 2020-10-02
CN111741499B true CN111741499B (en) 2022-06-03

Family

ID=72656794

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010758796.2A Active CN111741499B (en) 2020-07-31 2020-07-31 Multi-band convergence method for intelligent wireless networking

Country Status (1)

Country Link
CN (1) CN111741499B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112702727B (en) * 2020-11-25 2023-03-24 杭州萤石软件有限公司 Data transmission method, equipment and system of multi-frequency wireless mesh network
CN112996045B (en) * 2021-02-04 2022-11-29 深圳市吉祥腾达科技有限公司 Method and system for forwarding dimension link packet of mesh multi-frequency networking path
CN113923744A (en) * 2021-09-29 2022-01-11 天翼数字生活科技有限公司 Method and system for wireless cross-band backhaul

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223671A (en) * 2010-04-15 2011-10-19 华为技术有限公司 Method and communication equipment for data transmission in wireless multihop network
CN108696432A (en) * 2018-05-31 2018-10-23 广东工业大学 A kind of SDN wireless Mesh netword method for routing of business flow priority
CN110087268A (en) * 2019-04-30 2019-08-02 上海寰创通信科技股份有限公司 A kind of based on WLAN route switching method

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100254312A1 (en) * 2008-12-11 2010-10-07 Adapt4, Llc Dynamically transformed channel set routing
CN103179696B (en) * 2013-03-15 2016-03-02 北京邮电大学 Based on the network system of cognitive radio and network-building method in intelligent grid
US10575240B2 (en) * 2017-09-12 2020-02-25 Sony Corporation Multi-band millimeter wave network discovery
CN110856231B (en) * 2019-11-20 2021-11-09 北京邮电大学 Multi-data stream transmission method based on multi-hop network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223671A (en) * 2010-04-15 2011-10-19 华为技术有限公司 Method and communication equipment for data transmission in wireless multihop network
CN108696432A (en) * 2018-05-31 2018-10-23 广东工业大学 A kind of SDN wireless Mesh netword method for routing of business flow priority
CN110087268A (en) * 2019-04-30 2019-08-02 上海寰创通信科技股份有限公司 A kind of based on WLAN route switching method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
多信道无线Mesh 网络路由机制;刘宴兵;《小型微型计算机系统》;20120229;全文 *

Also Published As

Publication number Publication date
CN111741499A (en) 2020-10-02

Similar Documents

Publication Publication Date Title
CN111741499B (en) Multi-band convergence method for intelligent wireless networking
CN101411134B (en) Memory management for high speed media access control
WO2020258746A1 (en) Data transmission processing method, device, and communication apparatus
CN102971996A (en) Switching node with load balancing of bursts of packets
WO2020073971A1 (en) Data transmission method and apparatus for wireless backhaul network
CN1682502A (en) Apparatus, system and method for the transmission of data with different QoS attributes
CN101305565A (en) Packet routing in a wireless communications environment
CN104618959B (en) A kind of method and its system for realizing aeronautical Ad hoc networks MAC protocol
EP3304987B1 (en) Multipoint radio link control (rlc) coordinator for loosely coordinated multipoint communications
CN102905319A (en) Method and system for data flow distribution
CN110944358A (en) Data transmission method and device
CN102143589B (en) Network resource scheduling method in heterogeneous network and wireless resource controller
CN106793174B (en) X2 link optimization method and device
CN106131914B (en) Service request processing method and processing device
CN107959956A (en) A kind of WIA-PA network packet aggregation method based on radio channel state
Bonald et al. Scheduling network traffic
CN111756557B (en) Data transmission method and device
CN103179674B (en) A kind of user's Dynamic Packet method in Wireless Heterogeneous Networks system
Aissa et al. Dynamic spectrum hole management in cognitive radio
CN110493822A (en) Point-to-multipoint delivery device and system
Liu et al. Flow scheduling with low fronthaul delay for NGFI in C-RAN
CN109379646B (en) Passive optical network system and communication method thereof
CN114339830B (en) Topology management balanced scheduling self-adaptive caching scheme
US20240015528A1 (en) Hierarchical Proxy Deployment Method
US20180115920A1 (en) Ethernet frames encapsulation within cpri basic frames

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant