CN102149161A - Hierarchical and regular mesh network routing method - Google Patents
Hierarchical and regular mesh network routing method Download PDFInfo
- Publication number
- CN102149161A CN102149161A CN2011100252846A CN201110025284A CN102149161A CN 102149161 A CN102149161 A CN 102149161A CN 2011100252846 A CN2011100252846 A CN 2011100252846A CN 201110025284 A CN201110025284 A CN 201110025284A CN 102149161 A CN102149161 A CN 102149161A
- Authority
- CN
- China
- Prior art keywords
- node
- district
- sub
- network
- mesh network
- 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
Links
Images
Classifications
-
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a hierarchical and regular mesh network routing method in the technical field of communications, which comprises the steps as follows: routing on a mesh network is realized by building a hierarchical and regular network topology structure; the hierarchical and regular network topology structure consists of the actual network nodes of a pyramid topology; a mesh network of a plane structure is firstly formed by the actual network nodes; then regular virtual plot topologies are formed by a valid topology control strategy; the virtual plot consists of actual network entities; under the hierarchical and regular network topology structure, a comprehensive link quality assessment index is adopted to describe the quality of a link between the virtual plots in the network as well as between the actual nodes; and the mesh network routing realizes the adaptation of the QoS (quality of service) demands and protocol and path quality by adopting a routing protocol based on geographical positions and link states. The hierarchical and regular mesh network routing method has the obvious effects of improving the adaptation capacity of the mesh network routing for channels and services, the fault-tolerance and load balancing of the mesh network and the QoS performance of the services.
Description
Technical field
The present invention relates to communication technical field, particularly relate to the wireless mesh network routing mechanism.
Background technology
Radio communication possesses fast network and launches, supports advantages such as mobile or nomadic aspect networking.Yet with respect to wire message way, the maximum characteristics of wireless (moving) channel are exactly that its channel becomes when being, and wire message way is relatively stable.Because factors such as the time variation of the mobility of radio node and wireless channel and interference, make big and reliability Radio Link of the change in topology of wireless network be lower than wire link.The wireless mesh network Routing Protocol has been used for reference in recent years the achievement in research to Ad hoc network route, but the target of Adhoc network routing protocol generally is in order to adapt to fast-changing many topologys, with the criterion the most of criterion such as short jumping figure.As: DSR, AODV etc. use the shortest jumping figure as the Path selection foundation.ABR etc. adopt path length effective time as the routing standard when selecting the path.These single yardsticks can not reflect the quality condition of Radio Link fully, and especially in the multichannel environment, the route that single criterion is selected is not necessarily optimum.
Secondly, the Routing Protocol of existing wireless mesh network mostly is single footpath route agreement greatly, and the multipath route is the focus in the current research.In the mesh network, use single footpath route agreement not only to take place congested or link can not be reselected suitable path when disconnecting well, nor can when underloading, make full use of resource at network.From the angle of business, dissimilar service needed takies different bandwidth, and the QoS differences such as time delay that require, and the path of different link-qualities need be provided for different business.The packet of different kinds of business sends on same paths all if destination node is identical, when certain bar link congestion or disconnection, all data that send by this link just all must be sent by new path, just caused the instability at networking, and Business Stream is not assigned on the available resources rationally and effectively, cause that the subnetwork resource excessively uses, and other parts are used fully.Obviously, single footpath route agreement can not make full use of Internet resources, avoids congestion link, reach NLB, and can't satisfy the QoS demand of different kinds of business.
On the other hand, link-state routing protocol based on topology information can be by the evaluation to link-quality, provide and have the path that QoS ensures, but route maintenance can need constantly be carried out because of the inefficacy of one or several node in the path, mobile often interruption in the path end to end of its foundation.For Routing Protocol based on geographical location information, changes of topology structure is less to the influence of route, but compare routing mechanism based on part or global Topological Structure information, can only transmit packet according to positional information that close on or destination node based on the geographical position routing mechanism, and can't describe the path that it is set up with cost, thereby can't provide QoS to ensure business.
In sum: the Routing Protocol of existing wireless mesh network adopts single evaluation index to weigh the link-quality of a link, and still unresolved effective network source is distributed and utilized, and the QoS performance.
Summary of the invention
Technical problem to be solved by this invention is: overcome the problem of the link-quality that single link-quality evaluation index can't a link of thoroughly evaluating, solve the problem that the single path agreement can not rationally be utilized Internet resources; Solve the path failure of link-state routing protocol and the professional adaptive problem of different QoS requirements.
The present invention solves the problems of the technologies described above the technical scheme that is adopted to be: the network topology structure of the rule by making up a kind of stratification, and under this topological structure, adopt comprehensive link-quality evaluation index, calculate many paths that arrive the purpose sub-district of different link-qualities, and introduce fault-tolerant Routing Protocol, thereby the business of realization different QoS requirements and agreement and path is adaptive based on geographical location information; It is characterized in that: by by effective topological control strategy, and constitute a kind of method for routing of level regularization mesh network, may further comprise the steps based on Link State and geographical location information:
A, the effective topological control strategy of employing make the virtual stratification topological structure of wireless mesh network formation rule.
B, based on the virtual stratification wireless mesh network of A step, adopt comprehensive link-quality evaluation index to estimate the quality of link, obtain the LSD of the whole network unanimity by hello packet, present node obtains to arrive the multipath of the different link-qualities of purpose sub-district on this basis.
C, under the regular virtual topology of A step, obtain the geographical location information of network others node by hello packet, employing selects next redirect to send out the sub-district based on the fault-tolerant Routing Protocol of geographical location information according to a kind of mechanism based on angle, up to packet being sent to the purpose sub-district.
In the described steps A, the wireless mesh network method that forms original planar structure is: any node is by periodically sending explore frame detects whether there is the constructed network of other node in its frequency coverage, if any then directly adding this network, do not have and then it is set up a new network as start node, wait for that then other node inserts this network; After all nodes all add this network, just formed the wireless mesh network of original planar structure, and the transmission of beginning Business Stream, its flow process is as shown in Figure 1.
In the described steps A, in the transmission course of Business Stream, form this network all nodes by to the source address self study of Business Stream, set up one and be used for transmitting of primary data forwarding, form a plurality of virtual subdistricts by effective topological control strategy on this basis then, and comprise a plurality of actual nodes in each virtual subdistrict again, as shown in Figure 2.
In the described steps A, adopting the virtual topological structure of the rule of effective topological control strategy formation, is that the node division that its geographical position is close becomes the sub-district, and all nodes in the sub-district are formed a virtual subdistrict, and the virtual subdistrict structure as shown in Figure 3.The direct communication mutually of the node of each virtual subdistrict inside, and realize multi-hop communication between the interior nodes of different virtual sub-district, in this process, node will be by the source address self study process to Business Stream, sets up second and is used for transmitting of data forwarding in the sub-district.
Among the described step B, the reliability of the port by weighing single link and the bandwidth of link, the quality that factors such as the error rate, data burst rate, packet number of retransmissions, security of system, routing stability, energy are come this link-quality of overall merit.
Among the described step B, the all-network node by obtain each adjacent node send carry and these neighbours between the hello packet of information such as link-quality index, adjacent node ID and adjacent node place virtual subdistrict ID of link, at the whole network intercycle inundation.
Among the described step B, for making LSD reach the synchronous of the whole network, the LSD of node has two kinds of update modes, and the one, periodically send hello packet by node, upgrade and the maintenance link slip condition database; The 2nd, when node deviated from network or link failure were arranged in network, node sent hello packet immediately, and the state change information of topology is sent to other node in the network.Hello packet inundation process as shown in Figure 4.
Among the described step B, solve cell-of-origin S multipath finding method in the D of purpose sub-district and be: at first obtain by cell-of-origin S to the shortest path information of purpose sub-district D and that this information is deposited into multipath is concentrated by the dijkstra method.Other all nodes except that source node and destination node in the set of this multipath of deletion in the virtual topology figure of the whole network then obtain upgrading shortest path information under the topological structure condition by the dijkstra method again, and this information is concentrated to multipath.Repeat above-mentioned steps, up to all independent pathway information of acquisition.
Among the described step B, node obtains comprising information such as purpose sub-district ID, next jumping sub-district ID, cost by obtaining the multipath information that arrives the purpose sub-district, form the routing table that is used for the multi-hop cell communication of node, and then can obtain to be used for the route forwarding table that next-hop node is transmitted by this routing table.
Among the described step C, node obtains geographical coordinate information such as its present located longitude and latitude by the GPS positioner, and will carry in the hello packet of this information at the whole network inundation.
Among the described step C, calculate current area and purpose sub-district and and other adjacent cell between formed angle theta (as shown in Figure 5), the neighbor cell of θ angle minimum is sent out sub-district (as shown in Figure 6) as next redirect.
Among the described step C, when node runs into maximum non-concave erea when (as shown in Figure 7) in the process of forwarding data, node at first selects dextrorotation (as shown in Figure 8) to walk around this maximum non-concave erea, jump the sub-district if can find next smoothly, then Business Stream is passed to this sub-district, when can not find next jumping sub-district on the dextrorotation direction, selects left hand direction to select next to jump sub-district, if can find next to jump the sub-district smoothly, then Business Stream is passed to this sub-district.When node all can not find next when jumping sub-district in left-handed and dextrorotation direction, will give this packet rollback last one to jump the sub-district, then go up one and jump other next jumping sub-district of cell selecting and transmit.When the life span field of packet reduces to 0, abandon this packet.
Beneficial effect of the present invention is: the method for routing that has proposed a kind of level regularization mesh network, by wireless mesh network being carried out effectively topology control, the virtual hierarchical structure of formation rule, and the Routing Protocol of fusion position-based and Link State, improved channel in the wireless network and professional adaptation ability, effectively raised fault-tolerant, the load balancing and the professional QoS performance of wireless me sh network.
Description of drawings
Fig. 1 is the formation flow chart of mesh network
Fig. 2 is virtual stratification topological structure
Fig. 3 is the virtual subdistrict schematic diagram
Fig. 4 is a node inundation hello packet schematic diagram
Fig. 5 is by become θ angle schematic diagram with neighbor cell
Fig. 6 jumps the cell selecting schematic diagram for next
Fig. 7 is maximum non-concave erea schematic diagram
Next jumps cell selecting schematic diagram to Fig. 8 when running into maximum non-concave erea
Fig. 9 is the whole network node inundation hello packet schematic diagram
Figure 10 is for forming the virtual topology schematic diagram
Figure 11 obtains to arrive the schematic diagram of purpose sub-district multipath for node
Embodiment
With embodiment the present invention is described in further detail with reference to the accompanying drawings below:
Basic ideas of the present invention are as follows: the wireless mesh network that node is formed is through the virtual hierarchical structure of effective topological control strategy formation rule, select the Routing Protocol of position-based or Link State then according to the QoS demand of different kinds of business, packet is sent to destination node.
1. the Routing Protocol of Link State
As shown in Figure 9, all nodes of the whole network periodically send hello packet, and hello packet is inundation in the scope of the whole network.When node b receives the hello packet that node on every side starts, and when comprising the node ID of oneself in the message, will set up neighborhood, this node is joined in the neighbor table with this node.Afterwards, will carry the information relevant in the hello packet that starts by node b with these neighbours.
Node b sets up LSD by the hello packet that other node of reception the whole network is sent, and this database upgrades by the cycle and triggers the hello packet that upgrades transmission and reaches the synchronous of the whole network.
On the basis of LSD, node b will obtain the cum rights virtual topology figure (as shown in figure 10) of the whole network, constructing with own sub-district of living in by multiple dijkstra algorithm is the mulitpath (as shown in figure 11) of the arrival destination node place virtual subdistrict 3 in source, just obtain the multipath routing table then, comprised the path of many different link-qualities that arrive same purpose sub-district in this table.
At this moment, when node b has the business of certain QoS demand such as speech to produce, will search the multipath routing table, select to meet the path (promptly in routing table, having found corresponding next to jump sub-district) of QoS demand.
2. based on the Routing Protocol in geographical position
(a) as shown in Figure 5, certain actual node in the virtual subdistrict S has broadcasting etc. lower or do not require that the business of types such as QoS guarantee will send to purpose sub-district D to qos requirement, and then at first whether testing goal sub-district D is the neighbor cell of sub-district S.
(b) when finding that purpose sub-district D is not its neighbor cell, with regard to calculation plot S and purpose sub-district D and and other neighbor cell between formed angle theta, as shown in Figure 6, the neighbor cell a of selection θ angle minimum sends out the sub-district as next redirect.
(c) as shown in Figure 8, when dummy node a sends packet, send when running into maximum non-concave erea, preferentially select the sub-district that the purpose direction takes over (if do not have, the sub-district of the direction of then selecting to take back, selected the sub-district b that takes among Fig. 8), packet is sent to this sub-district.
(d) other nodes will repeat above-mentioned steps then, know packet is sent to the purpose sub-district.After arriving the purpose sub-district, packet will directly be jumped communication by one in the sub-district and will be sent to destination node.
In addition, except adaptation does not have the business demand of QoS guarantee, when the multipath routing table of node lost efficacy, also will directly initiate Routing Protocol based on the geographical position.
The invention provides a kind of method for routing of level regularization mesh network, by controlling to wireless mesh network is effectively topological, the virtual hierarchical structure of formation rule, and the Routing Protocol of fusion position-based and Link State, realize channel in the wireless network and professional adaptive, realize fault-tolerant, the load balancing and the raising QoS performance of wireless mesh network.
Claims (12)
1. the present invention is by the network topology structure of the rule of a kind of stratification of structure, and under this topological structure, adopt comprehensive link-quality evaluation index, calculate many paths that arrive the purpose sub-district of different link-qualities, and introduce fault-tolerant Routing Protocol, thereby the business of realization different QoS requirements and agreement and path is adaptive based on geographical location information; It is characterized in that: by by effective topological control strategy, and constitute a kind of method for routing of level regularization mesh network, may further comprise the steps based on Link State and geographical location information:
A, the effective topological control strategy of employing make the virtual stratification topological structure of wireless mesh network formation rule.
B, based on the virtual stratification wireless mesh network of A step, adopt comprehensive link-quality evaluation index to estimate the quality of link, obtain the LSD of the whole network unanimity by hello packet, present node obtains to arrive the multipath of the different link-qualities of purpose sub-district on this basis.
C, under the regular virtual topology of A step, obtain the geographical location information of network others node by hello packet, employing selects next redirect to send out the sub-district based on the fault-tolerant Routing Protocol of geographical location information according to a kind of mechanism based on angle, up to packet being sent to the purpose sub-district.
2. level regularization mesh network route method according to claim 1, it is characterized in that: in the described steps A, the wireless mesh network method that forms original planar structure is: any node is by periodically sending explore frame detects whether there is the constructed network of other node in its frequency coverage, if any then directly adding this network, do not have and then it is set up a new network as start node, wait for that then other node inserts this network; After all nodes all add this network, just formed the wireless mesh network of original planar structure, and the transmission of beginning Business Stream.
3. level regularization mesh network route method according to claim 1, it is characterized in that: in the described steps A, in the transmission course of Business Stream, form this network all nodes by to the source address self study of Business Stream, set up one and be used for transmitting of primary data forwarding, form a plurality of virtual subdistricts by effective topological control strategy on this basis then, and comprise a plurality of actual nodes again in each virtual subdistrict.
4. level regularization mesh network route method according to claim 1, it is characterized in that: in the described steps A, in the described steps A, adopt the virtual topological structure of the rule of effective topological control strategy formation, be that the node division that its geographical position is close becomes the sub-district, all nodes in the sub-district are formed a virtual subdistrict.The direct communication mutually of the node of each virtual subdistrict inside, and realize multi-hop communication between the interior nodes of different virtual sub-district, in this process, node will be by the source address self study process to Business Stream, sets up second and is used for transmitting of data forwarding in the sub-district.
5. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step B, the reliability of the port by weighing single link and the bandwidth of link, the quality that factors such as the error rate, data burst rate, packet number of retransmissions, security of system, routing stability, energy are come this link-quality of overall merit.
6. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step B, the all-network node by obtain each adjacent node send carry and these neighbours between the hello packet of information such as link-quality index, adjacent node ID and adjacent node place virtual subdistrict ID of link, at the whole network intercycle inundation.
7. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step B, for making LSD reach the synchronous of the whole network, the LSD of node has two kinds of update modes, the one, periodically send hello packet by node, upgrade and the maintenance link slip condition database; The 2nd, when node deviated from network or link failure were arranged in network, node sent hello packet immediately, and the state change information of topology is sent to other node in the network.
8. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step B, solve cell-of-origin S multipath finding method in the D of purpose sub-district and be: at first obtain by cell-of-origin S to the shortest path information of purpose sub-district D and that this information is deposited into multipath is concentrated by the dijkstra method.Other all nodes except that source node and destination node in the set of this multipath of deletion in the virtual topology figure of the whole network then obtain upgrading shortest path information under the topological structure condition by the dijkstra method again, and this information is concentrated to multipath.Repeat above-mentioned steps, up to all independent pathway information of acquisition.
9. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step B, node obtains comprising information such as purpose sub-district ID, next jumping sub-district ID, cost by obtaining the multipath information that arrives the purpose sub-district, form the routing table that is used for the multi-hop cell communication of node, and then can obtain to be used for the route forwarding table that next-hop node is transmitted by this routing table.
10. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step C, node obtains geographical coordinate information such as its present located longitude and latitude by the GPS positioner, and will carry in the hello packet of this information at the whole network inundation.
11. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step C, calculate current area and purpose sub-district and and other adjacent cell between formed angle theta, the neighbor cell of θ angle minimum is sent out the sub-district as next redirect.
12. level regularization mesh network route method according to claim 1, it is characterized in that: among the described step C, when node runs into maximum non-concave erea in the process of forwarding data, node at first selects dextrorotation to walk around this maximum non-concave erea, jump the sub-district if can find next smoothly, then Business Stream is passed to this sub-district, when on the dextrorotation direction, can not find next jumping sub-district, select left hand direction to select next to jump the sub-district, if can find next to jump the sub-district smoothly, then Business Stream is passed to this sub-district.When node all can not find next when jumping sub-district in left-handed and dextrorotation direction, will give this packet rollback last one to jump the sub-district, then go up one and jump other next jumping sub-district of cell selecting and transmit.When the life span field of packet reduces to 0, abandon this packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100252846A CN102149161A (en) | 2011-01-24 | 2011-01-24 | Hierarchical and regular mesh network routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100252846A CN102149161A (en) | 2011-01-24 | 2011-01-24 | Hierarchical and regular mesh network routing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102149161A true CN102149161A (en) | 2011-08-10 |
Family
ID=44423089
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100252846A Pending CN102149161A (en) | 2011-01-24 | 2011-01-24 | Hierarchical and regular mesh network routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102149161A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102548034A (en) * | 2011-12-26 | 2012-07-04 | 哈尔滨工业大学 | Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure |
| US20140362700A1 (en) * | 2013-06-05 | 2014-12-11 | Futurewei Technologies, Inc. | System and Method for Managing a Wireless Network |
| US9210047B2 (en) | 2012-01-11 | 2015-12-08 | Huawei Technologies Co., Ltd. | Method and apparatus for presenting network path |
| CN105450524A (en) * | 2015-12-08 | 2016-03-30 | 北京飞讯数码科技有限公司 | Media forwarding routing optimization algorithm |
| CN105722181A (en) * | 2016-04-12 | 2016-06-29 | 江苏中科羿链通信技术有限公司 | Method for obtaining neighbor node information in wireless chained multi-hop network |
| CN107204919A (en) * | 2017-07-06 | 2017-09-26 | 中国科学技术大学 | A kind of edge through street based on POF by with caching system and method |
| CN109089219A (en) * | 2018-06-08 | 2018-12-25 | 国网河北省电力有限公司石家庄供电分公司 | The automobile-used inspection communication means of high-tension cable inspection |
| CN109379739A (en) * | 2018-09-28 | 2019-02-22 | 嘉兴学院 | A kind of credible cooperating service method of sea wireless Mesh netword |
| CN111479305A (en) * | 2020-04-16 | 2020-07-31 | 西安交通大学 | TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna |
| CN114338513A (en) * | 2021-12-24 | 2022-04-12 | 南京邮电大学 | Wireless multi-hop routing quick decision-making method and system based on cross-layer information perception |
| CN116419364A (en) * | 2023-06-09 | 2023-07-11 | 杭州粒合信息科技有限公司 | Wi-SUN network and extension method through wired virtual radio frequency transmission |
-
2011
- 2011-01-24 CN CN2011100252846A patent/CN102149161A/en active Pending
Non-Patent Citations (3)
| Title |
|---|
| PHAM NGOC THAI等: "HIERARCHICAL ROUTING IN WIRELESS MESH NETWORK", 《ADVANCED COMMUNICATION TECHNOLOGY,THE 9TH INTERNATIONAL CONFERENCE》 * |
| 胡致远等: "无线Mesh网络规则拓扑规则结构与容量研究", 《计算机应用研究》 * |
| 胡致远等: "虚拟层次化无线mesh网络信道分配策略", 《北京航空航天大学学报》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102548034A (en) * | 2011-12-26 | 2012-07-04 | 哈尔滨工业大学 | Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure |
| CN102548034B (en) * | 2011-12-26 | 2015-04-08 | 哈尔滨工业大学 | Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure |
| US9210047B2 (en) | 2012-01-11 | 2015-12-08 | Huawei Technologies Co., Ltd. | Method and apparatus for presenting network path |
| US20140362700A1 (en) * | 2013-06-05 | 2014-12-11 | Futurewei Technologies, Inc. | System and Method for Managing a Wireless Network |
| US9532266B2 (en) * | 2013-06-05 | 2016-12-27 | Huawei Technologies Co., Ltd. | Systems and methods for managing a wireless network |
| US10506612B2 (en) | 2013-06-05 | 2019-12-10 | Huawei Technologies Co., Ltd. | Methods and device for authorization between a customer device and connectivity manager |
| CN105450524A (en) * | 2015-12-08 | 2016-03-30 | 北京飞讯数码科技有限公司 | Media forwarding routing optimization algorithm |
| CN105450524B (en) * | 2015-12-08 | 2020-06-09 | 北京飞讯数码科技有限公司 | Method for optimizing and calculating media forwarding route |
| CN105722181B (en) * | 2016-04-12 | 2019-03-29 | 江苏中科羿链通信技术有限公司 | The method of information of neighbor nodes is obtained in wireless chain multihop network |
| CN105722181A (en) * | 2016-04-12 | 2016-06-29 | 江苏中科羿链通信技术有限公司 | Method for obtaining neighbor node information in wireless chained multi-hop network |
| CN107204919A (en) * | 2017-07-06 | 2017-09-26 | 中国科学技术大学 | A kind of edge through street based on POF by with caching system and method |
| CN107204919B (en) * | 2017-07-06 | 2020-01-03 | 中国科学技术大学 | POF-based edge fast routing and caching system and method |
| CN109089219A (en) * | 2018-06-08 | 2018-12-25 | 国网河北省电力有限公司石家庄供电分公司 | The automobile-used inspection communication means of high-tension cable inspection |
| CN109089219B (en) * | 2018-06-08 | 2020-07-28 | 国网河北省电力有限公司石家庄供电分公司 | Patrol communication method for high-voltage cable patrol vehicle |
| CN109379739A (en) * | 2018-09-28 | 2019-02-22 | 嘉兴学院 | A kind of credible cooperating service method of sea wireless Mesh netword |
| CN111479305A (en) * | 2020-04-16 | 2020-07-31 | 西安交通大学 | TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna |
| CN114338513A (en) * | 2021-12-24 | 2022-04-12 | 南京邮电大学 | Wireless multi-hop routing quick decision-making method and system based on cross-layer information perception |
| CN114338513B (en) * | 2021-12-24 | 2024-07-23 | 南京邮电大学 | Wireless multi-hop routing fast decision method and system based on cross-layer information perception |
| CN116419364A (en) * | 2023-06-09 | 2023-07-11 | 杭州粒合信息科技有限公司 | Wi-SUN network and extension method through wired virtual radio frequency transmission |
| CN116419364B (en) * | 2023-06-09 | 2023-08-29 | 杭州粒合信息科技有限公司 | Wi-SUN network and extension method through wired virtual radio frequency transmission |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102149161A (en) | Hierarchical and regular mesh network routing method | |
| Wang et al. | CORMAN: A novel cooperative opportunistic routing scheme in mobile ad hoc networks | |
| US8693345B2 (en) | Dynamic management of wireless network topology with diverse traffic flows | |
| Roy et al. | Ant colony based routing for mobile ad-hoc networks towards improved quality of services | |
| US10009092B2 (en) | Mobile ad-hoc network with satellite node | |
| CN101711048B (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| Bitam et al. | QoS swarm bee routing protocol for vehicular ad hoc networks | |
| CN108989223A (en) | A kind of satellite routing algorithm under strong link constraints | |
| US20110164546A1 (en) | Vehicular mobility vector based routing | |
| CN101415248A (en) | Method for establishing layer-striding dynamic source route protocol based on load balance | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| Seppänen et al. | Multipath routing for mmWave WMN backhaul | |
| So et al. | Routing and channel assignment in multi-channel multi-hop wireless networks with single network interface | |
| Miao et al. | Study on research challenges and optimization for internetworking of hybrid MANET and satellite networks | |
| Braun et al. | Multihop wireless networks | |
| Mir et al. | Infrastructure-assisted joint power adaptation and routing for heterogeneous vehicular networks | |
| Mourya et al. | Managing congestion control in mobile ad-hoc network using mobile agents | |
| Fan et al. | A load-balanced route selection for network coding in wireless mesh networks | |
| Selvakanmani et al. | Overview and literature survey on routing protocols for mobile cognitive radio ad hoc networks | |
| Sharma et al. | Bandwidth Constrained Routing of Multimedia Trafficover Hybrid MANETs using Ant Colony Optimization | |
| So et al. | Load-balancing routing in multichannel hybrid wireless networks with single network interface | |
| KR100992485B1 (en) | Wireless mesh network apparatus and routing method using by it | |
| Bravo-Torres et al. | An efficient combination of topological and geographical routing for VANETs on top of a virtualization layer | |
| Zhu et al. | A congestion and interference aware routing metric for Wireless Mesh networks | |
| Toham et al. | OLSR enhancement for multi-interface multi-channel ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110810 |