CN115002863A - Wireless network routing method and storage medium suitable for large-scale network - Google Patents
Wireless network routing method and storage medium suitable for large-scale network Download PDFInfo
- Publication number
- CN115002863A CN115002863A CN202210622967.8A CN202210622967A CN115002863A CN 115002863 A CN115002863 A CN 115002863A CN 202210622967 A CN202210622967 A CN 202210622967A CN 115002863 A CN115002863 A CN 115002863A
- Authority
- CN
- China
- Prior art keywords
- node
- supervision
- information
- election
- local
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000012423 maintenance Methods 0.000 claims abstract description 15
- 230000004044 response Effects 0.000 claims abstract description 9
- 238000012544 monitoring process Methods 0.000 claims description 26
- 238000004590 computer program Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000008859 change Effects 0.000 claims description 3
- 230000004083 survival effect Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 8
- 238000010276 construction Methods 0.000 abstract description 2
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005034 decoration Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
Images
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/023—Limited or focused flooding to selected areas of a network
-
- 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- 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)
Abstract
The application discloses a wireless network routing method and a storage medium suitable for a large-scale network. The method comprises the following steps: selecting a supervision node according to the supervision capability of each node in the network, and generating a supervision link from an unsupervised node to the supervision node; the unsupervised node sends link state information to the supervised node through the supervised link, and the supervised node forms a network topology structure information table according to the link state information; the supervision node carries out supervision link maintenance and network topology structure information table maintenance; in response to the routing request information of the unsupervised node, the supervising node sends routing query information to the unsupervised node over the supervising link based on the maintained network topology information table. The invention can reduce the distribution of the route control information in the process of route construction and maintenance, reduces the network overhead and is suitable for large-scale networks.
Description
Technical Field
The present disclosure relates to the field of network technologies, and in particular, to a wireless network routing method and a storage medium suitable for a large-scale network.
Background
The mobile self-organizing network can utilize the routing forwarding function of the terminal to carry out networking communication under the condition of no infrastructure, and the distributed control and centerless network structure can maintain the residual communication capability under the condition of partial node failure and has strong robustness and survivability. In the traditional routing protocol of the mobile ad hoc network, in the process of establishing the routing, a source node establishes a routing table in a broadcasting mode, so that each node stores a large amount of redundant routing information, and the network overhead is high. When the number of nodes in the network is increased, a traditional routing protocol generates a large amount of routing control information, and the throughput rate of the network is affected, so that the key for improving the network performance is to reduce the network routing overhead in a large-scale mobile ad hoc network.
Disclosure of Invention
In view of at least one of the drawbacks or needs for improvement in the prior art, the present invention provides a wireless network routing method and a storage medium suitable for a large-scale network, which can reduce distribution of routing control information during routing construction and maintenance, reduce network overhead, and are suitable for a large-scale network.
To achieve the above object, according to a first aspect of the present invention, there is provided a wireless network routing method applicable to a large-scale network, including:
s101, selecting a supervision node according to supervision capacity of each node in a network, and generating a supervision link from an unsupervised node to the supervision node;
s102, an unsupervised node sends link state information to a supervision node through a supervision link, and the supervision node forms a network topology structure information table according to the link state information;
s103, the supervision node carries out supervision link maintenance and network topology structure information table maintenance;
s104, responding to the routing request information packet of the unsupervised node, the supervising node sends routing inquiry information to the unsupervised node through the supervising link based on the maintained network topology structure information table.
Further, the S101 includes:
step 1.1, calculating the supervision capability value of each node, and constructing local supervision information record information of each node, wherein the local supervision node record information at least comprises a supervision node address, the hop number from the node to the supervision node, the next hop node address of the node to the supervision node, the supervision capability value and a version number which indicates that the node plays the role of the supervision node for the second time;
and step 1.2, each node defaults to be a monitoring node, broadcasts and releases an election information group to other nodes, wherein the election information group at least comprises a monitoring node address, hop counts from the node to the monitoring node and a monitoring capability value, and the node receiving the election information group selects the monitoring node according to the election information group and the local monitoring node record information.
Further, the selecting the supervision node according to the election information group and the local supervision node record information includes:
step 1.2.1, the node receiving the election information group compares the supervision address in the election information group with the supervision address of the local supervision node record information, if the supervision addresses are the same, the step 1.2.2 is carried out, and if the supervision addresses are different, the step 1.2.3 is carried out;
step 1.2.2, if the hop count in the election information packet is greater than or equal to the hop count in the local supervision node information record, discarding the election information packet, if the hop count in the election information packet is less than the hop count in the local supervision node information record, modifying the next hop node address in the supervision node information record as the node address sending the election information packet, modifying the hop count in the supervision node information record as the hop count in the election information packet, then adding 1 to the hop count in the election information packet, broadcasting the election information packet to the neighbor node, and turning to step 1.2.4;
step 1.2.3, if the supervision ability value in the election information group is smaller than the supervision ability value in the local supervision node record information, discarding the election information group, if the supervision ability value in the election information group is larger than the supervision ability value in the local supervision node record information, broadcasting the election information group to the neighbor node, and turning to step 1.2.4, if the supervision ability value in the election information group is equal to the supervision ability value in the local supervision node record information, comparing the supervision node address in the local supervision node record information with the supervision node address in the election information group, selecting the information with the address with the front address sequence number in the two for recording, and turning to step 1.2.4;
and step 1.2.4, sending an election response information packet to a next hop node in the local supervision node record information, and if the next hop node in the local supervision node record information is changed, simultaneously sending the election response packet to an original next hop node of the local supervision node record information to form a supervision link.
Further, the local supervision node record information further comprises an optional period, a sequence number and timing, the election information packet further comprises an optional period and a sequence number, the optional period is used for indicating the optional period duration of the supervision node, the sequence number is used for identifying the old and new of the local supervision node record information, the timing is used for detecting the survival state of the supervision node, if the supervision node does not receive the message from the supervision node within the timing time, the supervision node is considered to be dead, and the supervision node is reselected.
Further, the calculation formula for calculating the supervision capability value of each node is as follows:
∑a j ＝1
in the formula, MCV i Denotes the supervision ability value of the ith node, e j Is the j influenceFactor, a j Is the weight coefficient of the jth influencing factor.
Further, the S102 includes:
the non-supervision node sends a neighbor node information packet to the supervision node through the supervision link, the neighbor node information packet records neighbor node information of the non-supervision node, and the supervision node forms a network topology structure information table according to the neighbor node information packet.
Further, the supervising link maintenance comprises:
step 3.1, the supervision node periodically sends broadcast patrol information packets to other nodes, wherein the broadcast patrol information packets at least comprise the hop counts from the node to the supervision node and the version number which indicates that the node plays the role of the supervision node for the second time;
step 3.2, the other nodes compare the version number of the received broadcast patrol information packet with the version number in the local supervision node record information, if the version number of the broadcast patrol information packet is earlier than the version number of the local supervision node record information, the broadcast patrol information packet is discarded, if the version number of the broadcast patrol information packet is the same as the version number of the local supervision node record information, the step 3.3 is entered, otherwise, the step 3.4 is entered;
step 3.3, if the hop count of the broadcast patrol information packet is less than the hop count of the local supervision node record information, entering step 3.4, otherwise, discarding the broadcast patrol information packet;
and 3.4, modifying the version number and the hop count in the local supervision node record information to be the same as the broadcast patrol information packet, and modifying the next hop address in the local supervision node record information to be the adjacent node address for sending the broadcast patrol information packet.
Further, the maintaining of the network topology information table includes:
when the connection relation between two adjacent nodes changes, the two nodes send connection relation information packets to the supervision node along the supervision link, the connection relation information packets are used for representing the change of the connection relation of the nodes, and the supervision node updates the network topology structure information table after receiving the connection relation information packets.
Further, the S104 includes:
if the supervision node receives the routing request information packet sent by the unsupervised node, the routing request information packet records the address of the destination node, and the supervision node encapsulates the routing information in the routing reply information packet and sends the routing information packet to the request node corresponding to the routing request information packet.
According to a second aspect of the present invention, there is also provided a storage medium storing a computer program executable by an access authentication apparatus, the computer program causing the access authentication apparatus to perform the steps of any one of the methods described above when run on the access authentication apparatus.
In general, compared with the prior art, the above technical solution contemplated by the present invention can achieve the following beneficial effects:
(1) a wireless network routing model based on supervision links is established, the supervision nodes are selected through competition, each common node generates a supervision link pointing to the supervision node, the supervision links and the supervision nodes can be generated only through one-time flooding, the convergence speed of the network is greatly accelerated, and topology control information is greatly reduced.
(2) In the routing method, as the supervision node bears more data forwarding tasks, the resource consumption of the supervision node is higher, the role in the whole network is more important, the periodical election and updating of the supervision node can effectively enhance the survivability of the network, and when the supervision node is attacked, the updating mechanism can effectively ensure the safety of the network.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic routing diagram of a wireless network suitable for a large-scale network according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a wireless network routing method suitable for a large-scale network according to an embodiment of the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
The terms "including" and "having," and any variations thereof in the description and claims of this application and the above-described drawings, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
The invention provides a wireless network route control method for a large-scale network, which fully considers the important function of a supervision node in the network, and the supervision node maintains the state information of the whole network, thereby avoiding the storage of redundant route information by a common node, and comprises the following steps: firstly, a wireless network routing model based on a supervision link is established, each node selects supervision nodes according to the competition of the supervision capacity of the link, a supervision link of the current network is generated, and the link state of the network is collected; secondly, link state monitoring is carried out according to a network structure, when the network topology structure is changed due to the death of an old node or the addition of a new node in the network, the monitoring node carries out patrol through periodic flooding broadcast and updates the network topology structure and the link state of the whole network according to the link state feedback; and finally, when any node in the network has a routing information request, sending the routing request to a supervision node, and inquiring a routing table by the supervision node to reply the routing information.
As shown in fig. 1, a network node and a link map formed according to the routing method include a supervision node, a normal node (unsupervised node), a supervision link, and a normal link (unsupervised link), where the normal node sends link state information to the supervision node through the supervision link, and the supervision node sends route query information to the normal node through the supervision link.
As shown in fig. 2, a wireless network routing control method for a large-scale network according to an embodiment of the present invention includes:
s101, selecting a monitoring node according to the monitoring capability of each node in the network, and generating a monitoring link from an unsupervised node to the monitoring node.
Further, the S101 includes step 1.1 to step 1.2.
Step 1.1, defining node supervision capacity values, calculating the supervision capacity values of all nodes, and constructing local supervision information record information of all nodes.
For each node in the network, the node supervision capacity value is calculated to judge whether the node has the capacity of serving as a supervision node, and the calculation method of the supervision capacity value is represented as follows:
∑a j ＝1
wherein, MCV i Denotes the supervision ability value of the ith node, e j For the jth influence factor, such as link bandwidth, self energy and number of neighbor nodes, a j Is the weight coefficient of the jth influencing factor.
When the node calculates the supervision ability value for the first time, the node constructs supervision node record information for recording the condition pointing to the supervision node, and the supervision node record information is expressed as:
< MCV, hop count, expiration, version number, sequence number, timing, supervision node address, next hop address >
The MCV is used for recording the supervision capacity value of the supervision node; the hop count represents the hop count which the node needs to pass through to the supervision node; the Node is used for determining how long the supervision Node can bear the task, the supervision Node adopts an arbitrary system, and when the time of bearing the supervision Node by the Node exceeds the arbitrary system, the whole network initiates the election process of the supervision Node (MN); the version number is used for identifying the number of the supervision tasks born by the current supervision node; the serial number is used for identifying the old and new of the supervision record information and also plays a role in time synchronization; the timing is mainly used for detecting the survival state of the supervision node, if the message from the supervision node is not received within the timing time, the supervision node is considered to be dead, and the supervision node is elected again; the supervision node address is used for recording the physical address of the supervision node; the next hop node address is used for recording the next hop node address of the common node leading to the supervision node.
The process of electing the supervision node is a flooding process, and if the node is a node with a low supervision capacity value (MCV), the supervision node information recorded by the node is covered in the flooding process of the node with the highest supervision capacity value (namely, the supervision node), so that correct supervision node information is recorded.
Step 1.2: each node defaults to be a monitoring node, broadcasts and issues election information groups to other nodes, and the nodes receiving the election information groups select the monitoring nodes according to the election information groups and the local monitoring node record information.
Firstly, the node defaults itself as a monitoring node, and broadcasts and issues election grouping to other nodes, wherein the election information grouping is expressed as:
< type, reservation, prefix length, hop count, version number, sequence number, expiration, MCV, supervision node address >
The type is used for identifying the election information group; reserving data with the prefix length related to the grouped data and recording the data such as the packet length and the like; the hop count, the version number, the serial number, the expiration date, the supervision capacity value and the supervision node address have the same function as the corresponding fields in the supervision record information;
when the node receives the election information group from other nodes, the supervision node is selected according to the election information group and the local supervision node record information, and the method comprises the following steps:
step 1.2.1: and comparing the supervision node address in the received election packet with the supervision node address in the local supervision node record information, and if the supervision node address in the election packet is equal to the supervision node address in the local supervision node record information, turning to the step 1.2.2, and if the supervision node address in the election packet is not equal to the supervision node address in the local supervision node record information, turning to the step 1.2.3.
Step 1.2.2: and comparing the hop count in the election packet with the hop count in the information record of the local supervision node, discarding the election packet if the hop count in the information record of the local supervision node is greater than or equal to the hop count in the information record of the local supervision node, modifying the address of the next hop node in the information record of the supervision node as the address of the node sending the packet and the hop count as the hop count in the election information packet if the hop count in the information record of the local supervision node is less than the hop count in the information record of the local supervision node, adding 1 to the hop count in the election packet, broadcasting the election packet to the neighbor node of the node receiving the election information packet, and turning to the step 1.2.4. And after receiving the election information packet, the neighbor node judges according to the same rule of the steps 1.2.1-1.2.4, and can record the shortest path inevitably.
And modifying the next hop node address in the node information record into the node address for sending the election packet and modifying the hop count in the supervision node information record into the hop count of the election packet, wherein the next hop node with the minimum hop count leading to the supervision node is selected.
Step 1.2.3: and comparing the supervision capacity value in the election group with the supervision capacity value in the local supervision node information record, if the supervision capacity value in the local supervision node information record is smaller than the supervision capacity value in the local supervision node information record, discarding the election group, if the supervision capacity value in the local supervision node information record is larger than the supervision capacity value in the local supervision node information record, broadcasting the election information group to the neighbor node, and going to the step 1.2.4, if the supervision capacity value in the local supervision node information record is equal to the supervision capacity value in the local supervision node information record, comparing the address of the supervision node in the local supervision node record with the address of the supervision node in the election group, selecting the information with the address sequence number before the address sequence number in the two for recording, and going to the step 1.2.4.
Step 1.2.4: and sending an election competition response packet to a next hop node in the supervision node information record, and if the next hop node in the supervision node information record is changed, simultaneously sending the election competition response packet to the original next hop node to form a supervision link.
And meanwhile, sending an election response packet to the original next hop node is used for informing the original next hop node of deleting the reverse link.
Election response packet structure: < type, version number, sequence number, Supervisory node Address, sending node Address >
The type is used for identifying the packet type, and the version number, the sequence number and the supervision node address are the same as the values in the node local supervision node record.
S102, the unsupervised node sends link state information to the supervised node through the supervised link, and the supervised node forms a network topology structure information table according to the link state information.
After the monitoring node competes for network stability, the common node sends the adjacent node information grouping to the monitoring node through the monitoring link, and the common node is mainly used for sending the adjacent node information and the link state information between the adjacent node information grouping to the monitoring node.
Structure of neighbor node information packet:
< type, flag, reserved, prefix length, version number, sequence number, sending node address, neighboring node 1 address and link status, neighboring node 2 address and link status, … … >
The sending node address is the node address for sending the adjacent node information packet, the adjacent node X address and the link state are the node address adjacent to the node and the link state information between the node address and the link state information, and the specific content can be customized.
After receiving the neighbor node information from other nodes, the supervising node establishes an adjacency table locally for recording the network topology structure.
Adjacency table structure:
< node 1 address, node 1 neighbor node address set, sequence number, status information; node 2 address
Node 2 neighbor address set, sequence number, state information; … … >
As the supervision node collects link information, a topology information table of the whole network is formed in the supervision node.
S103, the supervision node carries out supervision link maintenance and network topology structure information table maintenance.
Further, supervisory link maintenance comprises step 3.1 to step 3.4:
and 3.1, the supervision node periodically sends broadcast patrol information packets to other nodes to maintain supervision links.
The broadcast patrol information packet has the structure that:
< type, reserved, prefix length, hop count, version number, sequence number, due period, supervision node address >
And 3.2, comparing the version number of the received broadcast patrol packet with the version number in the local supervision information record, discarding the broadcast patrol information packet if the version number of the broadcast patrol information packet is earlier than the version number of the local supervision node record information, entering the step 3.3 if the version number of the broadcast patrol information packet is the same as the version number of the local supervision node record information, and entering the step 3.4 if the version number of the broadcast patrol information packet is not the same as the version number of the local supervision node record information.
And 3.3, if the hop count of the broadcast patrol information packet is less than the hop count of the local supervision node record information, entering the step 3.4, otherwise, discarding the broadcast patrol information packet.
And 3.4, modifying the version number and the hop count in the local supervision node record information to be the same as the broadcast patrol information packet, and modifying the next hop address in the local supervision node record information to be the adjacent node address for sending the broadcast patrol information packet.
The maintenance of the network topology structure information table is realized by feeding back the link state through the common nodes.
In order for a supervising node to grasp the structure of a network in time, when the connection state between nodes changes, it is necessary to transmit link state information to the supervising node. The feedback of the node to the connection state is completed by sending a connection relation group to the supervision node.
Structure of connection relation group:
< type, flag bit, prefix length, version number, sequence number, link state identifier, sending node address, neighboring node address >
The link state identification is used for recording the on-off state of the link, and the sending node address and the adjacent node address are used for recording the adjacency relation.
When the connection relation between two adjacent nodes changes, the two nodes send connection relation groups to the supervision node along the supervision link, and the change of the connection relation of the nodes is reflected through the connection relation groups. And after receiving the connection relation group, the supervision node updates the topological structure information table.
S104, responding to the routing request information packet of the unsupervised node, the supervising node sends routing inquiry information to the unsupervised node through the supervising link based on the maintained network topology structure information table.
The route acquisition comprises the following steps:
and the common node sends a routing request packet to the supervision node through the supervision link, and when the supervision node receives the routing request packet, the routing information is packaged in a routing reply packet and sent to the routing information request node.
Route request packet format: < type, version number, sequence number, source node address, destination node address >
The type is used for identifying the type of the packet, the version number and the sequence number are the same as those in the supervision node record, the source node address is the node address needing to send the data packet, and the destination node address is the destination node address needing to be reached by the data packet
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.
The present application also provides a storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above-described method. The computer-readable storage medium may include, but is not limited to, any type of disk including floppy disks, optical disks, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
The above description is merely an exemplary embodiment of the present disclosure, and the scope of the present disclosure is not limited thereto. That is, all equivalent changes and modifications made in accordance with the teachings of the present disclosure are intended to be included within the scope of the present disclosure. Embodiments of the present disclosure will be readily apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
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.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A wireless network routing method applicable to a large-scale network is characterized by comprising the following steps:
s101, selecting a supervision node according to supervision capacity of each node in a network, and generating a supervision link from an unsupervised node to the supervision node;
s102, an unsupervised node sends link state information to a supervision node through a supervision link, and the supervision node forms a network topology structure information table according to the link state information;
s103, the supervision node carries out supervision link maintenance and network topology structure information table maintenance;
s104, responding to the routing request information packet of the unsupervised node, the supervising node sends routing inquiry information to the unsupervised node through the supervising link based on the maintained network topology structure information table.
2. The wireless network routing method applicable to large-scale networks according to claim 1, wherein the S101 includes:
step 1.1, calculating the supervision capability value of each node, and constructing local supervision information record information of each node, wherein the local supervision information record information at least comprises a supervision node address, the hop count from the node to the supervision node, the next hop node address of the node to the supervision node, the supervision capability value and a version number which represents that the node plays the role of the supervision node for the second time;
and step 1.2, each node defaults to be a monitoring node, broadcasts and releases an election information group to other nodes, wherein the election information group at least comprises a monitoring node address, hop counts from the node to the monitoring node and a monitoring capability value, and the node receiving the election information group selects the monitoring node according to the election information group and the local monitoring node record information.
3. The wireless network routing method applicable to large-scale networks of claim 2, wherein the selecting of the supervising node according to the election information packet and the local supervising node record information comprises:
step 1.2.1, the node receiving the election information group compares the supervision address in the election information group with the supervision address of the local supervision node record information, if the supervision addresses are the same, the step 1.2.2 is carried out, and if the supervision addresses are different, the step 1.2.3 is carried out;
step 1.2.2, if the hop count in the election information packet is greater than or equal to the hop count in the local supervision node information record, discarding the election information packet, if the hop count in the election information packet is less than the hop count in the local supervision node information record, modifying the next hop node address in the supervision node information record as the node address sending the election information packet, modifying the hop count in the supervision node information record as the hop count in the election information packet, then adding 1 to the hop count in the election information packet, broadcasting the election information packet to the neighbor node, and turning to step 1.2.4;
step 1.2.3, if the supervision ability value in the election information group is smaller than the supervision ability value in the local supervision node record information, discarding the election information group, if the supervision ability value in the election information group is larger than the supervision ability value in the local supervision node record information, broadcasting the election information group to the neighbor node, and turning to step 1.2.4, if the supervision ability value in the election information group is equal to the supervision ability value in the local supervision node record information, comparing the supervision node address in the local supervision node record information with the supervision node address in the election information group, selecting the information with the address with the front address sequence number in the two for recording, and turning to step 1.2.4;
and step 1.2.4, sending an election response information packet to a next hop node in the local supervision node record information, and if the next hop node in the local supervision node record information is changed, simultaneously sending the election response packet to an original next hop node of the local supervision node record information to form a supervision link.
4. The method as claimed in claim 2, wherein the local supervision node record information further includes an expiration, a sequence number and a timing, the election information packet further includes an expiration and a sequence number, the expiration is used for indicating the expiration duration of the supervision node, the sequence number is used for identifying the old and new of the local supervision node record information, the timing is used for detecting the survival status of the supervision node, and if the supervision node does not receive the message from the supervision node within the timing time, the supervision node is considered to be dead, and the supervision node is reselected.
5. The wireless network routing method applicable to large-scale networks according to claim 2, wherein the calculation formula for calculating the supervision capability value of each node is as follows:
∑a j ＝1
in the formula, MCV i Denotes the supervision ability value of the ith node, e j Is the j influence factor, a j Is the weight coefficient of the jth influencing factor.
6. The wireless network routing method applicable to large-scale networks according to claim 1, wherein the S102 includes:
the non-supervision node sends a neighbor node information packet to the supervision node through the supervision link, the neighbor node information packet records neighbor node information of the non-supervision node, and the supervision node forms a network topology structure information table according to the neighbor node information packet.
7. The wireless network routing method applicable to large-scale networks of claim 2, wherein the supervising link maintenance comprises:
step 3.1, the supervision node periodically sends broadcast patrol information packets to other nodes, wherein the broadcast patrol information packets at least comprise the hop counts from the node to the supervision node and the version number which indicates that the node plays the role of the supervision node for the second time;
step 3.2, the other nodes compare the version number of the received broadcast patrol information packet with the version number in the local supervision node record information, if the version number of the broadcast patrol information packet is earlier than the version number of the local supervision node record information, the broadcast patrol information packet is discarded, if the version number of the broadcast patrol information packet is the same as the version number of the local supervision node record information, the step 3.3 is entered, otherwise, the step 3.4 is entered;
step 3.3, if the hop count of the broadcast patrol information packet is less than the hop count of the local supervision node record information, entering step 3.4, otherwise, discarding the broadcast patrol information packet;
and 3.4, modifying the version number and the hop count in the local supervision node record information to be the same as the broadcast patrol information packet, and modifying the next hop address in the local supervision node record information to be the adjacent node address for sending the broadcast patrol information packet.
8. The wireless network routing method for large-scale networks of claim 1, wherein the network topology information table maintenance comprises:
when the connection relation between two adjacent nodes changes, the two nodes send connection relation information packets to the supervision node along the supervision link, the connection relation information packets are used for representing the change of the connection relation of the nodes, and the supervision node updates the network topology structure information table after receiving the connection relation information packets.
9. The wireless network routing method applicable to large-scale networks according to claim 1, wherein the S104 includes:
if the supervision node receives the routing request information packet sent by the unsupervised node, the routing request information packet records the address of the destination node, and the supervision node encapsulates the routing information in the routing reply information packet and sends the routing information packet to the request node corresponding to the routing request information packet.
10. A storage medium storing a computer program executable by an access authentication device, the computer program causing the access authentication device to perform the steps of the method of any one of claims 1 to 9 when run on the access authentication device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210622967.8A CN115002863B (en) | 2022-06-02 | 2022-06-02 | Wireless network routing method suitable for large-scale network and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210622967.8A CN115002863B (en) | 2022-06-02 | 2022-06-02 | Wireless network routing method suitable for large-scale network and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115002863A true CN115002863A (en) | 2022-09-02 |
| CN115002863B CN115002863B (en) | 2024-05-17 |
Family
ID=83031774
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210622967.8A Active CN115002863B (en) | 2022-06-02 | 2022-06-02 | Wireless network routing method suitable for large-scale network and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115002863B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115622650A (en) * | 2022-09-08 | 2023-01-17 | 中国人民解放军国防科技大学 | Method and device for time synchronization and route maintenance of narrowband ad hoc network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| US20130103739A1 (en) * | 2011-10-21 | 2013-04-25 | Cisco Technology, Inc. | Obtaining Dynamic Connected-Network Topology Via any Node in Network |
| US20130215739A1 (en) * | 2012-02-21 | 2013-08-22 | Yikun Zhang | Routing method for a wireless multi-hop network |
| WO2017101575A1 (en) * | 2015-12-16 | 2017-06-22 | 中兴通讯股份有限公司 | Wireless ad hoc network routing method and device |
| CN111556550A (en) * | 2020-03-17 | 2020-08-18 | 西安电子科技大学 | Routing method for unmanned aerial vehicle network communication |
-
2022
- 2022-06-02 CN CN202210622967.8A patent/CN115002863B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| US20130103739A1 (en) * | 2011-10-21 | 2013-04-25 | Cisco Technology, Inc. | Obtaining Dynamic Connected-Network Topology Via any Node in Network |
| US20130215739A1 (en) * | 2012-02-21 | 2013-08-22 | Yikun Zhang | Routing method for a wireless multi-hop network |
| WO2017101575A1 (en) * | 2015-12-16 | 2017-06-22 | 中兴通讯股份有限公司 | Wireless ad hoc network routing method and device |
| CN111556550A (en) * | 2020-03-17 | 2020-08-18 | 西安电子科技大学 | Routing method for unmanned aerial vehicle network communication |
Non-Patent Citations (4)
| Title |
|---|
| CHANG, HAOTIAN: "Reinforcement Learning-Based Data Forwarding in Underwater Wireless Sensor Networks with Passive Mobility", 《SENSORS》, 28 February 2019 (2019-02-28) * |
| 孙兵;: "基于无线传感网络技术的变电站高压侧监测***路由优化设计", 内蒙古电力技术, no. 04, 28 August 2013 (2013-08-28) * |
| 方泽明;马传香;: "Ad Hoc入侵检测监视节点的自适应选择算法", 计算机工程, no. 17, 5 September 2008 (2008-09-05) * |
| 无线多媒体传感器网络路由技术研究: "无线多媒体传感器网络路由技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》, 15 February 2020 (2020-02-15) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115622650A (en) * | 2022-09-08 | 2023-01-17 | 中国人民解放军国防科技大学 | Method and device for time synchronization and route maintenance of narrowband ad hoc network |
| CN115622650B (en) * | 2022-09-08 | 2024-06-18 | 中国人民解放军国防科技大学 | Method and device for time synchronization and route maintenance of narrowband ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115002863B (en) | 2024-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111031544B (en) | Multi-network coexisting multi-frequency-point wireless communication networking method | |
| US7916666B2 (en) | Reliable broadcast protocol and apparatus for sensor networks | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| US9450830B2 (en) | Node apparatus and communication method | |
| CN100442786C (en) | Tree structure based routing method | |
| CN102883403B (en) | Construction method for mobile ad hoc network | |
| US8472319B2 (en) | Relay station operated according to QOS level of service packet and method of operating relay station | |
| CN113347088B (en) | Improved wireless self-organizing network multilink routing method | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| CN103260211A (en) | Improved AOMDV routing method | |
| CN103108374A (en) | Energy saving routing algorithm of composite structure mine emergency rescue wireless mesh network | |
| Li et al. | Vote-based clustering algorithm in mobile ad hoc networks | |
| CN115002863B (en) | Wireless network routing method suitable for large-scale network and storage medium | |
| CN109803342B (en) | Unmanned aerial vehicle self-organizing network routing method oriented to energy balance | |
| CN111148176B (en) | Routing method and device for wireless ad hoc network | |
| CN112822751B (en) | Hybrid wireless network routing method | |
| CN101854694A (en) | Multi-path routing method based on bandwidth requirements | |
| CN116782330A (en) | Method and medium for selecting path in SD-UANET by considering load and link change | |
| CN114641050A (en) | Energy-saving routing protocol method for unmanned aerial vehicle ad hoc network load sensing | |
| Kouvatsos et al. | Broadcasting methods in mobile ad hoc networks: an overview | |
| CN104869605A (en) | Emergency communication-based AODV route stability algorithm improvement method | |
| CN114785726B (en) | Clustering OLSR routing method based on management message merging | |
| Tavakoli et al. | An efficient fault-tolerance routing algorithm for mobile ad-hoc networks | |
| CN115865775B (en) | Unmanned aerial vehicle network rapid route recovery method based on OLSR | |
| CN112073430B (en) | Network security monitoring method based on multi-agent relay |
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 |