CN113347088B - Improved wireless self-organizing network multilink routing method - Google Patents
Improved wireless self-organizing network multilink routing method Download PDFInfo
- Publication number
- CN113347088B CN113347088B CN202110709118.1A CN202110709118A CN113347088B CN 113347088 B CN113347088 B CN 113347088B CN 202110709118 A CN202110709118 A CN 202110709118A CN 113347088 B CN113347088 B CN 113347088B
- Authority
- CN
- China
- Prior art keywords
- routing
- module
- node
- route
- routing information
- 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
Links
Images
Classifications
-
- 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/24—Multipath
-
- 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/22—Alternate routing
-
- 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/70—Routing based on monitoring results
-
- 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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an improved wireless self-organizing network multilink routing method, which comprises the following steps: 1) a route initialization module, a route information processing module, an added route module, a route information updating module, a timeliness check module, a link monitoring module, a link switching module and a route information broadcasting module are arranged in each node of the wireless self-organizing network; 2) initializing a local routing table, inputting current node information into the local routing table, broadcasting, and checking whether a route is out of date; 3) extracting a source node and a host node from routing information sent by a neighbor node, finding N shortest-distance routes of the source node to the host node, sequencing according to the distance, selecting an optimal route as a main route, and taking the rest N-1 routes as standby routes; then updating the routing table information and broadcasting the routing information; 4) and when the packet loss number of the node reaches a preset upper limit, finding out a route from the standby routes for link switching.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to an improved Ad-hoc network multilink routing method based on a Bellman-Ford algorithm.
Background
The wireless Ad-hoc network (Ad-hoc network) has the characteristics of no center and self-organization, and nodes in the network dynamically establish connection with other nodes. Therefore, the emphasis in implementing data transmission in Ad-hoc networks is on how to find an available and reliable transmission link between a source node and a sink node, and for this routing problem, the currently existing protocols and algorithms are roughly classified into the following categories:
conventional routing protocols: the AODV protocol is a typical protocol in an Ad-Hoc network, and the protocol is mainly characterized by generating routes according to needs. The protocol has a simple structure and is easy to implement, but when the topology of the nodes in the network changes or the channel state changes, the efficiency of the AODV protocol in the process of re-establishing the route is very low, and when the network has a convergent point, because of the limitation of the AODV protocol, the load of part of nodes near the convergent point is very large, which may cause congestion and even cause the death of the nodes.
Layered routing protocol: the layered routing protocol includes low power consumption adaptive clustering protocol (LEACH), low power consumption sensor information collection system (PEGASIS), threshold-aware energy-saving sensor network protocol (TEEN) and improvement thereof (APTEEN). The layered type protocol can solve the problem of network load distribution imbalance caused by a data-centric protocol and a plane-structured protocol. By taking LEACH as an example, the protocol forms a plurality of clusters by dynamically selecting the sensor nodes as cluster heads, and data in the clusters are forwarded after being aggregated by the cluster heads, so that the network traffic load is remarkably reduced, and the energy consumption can be greatly reduced. On the other hand, the layered routing protocol relies too much on the cluster head and faces some robustness problems, for example, once the cluster head fails, the recovery of the network structure is tedious. In addition, the formation of clusters requires additional signal interaction, and frequent replacement of cluster heads adds a certain overhead to the network.
Geographical routing protocol: the routing protocol based on the geographic information is typically a communication network with minimum power consumption protocol (MECN) and its modified SMECN protocol. The geographical routing protocol depends on a positioning module of equipment, a routing table is not directly constructed, and a path is determined by utilizing local position information, so that the mastering degree of nodes on position information of other nodes in the whole network often determines the routing performance.
The communication quality of the Ad-hoc network is greatly influenced by the wireless channel condition, the original effective link fails due to the sudden change of the channel quality, the data transmission is interrupted, and particularly under outdoor or field scenes, interference factors in the environment are more complex and unpredictable, so that the stability of channel parameters is poor. In addition, the nodes of the Ad-hoc network themselves have mobility, and thus the topology of the network may change greatly in a short time. These problems present a significant challenge to reliable communications in Ad-hoc networks.
In order to solve the above problems accurately, a multilink routing protocol needs to be considered comprehensively for reliable data transmission.
Disclosure of Invention
The invention aims to provide a multilink routing protocol which can improve the communication performance of an Ad-hoc network. The invention provides an improved Ad-hoc network multilink routing method based on a Bellman-Ford algorithm, which comprises the following steps: the routing system comprises a routing initialization module, a routing information processing module, an adding routing module, a routing information updating module, a timeliness checking module, a link monitoring module, a link switching module and a routing information broadcasting module. The routing initialization module calls a routing adding module, a timeliness checking module and a routing information broadcasting module, the routing information processing module calls a routing information updating module, a routing adding module and a routing information broadcasting module, the routing information updating module is called by the routing information processing module, the timeliness checking module and the link switching module, and the routing information updating module comprises:
the routing initialization module initializes a local routing table, calls the adding routing module, records the current node information into the local routing table, then calls the routing information broadcasting module to broadcast the routing outwards, and calls the timeliness checking module to check whether the routing is outdated.
The routing information processing module processes routing information sent by neighbor nodes, for a source node in the Ad-hoc network, the relaxation operation is realized through the routing information exchange operation between the neighbor nodes, N shortest-distance links of the source node to a host node are found out and are sequenced according to the distance, an optimal route is selected as a main route, the rest N-1 routes are reserved, the routing information updating module and the routing adding module are called, the routing table information is updated, and then the routing information broadcasting module is called to carry out triggered routing information broadcasting.
The route adding module adds effective routes to the route table in order according to the distance (namely hop count) from the current node to the destination node. The valid route means that the route information does not exceed the set updating time (such as 60s), and if the route information does not exceed the set updating time, the route is determined to be invalid.
The routing information updating module is used for modifying the routing information in the routing table when being called by the routing information processing module; when called by the timeliness check module, the routing module is used for deleting the routing information in the routing table; when called by the link switching module, for modifying the routing information in the routing table.
The timeliness checking module checks each routing information on the node, judges whether the set time is exceeded or not, and if the set time is exceeded, all the next hops of the corresponding routing information in the routing table are changed into unreachable ones; if not, no modification is made.
The routing information broadcasting module can be called under two conditions, namely, the periodic information broadcasting is carried out, and the broadcast content is all routing information of the node; and secondly, triggered information broadcasting, which is triggered after the routing table of the node is modified, and only modified pieces of routing information are broadcasted. The module is called by a route initialization module, a route information processing module and a link switching module.
The link monitoring module monitors the packet loss number of nodes in the Ad-hoc network.
The link switching module finds out the failure route in the routing table, calls the routing information updating module to switch the route, switches to the suboptimal route in the routing table, and calls the routing information broadcasting module to generate the trigger type broadcasting event.
Further, the method for finding out N links with the shortest distance in the information processing module includes: reconstructing a routing table in a Bellman-Ford algorithm, additionally recording a next hop list, and selecting a plurality of next hops for each node; and recording the shortest routes in a next hop list if the shortest routes exist according to the shortest distance vector principle during route searching, and recording the second shortest route if only 1 shortest route exists. One link with the shortest distance and the latest link is selected as the actually used link, and N-1 links are left for standby. The routing table structure of the present invention is shown in table 1.
Table 1 shows a routing table according to the present invention
Further, the method for monitoring the packet loss number of the node in the link monitoring module is to implant a packet loss monitor at an ARQ retransmission mechanism of the MAC layer, and when the node b detects that the packet loss behavior from the node a reaches a preset upper limit in a link from the node a to the node b, determine that the next hop of the node a is invalid (i.e., the node b is invalid), and then find out the best route (i.e., the route with the shortest distance in the next hop list) from the next hop list of the node a to perform link switching.
Further, when receiving the switching message from the link monitoring module, the link switching module traverses the routing table of the node, finds out all the routes with the next hop set as the node, invokes the routing information updating module to switch the routes, and generates a triggered routing information broadcast event.
By the scheme, the invention at least has the following advantages:
firstly, the fault tolerance is strong, and a redundant path is generated by a multilink routing method to be used as a substitute link, so that the problem of single link failure when the network state is changed is avoided; secondly, when a certain link becomes a transmission bottleneck due to an excessive load in a certain time, namely the link monitoring module detects that the packet loss behavior reaches a preset upper limit, switching information is generated and the link switching module is called to switch the link to an available optional path to balance the load. Thirdly, in the multilink routing method, since the backup route is started in the route discovery phase, the recovery time under the failure condition can be reduced, thereby reducing the packet loss rate. In a word, compared with a single link routing method, the multi-link routing method can balance network load better and bring higher reliability to data transmission.
The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical solutions of the present invention more clearly understood and to implement them in accordance with the contents of the description, the following detailed description is given with reference to the preferred embodiments of the present invention and the accompanying drawings.
Drawings
FIG. 1 is a diagram showing the relationship between modules according to the present invention.
Fig. 2 is a flow chart of a routing information processing module according to the present invention.
Fig. 3 is a flow chart of a link switching module according to the present invention.
Detailed Description
The following detailed description of embodiments of the present invention is provided in connection with the accompanying drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
In the description of the present invention, "plurality" means two or more unless specifically limited otherwise. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations. Furthermore, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements does not include a limitation to the listed steps or elements but may alternatively include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
As shown in fig. 1, an embodiment of the present invention provides an improved Ad-hoc network multilink routing method based on Bellman-Ford algorithm, including: the routing system comprises a routing initialization module, a routing information processing module, an adding routing module, a routing information updating module, a timeliness checking module, a link monitoring module, a link switching module and a routing information broadcasting module. The routing initialization module calls a routing adding module, a timeliness checking module and a routing information broadcasting module, the routing information processing module calls a routing information updating module, a routing adding module and a routing information broadcasting module, the routing information updating module can be called by the routing information processing module, the timeliness checking module and the link switching module, and the routing information updating module comprises:
the routing initialization module records the information of each node in the Ad-hoc network into the routing table of each node, then performs routing broadcast outwards, and sets a trigger event for checking whether the routing is outdated.
As shown in fig. 2, the routing information processing module processes the routing information sent by the neighboring node a, and first presets a flag bit Changed whose default value is FALSE, which is used to represent whether the routing information of the node a is modified in the current processing process. Then, the node B performs relaxation operation on each piece of routing information, because the hop count is used as the weight of the link in the Ad-hoc network, the weight of the link from the neighbor node A to the node B is always 1, and the relaxation operation on the link is to add 1 to the distance of the neighbor node.
Traversing all routing information sent by a neighbor node A, aiming at the ith routing information, judging whether the ith routing information exists on a node B by a routing information processing module, if not, calling a routing adding module, adding the ith routing information into a routing table of the node B, simultaneously setting a next hop value of the route as the neighbor node A, setting a distance value as a relaxed value (the distance of the neighbor node A is plus 1), and finally setting a Changed flag position of the routing information newly added into the local routing table as TRUE; if the ith piece of routing information exists, the routing information is quickly searched by using a dichotomy. After the routing information is found, judging whether the neighbor node A is in a next hop list to be selected or not, if so, calling a routing information updating module to update the distance information of the route to be selected; if the neighbor node A is not in the next hop list, comparing the distance after the relaxation operation (the neighbor node A distance +1) with the routing distance at the tail of the next hop list, judging whether the distance is shorter or not, if so, calling a routing information updating module to insert the routing information into the next hop list; if not, the routing information is discarded.
The routing information update module always uses the first item in the next hop list as the actually used link, so that the next hop value and the corresponding distance value may be Changed after the routing information update module is called, and the Changed flag bit of the piece of routing information is checked after the module is called.
After traversing the routing information sent by the neighbor node A, checking the Changed value, and if TRUE, indicating that the routing information of the node B is Changed in the above process and needs to be broadcasted to the outside, thereby calling a routing information broadcasting module to perform triggered routing information broadcasting.
And the route adding module adds effective routes to the routing table in order according to the distance.
When the routing information updating module is called by the routing information processing module, the distance updating operation or the inserting operation is directly carried out on the next hop list of the corresponding routing table; when the module is called by the timeliness check module, the routing information is outdated, the next hop list is required to be completely Changed into unreachable, the distance value is required to be completely Changed into infinity, and the Changed mark position is TRUE; as shown in fig. 3, when the module is called by the link switching module, the first entry of the next hop list is deleted first, then the whole is moved forward by one bit from the second entry, then it is determined whether the first entry of the current next hop list is available, if so, the next hop value and the distance value are Changed into the moved first entry, the Changed flag is TRUE, and if not, it is determined that there is no available route to be selected, and error information is output.
And the timeliness checking module checks all routing information on the nodes, judges whether the set time is exceeded or not, if so, indicates that the information is out of date, calls the routing information updating module to modify the information, and sets the next hop list as unreachable.
And the routing information broadcasting module broadcasts the routing information of the node to the adjacent nodes.
In the link monitoring module, a packet loss monitor is implanted at an ARQ retransmission mechanism of an MAC layer, when packet loss behavior is detected to reach 3 packets of a preset upper limit, the next hop is judged to be invalid, and then other optimal routes are found out from a next hop list to perform link switching.
When receiving the switching message of the link monitoring module, the link switching module traverses the routing table of the node, finds out all the routes with the next hop set as the node, calls the routing information updating module to switch the routes, and generates a triggered routing information broadcast event.
The invention has strong fault tolerance, and the multi-link routing method generates the redundant path as the substitute link, thereby avoiding the problem of single link failure when the network state changes; when a certain link becomes a transmission bottleneck due to overload in a certain time, the multilink routing method can balance the load by switching the traffic to an available alternative path; in the multilink routing method, because the backup route is started in the route discovery phase, the recovery time under the fault condition can be reduced, thereby reducing the packet loss rate. In a word, compared with single link routing, the multi-link routing method can balance network load better and bring higher reliability to data transmission.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, it should be noted that, for those skilled in the art, many modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.
Claims (7)
1. An improved wireless self-organizing network multilink routing method comprises the following steps:
1) a route initialization module, a route information processing module, an added route module, a route information updating module, a timeliness check module, a link monitoring module, a link switching module and a route information broadcasting module are arranged in each node of the wireless self-organizing network;
2) the routing initialization module initializes a local routing table, calls the adding routing module, records current node information into the local routing table, then calls the routing information broadcasting module to broadcast the routing outwards, and calls the timeliness checking module to check whether the routing is out of date;
3) the routing information processing module extracts a source node and a host node from routing information sent by neighbor nodes, for the source node, through the routing information exchange operation between the neighbor nodes, N routes with the shortest distance from the source node to the host node are found out and are ordered according to the distance, an optimal route is selected as a main route, and the rest N-1 routes are used as standby routes; then, calling a routing information updating module to update the routing table information, and then calling a routing information broadcasting module to broadcast the routing information;
4) the adding routing module adds effective routes to a routing table in order according to the distance from the current node to the host node;
5) the timeliness checking module checks each routing information on the node, judges whether the set time is exceeded or not, if yes, all next hops of the routing information in the routing table are changed into unreachable ones, the routing information updating module is called to update the next hops, and overtime routes are deleted;
6) the link monitoring module monitors the packet loss number of nodes in the wireless self-organizing network, judges that the next hop of the current route of the nodes fails when the packet loss number reaches a preset upper limit, then finds out a route from the standby routes to carry out link switching and sends a switching message to the link switching module; and when receiving the switching information of the link monitoring module, the link switching module traverses the routing table of the node, finds out all the next hops to be set as the routing of the node, calls a routing information updating module to switch the current routing to the found routing, and generates a routing information broadcast event.
2. The method of claim 1, wherein the information processing module obtains the N routes with the shortest distance by: adding a next hop list in a routing table, then finding out the shortest route of the source node to any host node according to the shortest distance vector principle, if a plurality of shortest routes with the same distance exist, respectively recording the shortest routes in the next hop list, and if only 1 shortest route exists, recording a second shortest route in the next hop list; then, one route with the shortest distance and the latest route is selected from the next hop list to be used as a main route, and N-1 routes are left to be used as standby routes.
3. The method of claim 1, wherein the method for monitoring the number of packet losses of the node in the link monitoring module is: and implanting a packet loss monitor at an ARQ retransmission mechanism of an MAC layer, and monitoring the packet loss number of the node.
4. The method as claimed in claim 1, 2 or 3, wherein when the routing information processing module at the node B processes the routing information sent from the neighboring node a, a routing change flag bit Changed whose default value is FALSE is preset to characterize whether the routing information of the node a is modified; then the node B performs relaxation operation on each piece of received routing information of the node A, namely adding 1 to the distance of the node A; then the node B traverses each routing information sent by the node A, aiming at the ith routing information, a routing information processing module firstly judges whether the ith routing information exists on the node B, if not, a routing adding module is called to add the ith routing information into a routing table of the node B, meanwhile, the next hop value of the ith routing is set as the node A, the distance value is set as a relaxed value, and finally, the Changed flag position of the ith routing information newly added into a local routing table is TRUE to represent that the ith routing information is modified; if the ith piece of routing information exists, judging whether the node A is already in a next hop list to be selected, and if so, calling a routing information updating module to update the routing distance in the next hop list to be selected; if the node A is not in the next hop list, comparing the distance after the relaxation operation with the routing distance at the tail of the next hop list, judging whether the distance is shorter or not, and if so, calling a routing information updating module to insert the ith routing information into the next hop list; if not, deleting the ith piece of routing information.
5. The method of claim 4, wherein after node B has traversed all routing information from node A, the Changed value is checked, and if TRUE, the routing information broadcasting module is invoked to broadcast the triggered routing information.
6. A method according to claim 1, 2 or 3, wherein the routing table comprises: the method comprises the steps of IP address of a host node, subnet mask of the host node, IP address of a next hop node, IP address list of a next hop node to be selected, communication interface to the next hop node, interface list of other next hops, distance from the next hop node to the host node, distance list from the next hop node to be selected to the host node, local routing flag bit, updating time of routing, routing change flag bit and flag bit for recording whether the current routing is a permanent routing or not.
7. An improved wireless self-organizing network comprises a plurality of nodes, and is characterized in that each node is provided with a route initialization module, a route information processing module, an adding route module, a route information updating module, a timeliness check module, a link monitoring module, a link switching module and a route information broadcasting module; wherein the content of the first and second substances,
the routing initialization module is used for initializing a local routing table, calling the adding routing module, inputting the current node information into the local routing table, then calling the routing information broadcasting module to broadcast the routing outwards, and calling the timeliness checking module to check whether the routing is out of date;
the routing information processing module is used for extracting a source node and a sink node from routing information sent by a neighbor node, finding N routes with the shortest distance from the source node to the sink node through the routing information exchange operation between the neighbor nodes for the source node, sequencing the routes according to the distance, selecting one optimal route as a main route, and using the rest N-1 routes as standby routes; then, calling a routing information updating module to update the routing table information, and then calling a routing information broadcasting module to broadcast the routing information;
the route adding module is used for orderly adding effective routes to the route table according to the distance from the current node to the host node;
the timeliness checking module is used for checking each routing information on the node, judging whether the set time is exceeded or not, if the set time is exceeded, changing all the next hops of the routing information in the routing table into unreachable state, calling the routing information updating module to update, and deleting the overtime routing;
the link monitoring module is used for monitoring the packet loss number of the nodes in the wireless self-organizing network, judging that the next hop of the current route of the nodes fails when the packet loss number reaches a preset upper limit, then finding out a route from the standby routes to perform link switching, and sending a switching message to the link switching module; and when receiving the switching message of the link monitoring module, the link switching module traverses the routing table of the node, finds out all the next hops to be set as the routing of the node, calls a routing information updating module to switch the current routing to the found routing, and generates a routing information broadcast event.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110709118.1A CN113347088B (en) | 2021-06-25 | 2021-06-25 | Improved wireless self-organizing network multilink routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110709118.1A CN113347088B (en) | 2021-06-25 | 2021-06-25 | Improved wireless self-organizing network multilink routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113347088A CN113347088A (en) | 2021-09-03 |
| CN113347088B true CN113347088B (en) | 2022-07-12 |
Family
ID=77478652
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110709118.1A Active CN113347088B (en) | 2021-06-25 | 2021-06-25 | Improved wireless self-organizing network multilink routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113347088B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113904977A (en) * | 2021-10-13 | 2022-01-07 | 中国电信股份有限公司 | Multilink gateway data transmission method and device, electronic equipment and readable medium |
| CN114615189B (en) * | 2022-03-10 | 2023-05-02 | 中国电子科技集团公司第十研究所 | Distributed topology control method for wireless self-organizing network |
| CN115767668A (en) * | 2022-10-31 | 2023-03-07 | 海尔优家智能科技（北京）有限公司 | Method and device for inquiring routing table, storage medium and electronic device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
| CN104010338A (en) * | 2014-05-13 | 2014-08-27 | 南京邮电大学 | Improved AODV routing method based on terminal energy sensing |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101835335B1 (en) * | 2011-04-11 | 2018-03-07 | 엘지전자 주식회사 | Routing method and apparatus for setting optimum multi-hop hybrid v-mimo transmission path for wireless ad hoc network |
-
2021
- 2021-06-25 CN CN202110709118.1A patent/CN113347088B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
| CN104010338A (en) * | 2014-05-13 | 2014-08-27 | 南京邮电大学 | Improved AODV routing method based on terminal energy sensing |
Non-Patent Citations (5)
| Title |
|---|
| 《无线传感器网络高能效可靠数据传输理论及应用研究》;李玉凯;《中国博士学位论文电子期刊网》;20110915;全文 * |
| 一种基于mesh网络的多径路由协议;徐婷等;《电子技术应用》;20100906(第09期);全文 * |
| 一种无线自组织网络动态路由协议;姜永广等;《通信技术》;20100610(第06期);全文 * |
| 单向ad-hoc移动网络优化路由协议OUAOR;臧婉瑜等;《计算机学报》;20021012(第10期);全文 * |
| 无线Ad hoc网络中的协同路由;刘洋等;《通信技术》;20101210(第12期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113347088A (en) | 2021-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113347088B (en) | Improved wireless self-organizing network multilink routing method | |
| US10212077B2 (en) | Label switched packet transfer device | |
| US8155004B2 (en) | Mobile network system for dynamically controlling communication path and method thereof | |
| TWI418183B (en) | Method and system of routing in a utility smart-grid network | |
| Agarwal et al. | Route-lifetime assessment based routing (RABR) protocol for mobile ad-hoc networks | |
| TWI381683B (en) | Method and system of routing in a utility smart-grid network | |
| US8416712B2 (en) | Method and device for installing and distributing routes | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| US20030117966A1 (en) | Network protocol for wireless devices utilizing location information | |
| US20090296704A1 (en) | Method for multi-path source routing in sensor network | |
| US7333827B2 (en) | Restricted dissemination of topology information in a communication network | |
| US20110235550A1 (en) | Network layer topology management for mobile ad-hoc networks and associated methods | |
| JP2009542109A (en) | Mobile ad hoc network (MANET) and method for implementing multiple paths for fault tolerance | |
| CN101312438A (en) | Router and route updating method thereof | |
| CN111510982B (en) | Data transmission method and device | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| Bao et al. | Link-state routing in networks with unidirectional links | |
| US20020009088A1 (en) | Systems and methods for negotiating virtual circuit paths in packet switched networks | |
| US20070115828A1 (en) | Method for sending requests in a network | |
| Ali et al. | Multipath routing backbones for load balancing in Mobile Ad hoc Networks | |
| CN112954764A (en) | Multipath shunting routing method based on path state in mobile ad hoc network | |
| Margaryan et al. | Development of an Adaptive Routing Algorithm in MANET | |
| CN115412489B (en) | Software-defined satellite network southbound interface control method | |
| CN114785726B (en) | Clustering OLSR routing method based on management message merging | |
| Pei et al. | Performance improvements of ospf manet extensions: A cross layer approach |
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 |