A method and system for controlling routing of Ad hoc network for fishing based on smart antenna

Through intelligent antenna technology, the communication radius of nodes in the Ad Hoc network for offshore fishing is explored and adjusted, and the network capacity and communication performance problems caused by omnidirectional antennas are solved, efficient data transmission and adaptive communication are achieved, and the communication for offshore fishing is improved. Overall performance of the system.

CN114828145BActive Publication Date: 2024-11-05XIDIAN UNIV +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210236152.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-10
Publication Date
2024-11-05
Estimated Expiration
2042-03-10

AI Technical Summary

Technical Problem

The existing offshore communication system uses omnidirectional antennas to reduce the network capacity, and the number of nodes that can send data at the same time is reduced, and the characteristics of different node density in offshore fishing boat communication are not taken into account, resulting in a decline in network communication performance, and even an isolated network or Orphaned nodes.

Method used

The intelligent antenna is used to detect the number of neighbor nodes in the area, adjust the communication radius of the coverage area of ​​the node's smart antenna according to the strategy, reduce the number of routing hops, and realize the compression of the end-to-end communication path. Specific steps include neighbor node discovery, area one-hop neighbor node count calculation and communication radius adjustment, service and routing data processing, and dynamically adjust the communication radius to adapt to node density changes through the high gain and space-division multiplexing capabilities of the smart antenna.

Benefits of technology

It improves network capacity and connectivity, compresses routing hop count, reduces data transmission delay, adapts to fishing communication scenarios with different node density distribution, and improves the performance indicators of the entire network.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114828145B_ABST
    Figure CN114828145B_ABST
Patent Text Reader

Abstract

The present invention belongs to the field of marine communication technology, and discloses a method and system for controlling the routing of an Ad Hoc network for fishing based on smart antennas. The method for controlling the routing of an Ad Hoc network for fishing includes neighbor node discovery, calculation of the number of one-hop neighbor nodes in a region, adjustment of the communication radius, and processing of service and routing data. The present invention applies the advantages of smart antennas such as space division multiplexing, high anti-interference, and high gain to marine communications, thereby further improving the capacity and other indicators of the marine communication system; combining smart antennas with the NRSA protocol of node density, in the case of fishing communication scenarios with different sparse distribution of node density, the communication radius in different directions is dynamically adjusted according to the number of one-hop neighbor nodes in different directions, thereby improving the network capacity. At the same time, the present invention fully considers the differences in node density and the frequent communication interference problems of omnidirectional antennas, and based on the advantages of smart antennas, combines some characteristics of existing routing to further improve the overall performance of the network.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of marine communications, and in particular relates to a method and system for controlling routing of a fishing Ad hoc network based on a smart antenna. Background Art

[0002] At present, my country is located in the east of the Asian continent, facing the Pacific Ocean. It has four major sea areas, namely the Bohai Sea, the Yellow Sea, the East China Sea and the South China Sea. It has vast sea areas, numerous ports and rich marine resources. Since ancient times, my country's coastal areas have been engaged in marine aquaculture and marine fishing. There are four major fishing grounds, making it a major producer and trader of aquatic products. However, when fishermen are fishing in the near sea, the environment at sea is complex and changeable, resulting in a relatively poor working environment and even the risk of accidents. Therefore, ensuring the safety of marine operations and even meeting some entertainment needs of fishermen in marine fishing operations are issues that coastal governments and fishery management departments are eager to solve. Therefore, it is necessary to vigorously develop marine fishing communication equipment and use communication protocols with more stable performance.

[0003] Ad Hoc networks can be quickly built without fixed network equipment. They have the characteristics of self-organization and centerlessness, and can adapt to dynamic changes in network topology. This is consistent with the needs of fishery communications, and maritime communications can be improved by applying Ad Hoc networks to marine communication systems. Self-organizing networks require truly effective distributed algorithms to determine network organization, link scheduling, and routing. As the two core technologies of Ad Hoc networks, MAC's channel intervention mechanism and network layer routing technology still have many problems, requiring more efficient, stable, and robust algorithms.

[0004] At present, there have been many studies on Ad Hoc networks, and many classic protocols have been proposed. One of them is the location-assisted routing protocol GPSR. In this protocol, the nodes first obtain their own location information, and then obtain the geographic location of the destination node through the location service protocol. Each node broadcasts a beacon packet containing the geographic location of the node. Through periodic packet exchange, the nodes in the network can obtain the geographic location of all neighboring nodes within one hop range, and then use the greedy forwarding algorithm to establish routing. In addition to many classic protocols, many improved protocols have also been proposed. The authors in the existing literature considered the different density of ships in different areas in the marine fishing scenario, and proposed a clustered cross-layer protocol HCVCR with variable communication radius. The communication radius is dynamically adjusted according to the density of nodes around the node, thereby reducing communication interference between nodes in different areas and improving the overall performance of the entire network, such as throughput.

[0005] In recent years, antenna technology and digital signal processing technology have developed rapidly, greatly reducing the hardware cost of antennas, making smart antenna technology widely used in daily wireless communication systems. Smart antennas enhance antenna performance by adjusting the spatial characteristics of the transmit and receive beams, and can perform beamforming and direction detection. They are currently widely used in radar and military fields. The directivity of antennas can effectively alleviate the interference of neighboring nodes in the network, enhance the signal gain in the desired direction, and greatly improve the overall communication quality of the network. Therefore, smart antennas have also become an important way to optimize the MAC layer access protocol. The authors of existing literature apply directional antennas to Ad Hoc networks and propose the DLAODV protocol, which uses the high transmission capacity of directional antennas and combines the ideas of on-demand distance vector routing AODV and location routing to optimize the entire network routing discovery and data transmission scheme, thereby improving the communication quality of the network to a certain extent.

[0006] Existing Ad Hoc networks are widely used in flight networking, vehicle networking and military fields due to their self-organization, lack of center and ability to be quickly built without fixed networks. However, there are few Ad Hoc network protocols designed for maritime application scenarios. Although existing literature takes advantage of the density and sparseness of nodes, the entire protocol is based on omnidirectional antennas, which results in a reduction in the number of nodes that can send data at the same time due to the impact of competition avoidance; although existing literature can improve network performance to a certain extent, it does not take into account the different node densities in various places in special scenarios such as maritime fishing boat communications, which results in a decrease in network communication performance in some areas with sparse ships, and even leads to isolated networks or isolated nodes in severe cases.

[0007] At present, maritime communications are still dominated by shortwave, ultra-shortwave, satellite communications and other technologies. Some literature studies maritime AdHoc communications, which greatly improves the advancement of fishing communication equipment. However, these systems usually use omnidirectional antennas for communication. When an omnidirectional antenna sends a signal to a node, other nodes within the communication radius of the node cannot send information in the frequency domain at the same time, resulting in a reduction in network capacity.

[0008] Therefore, in view of the shortcomings of the current marine communication system, especially the marine Ad Hoc communication system that relies on omnidirectional antennas, it is urgent to design a new Ad Hoc network routing control method and system for fishing.

[0009] Through the above analysis, the problems and defects of the prior art are as follows:

[0010] (1) Existing maritime communication systems usually use omnidirectional antennas for communication, resulting in a reduction in network capacity. At the same time, existing maritime Ad Hoc communication systems have the disadvantage of relying on omnidirectional antennas.

[0011] (2) The existing technology is based on omnidirectional antennas, which results in a reduction in the number of nodes that can send data at the same time due to the impact of contention backoff.

[0012] (3) The existing technology does not take into account the characteristics of different node densities in various places in the special scenario of marine fishing vessel communication. This leads to a decrease in network communication performance in some areas with sparse ships, and even leads to isolated networks or isolated nodes in severe cases. Summary of the invention

[0013] In view of the problems existing in the prior art, the present invention provides a method and system for controlling routing of an Ad Hoc network for fishing based on a smart antenna, and more particularly, relates to a method, system and application for controlling routing of an Ad Hoc network for fishing based on a smart antenna.

[0014] The present invention is implemented by using smart antennas to detect the number of one-hop neighbor nodes in a region, adjusting the communication radius of different coverage areas of the node smart antenna according to the strategy, and using the high gain of the smart antenna to reduce the number of hops in the route establishment process, thereby achieving end-to-end communication path compression. The route control method for the fishing Ad Hoc network provided by the present invention includes the following steps:

[0015] Step 1: Neighbor node discovery. Each node obtains relevant information of all neighbor nodes, such as IP address, geographic location, etc., so as to adjust the node communication radius later.

[0016] Step 2: Calculate the number of one-hop neighbor nodes in the region and adjust the communication radius, which can not only reduce the frequent packet collisions in dense areas, but also prevent the emergence of isolated fishing boats that cannot communicate in sparse areas, laying the foundation for subsequent communication between nodes.

[0017] Step three, perform business and routing data processing to provide route discovery and establishment and business data transmission for end-to-end communication of fishing boats, while reducing the number of hops in the forward route from the source node to the destination node, thereby achieving compression of the end-to-end communication path.

[0018] Further, the neighbor node discovery in step 1 includes:

[0019] In the neighbor node discovery phase, the number of neighbor nodes in each area is detected through the HELLO packet; in the node antenna coverage division, the beam width θ is set m is 60°, the number of antennas is 6, and full coverage of the area around the node is achieved; when θ mWhen it is 60°, the communication radius is extended to three times of the omnidirectional antenna. All antenna angles are based on due north as 0 degrees and are divided into areas s1, s2, s3, s4, s5, and s6 in a counterclockwise direction with due north as the reference.

[0020] Further, the calculation of the number of regional one-hop neighbor nodes and the adjustment of the communication radius in step 2 include:

[0021] Intelligent antennas are used, and the adaptive adjustment of node communication radius is realized in combination with the number of one-hop neighbor nodes in different small areas. According to the actual distribution scenarios of fishing vessels at sea, the communication radius of each node is designed to be four levels. The communication radius of each node's small area s1~s6 has four levels, from small to large, namely 5m, 20m, 100m and 500m, which correspond to 500m, 2km, 10km, 50km in actual scenarios, represented by R1, R2, R3 and R4. The number of nodes at different radii in each area is represented by N1, N2, N3, N4.

[0022] The specific process of calculating the number of one-hop neighbor nodes in the area and adjusting the communication radius is as follows:

[0023] (1) Traverse the neighbor node list;

[0024] (2) Calculate in which partition area (s1-s6) the neighboring node is located of this node;

[0025] (3) Calculate the distance D between the neighboring node and the current node;

[0026] (4) Update the corresponding N in the corresponding area i (1≤i≤4);

[0027] (5) Set area s j The subscript j=1;

[0028] (6) Determine whether j≤6 is true. If so, execute step (7); otherwise, execute step (15);

[0029] (7)s j Whether N2 of the region is greater than 180, if so, execute step (8), otherwise execute step (9);

[0030] (8) Set the node in s j The communication radius of the area is R1, and step (14) is executed;

[0031] (9)s j Whether N3 of the area is greater than 180, if so, execute step (10), otherwise execute step (11);

[0032] (10) Set the node in s jThe communication radius of the area is R2, and step (14) is executed;

[0033] (11)s j Whether N4 of the area is greater than 180, if so, execute step (12), otherwise execute step (13);

[0034] (12) Set the node in s j The communication radius of the area is R3, and step (14) is executed;

[0035] (13) Set the node in s j The communication radius of the area is R4, and step (14) is executed;

[0036] (14) j increases by 1, and returns to step (6);

[0037] (15)End.

[0038] Further, the business and routing data processing in step 3 includes:

[0039] The data packets to be processed include RREQ packets, RREP packets and service data packets.

[0040] Wherein, the RREQ packet is a routing request packet, which contains all the information implemented in the AODV protocol and adds the communication radius information and geographical location information of the source node;

[0041] The RREP packet is a routing response packet, which contains all the information implemented in the AODV protocol, and adds the communication radius, geographical location and address information of the source node and RT_NEXT_NODE;

[0042] The service data group is service data generated by this node or other nodes.

[0043] The data processing flow specifically includes:

[0044] (1) Call the resv function to receive data packets;

[0045] (2) Determine the type of the received data packet. If it is a service data packet, proceed to step (3); if it is a RREQ packet, proceed to step (4); if it is a RREP packet, proceed to step (5);

[0046] (3) Processing business data, executing step (6);

[0047] (4) RREQ group processing, execute step (6);

[0048] (5) RREP group processing;

[0049] (6)End.

[0050] Furthermore, the processing flow of the service data grouping in step (3) includes:

[0051] (3.1) When a node has a request for data transmission, it first checks whether it has a route to the destination node. If there is a route from the node to the destination node, it executes step (3.4); if there is no route from the node to the destination node, it executes step (3.2);

[0052] (3.2) Generate RREQ packet and broadcast;

[0053] (3.3) Receive and process RREP packets;

[0054] (3.4) Prepare to send a service data packet and determine the type. If it is uplink, execute step (3.5), otherwise execute step (3.6);

[0055] (3.5) Submit it to the transport layer for processing and execute step (3.7);

[0056] (3.6) Add necessary information and hand it over to the LL layer for processing.

[0057] (3.7)End.

[0058] The processing flow of the RREQ group in step (4) includes:

[0059] (4.1) Symmetric link judgment: if it is a symmetric link, execute step (4.2); if not, execute step (4.8);

[0060] (4.2) Determine whether there is a reverse route. If so, execute step (4.3); if not, execute step (4.4);

[0061] (4.3) Update the reverse route and execute step (4.5);

[0062] (4.4) Establish reverse routing;

[0063] (4.5) Determine whether the receiving node is the destination node or there is a forward route to the destination node. If there is no route or it is not the destination node, execute step (4.6); if it exists or it is the destination node, execute step (4.7);

[0064] (4.6) Update the relevant information of the RREQ source node and broadcast the RREQ packet, start to establish the route, and add the next hop node RT_NEXT_NODE of the forward route of the source node to the RREP packet. The RT_NEXT_NODE of the node that generates the RREP packet for the first time is always the current node, and execute step (4.9);

[0065] (4.7) Reply RREP packet to RREQ source node and execute step (4.9);

[0066] (4.8) Abandon RREQ packet;

[0067] (4.9)End.

[0068] The RREP data group processing flow in step (5) includes:

[0069] (5.1) Determine whether there is a forward route. If so, execute step (5.3); otherwise, execute step (5.2);

[0070] (5.2) Add forward routing;

[0071] (5.3) Update forward routing;

[0072] (5.4) Determine whether the node has data packets to send. If not, directly execute step (5.5); otherwise, start transmitting data first, and then execute step (5.5);

[0073] (5.5) Determine whether this node is the destination node. If so, execute step (5.7); otherwise, execute step (5.6);

[0074] (5.6) Update some information of the RREP packet and forward it, and execute step (5.8);

[0075] (5.7) discard the RREP packet;

[0076] (5.8)End.

[0077] Further, the process of updating the forward route in step (5.3) includes:

[0078] (5.3.1) Determine whether RT_NEXT_NODE and this node are symmetric links. If so, execute step (5.3.2); if not, execute step (5.3.3);

[0079] (5.3.2) Using the relevant communication information of the RT_NEXT_NODE node carried by the RREP packet, update the forward route and execute step (5.3.5);

[0080] (5.3.3) Update the forward route using the relevant communication information of the source node of the RREP packet;

[0081] (5.3.4) Set RT_NEXT_NODE node as this node;

[0082] (5.3.5)End.

[0083] The process of determining whether RT_NEXT_NODE and the current node are symmetrical links in step (5.3.1) includes:

[0084] (5.3.1.1) Calculate the area s where RT_NEXT_NODE is located at this node l (1≤l≤6) and this node is located in the region s of RT_NEXT_NODE k (1≤k≤6);

[0085] (5.3.1.2) Get the region where RT_NEXT_NODE is located l The communication radius L_R_Radius (1≤l≤6) and the area s where this node is located k The communication radius R_L_Radius (1≤k≤6);

[0086] (5.3.1.3) Calculate the distance D_R between the RT_NEXT_NODE node and this node;

[0087] (5.3.1.4) Determine whether D_R≤min(L_R_Radius,R_L_Radius) holds. If so, this node and RT_NEXT_NODE are symmetric links; otherwise, the two nodes are not symmetric links;

[0088] (5.3.1.5)End.

[0089] Another object of the present invention is to provide a fishery Ad Hoc network routing control system for implementing the fishery Ad Hoc network routing control method, the fishery Ad Hoc network routing control system comprising:

[0090] Node discovery module, used to discover neighbor nodes;

[0091] The node number calculation module is used to calculate the number of one-hop neighbor nodes in the area and adjust the communication radius;

[0092] The data processing module is used for business and routing data processing.

[0093] Another object of the present invention is to provide a computer device, the computer device comprising a memory and a processor, the memory storing a computer program, and when the computer program is executed by the processor, the processor performs the following steps:

[0094] Neighbor node discovery, calculation of the number of one-hop neighbor nodes in the area and adjustment of the communication radius, business and routing data processing; in the business and routing data processing stage, each data packet received and transmitted by the node is processed.

[0095] Another object of the present invention is to provide a computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the processor executes the following steps:

[0096] Neighbor node discovery, calculation of the number of one-hop neighbor nodes in the area and adjustment of the communication radius, business and routing data processing; in the business and routing data processing stage, each data packet received and transmitted by the node is processed.

[0097] Another object of the present invention is to provide an information data processing terminal, which is used to implement the fishing Ad Hoc network routing control system.

[0098] In combination with the above technical solutions and the technical problems solved, please analyze the advantages and positive effects of the technical solutions to be protected by the present invention from the following aspects:

[0099] First, in view of the technical problems existing in the above-mentioned prior art and the difficulty of solving the problems, the technical solutions to be protected by the present invention and the results and data during the research and development process are closely combined to analyze in detail and deeply how the technical solutions of the present invention solve the technical problems, and some creative technical effects brought about after solving the problems. The specific description is as follows:

[0100] The invention provides a method for controlling the routing of an Ad Hoc network for fishing, a method for adaptively adjusting the communication radius after adding a smart antenna based on the statistics of the number of one-hop neighbor nodes of a smart antenna, a method for judging a symmetric link based on a smart antenna, a path compression algorithm based on the position of a routing node and a smart antenna, and an Ad Hoc routing protocol combining the number of one-hop neighbor nodes, a communication radius adjustment strategy and a smart antenna technology, an NRSA protocol combining smart antennas and the number of one-hop neighbor nodes, and when the nodes are dense, the network capacity is improved through the space division multiplexing capability of the smart antenna; the NRSA protocol combining smart antennas and node density, when the nodes are sparse, the high gain characteristics of the smart antenna are used to improve the connectivity of the network, compress the number of routing hops, and reduce the data transmission delay; the NRSA protocol combining smart antennas and node density, in a fishing communication scenario with different sparse node densities, dynamically adjusts the communication radius in different directions according to the number of one-hop neighbor nodes in different directions, and further improves the network capacity.

[0101] The present invention can also calculate whether directionally communicating between nodes is possible by adding the geographical location of the node and information related to the communication radius to the data packet, thereby replacing the method for determining whether directionally communicating between nodes is possible; using other reference coordinate systems to indicate the direction angle between two communication nodes; using other beam main lobe angles other than 60° to replace the division of the area around the node; and replacing the smart antenna with a beam switching antenna or a beam rotating antenna.

[0102] Second, considering the technical solution as a whole or from the perspective of the product, the technical effects and advantages of the technical solution to be protected by the present invention are described in detail as follows:

[0103] The present invention applies the advantages of smart antennas such as space division multiplexing, high anti-interference and high gain to maritime communications, thereby further improving the capacity and other indicators of the maritime communication system.

[0104] Third, as auxiliary evidence of the inventiveness of the claims of the present invention, it is also reflected in the following important aspects:

[0105] (1) The expected benefits and commercial value of the technical solution of the present invention after transformation are:

[0106] This technology applies various advanced technologies such as smart antennas and has a certain degree of advancement. The system using this invention can replace the existing fishing communication system, which can not only provide fishermen with basic communication guarantees for safe operations, but also provide value-added services such as audio and video entertainment, and has significant commercial value.

[0107] (2) The technical solution of the present invention fills the technical gap in the industry at home and abroad:

[0108] The present invention fully considers the density of nodes in fishing communication scenarios, applies the advantages of smart antennas such as space division multiplexing, high anti-interference and high gain to marine communications, adaptively adjusts the regional communication radius through the number of regional neighbor nodes, compresses the number of routing hops, and maximizes the system throughput, filling the gap in related technologies at home and abroad. BRIEF DESCRIPTION OF THE DRAWINGS

[0109] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0110] Figure 1 It is a node operation flow chart of the NRSA protocol provided by an embodiment of the present invention.

[0111] Figure 2 It is a schematic diagram of dividing the coverage area of ​​node antennas provided in an embodiment of the present invention.

[0112] Figure 3 This is a schematic diagram of the relationship between the number of one-hop neighbor nodes and throughput provided by an embodiment of the present invention.

[0113] Figure 4 It is a flow chart of an algorithm for calculating the number of one-hop neighbor nodes in a node area and adjusting the communication radius provided by an embodiment of the present invention.

[0114] Figure 5 It is a data processing flow chart provided by an embodiment of the present invention.

[0115] Figure 6 It is a flow chart of business data grouping processing provided by an embodiment of the present invention.

[0116] Figure 7 It is a flow chart of RREQ grouping processing provided by an embodiment of the present invention.

[0117] Figure 8 It is a flow chart of RREP grouping processing provided by an embodiment of the present invention.

[0118] Fig. 9 This is a forward routing update flow chart provided by an embodiment of the present invention.

[0119] Fig.10 The present invention provides a flowchart for determining symmetric links in a forward routing update.

[0120] Fig.11 It is a simulation scene node diagram provided by an embodiment of the present invention.

[0121] Fig.12It is a comparison chart of throughput of various protocols at different data generation rates provided by an embodiment of the present invention.

[0122] Fig.13 This is a scatter plot of fishing boats on May 3, 2020 provided by an embodiment of the present invention.

[0123] Fig.14 This is a network node distribution diagram provided by an embodiment of the present invention.

[0124] Fig.15 It is a schematic diagram comparing the throughputs of the AODV protocol, the HCVCR protocol and the NRSA protocol provided by an embodiment of the present invention.

[0125] Fig.16 It is a schematic diagram of end-to-end delay comparison of the AODV protocol, HCVCR protocol and NRSA protocol provided by an embodiment of the present invention.

[0126] Fig.17 It is a schematic diagram comparing packet loss rates of the AODV protocol, HCVCR protocol and NRSA protocol provided by an embodiment of the present invention.

[0127] Fig.18 The present invention is a flowchart of a method for controlling routing in an Ad Hoc network for fishing provided by an embodiment of the present invention.

[0128] Fig.19 This is a structural block diagram of a fishery Ad Hoc network routing control system provided by an embodiment of the present invention; in the figure: 1. a node discovery module; 2. a node number calculation module; 3. a data processing module. DETAILED DESCRIPTION

[0129] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0130] 1. Explanatory Examples In order to enable those skilled in the art to fully understand how to implement the present invention, this section provides an illustrative example that expands and describes the technical solution of the claims.

[0131] In view of the problems existing in the prior art, the present invention provides a method and system for controlling routing of an Ad hoc network for fishing based on a smart antenna. The present invention is described in detail below in conjunction with the accompanying drawings.

[0132] like Fig.18 As shown, the method for controlling the routing of an Ad Hoc network for fishing provided by an embodiment of the present invention comprises the following steps:

[0133] S101, performing neighbor node discovery;

[0134] S102, calculating the number of one-hop neighbor nodes in the area and adjusting the communication radius;

[0135] S103, performing business and routing data processing.

[0136] like Fig.19 As shown, the fishing Ad Hoc network routing control system provided by the embodiment of the present invention includes:

[0137] Node discovery module 1, used for neighbor node discovery;

[0138] Node number calculation module 2, used for calculating the number of one-hop neighbor nodes in the area and adjusting the communication radius;

[0139] The data processing module 3 is used for processing business and routing data.

[0140] The technical solution of the present invention is further described below in conjunction with the explanation of terms.

[0141] Throughput: the total amount of data successfully transmitted in the network per unit time. Transmission delay: the time difference between the source node sending a packet and the destination node receiving the packet. Ad Hoc: wireless mobile self-organizing network. Ad Hoc networks with dynamically changing topology have the characteristics of being decentralized, self-organizing, and can be quickly built without relying on fixed network equipment, and data packets can be transmitted in multiple hops. MAC: media access control, which defines how data frames are transmitted on the medium. Routing protocol: the rules for specifying the transmission of data from the source node to the destination node. AODV: on-demand plane distance vector routing protocol for wireless ad hoc networks, which is a reactive routing protocol, that is, when sending a packet to the destination node, the source node initiates the route search process in the network to find the corresponding route. RREQ: route request packet, used to find a route. RREP: route reply packet. HELLO: a broadcast packet for detecting neighbor nodes. NRSA: an Ad Hoc routing protocol that combines the number of one-hop neighbor nodes, communication radius adjustment strategy and smart antenna technology. Symmetric link: When two nodes are within each other's directional communication range, the wireless link between them is a directional symmetric link. Path compression: The reduction of the number of routing hops when the source node and the destination node communicate is called path compression. RT_NEXT_NODE: In the process of route discovery, the source node that sends the RREP packet needs to forward the next hop node in the currently discovered forward route. NS2: A free and open source network simulation software.

[0142] In the fishing communication system, when all nodes use omnidirectional antennas and have the same communication radius, in areas with dense nodes, the transmission of one node will cause many surrounding nodes to be silent, and in areas with sparse nodes, it is also easier for a node to become an isolated node that cannot participate in communication. The above two situations have become important limitations for improving network performance, resulting in a sharp decline in related performance indicators such as network capacity and transmission delay. Therefore, the node dynamically adjusts its own communication radius size according to the number of one-hop neighbor nodes in different directions and some other factors, and combines the space division multiplexing characteristics of the smart antenna to improve the capacity of the network; in addition, in the process of route discovery, the high gain of the smart antenna can reduce the number of hops for data packet transmission, thereby achieving the purpose of reducing transmission delay. The present invention proposes a routing control method and system for a fishing Ad Hoc network based on smart antennas.

[0143] In the NRSA algorithm, each node runs the following flow chart: Figure 1 As shown, it includes three parts: neighbor node discovery, calculation of the number of one-hop neighbor nodes in the area and adjustment of the communication radius, and business and routing data processing. In the business and routing data processing stage, each data packet received and transmitted by the node is processed. Each part is described in detail as follows:

[0144] (1) Neighbor Node Discovery

[0145] In the neighbor node discovery phase, the NRSA algorithm uses HELLO packets to detect the number of neighbor nodes in each area. The node antenna coverage range in the NRSA algorithm is divided as follows: Figure 2 As shown, set the beam width θ m The angle is 60° and the number of antennas is 6, achieving full coverage of the area around the node (see Figure 2 ). From the existing literature, we know that when θ m When it is 60°, the communication radius can be extended to three times that of the omnidirectional antenna. All antenna angles are based on due north as 0 degrees and are divided into areas s1, s2, s3, s4, s5, and s6 in a counterclockwise direction with due north as the reference.

[0146] (2) Calculation of the number of one-hop neighbor nodes in a region and adjustment of the communication radius

[0147] In order for nodes to be able to adaptively adjust their communication radius based on the number of one-hop neighbor nodes, it is first necessary to study the optimal number of one-hop neighbor nodes that maximizes the throughput within the one-hop communication range of the node. The present invention focuses on the throughput of the system, so the NS2 simulation tool is used to simulate the relationship between the number of one-hop neighbor nodes and the network throughput.

[0148] Ignoring the transmission delay, the impact of the communication radius on the communication performance within one hop can be ignored. The communication radius is set to 50m, and then the sedest tool of NS2 is used to scatter nodes with a radius of 50m. The number of nodes is gradually increased at intervals of 20, and 60% of the node pairs are selected for data transmission at each node number. The data generation rate is 9.6Kbps. The simulation results are as follows: Figure 3 As shown, Figure 3 The trend of throughput changing with the number of one-hop neighbor nodes is given. At this time, the maximum throughput occurs when the number of one-hop neighbor nodes is 210. For the stability of the system, the present invention sets the optimal number of one-hop neighbor nodes to 180.

[0149] In the phase of calculating the number of one-hop neighbor nodes in a region and adjusting the communication radius, the NRSA algorithm traverses the neighbor node list to obtain the number of one-hop neighbor nodes in each region of the node, and uses this as a benchmark according to the following: Figure 4 The rules shown adjust the communication radius of the area. The area is a factor that is only related to the relative position of the communication destination node. Once the area is determined, the communication radius of the area depends only on the density of the neighbor nodes in the area. Therefore, when studying the relationship between the regional communication radius and the number of one-hop neighbor nodes in the area, it can be compared to the relationship between the communication radius and the density of neighbor nodes when using omnidirectional antenna communication. Because the optimal number of one-hop neighbor nodes is 180 when using omnidirectional antennas, when using smart antennas to evenly divide the nodes into six small areas, the optimal number of one-hop neighbor nodes in each small area should also be 180.

[0150] Existing literature uses omnidirectional antennas to obtain neighbor nodes around nodes, thereby setting corresponding communication radius for different nodes, and using omnidirectional antennas during data communication. The present invention will use smart antennas and realize adaptive adjustment of node communication radius in combination with the number of one-hop neighbor nodes in different small areas. The NRSA algorithm designs the communication radius of each node into four levels according to the actual distribution scenario of fishing boats at sea, that is, the communication radius of each node's small area s1~s6 has four levels, from small to large, 5m, 20m, 100m and 500m, that is, 500m, 2km, 10km, 50km in actual scenarios, represented by R1, R2, R3 and R4, and the number of nodes at different radii in each area is represented by N1, N2, N3, N4.

[0151] The calculation of the number of one-hop neighbor nodes in the region and the adjustment of the communication radius are as follows: Figure 4 As shown, the specific process is as follows:

[0152] Step 2.1: Traverse the neighbor node list;

[0153] Step 2.2: Calculate in which partition area (s1 to s6) the neighboring node is located of this node;

[0154] Step 2.3: Calculate the distance D between the neighbor node and the current node;

[0155] Step 2.4: Update the corresponding N in the corresponding area i (1≤i≤4);

[0156] Step 2.5: Set the region j The subscript j=1;

[0157] Step 2.6: Determine whether j≤6 is true. If so, go to step 2.7; otherwise, go to step 2.15.

[0158] Step 2.7: j Is N2 of the region greater than 180? If so, go to step 2.8; otherwise, go to step 2.9;

[0159] Step 2.8: Set up the node in s j The communication radius of the area is R1, and step 2.14 is executed;

[0160] Step 2.9: j Is N3 of the area greater than 180? If so, go to step 2.10; otherwise, go to step 2.11.

[0161] Step 2.10: Set up the node in s j The communication radius of the area is R2, and step 2.14 is executed;

[0162] Step 2.11: j Is N4 of the area greater than 180? If so, go to step 2.12; otherwise, go to step 2.13.

[0163] Step 2.12: Set up the node in s j The communication radius of the area is R3, and step 2.14 is executed;

[0164] Step 2.13: Set up the node in s j The communication radius of the area is R4, and step 2.14 is executed;

[0165] Step 2.14: Add 1 to j and return to step 2.6;

[0166] Step 2.15: End.

[0167] (3) Business and routing data processing

[0168] During the data processing, the main data packets that need to be processed include RREQ packets, RREP packets and business data packets.

[0169] RREQ packet: Routing request packet, which contains all the information implemented in the AODV protocol, and adds the communication radius information and geographical location information of the source node.

[0170] RREP packet: the routing response packet, which contains all the information implemented in the AODV protocol, and adds the communication radius, geographic location, and address of the source node and RT_NEXT_NODE.

[0171] Business data group: business data generated by this node or other nodes.

[0172] The data processing flow provided by the embodiment of the present invention is as follows Figure 5 As shown, the specific process includes:

[0173] Step 3.1: Call the resv function to receive the data packet;

[0174] Step 3.2: Determine the type of the received data packet. If it is a service data packet, proceed to step 3.3; if it is a RREQ packet, proceed to step 3.4; if it is a RREP packet, proceed to step 3.5.

[0175] Step 3.3: Business data processing, go to step 3.6;

[0176] Step 3.4: RREQ group processing, execute step 3.6;

[0177] Step 3.5: RREP grouping processing;

[0178] Step 3.6: End.

[0179] Step 3.3 provided in the embodiment of the present invention: The processing flow of the service data group is as follows: Figure 6 As shown, the specific process includes:

[0180] Step 3.3.1: When a node has a request for data transmission, it first checks whether it has a route to the destination node. If there is a route from the node to the destination node, it executes step 3.3.4; if there is no route from the node to the destination node, it executes step 3.3.2;

[0181] Step 3.3.2: Generate RREQ packet and broadcast;

[0182] Step 3.3.3: Receive and process the RREP packet;

[0183] Step 3.3.4: Prepare to send service data packets and determine the type. If it is uplink, execute step 3.3.5; otherwise, execute step 3.3.6.

[0184] Step 3.3.5: Hand it over to the transport layer for processing and execute step 3.3.7;

[0185] Step 3.3.6: Add some necessary information and pass it to the LL layer for processing.

[0186] Step 3.3.7: End.

[0187] Step 3.4 provided in the embodiment of the present invention: The processing flow of RREQ grouping is as follows Figure 7 As shown, specifically including:

[0188] Step 3.4.1: Symmetric link determination. If it is a symmetric link, go to step 3.4.2. If not, go to step 3.4.8.

[0189] Step 3.4.2: Determine whether there is a reverse route. If so, execute step 3.4.3. If not, execute step 3.4.4.

[0190] Step 3.4.3: Update the reverse route and go to step 3.4.5;

[0191] Step 3.4.4: Establish reverse routing;

[0192] Step 3.4.5: Determine whether the receiving node is the destination node or whether there is a forward route to the destination node. If there is no route or it is not the destination node, execute step 3.4.6. If there is or it is the destination node, execute step 3.4.7.

[0193] Step 3.4.6: Update the relevant information of the RREQ source node and broadcast the RREQ packet, start to establish the route, and add the next hop node RT_NEXT_NODE of the forward route of the source node to the RREP packet. It should be noted that the RT_NEXT_NODE of the node that generates the RREP packet for the first time is always the current node, and execute step 3.4.9;

[0194] Step 3.4.7: Reply RREP packet to the RREQ source node and execute step 3.4.9;

[0195] Step 3.4.8: discard the RREQ packet;

[0196] Step 3.4.9: End.

[0197] Step 3.5 provided in the embodiment of the present invention: RREP data group processing flow is as follows Figure 8 As shown, specifically including:

[0198] Step 3.5.1: Determine whether there is a forward route. If so, execute step 3.5.3; otherwise, execute step 3.5.2.

[0199] Step 3.5.2: Add forward routing;

[0200] Step 3.5.3: Update forward routing;

[0201] Step 3.5.4: Determine whether the node has data packets to send. If not, proceed directly to step 3.5.5. Otherwise, start transmitting data first, and then proceed to step 3.5.5.

[0202] Step 3.5.5: Determine whether this node is the destination node. If so, execute step 3.5.7; otherwise, execute step 3.5.6.

[0203] Step 3.5.6: Update some information of the RREP packet, then forward it and execute step 3.5.8;

[0204] Step 3.5.7: discard the RREP packet;

[0205] Step 3.5.8: End.

[0206] Step 3.5.3 provided in the embodiment of the present invention: the process of updating the forward route is as follows Fig. 9 As shown, specifically including:

[0207] Step 3.5.3.1: Determine whether RT_NEXT_NODE and this node are symmetrical links. If so, execute step 3.5.3.2. If not, execute step 3.5.3.3.

[0208] Step 3.5.3.2: Use the relevant communication information of the RT_NEXT_NODE node carried by the RREP packet to update the forward route and execute step 3.5.3.5;

[0209] Step 3.5.3.3: Update the forward route using the relevant communication information of the source node of the RREP packet;

[0210] Step 3.5.3.4: Set the RT_NEXT_NODE node as this node;

[0211] Step 3.5.3.5: End.

[0212] The step 3.5.3.1 provided in the embodiment of the present invention: the judgment process of whether RT_NEXT_NODE and the current node are symmetrical links is as follows Fig.10 As shown, specifically including:

[0213] Step 3.5.3.1.1: Calculate the region where RT_NEXT_NODE is located in this node (s l (1≤l≤6)) and the region in which the node is located in RT_NEXT_NODE (s k(1≤k≤6));

[0214] Step 3.5.3.1.2: Get the region where RT_NEXT_NODE is located l The communication radius L_R_Radius (1≤l≤6) and the area s where this node is located k The communication radius R_L_Radius (1≤k≤6);

[0215] Step 3.5.3.1.3: Calculate the distance D_R between the RT_NEXT_NODE node and this node;

[0216] Step 3.5.3.1.4: Determine whether D_R≤min(L_R_Radius, R_L_Radius) holds. If so, this node and RT_NEXT_NODE are symmetric links. Otherwise, the two nodes are not symmetric links.

[0217] Step 3.5.3.1.5: End.

[0218] 2. Application Examples: In order to prove the creativity and technical value of the technical solution of the present invention, this section provides application examples of the technical solution of the claims on specific products or related technologies.

[0219] It should be noted that the embodiments of the present invention can be implemented by hardware, software, or a combination of software and hardware. The hardware part can be implemented using dedicated logic; the software part can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or dedicated design hardware. It can be understood by a person of ordinary skill in the art that the above-mentioned devices and methods can be implemented using computer executable instructions and / or contained in a processor control code, such as a carrier medium such as a disk, CD or DVD-ROM, a programmable memory such as a read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. Such code is provided on the carrier medium. The device and its modules of the present invention can be implemented by hardware circuits such as very large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., can also be implemented by software executed by various types of processors, and can also be implemented by a combination of the above-mentioned hardware circuits and software, such as firmware.

[0220] 3. Evidence of the effects of the embodiments. The embodiments of the present invention have achieved some positive effects during the development or use process, and indeed have great advantages over the prior art. The following content is described in conjunction with the data, charts, etc. of the test process.

[0221] Example: Simulation and results analysis

[0222] First, set up a simulation scenario according to existing literature to simulate and verify the network performance of the protocol. Because the setdest tool of NS-2 can only randomly scatter points in a specified rectangular area, in order to realize the simulation scenario in existing literature, this simulation scatters points in multiple scene areas of different sizes, scattering more points in small areas and fewer points in large areas, and then merges several scene files to establish Fig.11 The simulation scenario shown.

[0223] The data services used in this simulation verification are also set according to existing literature, and the cbrgen tool is used to Fig.11 In the simulation scenario, 10 CBR data links are generated by randomly selecting nodes. The CBR data flow rate increases from 50Kbps to 400Kbps, with a step-by-step increase of 50Kbps.

[0224] The settings of common parameters are as follows: the channel bandwidth is 2Mbps, the ratio of communication range to carrier sensing range is 1:2.2, and the minimum time slot interval in the network is set to 20us.

[0225] Relevant settings of the HCVCR cross-layer protocol: the maximum time frame of the TDMA mechanism is 2s, which is then divided into two hour frames, the neighbor discovery time frame is 0.06s, the data transmission time frame is 1.94s, and the neighbor discovery time frame is divided into 6 equal sub-time frames, each sub-time frame is 0.01s, the cell radius in the network is 600m, which is equal to the maximum communication radius specified by the HCVCR cross-layer protocol, and the four communication radii are 50m, 150m, 300m and 600m respectively.

[0226] Related settings of AODV protocol: The routing layer uses AODV protocol, the MAC layer uses IEEE802.11 protocol, and the communication radius is set to 400m.

[0227] NRSA protocol related settings: The maximum time frame of the TDMA mechanism is 2s, which is then divided into two hour frames, the neighbor discovery time frame is 0.06s, the data transmission time frame is 1.94s, and the neighbor discovery time frame is divided into 6 equal sub-time frames, each sub-time frame is 0.01s, the cell radius in the network is 500m, which is equal to the maximum communication radius specified by the NRSA protocol. The four communication radii are 5m, 20m, 10m and 500m respectively, and the number of antennas is set to 6.

[0228] This simulation will be repeated 20 times, 10 data links will be selected each time, and the average of the 20 simulation results will be obtained. The final simulation result is as follows: Fig.12 shown.

[0229] Depend on Fig.12It can be seen that under the same simulation scenario and service data settings in the existing literature, the three curves all show that the throughput increases with the increase in the service rate and finally tends to saturation. The NRSA protocol performs better than the HCVCR protocol in terms of throughput performance, achieving a huge improvement in throughput, which is about 53% higher than the HCVCR protocol and about 131% higher than the AODV protocol, so that the entire network can bear a larger network load.

[0230] From the existing literature, we can get the distribution scatter diagram of global fishing vessels at a certain point in time, such as Fig.13 As shown in the figure, the distribution of fishing boats from near the coastline to far from the coastline shows an overall trend of dense to sparse, so the distribution of fishing boats simulated in fishing ports, near seas and far seas should also be similar.

[0231] The National Central Fishing Port has an unloading capacity of more than 80,000 tons of fish, and can accommodate more than 800 large, medium and small fishing vessels for berthing, shelter and replenishment. The water and land areas are 400,000 to 500,000 m 2 and 200,000 m 2 The length of the fishing coastline is more than 1000m, the length of the dock coastline is not less than 600m, the depth of the land in front of the dock is not less than 100m, and fishing boats can reach very far out to sea to fish, so the simulation scene sets the X-axis to 1000m and the Y-axis to 2000m. The X-axis is the side where the fishing port is located. There are many shapes of fishing ports. In order to more realistically simulate the actual situation of fishing boats docked in fishing ports, the present invention uses a new simulation scene to verify the performance of the protocol. The scene will adopt a U-shape, and according to the distribution of fishing boats docked at fishing ports, fishing boats leaving ports, and fishing boats in near and far seas, 1275 will be arranged in the network scene, thereby realistically simulating the distribution of fishing boats in fishing ports, near seas and far seas.

[0232] Due to the limitation of the source code of the setdest tool in NS-2 and the complexity of modification, the desired model cannot be obtained. Therefore, the simulation model is established with the help of matlab tools. First, key data such as node coordinates, movement direction and movement speed are obtained through matlab, and then these data are converted into files that can be read by the appropriate NS2 simulation script through the script program, so as to obtain the final simulation scene file. The number of nodes is 1275, the maximum node movement speed is 0.2m / s, and the distribution is as follows Fig.14 shown.

[0233] The business data used in this simulation simulates the voice business of fishing boat communications. The voice business communication bandwidth is 9.6Kbps, and the system bandwidth is 1Mbps. In order to simulate the real-time communication of a real fishing boat, about 720 nodes are selected from 1275 nodes to form 240 communication connections. A random start time is set for the data transmission of each connection, and the data generation rate between each connection is set to 9.6Kbps. The ratio of the communication range to the carrier sensing range is 1:2.2, and the minimum time slot interval in the network is 20us. In addition, since there are too many business connections used in this simulation, and the nodes used by the tool cbrgen to generate business links are all concentrated in 1 to 300, the matlab tool is used to write a script to generate business data to obtain key data, and then the key data generated by the script is converted into a business data format that NS2 can recognize, thereby achieving more realistic communication links and business data.

[0234] Through simulation, we can get the throughput of AODV protocol, HCVCR protocol and NRSA protocol as 134.67Kbps, 179.31Kbps and 367.34Kbps respectively. The data results are imported into matlab, and the throughput comparison chart of AODV protocol, HCVCR protocol and NRSA protocol is drawn by matlab, as shown in the figure. Fig.15 As shown, from the simulation results data and Fig.15 It can be seen that the spatial division multiplexing of the smart antenna makes the probability of data packet collision of the NRSA protocol much smaller than that of the HCVCR protocol and the AODV protocol. Compared with the HCVCR protocol and the AODV protocol, the NRSA protocol can accommodate more nodes to transmit data at the same time. The throughput performance of the NRSA protocol is improved by about 104% than that of the HCVCR protocol and by about 172% than that of the AODV protocol.

[0235] The average end-to-end delays of the AODV protocol, HCVCR protocol, and NRSA protocol are 0.32s, 0.31s, and 0.05s, respectively. The data results are imported into MATLAB, and a comparison chart of the average end-to-end delays of the AODV protocol, HCVCR protocol, and NRSA protocol is drawn through MATLAB, as shown in the figure. Fig.16 As shown, from the simulation results data and Fig.16 It can be seen that the high gain and path compression of the smart antenna reduce the average end-to-end delay of the NRSA protocol by about 83% compared with the HCVCR protocol and the AODV protocol, while the average end-to-end delays of the AODV protocol and the HCVCR protocol are almost equal. This is because the smart antenna used in the NRSA protocol has high gain, the signal has a longer propagation distance, and a path compression algorithm is used in the route discovery process, but both the AODV protocol and the HCVCR protocol use omnidirectional antennas, and the route discovery process is basically similar.

[0236] The packet loss rates of the AODV protocol, HCVCR protocol and NRSA protocol are 0.24, 0.21 and 0.03 respectively. The data results are imported into matlab, and a comparison chart of the packet loss rates of the AODV protocol, HCVCR protocol and NRSA protocol is drawn through matlab, as shown in Fig.17 As shown, from the simulation results data and Fig.17 It can be seen that the spatial division multiplexing of the smart antenna makes the probability of data packet collision of the NRSA protocol much lower than that of the HCVCR protocol and the AODV protocol, so the success rate of data transmission is greatly improved, that is, the success rate of voice service calls is increased by about 85% compared with the HCVCR protocol and the AODV protocol.

[0237] The above description is only a specific implementation mode of the present invention, but the protection scope of the present invention is not limited thereto. Any modifications, equivalent substitutions and improvements made by any technician familiar with the technical field within the technical scope disclosed by the present invention and within the spirit and principle of the present invention should be covered by the protection scope of the present invention.

Claims

1. A method for controlling the routing of an Adhoc network for fishing based on smart antennas, characterized in that: The fishing Ad hoc network routing control method based on smart antennas uses smart antennas to detect the number of one-hop neighbor nodes in the area, adjusts the communication radius of different coverage areas of the node smart antenna according to the strategy, and uses the high gain of the smart antenna to reduce the number of route hops during route establishment, thereby achieving end-to-end communication path compression; The fishing Adhoc network routing control method based on smart antenna comprises the following steps: Step 1: Discover neighbor nodes; Step 2: Calculate the number of one-hop neighbor nodes in the area and adjust the communication radius; Step 3: Processing business and routing data; The neighbor node discovery in step 1 includes: In the neighbor node discovery phase, the number of neighbor nodes in each area is detected through the HELLO packet; in the node antenna coverage division, the beam width θ is set m is 60°, the number of antennas is 6, and full coverage of the area around the node is achieved; when θ m When the angle is 60°, the communication radius is extended to three times that of the omnidirectional antenna. All antenna angles are based on the north as 0 degrees and are divided into areas s1, s2, s3, s4, s5, and s6 in a counterclockwise direction with the north as the reference. The calculation of the number of regional one-hop neighbor nodes and the adjustment of the communication radius in step 2 include: Smart antennas are used, and the adaptive adjustment of node communication radius is realized by combining the number of one-hop neighbor nodes in different small areas. According to the actual distribution scenario of fishing boats at sea, the communication radius of each node is designed into four levels. The communication radius of each node's small area s1~s6 has four levels, from small to large, namely 5m, 20m, 100m and 500m, corresponding to 500m, 2km, 10km, 50km in actual scenarios, represented by R1, R2, R3 and R4. The number of nodes at different radii in each area is represented by N1, N2, N3, N4. The specific process of calculating the number of one-hop neighbor nodes in the area and adjusting the communication radius is as follows: (1) Traverse the neighbor node list; (2) Calculate in which partition area (s1-s6) the neighboring node is located of this node; (3) Calculate the distance D between the neighboring node and the current node; (4) Update the corresponding N in the corresponding area i (1≤i≤4); (5) Set area s j The subscript j=1; (6) Determine whether j≤6 is true. If so, execute step (7); otherwise, execute step (15); (7)s j Whether N2 of the region is greater than 180, if so, execute step (8), otherwise execute step (9); (8) Set the node in s j The communication radius of the area is R1, and step (14) is executed; (9)s j Whether N3 of the area is greater than 180, if so, execute step (10), otherwise execute step (11); (10) Set the node in s j The communication radius of the area is R2, and step (14) is executed; (11)s j Whether N4 of the area is greater than 180, if so, execute step (12), otherwise execute step (13); (12) Set the node in s j The communication radius of the area is R3, and step (14) is executed; (13) Set the node in s j The communication radius of the area is R4, and step (14) is executed; (14) j increases by 1, and returns to step (6); (15)End.

2. The method for controlling the routing of the fishing Adhoc network based on the smart antenna according to claim 1, characterized in that: The business and routing data processing in step 3 includes: The data packets to be processed include RREQ packets, RREP packets and service data packets; Wherein, the RREQ packet is a routing request packet, which contains all the information implemented in the AODV protocol and adds the communication radius information and geographical location information of the source node; The RREP packet is a routing response packet, which contains all the information implemented in the AODV protocol, and adds the communication radius, geographical location and address information of the source node and RT_NEXT_NODE; The service data group is service data generated by the node or other nodes; The data processing flow specifically includes: (1) Call the resv function to receive data packets; (2) Determine the type of the received data packet. If it is a service data packet, proceed to step (3); if it is a RREQ packet, proceed to step (4); if it is a RREP packet, proceed to step (5); (3) Processing business data, executing step (6); (4) RREQ group processing, execute step (6); (5) RREP group processing; (6)End.

3. The method for controlling the routing of the fishing Ad hoc network based on smart antenna according to claim 2, characterized in that: The processing flow of the service data group in step (3) includes: (3.1) When a node has a request for data transmission, it first checks whether it has a route to the destination node. If there is a route from the node to the destination node, it executes step (3.4); if there is no route from the node to the destination node, it executes step (3.2); (3.2) Generate RREQ packet and broadcast; (3.3) Receive and process RREP packets; (3.4) Prepare to send a service data packet and determine the type. If it is uplink, execute step (3.5), otherwise execute step (3.6); (3.5) Submit it to the transport layer for processing and execute step (3.7); (3.6) Add necessary information and hand it over to the LL layer for processing; (3.7) End; The processing flow of the RREQ group in step (4) includes: (4.1) Symmetric link judgment: if it is a symmetric link, execute step (4.2); if not, execute step (4.8); (4.2) Determine whether there is a reverse route. If so, execute step (4.3); if not, execute step (4.4); (4.3) Update the reverse route and execute step (4.5); (4.4) Establish reverse routing; (4.5) Determine whether the receiving node is the destination node or there is a forward route to the destination node. If there is no route or it is not the destination node, execute step (4.6); if it exists or it is the destination node, execute step (4.7); (4.6) Update the relevant information of the RREQ source node and broadcast the RREQ packet, start to establish the route, and add the next hop node RT_NEXT_NODE of the forward route of the source node to the RREP packet. The RT_NEXT_NODE of the node that generates the RREP packet for the first time is always the current node, and execute step (4.9); (4.7) Reply RREP packet to RREQ source node and execute step (4.9); (4.8) discard the RREQ packet; (4.9) End; The RREP data group processing flow in step (5) includes: (5.1) Determine whether there is a forward route. If so, execute step (5.3); otherwise, execute step (5.2); (5.2) Add forward routing; (5.3) Update forward routing; (5.4) Determine whether the node has data packets to send. If not, directly execute step (5.5); otherwise, start transmitting data first, and then execute step (5.5); (5.5) Determine whether this node is the destination node. If so, execute step (5.7); otherwise, execute step (5.6); (5.6) Update some information of the RREP packet, then forward it and execute step (5.8); (5.7) discard the RREP packet; (5.8)End.

4. The method for controlling the routing of the fishing Ad hoc network based on smart antenna according to claim 3, characterized in that: The process of updating the forward route in step (5.3) includes: (5.3.1) Determine whether RT_NEXT_NODE and this node are symmetric links. If so, execute step (5.3.2); if not, execute step (5.3.3); (5.3.2) Using the relevant communication information of the RT_NEXT_NODE node carried by the RREP packet, update the forward route and execute step (5.3.5); (5.3.3) Update the forward route using the relevant communication information of the source node of the RREP packet; (5.3.4) Set RT_NEXT_NODE node as this node; (5.3.5) End; The process of determining whether RT_NEXT_NODE and the current node are symmetrical links in step (5.3.1) includes: (5.3.1.1) Calculate the area s where RT_NEXT_NODE is located at this node l (1≤l≤6) and this node is located in the region s of RT_NEXT_NODE k (1≤k≤6); (5.3.1.2) Get the region where RT_NEXT_NODE is located l The communication radius L_R_Radius (1≤l≤6) and the area s where this node is located k The communication radius R_L_Radius (1≤k≤6); (5.3.1.3) Calculate the distance D_R between the RT_NEXT_NODE node and this node; (5.3.1.4) Determine whether D_R≤min(L_R_Radius,R_L_Radius) holds. If so, this node and RT_NEXT_NODE are symmetric links; otherwise, the two nodes are not symmetric links; (5.3.1.5)End.

5. A fishery Ad Hoc network routing control system implementing the fishery Ad Hoc network routing control method based on smart antennas as described in any one of claims 1 to 4, characterized in that: The fishing Ad Hoc network routing control system comprises: Node discovery module, used to discover neighbor nodes; The node number calculation module is used to calculate the number of one-hop neighbor nodes in the area and adjust the communication radius; The data processing module is used for business and routing data processing.

6. A computer device, characterized in that: The computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the smart antenna-based fishing Ad hoc network routing control method as claimed in any one of claims 1 to 4.

7. A computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the processor executes the steps of the smart antenna-based fishing Ad hoc network routing control method according to any one of claims 1 to 4.