CN115941584A - High dynamic on-demand routing method for ad hoc network, communication node and storage medium - Google Patents
High dynamic on-demand routing method for ad hoc network, communication node and storage medium Download PDFInfo
- Publication number
- CN115941584A CN115941584A CN202211489438.1A CN202211489438A CN115941584A CN 115941584 A CN115941584 A CN 115941584A CN 202211489438 A CN202211489438 A CN 202211489438A CN 115941584 A CN115941584 A CN 115941584A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- route
- communication
- target node
- 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
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present application relates to a high dynamic on-demand routing method, communication node and storage medium for an ad hoc network. The method comprises the following steps: after receiving a routing request message sent by a source node, a target node periodically broadcasts a routing maintenance message, each node receiving the routing maintenance message determines a neighbor node reaching the target node as a next-hop communication route according to a link transmission quality value in the message so as to construct or update a routing table, so that after periodically broadcasting the routing maintenance message by the target node, each node dynamically updates the respective routing table according to the current network state, after receiving the routing maintenance message, the source node can establish the routing table reaching the target node and send service frame data to the next-hop node according to the routing table, and after the transmission of the service frame data is finished, the target node stops broadcasting the routing maintenance message. By adopting the method, the routing table can be updated and maintained in time, and the overhead of the routing protocol is effectively reduced.
Description
Technical Field
The present application relates to the field of network routing technologies, and in particular, to a high dynamic on-demand routing method, a communication node, and a storage medium for an ad hoc network.
Background
At present, wireless self-organizing network routing protocols can be divided into two types, namely on-demand routing protocols and table-driven routing protocols according to different routing discovery strategies.
When no service data sending request exists in the on-demand routing protocol, routing messages are not exchanged, and network overhead is low; when data is sent, sending a routing message to search a route, and transmitting the data according to the established route after establishing the route. The table-driven routing protocol is also called as proactive routing, each node periodically broadcasts routing messages to maintain routing information reaching other nodes, and the nodes receiving routing packets update the routing table to maintain the accuracy and timeliness of the routing table, so that the table-driven routing protocol can better adapt to the rapidly-changing network topology.
The on-demand routing protocol does not continuously send routing messages to update the routing after the routing is established, the routing of data being transmitted may be interrupted with the enhancement of network mobility, and after the routing is interrupted, a routing discovery process needs to be called again, so that service transmission delay and packet loss rate are high. The table-driven routing protocol has high protocol overhead because each node in the network needs to broadcast routing messages periodically, and when the number of nodes in the network is large, the overhead for maintaining the routing table is increased by times, so that a large amount of network bandwidth is occupied, and the throughput of the whole network is reduced.
Disclosure of Invention
Based on this, it is necessary to provide a high dynamic on-demand routing method, a communication node and a storage medium for an ad hoc network, which can update and maintain a routing table in time and effectively reduce the overhead of a routing protocol.
A high dynamic on-demand routing method for an ad hoc network, the method being implemented in communication nodes in a wireless ad hoc network, each of the communication nodes comprising a source node and a target node, the method comprising:
a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
the communication node receiving the route maintenance message establishes a routing table from the communication node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when the communication node establishes the routing table from the communication node to the target node or updates the routing table, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, and the target node refreshes the timer after receiving the service frame data, and stops broadcasting the route maintenance message until the timer is overtime.
In one embodiment, the routing request message includes addresses of a source node and a destination node;
the other communication nodes receive the routing request message broadcasted by the source node or forwarded by the other nodes, check whether the address of the target node in the routing request message is the address of the node, if the address of the target node is not the address of the node, establish or maintain a reverse route from the node to the source node according to the routing request message, and forward the routing request message to the other nodes;
and if the address of the target node in the routing request message is the address of the node, the node is the target node.
In one embodiment, after the target node receives the routing request packet, a reverse route to the source node is established or maintained according to the routing request packet.
In one embodiment, after the source node sends the service frame data to the next-hop communication route according to the newly established routing table:
and after receiving the service frame data, the communication node sends the service frame data to a next-hop communication route according to a routing table updated in real time until the service frame data reaches the target node.
In one embodiment, if the source node does not receive the route maintenance message sent by the target node within a preset time after broadcasting the route request message, the route request message is rebroadcast until the route maintenance message sent by the target node is received.
In one embodiment, the link transmission quality value in the route maintenance message is determined according to the number of hops to reach the target node, the channel quality, and the success rate of receiving the route maintenance message.
In one embodiment, the orig ID in the route maintenance packet periodically broadcast by the target node is the ID of the target node, the dest ID is the broadcast ID 0xFF, and the link transmission quality value is initialized to 100.
A communication node for an ad hoc network, the communication node comprising a memory, a processor and a communicator;
the memory is used for storing computer programs, and the processor is used for executing the computer programs stored by the memory and realizing the following steps when being executed:
a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
the communication node receiving the route maintenance message establishes a routing table from the communication node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when the communication node establishes the routing table from the communication node to the target node or updates the routing table, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, the target node refreshes the timer after receiving the service frame data, and the route maintenance message is stopped broadcasting until the timer is overtime;
the communicator is used for communicating with other communication nodes in the ad hoc network.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
the communication node receiving the route maintenance message establishes a routing table from the communication node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when the communication node establishes the routing table from the communication node to the target node or updates the routing table, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
and after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, and the target node refreshes the timer after receiving the service frame data until the timer is overtime, and then stops broadcasting the route maintenance message.
According to the high-dynamic on-demand routing method, the communication nodes and the storage medium for the ad hoc network, after a target node receives a routing request message sent by a source node, a timer is started, meanwhile, a routing maintenance message is periodically broadcast, each communication node receiving the routing maintenance message determines a neighbor communication node reaching the target node as a next-hop communication route according to the link transmission quality value in the routing maintenance message to construct or update a routing table, therefore, after the target node periodically broadcasts the routing maintenance message, each communication node dynamically updates the respective routing table according to the current network state, after the source node receives the routing maintenance message, a route reaching the target node can be established, service frame data are sent to the next-hop communication node according to the routing maintenance message, and when the service frame data reach the target node, the target node refreshes the timer after receiving the service frame data until the timer is overtime, the broadcasting of the routing maintenance message is stopped. Therefore, the method broadcasts the routing request message only when a service transmission request exists, the destination node starts to broadcast the routing maintenance message periodically after receiving the routing request message of the source node, and stops broadcasting the routing maintenance message after the service transmission is finished, so that the method can effectively reduce the overhead of a routing protocol while updating and maintaining a routing table in time, and is suitable for a high-dynamic large-scale self-organizing network.
Drawings
FIG. 1 is a flow diagram illustrating a method for high dynamic on-demand routing for an ad hoc network in one embodiment;
fig. 2 is a schematic diagram of a message format of an OM message in an embodiment;
fig. 3 is a schematic diagram illustrating a route establishment procedure for a source node to reach a destination node in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
As shown in fig. 1, a high dynamic on-demand routing method for an ad hoc network is provided, and the method is implemented in each communication node in the wireless ad hoc network, each communication node includes a source node and a target node, and includes the following steps:
step S100, a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
step S110, after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
step S120, a communication node receiving the route maintenance message establishes a routing table from the communication node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when the routing table from the communication node to the target node is established or the routing table is updated, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
step S130, after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends the service frame data to the next hop communication route according to the newly established route table;
step S140, after the forwarding of the intermediate communication nodes, the service frame data reaches the target node, the target node refreshes the timer after receiving the service frame data, and the broadcasting of the route maintenance message is stopped until the timer is overtime.
In this embodiment, a hop-by-hop routing method is adopted, and a communication node only needs to obtain which neighbor nodes can reach a target node through which a complete routing path to the target node is found without obtaining a full network topology, and selects an optimal neighbor node reaching the target node as a next hop node for sending service data.
In step S100, when a communication node a (source node) needs to send a service to another communication node B (destination node), the communication node a first queries whether a route to the communication node B exists in a local routing table, and since the communication node a and the communication node B communicate for the first time and the route does not exist yet, the communication node a sends a broadcast route request packet, where orig ID is the ID of the communication node a and dest ID is the ID of the communication node B.
In this embodiment, a routing protocol packet is designed, which is called an OM packet, and the packet format of the OM packet is shown in fig. 2, where: type is a message type field, 1 represents a route request message (i.e. a message broadcast by a communication node a), and 2 represents a route maintenance message (i.e. a message broadcast by a communication node B); TTL is the field of maximum hop count and represents the maximum hop count of the OM message which can be transmitted; seq is a serial number field, and the seq increases by 1 when an OM frame is sent every time, and represents the updating degree of an OM message sent by a node; TQ is a transmission quality field, is used for marking link quality and is a basis for routing selection, and the larger the TQ value is, the better the transmission quality is, and the value range is 0-100; orig ID is a source node ID field and represents a node ID number for sending the OM message; dest ID is a destination ID field and represents the ID number of the destination node of the OM message.
After the communication node A broadcasts the routing request message, other communication nodes receive the routing request message broadcasted by the communication node A or forwarded by other nodes, check whether the address of the communication node B in the routing request message is the address of the node, if not, establish or maintain a reverse route from the node to the communication node A according to the routing request message, and forward the routing request message to other nodes.
And when the address of the communication node B in the routing request message is the address of the node, the node is the communication node B.
In step S110, after the communication node B receives the routing request message, it establishes or maintains a reverse route to the communication node a according to the routing request message, starts a routing maintenance message, stops a sending timer, and starts to broadcast the routing maintenance message periodically, where orig ID is the ID of the communication node B, dest ID is broadcast ID 0xff, tq is initialized to 100.
In step S120, the neighboring node that receives the route maintenance packet establishes a routing table from the node to the communication node B according to the received packet or updates the routing table, then forwards the route maintenance packet to its neighboring node, and updates the transmission quality value TQ in the route maintenance OM packet, which indicates the link quality is bad. The transmission quality value TQ is determined by the number of hops to the communication node B, the channel quality, and the success rate of receiving the route maintenance message.
Each node in the network determines a neighbor node with the best transmission quality reaching the target node B as a next hop route according to the received route maintenance message of the communication node B.
And because the route maintenance message is periodically broadcast, each communication node periodically receives the route maintenance message, and can select the optimal neighbor node from the node to the communication node B as the next-hop route according to the current network condition.
In step S130, after receiving the route maintenance packet sent by the communication node B, the communication node a establishes a route to the node B, and sends a service data frame to the next hop node in the routing table according to the newly established route. The route establishment procedure is shown in fig. 3.
In step S140, after the source node sends the service frame data to the next-hop communication route according to the newly established routing table, and after the corresponding communication node receives the service frame data, the corresponding communication node sends the service frame data to the current optimal neighboring node according to the routing table updated in real time as the next-hop communication route, and so on until the service frame data reaches the target node, so as to complete transmission of the service data.
In this embodiment, after receiving the service data sent by the communication node a, the communication node B refreshes the route maintenance packet and stops sending the timer. If the communication node B does not receive the routing request message or the service data message from the communication node A in the specified time, and the routing maintenance message of the communication node B stops sending the overtime timer, the fact that the communication node A does not need to send data to the communication node B is indicated, and the communication node B stops broadcasting the routing maintenance message, so that the overhead of a routing protocol is reduced.
In this embodiment, if the communication node a does not receive the route maintenance packet sent by the communication node B within the preset time after broadcasting the route request packet, the route request packet is rebroadcast until the route maintenance packet sent by the communication node B is received.
In the high dynamic on-demand routing method for the ad hoc network, when no service data transmission request exists in the ad hoc network, the nodes do not exchange routing messages, the routing request messages are broadcasted when the service transmission request exists in the nodes, destination node address information is carried in the routing messages, the destination nodes establish reverse routing reaching the source nodes after receiving the routing messages of the source nodes, and the routing maintenance messages are broadcasted periodically. After receiving the route maintenance message of the destination node, the source node establishes a route reaching the destination node, and meanwhile, in order to avoid the failure of the established route caused by the movement of the node, the source node continuously updates the optimal route reaching the destination node according to the received periodic route maintenance message of the destination node; and after the service transmission is finished, the destination node stops broadcasting the route maintenance message so as to save network overhead.
It should be understood that, although the steps in the flowchart of fig. 1 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in fig. 1 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
In one embodiment, there is also provided a communication node for an ad hoc network, the communication node comprising a memory, a processor, and a communicator;
the memory is used for storing computer programs, and the processor is used for executing the computer programs stored by the memory and realizing the following steps when being executed:
a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
the communication node receiving the route maintenance message establishes a routing table from the node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the link transmission quality value is forwarded to other adjacent communication nodes, and when the routing table from the node to the target node is established or the routing table is updated, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, the target node refreshes the timer after receiving the service frame data, and the route maintenance message is stopped broadcasting until the timer is overtime;
the communicator is used for communicating with other communication nodes in the ad hoc network.
In one embodiment, a high dynamic on-demand routing system for an ad hoc network is further provided, and the system comprises a plurality of communication nodes in the wireless ad hoc network, wherein each communication node comprises a source node and a target node;
the source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
after receiving the route maintenance message, the communication node establishes a route table from the communication node to a target node according to the route maintenance message or updates the route table, meanwhile, after updating a link transmission quality value in the route maintenance message, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when establishing the route table from the communication node to the target node or updating the route table, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
and after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, and the target node refreshes the timer after receiving the service frame data until the timer is overtime, and then stops broadcasting the route maintenance message.
For specific limitations of the high dynamic on-demand routing system for the ad hoc network, reference may be made to the above limitations of the high dynamic on-demand routing method for the ad hoc network, and details thereof are not described herein again.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
the communication node receiving the route maintenance message establishes a routing table from the communication node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when the communication node establishes the routing table from the communication node to the target node or updates the routing table, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
and after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, and the target node refreshes the timer after receiving the service frame data until the timer is overtime, and then stops broadcasting the route maintenance message.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), rambus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent application shall be subject to the appended claims.
Claims (9)
1. A highly dynamic on-demand routing method for an ad hoc network, the method being implemented in each communication node in a wireless ad hoc network, each communication node comprising a source node and a destination node, the method comprising:
a source node broadcasts a routing request message, and the routing request message is forwarded by a plurality of communication nodes and then reaches a target node;
after receiving the routing request message, the target node starts a timer and periodically broadcasts a routing maintenance message;
the communication node receiving the route maintenance message establishes a routing table from the communication node to a target node according to the route maintenance message or updates the routing table, meanwhile, after the link transmission quality value in the route maintenance message is updated, the communication node forwards the link transmission quality value to other adjacent communication nodes, and when the communication node establishes the routing table from the communication node to the target node or updates the routing table, a neighbor communication node reaching the target node is determined to be used as a next hop communication route according to the link transmission quality value in the route maintenance message;
after receiving the route maintenance message, the source node establishes a route table reaching the target node and sends service frame data to a next-hop communication route according to the newly established route table;
and after forwarding of a plurality of intermediate communication nodes, the service frame data reaches the target node, and the target node refreshes the timer after receiving the service frame data until the timer is overtime, and then stops broadcasting the route maintenance message.
2. The method according to claim 1, wherein the routing request message includes addresses of a source node and a destination node;
the other communication nodes receive the routing request message broadcasted by the source node or forwarded by the other nodes, check whether the address of the target node in the routing request message is the address of the node, if the address of the target node is not the address of the node, establish or maintain a reverse route from the node to the source node according to the routing request message, and forward the routing request message to the other nodes;
and if the address of the target node in the routing request message is the address of the node, the node is the target node.
3. The method according to claim 2, wherein after the target node receives the route request packet, a reverse route to the source node is established or maintained according to the route request packet.
4. The high dynamic on-demand routing method according to claim 3, wherein the source node sends the traffic frame data to the next-hop communication route according to the newly established routing table, and then:
and after receiving the service frame data, the communication node sends the service frame data to a next-hop communication route according to a routing table updated in real time until the service frame data reaches the target node.
5. The high-dynamic on-demand routing method according to claim 4, wherein if the source node does not receive the route maintenance packet sent by the target node within a preset time after broadcasting the route request packet, the route request packet is rebroadcast until the route maintenance packet sent by the target node is received.
6. The high dynamic on-demand routing method according to claim 5, wherein the link transmission quality value in the route maintenance message is determined according to the number of hops to reach a target node, the channel quality, and the success rate of receiving the route maintenance message.
7. The high-dynamic on-demand routing method according to claim 6, wherein an orig ID in a route maintenance message periodically broadcast by the target node is an ID of the target node, a dest ID is a broadcast ID of 0xFF, and a link transmission quality value is initialized to 100.
8. A communication node for an ad hoc network, the communication node comprising a memory, a processor, and a communicator;
the memory for storing a computer program, the processor for executing the computer program stored by the memory, when executing implementing the steps of the method according to any of claims 1-7;
the communicator is used for communicating with other communication nodes in the ad hoc network.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211489438.1A CN115941584A (en) | 2022-11-25 | 2022-11-25 | High dynamic on-demand routing method for ad hoc network, communication node and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211489438.1A CN115941584A (en) | 2022-11-25 | 2022-11-25 | High dynamic on-demand routing method for ad hoc network, communication node and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115941584A true CN115941584A (en) | 2023-04-07 |
Family
ID=86698666
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211489438.1A Pending CN115941584A (en) | 2022-11-25 | 2022-11-25 | High dynamic on-demand routing method for ad hoc network, communication node and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115941584A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117081975A (en) * | 2023-10-17 | 2023-11-17 | 苏州元脑智能科技有限公司 | Topology structure, construction method, message sending method, device, equipment and medium |
| CN117692987A (en) * | 2024-02-01 | 2024-03-12 | 深圳市海曼科技股份有限公司 | Route discovery method, device, equipment and storage medium |
-
2022
- 2022-11-25 CN CN202211489438.1A patent/CN115941584A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117081975A (en) * | 2023-10-17 | 2023-11-17 | 苏州元脑智能科技有限公司 | Topology structure, construction method, message sending method, device, equipment and medium |
| CN117081975B (en) * | 2023-10-17 | 2024-02-09 | 苏州元脑智能科技有限公司 | Topology structure, construction method, message sending method, device, equipment and medium |
| CN117692987A (en) * | 2024-02-01 | 2024-03-12 | 深圳市海曼科技股份有限公司 | Route discovery method, device, equipment and storage medium |
| CN117692987B (en) * | 2024-02-01 | 2024-05-14 | 深圳市海曼科技股份有限公司 | Route discovery method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2296326B1 (en) | Route selection in wireless networks | |
| CN106888490B (en) | Routing method and device of wireless ad hoc network | |
| US7408911B2 (en) | System and method to decrease the route convergence time and find optimal routes in a wireless communication network | |
| US7606176B2 (en) | System and method to improve the performance of an on demand routing protocol in a wireless network | |
| US8971231B2 (en) | Systems and methods for mobile communications | |
| US7415019B2 (en) | Apparatus and method for collecting active route topology information in a mobile ad hoc network | |
| US20020145978A1 (en) | Mrp-based hybrid routing for mobile ad hoc networks | |
| US7894408B2 (en) | System and method for distributing proxying error information in wireless networks | |
| CN115941584A (en) | High dynamic on-demand routing method for ad hoc network, communication node and storage medium | |
| US20090161594A1 (en) | Hybrid multicast routing protocol for wireless mesh networks | |
| CA2851594A1 (en) | Cognitive mobile time division duplex ad-hoc network | |
| JP2009273140A (en) | Hybrid type mesh routing protocol | |
| KR100602267B1 (en) | System and method for router in communication system | |
| Lesiuk | Routing in ad hoc networks of mobile hosts | |
| EP2068500A2 (en) | Method and system for flooding and multicast routing in an ad-hoc network | |
| KR101762696B1 (en) | Route Maintenance Protocol Using Destination-initiated Flooding in Mobile Ad Hoc Networks | |
| CN112383947B (en) | Wireless ad hoc network mixed routing protocol method based on network environment | |
| Oh | An adaptive routing algorithm for wireless mesh networks | |
| CA2817659C (en) | Route selection in wireless networks | |
| Rao et al. | Impact and Suitability of Reactive Routing Protocols, Energy-Efficient and AI Techniques on QoS Parameters of WANETs | |
| CA2896911C (en) | Route selection in wireless networks | |
| WO2003051009A1 (en) | Method of using data rates as a routing metric in ad-hoc networks | |
| CN115915324A (en) | Multi-channel routing method, device, computer equipment and storage medium | |
| Kim et al. | A Flexible Tree-Based Routing Protocol with a Mesh Relaying Node in Multi-hop Wireless Mesh Networks |
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 |