CN115002863B - Wireless network routing method suitable for large-scale network and storage medium - Google Patents
Wireless network routing method suitable for large-scale network and storage medium Download PDFInfo
- Publication number
- CN115002863B CN115002863B CN202210622967.8A CN202210622967A CN115002863B CN 115002863 B CN115002863 B CN 115002863B CN 202210622967 A CN202210622967 A CN 202210622967A CN 115002863 B CN115002863 B CN 115002863B
- Authority
- CN
- China
- Prior art keywords
- node
- supervision
- information
- information packet
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000012544 monitoring process Methods 0.000 claims abstract description 19
- 238000012423 maintenance Methods 0.000 claims abstract description 17
- 230000008569 process Effects 0.000 claims abstract description 10
- 230000002860 competitive effect Effects 0.000 claims description 31
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 14
- 230000004044 response Effects 0.000 claims description 7
- 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
- 238000010276 construction Methods 0.000 abstract description 2
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 230000006641 stabilisation Effects 0.000 description 1
- 238000011105 stabilization Methods 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/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 non-supervision node sends link state information to the supervision node through the supervision link, and the supervision node forms a network topology structure information table according to the link state information; the monitoring node performs monitoring link maintenance and network topology structure information table maintenance; and responding to the route request information of the non-supervision node, and sending route query information to the non-supervision node through a supervision link by the supervision node based on the maintained network topology structure information table. The application can reduce the distribution of the route control information in the route construction and maintenance process, reduce the network overhead and is suitable for large-scale networks.
Description
Technical Field
The present application 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 route 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 capacity under the condition of partial node failure, and has strong robustness and destruction resistance. In the route establishment process of the traditional mobile self-organizing network route protocol, a source node establishes a route table in a broadcast mode, so that each node stores a large amount of redundant route information, and network overhead is high. When the number of nodes in a network increases, a conventional routing protocol will generate a large amount of routing control information to affect the throughput rate of the network, so that the need to reduce the network routing overhead in a large-scale mobile ad hoc network is a key to improve the network performance.
Disclosure of Invention
Aiming at least one defect or improvement requirement of the prior art, the invention provides a wireless network routing method and a storage medium suitable for a large-scale network, which can reduce the distribution of routing control information in the process of route construction and maintenance, reduce network overhead and are suitable for the 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 suitable for a large-scale network, comprising:
S101, 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;
s102, an unsupervised node sends link state information to a supervised node through a supervised link, and the supervised node forms a network topology structure information table according to the link state information;
s103, the supervision node performs supervision link maintenance and network topology structure information table maintenance;
s104, responding to the route request information packet of the non-supervision node, and sending route query information to the non-supervision node through the supervision link by the supervision node based on the maintained network topology structure information table.
Further, the S101 includes:
step 1.1, calculating the supervision capacity 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 count from the node to the supervision node, the next hop node address of the node leading to the supervision node, the supervision capacity value and the version number representing the next time the node acts as the supervision node;
And 1.2, each node defaults to be a supervision node, broadcasts and distributes an election information packet to other nodes, wherein the election information packet at least comprises a supervision node address, the hop count from the node to the supervision node and a supervision capability value, and the node receiving the election information packet selects the supervision node according to the election information packet and the local supervision node record information.
Further, the selecting the supervisory node according to the competitive information packet and the local supervisory node record information includes:
step 1.2.1, the node which receives the competitive information packet compares the supervising address in the competitive information packet with the supervising address of the local supervising node record information, if the same, the step 1.2.2 is shifted to, if the different, the step 1.2.3 is shifted to;
Step 1.2.2, discarding the competitive information packet if the number of hops in the competitive information packet is greater than or equal to the number of hops in the local supervisory node information record, modifying the next hop node address in the supervisory node record information as the node address for transmitting the competitive information packet if the number of hops in the competitive information packet is less than the number of hops in the local supervisory node record information, modifying the number of hops in the supervisory node record information as the number of hops in the competitive information packet, adding 1 to the number of hops in the competitive information packet, broadcasting the competitive information packet to the neighbor node, and turning to step 1.2.4;
Step 1.2.3, if the supervision capability value in the election information packet is smaller than the supervision capability value in the local supervision node record information, discarding the election information packet, if the supervision capability value in the election information packet is larger than the supervision capability value in the local supervision node record information, broadcasting the election information packet to the neighbor node, and turning to step 1.2.4, if the supervision capability value in the election information packet is equal to the supervision capability 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 packet, selecting the information with the address sequence number before to record, and turning to step 1.2.4;
and step 1.2.4, transmitting an election response information packet to the next hop node in the local supervision node record information, and if the next hop node in the local supervision node record information changes, transmitting the election response packet to the original next hop node in the local supervision node record information at the same time to form a supervision link.
Further, the local supervision node record information further comprises an optional period, a serial number and a timing, the competitive information packet further comprises the optional period and the serial number, the optional period is used for representing the optional period duration of the supervision node, the serial number is used for identifying the new and old of the local supervision node record information, the timing is used for detecting the survival state of the supervision node, and 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 selected again.
Further, the calculation formula for calculating the supervision capability value of each node is as follows:
∑aj＝1
Where MCV i represents the supervisor capacity value of the ith node, e j is the jth influencing factor, and a j is the weighting coefficient of the jth influencing factor.
Further, the S102 includes:
The non-supervision node sends an adjacent node information packet to the supervision node through the supervision link, the adjacent node information packet records the adjacent node information of the non-supervision node, and the supervision node forms a network topology structure information table according to the adjacent node information packet.
Further, the supervising link maintenance includes:
step 3.1, periodically transmitting broadcast patrol information packets to other nodes by the monitoring node, wherein the broadcast patrol information packets at least comprise hop numbers from the node to the monitoring node and version numbers representing the third time of the node serving as the monitoring node;
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 smaller 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 number in the local supervision node record information to be the same as those of 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 transmitting the broadcast patrol information packet.
Further, the network topology information table maintenance includes:
When the connection relation of two adjacent nodes changes, the two nodes send connection relation information packets to the monitoring nodes along the monitoring links, the connection relation information packets are used for representing the change of the connection relation of the nodes, and the monitoring nodes update the network topology structure information table after receiving the connection relation information packets.
Further, the S104 includes:
If the supervising node receives the route request information packet sent by the non-supervising node, the route request information packet records the address of the destination node, and the supervising node encapsulates the route information in the route reply information packet and sends the route reply information packet to the request node corresponding to the route 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 device, the computer program, when run on the access authentication device, causing the access authentication device to perform the steps of any one of the methods described above.
In general, the above technical solutions conceived by the present invention, compared with the prior art, enable the following beneficial effects to be obtained:
(1) A wireless network routing model based on the supervision links is established, and the supervision nodes are selected through competition, so that each common node generates the supervision links pointing to the supervision nodes, the supervision links and the supervision nodes can be generated only by one-time flooding, the convergence speed of the network is greatly increased, and the topology control information is greatly reduced.
(2) In the routing method, as the supervising node bears more data forwarding tasks, the self resource consumption is larger, the role in the whole network is also more important, the periodical election and updating of the supervising node can effectively enhance the survivability of the network, and when the supervising node is attacked, the updating mechanism can effectively ensure the security of the network.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of wireless network routing applicable to a large-scale network according to an embodiment of the present application;
Fig. 2 is a flow chart of a wireless network routing method suitable for a large-scale network according to an embodiment of the present application.
Detailed Description
The present invention 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 invention 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 invention. In addition, the technical features of the embodiments of the present invention described below may be combined with each other as long as they do not collide with each other.
The terms "comprising" and "having" and any variations thereof in the description and claims of the application and in the foregoing drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.
The wireless network route control method for the large-scale network fully considers the important role of the monitoring node in the network, and the monitoring node maintains the state information of the whole network, thereby avoiding the common node from storing redundant route information, and comprises the following steps: firstly, constructing a wireless network routing model based on a supervision link, wherein each node competes and selects the supervision node according to own link supervision capability, generates a supervision link of the current network, and collects the link state of the network; secondly, carrying out link state supervision according to a network structure, when the network topology structure is changed due to the death of old nodes or the addition of new nodes in the network, carrying out inspection by the supervision nodes through periodical flooding broadcast, and updating the network topology structure and the whole network link state according to link state feedback; and finally, when any node in the network has a route information request, sending the route request to the monitoring node, and inquiring the route table by the monitoring node to reply the route information.
As shown in fig. 1, the network node and the link map formed according to the routing method include a supervisory node, a normal node (non-supervisory node), a supervisory link and a normal link (non-supervisory link), the normal node sends link state information to the supervisory node through the supervisory link, and the supervisory node sends route query information to the normal node through the supervisory link.
As shown in fig. 2, a wireless network route control method for a large-scale network according to an embodiment of the present invention includes the steps of:
S101, 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.
Further, the step S101 includes steps 1.1 to 1.2.
Step 1.1, defining a node supervision capability value, calculating each node supervision capability value, and constructing local supervision information record information of each node.
For each node in the network, the node supervision capability value is calculated to judge whether the node has the capability of functioning as a supervision node, and the calculation method of the supervision capability value is expressed as follows:
∑aj＝1
Where MCV i represents the supervisor capability value of the ith node, e j is the jth influencing factor, such as link bandwidth, self energy, number of neighboring nodes, etc., and a j is the weight coefficient of the jth influencing factor.
When the node calculates the supervision capability value for the first time, the supervision node record information is constructed and used for recording the condition pointing to the supervision node, and the supervision node record information is expressed as:
< MCV, hop count, tenn, version number, sequence number, timing, supervisory 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 that the node needs to pass from the supervising node; the period is used for determining how long the supervision Node can bear, the supervision Node adopts a period system, and when the time of the Node bearing the supervision Node exceeds the period, the whole network will reinitiate the election process of the supervision Node (MN); the version number is used for identifying the number of times of the supervision task born by the current supervision node; the serial number is used for identifying the new and old of the supervision record information and plays a role in time synchronization; the timing is mainly used for detecting the survival state of the supervision node, and 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 reelected; the supervising node address is used for recording the physical address of the supervising node; the next-hop node address is used for recording the next-hop node address of the common node leading to the supervising node.
The process of electing the supervising node is a flooding process, if the node is a node with low supervising capability value (MCV), the supervising node information recorded by the node will be covered in the flooding process of the node with the highest supervising capability value (i.e. the supervising node), so that the correct supervising node information is recorded.
Step 1.2: each node defaults to be a supervision node, broadcasts and distributes an election information packet to other nodes, and the node receiving the election information packet selects the supervision node according to the election information packet and the local supervision node record information.
The node firstly defaults to be a supervision node and broadcasts and distributes an election packet to other nodes, wherein the election information packet is expressed as:
< type, reserved, prefix length, hop count, version number, sequence number, tenure, MCV, supervisory node Address >
Wherein, the type is used for marking the competitive information group; the reserved prefix length is data related to the packet data and is used for recording the data such as the packet length; the hop count, version number, serial number, tenure period, supervision ability value and supervision node address are the same as the corresponding fields in the supervision record information;
when the node receives the competitive information packet from other nodes, selecting the supervising node according to the competitive information packet and the local supervising node record information comprises the following steps:
Step 1.2.1: and comparing the supervisory node address in the received competitive grouping with the supervisory node address in the local supervisory node record information, if the supervisory node addresses are equal, turning to step 1.2.2, and if the supervisory node addresses are not equal, turning to step 1.2.3.
Step 1.2.2: comparing the hop count in the competitive grouping with the hop count in the local supervision node information record, discarding the competitive grouping if the hop count in the local supervision node information record is greater than or equal to 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 for transmitting the grouping if the hop count is less than the hop count in the local supervision node information record, modifying the hop count as the hop count in the competitive information grouping, adding 1 to the hop count in the competitive grouping, broadcasting the competitive grouping to the neighbor nodes of the node receiving the competitive information grouping, and turning to the step 1.2.4. After receiving the election information packet, the neighbor node also judges according to the same rules of steps 1.2.1-1.2.4, and can record the shortest path.
The next hop node address in the node information record is modified to be the node address for sending the election packet, and the hop count in the supervising node information record is modified to be the hop count of the election packet, which is used for selecting the next hop node leading to the minimum hop count of the supervising node.
Step 1.2.3: comparing the supervision capability value in the election packet with the supervision capability value in the local supervision node information record, discarding the election packet if the supervision capability value in the local supervision node information record is smaller than the supervision capability value in the local supervision node information record, broadcasting the election information packet to the neighbor node if the supervision capability value in the local supervision node information record is larger than the supervision capability value in the local supervision node information record, and turning to step 1.2.4, and comparing the address of the supervision node in the local supervision node record with the supervision node address in the election packet if the supervision capability value in the local supervision node information record is equal to the supervision capability value in the local supervision node information record, selecting the information with the address sequence number before the address sequence number in the two to record, and turning to step 1.2.4.
Step 1.2.4: and sending an election response packet to the next-hop node in the supervision node information record, and if the next-hop node in the supervision node information record changes, sending the election response packet to the original next-hop node at the same time to form a supervision link.
And simultaneously, the election response packet is sent to the original next-hop node to inform the original next-hop node to delete the reverse link.
The election reply packet structure: < type, version number, sequence number, supervising node address, transmitting node address >
Wherein the type is used to identify the packet type, the version number, sequence number and supervisor node address are the same as the values in the node local supervisor node record.
S102, the non-supervision node sends link state information to the supervision node through the supervision link, and the supervision node forms a network topology structure information table according to the link state information.
After the supervision node competes for network stabilization, the common node sends neighbor node information packets to the supervision node through the supervision link, and the neighbor node information packets are mainly used for sending neighbor node information and link state information between the neighbor node information to the supervision node.
Structure of neighbor node information packet:
< type, flag bit, reserved, prefix length, version number, sequence number, sending node address, neighbor node 1 address and link state, neighbor node 2 address and link state, … … >
The sending node address is a node address for sending the adjacent node information packet, the adjacent node X address and the link state are the node addresses adjacent to the node and the link state information between the adjacent node X address and the link state information, and the specific content can be customized.
And after receiving the neighbor node information from other nodes, the monitoring node locally establishes an adjacency relation table 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 node address set, serial number, status information; … … ]
Along with the collection of the link information by the supervision node, a topology structure information table of the whole network is formed in the supervision node.
S103, the supervision node performs supervision link maintenance and network topology structure information table maintenance.
Further, the supervising link maintenance includes steps 3.1 to 3.4:
And 3.1, periodically sending broadcast tour information packets to other nodes by the supervision node to carry out supervision link maintenance.
The structure of the broadcast patrol information packet is as follows:
< type, reserved, prefix length, hop count, version number, sequence number, tenure, supervising node address >
And 3.2, comparing the version number of the received broadcast patrol information 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, and 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, otherwise entering the step 3.4.
Step 3.3, if the hop count of the broadcast patrol information packet is smaller than the hop count of the local supervision node record information, step 3.4 is entered, otherwise, the broadcast patrol information packet is discarded.
And 3.4, modifying the version number and the hop number in the local supervision node record information to be the same as those of 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 transmitting the broadcast patrol information packet.
The maintenance of the network topology information table is realized by feeding back the link state through the common node.
In order for the supervising node to grasp the structure of the network in time, when the connection state between the nodes is changed, it is necessary to transmit link state information to the supervising node. The feedback of the connection state by the nodes is completed by sending connection relation packets to the supervising node.
Structure of connection relation group:
< type, flag bit, prefix length, version number, sequence number, link state identification, transmitting node address, neighbor node address >
The link state identifier 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 adjacent relation.
When the connection relation of two adjacent nodes changes, both nodes send connection relation groups to the supervising node along the supervising link, and the change of the connection relation of the nodes is reflected through the connection relation groups. And after receiving the connection relation packet, the supervision node updates the topology structure information table.
S104, responding to the route request information packet of the non-supervision node, and sending route query information to the non-supervision node through the supervision link by the supervision node based on the maintained network topology structure information table.
The route acquisition comprises the following steps:
The common node sends a route request packet to the supervising node through the supervising link, and after the supervising node receives the route request packet, the routing information is encapsulated in a route reply packet and sent to the route information request node.
Routing request packet format: < type, version number, sequence number, source node Address, destination node Address >
Wherein the type is used for identifying the type of the packet, the version number and the serial number are the same as those in the record of the supervising node, the source node address is the node address of the data packet to be transmitted, and the destination node address is the destination node address of the data packet to be reached
The foregoing is merely a preferred embodiment of the present invention and it should be noted that modifications and adaptations to those skilled in the art may be made without departing from the principles of the present invention, which are intended to be comprehended within the 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 method. The computer-readable storage medium may include, among other things, any type of disk including floppy disks, optical disks, DVDs, CD-ROMs, micro-drives, and magneto-optical disks, ROM, RAM, EPROM, EEPROM, DRAM, VRAM, 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 foregoing method embodiments are all described as a series of acts, but it should be understood by those skilled in the art that the present application is not limited by the order of acts described, as some steps may be performed in other orders or concurrently in accordance with the present application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all preferred embodiments, and that the acts and modules referred to are not necessarily required for the present application.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
The foregoing is merely exemplary embodiments of the present disclosure and is not intended to limit the scope of the present disclosure. That is, equivalent changes and modifications are contemplated by the teachings of this disclosure, which fall 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 scope and spirit of the disclosure being indicated by the claims.
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.
It will be readily appreciated by those skilled in the art that the foregoing description is merely a preferred embodiment of the invention and is not intended to limit the invention, but any modifications, equivalents, improvements or alternatives falling within the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (8)
1. A wireless network routing method suitable for a large-scale network, comprising:
S101, 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;
s102, an unsupervised node sends link state information to a supervised node through a supervised link, and the supervised node forms a network topology structure information table according to the link state information;
s103, the supervision node performs supervision link maintenance and network topology structure information table maintenance;
s104, responding to the route request information packet of the non-supervision node, and sending route query information to the non-supervision node through a supervision link by the supervision node based on the maintained network topology structure information table;
the S101 includes:
step 1.1, calculating the supervision capacity 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 count from the node to the supervision node, the next hop node address of the node leading to the supervision node, the supervision capacity value and the version number representing the next time the node acts as the supervision node;
Step 1.2, each node defaults to be a supervision node, and broadcasts and distributes an election information packet to other nodes, wherein the election information packet at least comprises a supervision node address, the hop count from the node to the supervision node and a supervision capability value, and the node receiving the election information packet selects the supervision node according to the election information packet and the local supervision node record information;
the selecting the supervisory node according to the competitive information grouping and the local supervisory node record information comprises the following steps:
step 1.2.1, the node which receives the competitive information packet compares the supervising address in the competitive information packet with the supervising address of the local supervising node record information, if the same, the step 1.2.2 is shifted to, if the different, the step 1.2.3 is shifted to;
Step 1.2.2, discarding the competitive information packet if the number of hops in the competitive information packet is greater than or equal to the number of hops in the local supervisory node information record, modifying the next hop node address in the supervisory node record information as the node address for transmitting the competitive information packet if the number of hops in the competitive information packet is less than the number of hops in the local supervisory node record information, modifying the number of hops in the supervisory node record information as the number of hops in the competitive information packet, adding 1 to the number of hops in the competitive information packet, broadcasting the competitive information packet to the neighbor node, and turning to step 1.2.4;
Step 1.2.3, if the supervision capability value in the election information packet is smaller than the supervision capability value in the local supervision node record information, discarding the election information packet, if the supervision capability value in the election information packet is larger than the supervision capability value in the local supervision node record information, broadcasting the election information packet to the neighbor node, and turning to step 1.2.4, if the supervision capability value in the election information packet is equal to the supervision capability 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 packet, selecting the information with the address sequence number before to record, and turning to step 1.2.4;
and step 1.2.4, transmitting an election response information packet to the next hop node in the local supervision node record information, and if the next hop node in the local supervision node record information changes, transmitting the election response packet to the original next hop node in the local supervision node record information at the same time to form a supervision link.
2. The wireless network routing method for a large-scale network of claim 1, wherein the local supervision node record information further comprises an expiry period, a sequence number and a timing, wherein the auction information packet further comprises the expiry period and the sequence number, the expiry period is used for indicating the duration of the expiry period of the supervision node, the sequence number is used for identifying the new and old of the local supervision node record information, the timing is used for detecting the survival state of the supervision node, and if a 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 reselected.
3. The wireless network routing method for a large-scale network according to claim 1, wherein the calculation formula for calculating the supervision capability value of each node is:
In the method, in the process of the invention, Representing the supervisor capability value of the ith node,/>For the j-th influencing factor,/>The weight coefficient of the j-th influencing factor.
4. The wireless network routing method applicable to a large-scale network as recited in claim 1, wherein the S102 includes:
The non-supervision node sends an adjacent node information packet to the supervision node through the supervision link, the adjacent node information packet records the adjacent node information of the non-supervision node, and the supervision node forms a network topology structure information table according to the adjacent node information packet.
5. The wireless network routing method applicable to a large-scale network as recited in claim 1, wherein the supervising link maintenance comprises:
step 3.1, periodically transmitting broadcast patrol information packets to other nodes by the monitoring node, wherein the broadcast patrol information packets at least comprise hop numbers from the node to the monitoring node and version numbers representing the third time of the node serving as the monitoring node;
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 smaller 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 number in the local supervision node record information to be the same as those of 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 transmitting the broadcast patrol information packet.
6. The wireless network routing method for a large-scale network of claim 1, wherein the network topology information table maintenance comprises:
When the connection relation of two adjacent nodes changes, the two nodes send connection relation information packets to the monitoring nodes along the monitoring links, the connection relation information packets are used for representing the change of the connection relation of the nodes, and the monitoring nodes update the network topology structure information table after receiving the connection relation information packets.
7. The wireless network routing method applicable to a large-scale network as recited in claim 1, wherein the S104 includes:
If the supervising node receives the route request information packet sent by the non-supervising node, the route request information packet records the address of the destination node, and the supervising node encapsulates the route information in the route reply information packet and sends the route reply information packet to the request node corresponding to the route request information packet.
8. A storage medium storing a computer program executable by an access authentication device, the computer program, when run on the access authentication device, causing the access authentication device to perform the steps of the method of any one of claims 1 to 7.
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 CN115002863A (en) | 2022-09-02 |
| CN115002863B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115622650B (en) * | 2022-09-08 | 2024-06-18 | 中国人民解放军国防科技大学 | Method and device for time synchronization and route maintenance of narrowband ad hoc network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130103739A1 (en) * | 2011-10-21 | 2013-04-25 | Cisco Technology, Inc. | Obtaining Dynamic Connected-Network Topology Via any Node in Network |
| US8693322B2 (en) * | 2012-02-21 | 2014-04-08 | Yikun Zhang | Routing method for a wireless multi-hop network |
-
2022
- 2022-06-02 CN CN202210622967.8A patent/CN115002863B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| 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 |
|---|
| Ad Hoc入侵检测监视节点的自适应选择算法;方泽明;马传香;;计算机工程;20080905(17);全文 * |
| Reinforcement Learning-Based Data Forwarding in Underwater Wireless Sensor Networks with Passive Mobility;Chang, Haotian;《SENSORS》;20190228;全文 * |
| 基于无线传感网络技术的变电站高压侧监测系统路由优化设计;孙兵;;内蒙古电力技术;20130828(04);全文 * |
| 无线多媒体传感器网络路由技术研究;无线多媒体传感器网络路由技术研究;《中国优秀硕士学位论文全文数据库 信息科技辑》;20200215;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115002863A (en) | 2022-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101803309B (en) | Method and system of routing in a utility smart-grid network | |
| EP1499989B1 (en) | Reactive routing on-demand in mobile network | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| US20080247408A1 (en) | Reliable Broadcast Protocol and Apparatus for Sensor Networks | |
| Shaikh et al. | New metrics for dominating set based energy efficient activity scheduling in ad hoc networks | |
| CN106817738A (en) | A kind of method for routing based on Game with Coalitions | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| Zhang et al. | A security aware fuzzy enhanced reliable ant colony optimization routing in vehicular ad hoc networks | |
| CN115002863B (en) | Wireless network routing method suitable for large-scale network and storage medium | |
| CN109511152A (en) | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring | |
| CN114615706B (en) | Method for increasing communication capacity of micropower wireless network in smart grid | |
| Singla et al. | Topology control algorithms for wireless sensor networks: A review | |
| CN107995114B (en) | Routing method of delay tolerant network based on density clustering | |
| Abuashour | An efficient Clustered IoT (CIoT) routing protocol and control overhead minimization in IoT network | |
| Liu et al. | A swarm intelligence routing algorithm for MANETs. | |
| Guo et al. | HEAD: a hybrid mechanism to enforce node cooperation in mobile ad hoc networks | |
| Kchaou et al. | A new trust based routing protocol for VANETs | |
| Bellaouar et al. | QoS based clustering for vehicular networks in smart cities | |
| Cheng et al. | GMZRP: Geography-aided multicast zone routing protocol in mobile ad hoc networks | |
| Chavan et al. | Event Based Clustering Localized Energy Efficient Ant Colony Optimization for Performance Enhancement of Wireless Sensor Network. | |
| Gayatri et al. | An Improved Whale optimization Algorithm for Cross layer Neural Connection Network of MANET. | |
| Wang et al. | A unifying look at clustering in mobile ad hoc networks | |
| Cheng et al. | Power management in wireless ad hoc networks using AODV | |
| CN104869605A (en) | Emergency communication-based AODV route stability algorithm improvement method | |
| Wang et al. | Fuzzy logic based reputation system for mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |