CN114390632B - Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer - Google Patents
Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer Download PDFInfo
- Publication number
- CN114390632B CN114390632B CN202111528058.XA CN202111528058A CN114390632B CN 114390632 B CN114390632 B CN 114390632B CN 202111528058 A CN202111528058 A CN 202111528058A CN 114390632 B CN114390632 B CN 114390632B
- Authority
- CN
- China
- Prior art keywords
- node
- wireless
- destination node
- topology table
- access layer
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000004364 calculation method Methods 0.000 claims abstract description 58
- 230000005540 biological transmission Effects 0.000 claims abstract description 53
- 238000004590 computer program Methods 0.000 claims description 11
- 238000013461 design Methods 0.000 claims description 6
- 239000012742 immunoprecipitation (IP) buffer Substances 0.000 claims description 3
- 230000006870 function Effects 0.000 claims description 2
- 238000012790 confirmation Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 244000201986 Cassia tora Species 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000006735 deficit Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- NCAIGTHBQTXTLR-UHFFFAOYSA-N phentermine hydrochloride Chemical compound [Cl-].CC(C)([NH3+])CC1=CC=CC=C1 NCAIGTHBQTXTLR-UHFFFAOYSA-N 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- 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/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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application relates to a wireless mobile ad hoc network dynamic routing method, a wireless mobile ad hoc network dynamic routing device, a wireless mobile ad hoc network dynamic routing computer device and a wireless mobile ad hoc network storage medium based on the combination of an access layer and a network layer. The method comprises the following steps: the wireless access control unit of the access layer acquires the link quality among the nodes in real time and updates the topology table; when receiving data to be transmitted, the wireless IP unit of the access layer determines a destination node according to the data to be transmitted; the wireless IP unit of the access layer traverses all transmission paths which can reach the destination node in a topology table according to the destination node, analyzes according to the data rate of the corresponding transmission paths, and determines a route calculation result; and transmitting the data to be transmitted according to the route calculation result, so that network overhead of route discovery and updating of the wireless mobile ad hoc network is reduced, and the effectiveness and availability of the wireless mobile ad hoc network route are improved.
Description
Technical Field
The present application relates to the field of wireless network technologies, and in particular, to a method, an apparatus, a computer device, and a storage medium for dynamic routing of a wireless mobile ad hoc network based on combination of an access layer and a network layer.
Background
At present, wireless mobile ad hoc networks are widely used in the military and civil fields because they can realize fast networking without relying on any communication infrastructure. It merges two technologies of wireless communication and computer network, and the routing technology is one of the most challenging works of wireless ad hoc networks.
In wireless mobile ad hoc networks, traffic packet transmissions are performed in a multi-hop manner. Thus, a complete route is often made up of links between nodes. Any link disruption caused by relative movement between nodes in the network and propagation impairment of the wireless signal will result in failure of the traffic transmission path. In addition, the wireless link has fast channel condition change, unidirectional link exists and other adverse factors, which cause fast network topology change, thereby providing high requirements for dynamic routing design.
Conventional ad hoc routing protocols mainly include proactive routing protocols and reactive routing protocols. The nodes adopting the proactive routing protocol (DSDV, OLSR, TBRPF) need to periodically update the full network routing state, and the reactive routing protocol (AODV, TORA, ZRP) needs to reinitiate the route discovery process in a flooding (broadcast flooding or regional limited flooding) mode by the service source node to obtain new end-to-end link connection so as to overcome the defect that the node routing table does not contain full network routing information. This would result in a significant amount of network control overhead. On the other hand, frequent topology changes will shorten the lifetime of the route and reduce its availability. All algorithms that optimize around the node neighborhood state update period (i.e., broadcast period of HELLO packets) have ultimately been difficult to fundamentally solve the problem of rapid topology changes.
The essential problem with these routing dilemmas is the lineage to traditional wired network routing protocol solutions: firstly, attempting to pre-establish a route between a source node and a destination node, and forwarding data after the route is established; and secondly, completely separating the routing protocol from the channel access protocol. Therefore, the routing of the wireless mobile ad hoc network is less efficient.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a wireless mobile ad hoc network dynamic routing method, apparatus, computer device and storage medium based on the combination of an access layer and a network layer, which can improve the routing availability of the wireless mobile ad hoc network.
A wireless mobile ad hoc network dynamic routing method based on a combination of an access layer and a network layer, the method comprising:
Acquiring link quality among nodes in real time through a wireless access control unit of an access layer, and updating a topology table;
When receiving data to be transmitted, the wireless IP unit of the access layer determines a destination node according to the data to be transmitted;
The wireless IP unit of the access layer traverses all transmission paths which can reach the destination node in a topology table according to the destination node, analyzes according to the data rate of the corresponding transmission paths, and determines a route calculation result;
And transmitting the data to be transmitted according to the route calculation result.
In one embodiment, the step of traversing all transmission paths capable of reaching the destination node in the topology table by the radio IP unit of the access layer according to the destination node, analyzing according to the data rate of the corresponding transmission paths, and determining the route calculation result includes:
Traversing all nodes which are not 0 in TP [ x 1 ] [ j ] in a topology table by the wireless IP unit of the access layer according to the destination node to obtain a set S1, and recording transmission time L/R (TP [ S i ] [ j ]) required by each node in the set S1 to the destination node j, wherein TP [ ] is the topology table, and TP [ x 1 ] [ j ] is the link quality between the x1 st node and the destination node j; x 1 is the node number, x 1 epsilon 1, 2, 3 … … n, n is the total node number in the wireless mobile ad hoc network; s i is the node number, S i ε S1; j is a destination node; l is a data amount; r (TP [ s i ] [ j ]) is the data transmission rate corresponding to the s i th node and the destination node j;
and continuing to take each node in the set S1 as a traversing destination node, traversing all nodes which are not 0 in TP [ x 2][si ] in a topology table to obtain a set S2, recording the shortest transmission time L/R (TP [ x 2][si ]) required from each node in the set S2 to a target node j, and carrying out iterative traversal by taking each node in the set S2 as the next traversing destination node until all nodes which are not 0 are traversed in the topology table are iterated, wherein the obtained set Sx comprises own nodes S, and a route calculation result is obtained.
In one embodiment, the step of obtaining, in real time, the link quality between the nodes by the radio access control unit of the access layer and updating the topology table includes:
the wireless access control unit of the access layer monitors the link quality between itself and each node in real time, and updates the link quality between itself and each node in the topology table of itself;
And the wireless access control unit of the access layer acquires the topology table sent by each node in real time, and updates the link quality between other nodes and each node in the topology table according to the received topology table.
In one embodiment, the method further comprises:
And the wireless IP unit of the access layer searches the route calculation of the destination node after updating the topology table of the wireless IP unit of the access layer last time according to the destination node, and directly acquires the route calculation result as the route calculation result.
A wireless mobile ad hoc network dynamic routing device based on a combination of an access layer and a network layer, the device comprising:
The topology table updating module is used for acquiring the link quality among the nodes in real time by the wireless access control unit of the access layer and updating the topology table;
The destination node determining module is used for determining a destination node according to the data to be transmitted by the wireless IP unit of the access layer when the data to be transmitted is received;
The route calculation module is used for traversing all transmission paths which can reach the destination node in the topology table according to the destination node by the wireless IP unit of the access layer, analyzing according to the data rate of the corresponding transmission path and determining a route calculation result;
And the transmission module is used for transmitting the data to be transmitted according to the route calculation result.
A computer device comprising a memory storing a computer program and a processor implementing the steps of the method when the processor executes the computer program.
A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method.
The wireless mobile ad hoc network dynamic routing method, the wireless mobile ad hoc network dynamic routing device, the wireless mobile ad hoc network dynamic routing computer device and the wireless mobile ad hoc network storage medium based on the combination of the access layer and the network layer acquire link quality among nodes in real time through a wireless access control unit of the access layer, and update a topology table; when receiving data to be transmitted, the wireless IP unit of the access layer determines a destination node according to the data to be transmitted; the wireless IP unit of the access layer traverses all transmission paths which can reach the destination node in a topology table according to the destination node, analyzes according to the data rate of the corresponding transmission paths, and determines a route calculation result; and transmitting the data to be transmitted according to the route calculation result, so that network overhead of route discovery and updating of the wireless mobile ad hoc network is reduced, and the effectiveness and availability of the wireless mobile ad hoc network route are improved.
Drawings
FIG. 1 is a flow diagram of a method for dynamic routing of a wireless mobile ad hoc network based on the association of an access layer and a network layer in one embodiment;
FIG. 2 is a block diagram of a prior art hierarchy of protocol stacks versus the hierarchy of the present application in one embodiment;
FIG. 3 is a software architecture diagram of the protocol stack of the present application in one embodiment;
Fig. 4 is a block diagram of a wireless mobile ad hoc network dynamic routing device based on the association of an access layer and a network layer in one embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
The wireless mobile ad hoc network dynamic routing method based on the combination of the access layer and the network layer can be applied to the wireless mobile ad hoc network. The wireless mobile ad hoc network comprises n nodes, the network nodes can be terminals or servers, the nodes can communicate with each other, the terminals can be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers and portable wearable devices, and the servers can be realized by independent servers or server clusters formed by a plurality of servers.
In one embodiment, as shown in fig. 1, a method for dynamically routing a wireless mobile ad hoc network based on the combination of an access layer and a network layer is provided, and the method is applied to one of the nodes for illustration, and includes the following steps:
step S220, the wireless access control unit of the access layer acquires the link quality among the nodes in real time, and updates the topology table.
As shown in fig. 2, the network layer (NET) of each node hierarchical design (left structure as shown in fig. 2) is combined with the access layer (MAC), and a topology updating and routing computation function module is designed in the access layer (right structure as shown in fig. 2). As shown in fig. 2 and 3, the physical layer (PHY) is divided into an access channel and a traffic channel, and the access layer (MAC) is divided into three logic units of Radio Access Control (RAC), radio Link Control (RLC), and Radio IP (RIP).
Each node in the wireless mobile ad hoc network adopts a tightly coupled protocol stack cross-layer design method, fully utilizes the supporting capability provided by a physical layer and an MAC layer (access layer), compresses the overhead, and realizes the real-time control of the high dynamic topology under the centerless condition. Each node adopts the design idea of the instant route, and realizes the real-time optimized response to the route under the high dynamic topology condition. Each node dynamic route is realized by the following steps: ① . The physical layer provides channel link quality estimates for the control packets; ② . The joint design of the route control packet and the channel access control packet; ③ . The following path calculates the next hop forwarding node without pre-establishing a route.
The RAC unit (radio access control unit of the access layer) is responsible for topology maintenance. The topology table content is the link quality (CQI) between nodes, which is a signal-to-noise ratio estimate at the time of transmission preparation (RTS) and transmission acknowledgement (CTS) reception by the physical layer. Topology tables are propagated through RTS and CTS. And each node updates the topology table by interception and reception, and continuously perfects the own topology table.
In step S240, when the data to be transmitted is received, the radio IP unit of the access layer determines the destination node according to the data to be transmitted.
Step S260, the wireless IP unit of the access layer traverses all transmission paths which can reach the destination node in the topology table according to the destination node, analyzes according to the data rate of the corresponding transmission path, and determines the route calculation result.
Wherein the topology table is updated at the RAC unit, but the routing calculation is done at the RIP unit (radio IP unit of the access layer). The calculated output is a one-hop forwarding address table. When the topology table is updated, routing calculation is required to be carried out on all IP packets in the wireless IP buffer queue; when a new IP packet (data to be transmitted) is inserted into the queue, a routing calculation is required for the IP packet (data to be transmitted). In the calculation process, the destination IP addresses are directly copied in the same way, and repeated calculation is not needed.
Step S280, transmitting the data to be transmitted according to the route calculation result.
In one embodiment, the step of traversing all transmission paths capable of reaching the destination node in the topology table by the radio IP unit of the access layer according to the destination node, analyzing according to the data rate of the corresponding transmission paths, and determining the route calculation result includes:
traversing all nodes which are not 0 in TP [ x 1 ] [ j ] in a topology table according to the destination node by a wireless IP unit of an access layer to obtain a set S1, and recording transmission time L/R (TP [ S i ] [ j ]) required by each node in the set S1 to the destination node j, wherein TP [ ] is the topology table, and TP [ x 1 ] [ j ] is the link quality between the x 1-th node and the destination node j; x 1 is the node number, x 1 epsilon 1, 2, 3 … … n, n is the total node number in the wireless mobile ad hoc network; s i is the node number, S i ε S1; j is a destination node; l is a data amount; r (TP [ s i ] [ j ]) is the data transmission rate corresponding to the s i th node and the destination node j;
and continuing to take each node in the set S1 as a traversing destination node, traversing all nodes which are not 0 in TP [ x 2][si ] in a topology table to obtain a set S2, recording the shortest transmission time L/R (TP [ x 2][si ]) required from each node in the set S2 to a target node j, and carrying out iterative traversal by taking each node in the set S2 as the next traversing destination node until all nodes which are not 0 are traversed in the topology table are iterated, wherein the obtained set Sx comprises own nodes S, and a route calculation result is obtained.
In this case, the route calculation process is described by taking the example in which the node 3 transmits data to the node 5. Let the data quantity be L (bytes), TP [ ] be topology table.
Find all x1 not 0 in TP [ x1] [5], record the transmission time L/R (TP [ x1] [5 ]) that x1 needs to node 5, R (TP [ x1] [5 ]) is the corresponding data transmission rate.
In the previous step, a node x2 which is not 0 in TP [ x2] [ x1] is found, and the shortest transmission time (the sum of the shortest times from x2 to x1 and from x1 to node 5) that all x2 reaches 5 nodes is recorded;
then, in the previous step, a node x3 which is not 0 in TP [ x3] [ x2] is found, and the shortest transmission time (the sum of the shortest times from x3 to x2 and from x2 to node 5) that all x3 reaches 5 nodes is recorded;
push all the way to node 3 (note xi=3), find the shortest transmission time and corresponding path from node 3 to node 5.
The first hop destination node from node 3 to node 5 is noted as the route calculation result.
In one embodiment, the step of obtaining the link quality between the nodes in real time through the wireless access control unit of the access layer and updating the topology table includes:
The wireless access control unit of the access layer monitors the link quality between itself and each node in real time, and updates the link quality between itself and each node in the topology table of itself;
The wireless access control unit of the access layer acquires the topology table sent by each node in real time, and updates the link quality between other nodes and each node in the topology table according to the received topology table.
In one embodiment, the method further comprises:
And the wireless IP unit of the access layer searches the route calculation of the destination node after the last self topology table update according to the destination node, and directly acquires the route calculation result as the route calculation result.
According to the wireless mobile ad hoc network dynamic routing method based on the combination of the access layer and the network layer, the wireless access control unit of the access layer is used for acquiring the link quality among all nodes in real time, and the topology table is updated; when receiving data to be transmitted, the wireless IP unit of the access layer determines a destination node according to the data to be transmitted; the wireless IP unit of the access layer traverses all transmission paths which can reach the destination node in the topology table according to the destination node, analyzes according to the data rate of the corresponding transmission path, and determines a route calculation result; and transmitting the data to be transmitted by using a route calculation result, so that network overhead of route discovery and updating of the wireless mobile ad hoc network is reduced, and the effectiveness and usability of the wireless mobile ad hoc network route are improved.
It should be understood that, although the steps in the flowchart of fig. 1 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 1 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of other steps or sub-steps of other steps.
In one embodiment, as shown in fig. 4, there is provided a wireless mobile ad hoc network dynamic routing device based on the combination of an access layer and a network layer, including: a topology table update module 310, a destination node determination module 320, a route calculation module 330, and a route calculation module 330.
The topology table updating module 310 is configured to obtain, in real time, link quality between each node by using a radio access control unit of an access layer, and update a topology table.
The destination node determining module 320 is configured to determine, when receiving data to be transmitted, a destination node according to the data to be transmitted by the radio IP unit of the access layer.
The route calculation module 330 is configured to traverse all transmission paths capable of reaching the destination node in the topology table according to the destination node by using the radio IP unit of the access layer, and analyze according to the data rate of the corresponding transmission path to determine a route calculation result;
and a transmission module 340, configured to transmit the data to be transmitted according to the route calculation result.
In one embodiment, the route calculation module 330 is further configured to: traversing all nodes which are not 0 in TP [ x 1 ] [ j ] in a topology table according to the destination node by a wireless IP unit of an access layer to obtain a set S1, and recording transmission time L/R (TP [ S i ] [ j ]) required by each node in the set S1 to the destination node j, wherein TP [ ] is the topology table, and TP [ x 1 ] [ j ] is the link quality between the x 1-th node and the destination node j; x 1 is the node number, x 1 epsilon 1,2, 3 … … n, n is the total node number in the wireless mobile ad hoc network; s i is the node number, S i ε S1; j is a destination node; l is a data amount; r (TP [ s i ] [ j ]) is the data transmission rate corresponding to the s i th node and the destination node j; and continuing to take each node in the set S1 as a traversing destination node, traversing all nodes which are not 0 in TP [ x 2][si ] in a topology table to obtain a set S2, recording the shortest transmission time L/R (TP [ x 2][si ]) required from each node in the set S2 to a target node j, and carrying out iterative traversal by taking each node in the set S2 as the next traversing destination node until all nodes which are not 0 are traversed in the topology table are iterated, wherein the obtained set Sx comprises own nodes S, and a route calculation result is obtained.
In one embodiment, topology table update module 310 is further configured to: the wireless access control unit of the access layer monitors the link quality between itself and each node in real time, and updates the link quality between itself and each node in the topology table of itself; the wireless access control unit of the access layer acquires the topology table sent by each node in real time, and updates the link quality between other nodes and each node in the self topology table according to the received topology table.
In one embodiment, the route calculation module 330 is further configured to: and the wireless IP unit of the access layer searches the route calculation of the destination node after the last self topology table update according to the destination node, and directly acquires the route calculation result as the route calculation result.
The specific limitation of the wireless mobile ad hoc network dynamic routing device based on the combination of the access layer and the network layer can be referred to as the limitation of the wireless mobile ad hoc network dynamic routing method based on the combination of the access layer and the network layer, and the description is omitted here. The modules in the wireless mobile ad hoc network dynamic routing device based on the combination of the access layer and the network layer can be all or partially realized by software, hardware and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, including a memory and a processor, where the memory stores a computer program, and the processor implements the steps of the wireless mobile ad hoc network dynamic routing method based on the combination of an access layer and a network layer when the processor executes the computer program.
In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor implements the steps of the wireless mobile ad hoc network dynamic routing method based on the combination of an access layer and a network layer described above.
Those skilled in the art will appreciate that implementing all or part of the above-described methods may be accomplished by way of a computer program, which may be stored on a non-transitory computer readable storage medium, that when executed may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile 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 (SYNCHLINK) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples illustrate only a few embodiments of the application, which are described in detail and are not to be construed as limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of protection of the present application is to be determined by the appended claims.
Claims (6)
1. A wireless mobile ad hoc network dynamic routing method based on the combination of an access layer and a network layer, the method comprising:
The method comprises the steps that link quality among nodes is obtained through real-time interception and receiving of a wireless access control unit of an access layer of a node, a topology table is updated, the content of the topology table is the link quality among the nodes, the link quality among the nodes is signal-to-noise ratio estimation when a physical layer performs transmission preparation and transmission confirmation receiving, the node adopts a tightly coupled protocol stack cross-layer design method, a topology updating and routing calculation function module is designed in the access layer, the physical layer of the node is divided into an access channel and a service channel, the access layer is divided into a wireless access control unit, a wireless link control unit and a wireless IP unit, and when the topology table is updated, routing calculation is needed to be performed on all IP packets in a wireless IP buffer queue;
When receiving data to be transmitted, the wireless IP unit of the access layer determines a destination node according to the data to be transmitted;
The wireless IP unit of the access layer traverses all transmission paths which can reach the destination node in a topology table according to the destination node, analyzes according to the data rate of the corresponding transmission paths, and determines a route calculation result;
Transmitting the data to be transmitted according to the route calculation result;
the wireless IP unit of the access layer traverses all transmission paths capable of reaching the destination node in a topology table according to the destination node, analyzes according to the data rate of the corresponding transmission paths, and determines a route calculation result, which comprises the following steps:
Traversing all nodes which are not 0 in TP [ x 1 ] [ j ] in a topology table by the wireless IP unit of the access layer according to the destination node to obtain a set S1, and recording transmission time L/R (TP [ S i ] [ j ]) required by each node in the set S1 to the destination node j, wherein TP [ ] is the topology table, and TP [ x 1 ] [ j ] is the link quality between the x1 st node and the destination node j; x 1 is the node number, x 1 epsilon 1, 2, 3 … … n, n is the total node number in the wireless mobile ad hoc network; s i is the node number, S i ε S1; j is a destination node; l is a data amount; r (TP [ s i ] [ j ]) is the data transmission rate corresponding to the s i th node and the destination node j;
And continuing to take each node in the set S1 as a traversing destination node, traversing all nodes which are not 0 in TP [ x 2][si ] in a topology table to obtain a set S2, recording the shortest transmission time L/R (TP [ x 2][si ]) required from each node in the set S2 to a target node j, and carrying out iterative traversal by taking each node in the set S2 as the next traversing destination node until iterating to traverse all nodes which are not 0 in the topology table, wherein the obtained set Sx comprises own nodes S, and a route calculation result is obtained, and the route calculation result is a one-hop forwarding address table.
2. The method according to claim 1, wherein the step of obtaining the link quality between the nodes in real time by the radio access control unit of the access layer and updating the topology table includes:
the wireless access control unit of the access layer monitors the link quality between itself and each node in real time, and updates the link quality between itself and each node in the topology table of itself;
And the wireless access control unit of the access layer acquires the topology table sent by each node in real time, and updates the link quality between other nodes and each node in the topology table according to the received topology table.
3. The method according to claim 1, wherein the method further comprises:
and the wireless IP unit of the access layer searches the route calculation of the destination node after updating the topology table of the wireless IP unit of the access layer last time according to the destination node, and directly acquires the route calculation result as the route calculation result.
4. A wireless mobile ad hoc network dynamic routing device based on a combination of an access layer and a network layer, the device comprising:
the topology table updating module is used for acquiring link quality among all nodes in real time by a wireless access control unit of an access layer of the node and updating the topology table, wherein the access layer is divided into a wireless access control unit, a wireless link control unit and a wireless IP unit, and when the topology table is updated, routing calculation is needed for all IP packets in a wireless IP buffer queue;
The destination node determining module is used for determining a destination node according to the data to be transmitted by the wireless IP unit of the access layer when the data to be transmitted is received;
The route calculation module is used for traversing all transmission paths which can reach the destination node in the topology table according to the destination node by the wireless IP unit of the access layer, analyzing according to the data rate of the corresponding transmission path and determining a route calculation result;
The transmission module is used for transmitting the data to be transmitted according to the route calculation result;
The route calculation module is further configured to: traversing all nodes which are not 0 in TP [ x 1 ] [ j ] in a topology table by the wireless IP unit of the access layer according to the destination node to obtain a set S1, and recording transmission time L/R (TP [ S i ] [ j ]) required by each node in the set S1 to the destination node j, wherein TP [ ] is the topology table, and TP [ x 1 ] [ j ] is the link quality between the x1 st node and the destination node j; x 1 is the node number, x 1 epsilon 1,2,3 … … n, n is the total node number in the wireless mobile ad hoc network; s i is the node number, S i ε S1; j is a destination node; l is a data amount; r (TP [ s i ] [ j ]) is the data transmission rate corresponding to the s i th node and the destination node j;
And continuing to take each node in the set S1 as a traversing destination node, traversing all nodes which are not 0 in TP [ x 2][si ] in a topology table to obtain a set S2, recording the shortest transmission time L/R (TP [ x 2][si ]) required from each node in the set S2 to a target node j, and carrying out iterative traversal by taking each node in the set S2 as the next traversing destination node until iterating to traverse all nodes which are not 0 in the topology table, wherein the obtained set Sx comprises own nodes S, and a route calculation result is obtained, and the route calculation result is a one-hop forwarding address table.
5. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 3 when the computer program is executed.
6. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111528058.XA CN114390632B (en) | 2021-12-14 | 2021-12-14 | Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111528058.XA CN114390632B (en) | 2021-12-14 | 2021-12-14 | Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114390632A CN114390632A (en) | 2022-04-22 |
| CN114390632B true CN114390632B (en) | 2024-09-06 |
Family
ID=81195500
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111528058.XA Active CN114390632B (en) | 2021-12-14 | 2021-12-14 | Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114390632B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060068440A (en) * | 2004-12-16 | 2006-06-21 | 삼성전자주식회사 | How to set up routing path in mobile ad hoc network environment and network device using same |
| CN110831104A (en) * | 2019-12-04 | 2020-02-21 | 深圳市纽瑞芯科技有限公司 | A network routing method for a linear topology wireless ad hoc network |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7843891B2 (en) * | 2006-05-11 | 2010-11-30 | Tropos Networks, Inc. | Mobile node data transmission rate selection |
| KR100955246B1 (en) * | 2008-03-12 | 2010-04-29 | 울산대학교 산학협력단 | Dynamic Group Source Routing Method for Wireless Mobile Ad Hoc Network |
| CN101945432B (en) * | 2010-09-16 | 2016-11-23 | 北京邮电大学 | A kind of multi tate chance method for routing for wireless mesh network |
| CN103338495B (en) * | 2013-07-04 | 2014-05-14 | 南京信息工程大学 | Two-way energy balance wireless sensing network route method based on LEPS |
-
2021
- 2021-12-14 CN CN202111528058.XA patent/CN114390632B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060068440A (en) * | 2004-12-16 | 2006-06-21 | 삼성전자주식회사 | How to set up routing path in mobile ad hoc network environment and network device using same |
| CN110831104A (en) * | 2019-12-04 | 2020-02-21 | 深圳市纽瑞芯科技有限公司 | A network routing method for a linear topology wireless ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114390632A (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7778235B2 (en) | Compression of a routing header in a packet by a mobile router in an ad hoc network | |
| US8064416B2 (en) | Route selection in wireless networks | |
| US8213352B2 (en) | Wireless communication system, wireless communication device, wireless communication method, and program | |
| CN100576809C (en) | Access and Routing Calculation Method in Large-Scale Dynamic Heterogeneous Hybrid Wireless Ad Hoc Networks | |
| US20050053007A1 (en) | Route selection in mobile ad-hoc networks based on traffic state information | |
| WO2020156340A1 (en) | Data transmission method and apparatus | |
| JP2007325261A (en) | Route establishment method | |
| Singh et al. | A survey: Ad-hoc on demand distance vector (AODV) protocol | |
| US20050157749A1 (en) | System and method for communication with an external network in an IPv6 MANET network | |
| CN104955104B (en) | A kind of transmission method and device of data | |
| CN102170660A (en) | Multi-path route constructing method and system based on APDV (Ad Hoc On-demand Distance Vector) | |
| Mu | An improved AODV routing for the zigbee heterogeneous networks in 5G environment | |
| Gupta et al. | Routing protocols in mobile ad-hoc networks | |
| Omar et al. | On-demand source routing with reduced packets protocol in mobile ad-hoc networks | |
| Rahem et al. | Topology sense and graph-based TSG: efficient wireless ad hoc routing protocol for WANET | |
| CN114390632B (en) | Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer | |
| Sengupta et al. | Designing an enhanced ZRP algorithm for MANET and simulation using OPNET | |
| JP5860135B2 (en) | Communication device search method, communication device, communication device search program, and ad hoc network system | |
| CN102573000A (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| SreeRangaRaju et al. | Optimized ZRP for MANETs and its Applications | |
| Abbas et al. | Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery | |
| Le et al. | An efficient hybrid routing approach for hybrid wireless mesh networks | |
| Raju et al. | ZRP versus aodv and dsr: A comprehensive study on zrp performance on manets | |
| Rajput et al. | Comparative Analysis of Original AODV and AODV-DOR Routing Protocols in Mobile Ad-hoc Networks | |
| Mewada et al. | Measurement based performance of reactive and proactive routing protocols in wmn |
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 |