CN117377019A - Ad hoc network control method, device, equipment and storage medium - Google Patents
Ad hoc network control method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN117377019A CN117377019A CN202311645165.XA CN202311645165A CN117377019A CN 117377019 A CN117377019 A CN 117377019A CN 202311645165 A CN202311645165 A CN 202311645165A CN 117377019 A CN117377019 A CN 117377019A
- Authority
- CN
- China
- Prior art keywords
- information
- target terminal
- path
- terminal
- sight
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000013439 planning Methods 0.000 claims abstract description 37
- 238000004590 computer program Methods 0.000 claims abstract description 25
- 238000005457 optimization Methods 0.000 claims description 24
- 238000005259 measurement Methods 0.000 claims description 19
- 230000008054 signal transmission Effects 0.000 claims description 7
- 230000002708 enhancing effect Effects 0.000 claims description 5
- 238000012544 monitoring process Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 description 16
- 230000005540 biological transmission Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 238000013468 resource allocation Methods 0.000 description 4
- 230000008439 repair process Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000000060 site-specific infrared dichroism spectroscopy Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
- H04W40/205—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location using topographical information, e.g. hills, high rise buildings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/08—Mobility data transfer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
- H04W8/24—Transfer of terminal data
Abstract
The application relates to an ad hoc network control method, an ad hoc network control device, a computer device, a storage medium and a computer program product. The method comprises the following steps: controlling the base station to cover the wireless signal; judging whether the target terminal is positioned in the direct line of sight; if the target terminal is located in the direct line of sight, acquiring login information of the target terminal; if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal; and forwarding the wireless signal to a target terminal based on the planned optimal path. By adopting the method, the signal can automatically select the optimal path to continuously jump from one user to another user and finally reach the target user without direct vision distance, and the user with the direct vision distance provides a wireless broadband access function for the adjacent user without the direct vision distance.
Description
Technical Field
The present disclosure relates to the field of wireless mesh networks, and in particular, to a method, an apparatus, a device, and a storage medium for controlling an ad hoc network.
Background
With the development of network and power technology, network and power equipment become indispensable parts in people's life, but often lead to disaster area road interruption and power interruption in natural disasters, and then lead to unable timely communication with disaster personnel, be difficult to rescue disaster area fast and pertinently.
The existing emergency rescue aiming at the disaster-stricken area usually enters the disaster-stricken area rapidly by a manual mode, performs debugging and emergency repair on power equipment and network equipment, and gradually resumes the communication of the disaster-stricken area by synchronously building a new communication terminal and the like.
In the existing rush-repair mode, because the power equipment and the network equipment are rush-repaired in an artificial mode, a communication network cannot be timely constructed before the power equipment and the network equipment are contacted with the rush-repair equipment, so that the rush-repair efficiency is low.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a fast and flexible ad hoc network control method, apparatus, computer device, computer readable storage medium and computer program product for recovering a communication network.
In a first aspect, the present application provides an ad hoc network control method. The method comprises the following steps: controlling the base station to cover the wireless signal;
judging whether the target terminal is positioned in the direct line of sight;
if the target terminal is located in the direct line of sight, acquiring login information of the target terminal;
if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal;
and forwarding the wireless signal to a target terminal based on the planned optimal path.
In one embodiment, planning the best path with the target terminal includes:
selecting corresponding scene information based on a preset scene library, wherein the scene library stores different scene information and an optimal path planning strategy corresponding to the scene information, and the scene information at least comprises the steps of establishing network connection and enhancing network quality;
when the scene information is that network connection is established, planning the shortest distance between the base station and the target terminal based on Dijkstra algorithm;
when the scene information is the enhanced network quality, a path with larger bandwidth between the base station and the target terminal is preferentially selected based on the bandwidth.
In one embodiment, the shortest distance between the base station and the target terminal is planned based on Dijkstra algorithm:
planning path information between all base stations and a target terminal, wherein the path information is a signal transmission path from the base stations to the target terminal through the terminals in the direct line of sight;
comparing any two pieces of path information, and storing the path distance shorter into a preset path library;
if the path distance of any path information is smaller than the path information in the path library, the path information in the path library is replaced with the shorter path information.
In one embodiment, selecting a path with a larger bandwidth between the base station and the target terminal based on bandwidth preference comprises:
planning path information between all base stations and a target terminal;
acquiring available bandwidths, network congestion degrees and link quality corresponding to different path information;
calculating available bandwidth, network congestion degree and link quality based on preset weights, and acquiring bandwidth priority;
and selecting the path information with the highest bandwidth priority.
In one embodiment, a channel measurement index is obtained, wherein the channel measurement index comprises signal strength, signal-to-noise ratio and channel quality indication of path information;
selecting a corresponding terminal or node to perform resource optimization based on the channel measurement index and the scene information;
and sending a resource optimization instruction and monitoring a signal measurement index.
In one embodiment, selecting a corresponding terminal or node for resource optimization based on the channel measurement index and the scene information includes:
when the scene information is that network connection is established, the scene information is sent to a terminal or a node with the worst channel quality indication for optimization operation;
and when the scene information is the enhanced network quality, performing optimization operation on the terminal or the node with the lowest bandwidth.
In a second aspect, the present application further provides an ad hoc network control device. The device comprises: the audio information conversion module is used for acquiring audio information and converting the audio information into frequency domain characteristic information;
the wireless signal coverage module is used for controlling the base station to cover wireless signals;
the direct sight distance judging module is used for judging whether the target terminal is positioned in the direct sight distance;
the login information acquisition module is used for acquiring login information of the target terminal if the target terminal is positioned in the direct line of sight;
the optimal path planning module is used for acquiring terminal information in infinite signals and planning an optimal path between the terminal information and the target terminal if the target terminal is located outside the direct line of sight;
and the wireless signal forwarding module is used for forwarding the wireless signal to the target terminal based on the planned optimal path.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor which when executing the computer program performs the steps of:
controlling the base station to cover the wireless signal;
judging whether the target terminal is positioned in the direct line of sight;
if the target terminal is located in the direct line of sight, acquiring login information of the target terminal;
if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal;
and forwarding the wireless signal to a target terminal based on the planned optimal path.
In a fourth aspect, the present application also provides a computer-readable storage medium. A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
controlling the base station to cover the wireless signal;
judging whether the target terminal is positioned in the direct line of sight;
if the target terminal is located in the direct line of sight, acquiring login information of the target terminal;
if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal;
and forwarding the wireless signal to a target terminal based on the planned optimal path.
In a fifth aspect, the present application also provides a computer program product. Computer program product comprising a computer program which, when executed by a processor, realizes the steps of:
controlling the base station to cover the wireless signal;
judging whether the target terminal is positioned in the direct line of sight;
if the target terminal is located in the direct line of sight, acquiring login information of the target terminal;
if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal;
and forwarding the wireless signal to a target terminal based on the planned optimal path.
The method, the device, the computer equipment, the storage medium and the computer program product for controlling the self-organizing network control the base station to cover the wireless signal; judging whether the target terminal is positioned in the direct line of sight; if the target terminal is located in the direct line of sight, acquiring login information of the target terminal; if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal; and forwarding the wireless signal to a target terminal based on the planned optimal path. By adopting the method, the signal can automatically select the optimal path to continuously jump from one user to another user and finally reach the target user without the direct vision distance, and the user with the direct vision distance provides a wireless broadband access function for the adjacent user without the direct vision distance.
Drawings
FIG. 1 is an application environment diagram of an ad hoc network control method in one embodiment;
FIG. 2 is a flow chart of an ad hoc network control method in one embodiment;
FIG. 3 is a schematic diagram of planning an optimal path in one embodiment;
FIG. 4 is a schematic diagram of channel-based optimization in one embodiment;
FIG. 5 is a block diagram of an ad hoc network control device in one embodiment;
fig. 6 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
The ad hoc network control method provided by the embodiment of the application can be applied to an application environment as shown in fig. 1. Wherein the terminal communicates with the server through a network. The data storage system may store data that the server needs to process. The data storage system may be integrated on a server or may be placed on a cloud or other network server. The terminal can be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, internet of things equipment and portable wearable equipment, and the internet of things equipment can be smart speakers, smart televisions, smart air conditioners, smart vehicle-mounted equipment and the like. The portable wearable device may be a smart watch, smart bracelet, headset, or the like. The server may be implemented as a stand-alone server or as a server cluster composed of a plurality of servers.
In one embodiment, as shown in fig. 2, the method includes the following steps:
step 202, controlling a base station to cover a wireless signal.
In the area with direct line of sight, one or more LTE base stations are deployed as transmitting stations, which can provide wide coverage wireless signals.
Step 204, determining whether the target terminal is located within the direct line of sight.
If the target terminal is located in the direct line of sight, acquiring login information of the target terminal;
if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal; direct Line-of-Sight (LOS) refers to the visual range between two communication devices when there is no obstruction, building, etc. between the two communication devices; when there is a direct line of sight between two communication devices, the signal transmission quality is generally better and the transmission distance is generally further.
And step 206, forwarding the wireless signal to the target terminal based on the planned optimal path.
The terminal with direct line of sight and close to the transmitting station can directly receive the wireless signal from the base station and forward the signal to other users through own equipment (such as a wireless router).
According to the ad hoc network control method, a brand new communication network is quickly constructed directly through the ad hoc network equipment in a disaster area, communication is quickly and conveniently recovered, follow-up rush repair and disaster relief are facilitated, and disaster relief efficiency is improved.
In one embodiment, as shown in fig. 3, planning the best path with the target terminal includes:
step 302, selecting corresponding scene information based on a preset scene library.
The scene library stores different scene information and an optimal path planning strategy corresponding to the scene information, and the scene information at least comprises the steps of establishing network connection and enhancing network quality.
And step 304, when the scene information is that network connection is established, planning the shortest distance between the base station and the target terminal based on Dijkstra algorithm.
The shortest distance between the base station and the target terminal can be planned by using a Bellman-Ford algorithm, which specifically comprises the following steps:
creating a plurality of groups of dist, representing the distance between the source node and other nodes, setting the distance between the source node and other nodes as infinity initially, and setting the distance between the starting point and the self as 0; repeating the following steps n times, n being the number of nodes: performing a slackening operation on each edge in the graph, namely checking the distance between the node adjacent to the starting point of the edge and the node reached by the edge, and if a shorter distance is found, updating the distance value of the node adjacent to the starting point of the edge; check if a negative weight loop is present and if so, indicate that the shortest path cannot be found.
And 306, when the scene information is to enhance the network quality, selecting a path with larger bandwidth between the base station and the target terminal based on bandwidth preference.
The path with larger bandwidth is preferentially selected to ensure the speed and quality of data transmission, and the bandwidth priority is judged based on indexes such as available bandwidth on the path, network congestion condition or link quality.
In one embodiment, the shortest distance between the base station and the target terminal is planned based on Dijkstra algorithm:
planning path information between all base stations and a target terminal, wherein the path information is a signal transmission path from the base stations to the target terminal through the terminals in the direct line of sight; comparing any two pieces of path information, and storing the path distance shorter into a preset path library; if the path distance of any path information is smaller than the path information in the path library, the path information in the path library is replaced with the shorter path information.
For example, a digital group dist is created to represent the distance between the source node and other nodes, the distance between the source node and other nodes is set to infinity initially, and the distance between the starting point and the source node is set to 0; creating a set S, and storing the nodes with the shortest distance determined; repeating the following steps until all nodes are contained in S, or no path is found: finding a node v with the shortest current distance in the dist array, and adding the node v into the set S; the distance between the adjacent nodes with v is updated, and if v is passed, the distance can be made shorter, and the original distance is replaced.
In one embodiment, selecting a path between the base station and the target terminal with a larger bandwidth based on bandwidth preference comprises:
planning path information between all base stations and a target terminal; acquiring available bandwidths, network congestion degrees and link quality corresponding to different path information; calculating available bandwidth, network congestion degree and link quality based on preset weights, and acquiring bandwidth priority; and selecting the path information with the highest bandwidth priority.
Wherein, in addition to the shortest path and bandwidth first algorithm, the following algorithm may be used to calculate path information:
maximum signal strength algorithm: selecting the path with the strongest signal strength may improve the reliability and stability of signal transmission, require signal strength measurements between nodes, and select the path with the highest signal strength.
Adaptive algorithm: and dynamically adjusting the strategy of selecting the path, and dynamically selecting according to the real-time condition and the requirement of the network. The best path is adaptively selected, for example, based on load balancing, network congestion, or link quality, among other metrics.
Multipath algorithm: multiple paths are selected and traffic is distributed onto these paths to improve the fault tolerance and load balancing capabilities of the network. This may be achieved by using a plurality of path selection algorithms, such as the ECMP (Equal-Cost Multi path) algorithm.
QoS optimization algorithm: qoS, namely quality of service (Quality of Service), refers to the quality of service index such as bandwidth, time delay, packet loss rate and the like of various applications in a network by classifying, scheduling and controlling data traffic transmitted in the network in order to meet the requirements of different services and applications; the optimal path meeting the QoS requirement is selected according to the requirements of different applications and the quality of service, and the path is selected according to the key indexes of the priority, the delay requirement, the bandwidth requirement and the like of the applications.
In one embodiment, as shown in fig. 4, the method further comprises:
step 402, a channel measurement indicator is obtained.
The LTE user equipment (e.g., a terminal or a user equipment) continuously measures channel quality and other related indexes, and feeds back the information to the base station, where the channel measurement indexes include signal strength, signal-to-noise ratio and channel quality indication of path information.
And step 404, selecting a corresponding terminal or node to perform resource optimization based on the channel measurement index and the scene information.
The base station evaluates the resource requirements of different users or services according to the received user feedback information and service requirements; the base station uses a resource allocation algorithm to determine how to allocate available spectrum resources and time domain resources to different users or services, which may take into account different objectives such as maximizing system capacity, minimizing interference, providing fair resource sharing, etc.
Step 406, sending a resource optimization instruction and monitoring a signal measurement index.
The base station makes a resource allocation decision according to the resource demand and the result of a resource allocation algorithm, and sends corresponding scheduling instructions to the user equipment, wherein the instructions comprise information such as resource blocks, time slots, power levels and the like allocated to the user; the resource allocation is dynamic and needs to be periodically adjusted and updated according to real-time channel conditions and user requirements. The base station can continuously monitor the channel quality and feedback information of the user and reallocate resources according to the needs so as to meet the requirements of different scenes.
Optionally, the method for constructing the Mesh network further includes: planning a network topology: the range and layout of the wireless Mesh network are determined, including the positions and the number of nodes and the like. And determining the arrangement mode of the nodes according to the actual requirements and the feasibility evaluation so as to realize the optimal signal coverage and transmission efficiency.
Selecting an appropriate hardware device: a hardware device suitable for the wireless Mesh network is selected. Mainly comprising Mesh nodes (e.g. wireless routers or wireless access points) that should support Mesh network protocols and be able to communicate with each other.
Configuring a Mesh node: parameters of the Mesh node including network name (SSID), encryption settings, router mode, etc. are set according to the guidelines of the device vendor. Ensuring that the configuration of all nodes is consistent so that the nodes can be properly interconnected.
Deploying Mesh nodes: and installing and deploying Mesh nodes at predetermined positions according to network topology planning. Ensuring that the distance and signal coverage between nodes is sufficient, in general, the nodes should be relatively close together to ensure reliable signal transmission.
Starting and testing a network: once all nodes are installed and configured, the network is started and tested. The nodes can be correctly interconnected, data can be transmitted in multiple hops between the nodes, and the performance and the stability of the network are monitored.
Optimizing network configuration: and gradually optimizing the network configuration according to the test result. It may be desirable to adjust the location of nodes, increase or decrease the number of nodes, adjust channel settings, etc. to improve the coverage and performance of the network.
Network management and maintenance: the wireless Mesh network is checked and maintained regularly, normal operation and communication of the nodes are ensured, and the nodes can be monitored and managed remotely by using a management tool to timely treat faults and problems.
Self-organization and self-repair: the nodes in the wireless Mesh network can automatically discover, select and establish communication connection, and when the nodes in the network fail or increase or decrease, the network can automatically reorganize and repair, so that the influence of single-point failure is avoided, and the reliability of the network is improved; multi-hop transmission: the data can be transmitted through a plurality of relay nodes, so that the communication distance is prolonged, and the coverage limitation of the traditional wireless local area network is solved; and (3) expansibility: the wireless Mesh network can increase or decrease nodes according to the needs, flexibly expand the scale of the network, and adapt to different scenes and requirements; self-organizing routing: the nodes in the wireless Mesh network have a routing function, and can automatically select the optimal transmission path according to the network topology and the optimization algorithm, so that the transmission efficiency and capacity of the network are improved; high bandwidth and high throughput: because a plurality of nodes can be utilized for data transmission in the wireless Mesh network, high-bandwidth and high-throughput data transmission can be realized, and the requirement of large-scale data transmission is met.
It should be noted that, when the scenario information is that network connection is established, the scenario information is sent to a terminal or a node with the worst channel quality indication for optimization operation;
and when the scene information is the enhanced network quality, performing optimization operation on the terminal or the node with the lowest bandwidth.
Two types of nodes are included in WMNs: a wireless Mesh router and a wireless Mesh client. The system structure of WMNs is classified into 3 classes according to the difference of node functions: backbone Mesh structure, client Mesh structure, hybrid structure.
The backbone Mesh structure is formed by Mesh interconnection of Mesh routers, and the wireless Mesh backbone is connected with an external network through the Mesh routers. The Mesh router has a gateway and a relay function of a traditional wireless router, also has a routing function for supporting Mesh network interconnection, and can obtain the same wireless coverage range with much lower transmitting power through wireless multi-hop communication.
The client Mesh structure is a small-sized peer-to-peer communication network formed by interconnection of Mesh clients, and provides point-to-point service between the clients. The Mesh network user terminal can be a user device such as a portable computer, a mobile phone, a PDA and the like provided with a wireless network card and an antenna. Such a structure may provide a communication support without or inconvenient use of existing network infrastructure.
The Mesh client can access the backbone Mesh network through the Mesh router to form a hybrid structure of the Mesh network, wherein a dotted line and a solid line respectively represent wireless and wired connection. This structure provides connectivity to other network structures, enhancing connectivity and expanding coverage.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides an ad hoc network control device for realizing the above-mentioned ad hoc network control method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation in the embodiments of one or more ad hoc network control devices provided below may be referred to the limitation of the ad hoc network control method hereinabove, and will not be repeated here.
In one embodiment, as shown in fig. 5, there is provided an ad hoc network control apparatus, including: the system comprises a wireless signal coverage module, a direct line-of-sight judgment module, a login information acquisition module, an optimal path planning module, a scene quality optimization module and a wireless signal forwarding module, wherein:
in one embodiment, the optimal path planning module is further configured to select corresponding scene information based on a preset scene library, where different scene information and an optimal path planning policy corresponding to the scene information are stored in the scene library, where the scene information at least includes establishing network connection and enhancing network quality; when the scene information is that network connection is established, planning the shortest distance between the base station and the target terminal based on Dijkstra algorithm; when the scene information is the enhanced network quality, a path with larger bandwidth between the base station and the target terminal is preferentially selected based on the bandwidth.
In one embodiment, the optimal path planning module is further configured to plan path information between all base stations and the target terminal, where the path information is a signal transmission path from the base station to the target terminal by forwarding signals through the terminal in the direct line of sight; comparing any two pieces of path information, and storing the path distance shorter into a preset path library; if the path distance of any path information is smaller than the path information in the path library, the path information in the path library is replaced with the shorter path information.
In one embodiment, the optimal path planning module is further configured to plan path information between all base stations and the target terminal; acquiring available bandwidths, network congestion degrees and link quality corresponding to different path information; calculating available bandwidth, network congestion degree and link quality based on preset weights, and acquiring bandwidth priority; and selecting the path information with the highest bandwidth priority.
In one embodiment, the scene quality optimization module is further configured to obtain a channel measurement indicator, where the channel measurement indicator includes a signal strength, a signal-to-noise ratio, and a channel quality indicator of the path information; selecting a corresponding terminal or node to perform resource optimization based on the channel measurement index and the scene information; and sending a resource optimization instruction and monitoring a signal measurement index.
In one embodiment, the scene quality optimization module is further configured to, when the scene information is that network connection is established, perform an optimization operation on the terminal or the node with the worst channel quality indication; and when the scene information is the enhanced network quality, performing optimization operation on the terminal or the node with the lowest bandwidth.
The modules in the ad hoc network control method device can be all or partially realized by software, hardware and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 6. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer device is for storing data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program when executed by a processor implements a power quality data query presentation method.
In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method embodiments described above when the computer program is executed.
In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, implements the steps of the method embodiments described above.
In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.
It should be noted that, user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the various embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the various embodiments provided herein may include at least one of relational databases and non-relational databases. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic units, quantum computing-based data processing logic units, etc., without being limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples only represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application shall be subject to the appended claims.
Claims (10)
1. An ad hoc network control method, comprising:
controlling the base station to cover the wireless signal;
judging whether the target terminal is positioned in the direct line of sight;
if the target terminal is located in the direct line of sight, acquiring login information of the target terminal;
if the target terminal is located outside the direct line of sight, acquiring terminal information in an infinite signal and planning an optimal path between the terminal information and the target terminal;
and forwarding the wireless signal to a target terminal based on the planned optimal path.
2. The method of claim 1, wherein the planning of the best path with the target terminal comprises:
selecting corresponding scene information based on a preset scene library, wherein the scene library stores different scene information and an optimal path planning strategy corresponding to the scene information, and the scene information at least comprises the steps of establishing network connection and enhancing network quality;
when the scene information is that network connection is established, planning the shortest distance between the base station and the target terminal based on Dijkstra algorithm;
when the scene information is the enhanced network quality, a path with larger bandwidth between the base station and the target terminal is preferentially selected based on the bandwidth.
3. The method of claim 2, wherein the planning of the shortest distance between the base station and the target terminal is based on Dijkstra's algorithm:
planning path information between all base stations and a target terminal, wherein the path information is a signal transmission path from the base stations to the target terminal through the terminals in the direct line of sight;
comparing any two pieces of path information, and storing the path distance shorter into a preset path library;
if the path distance of any path information is smaller than the path information in the path library, the path information in the path library is replaced with the shorter path information.
4. The method of claim 2, wherein the preferentially selecting a path of greater bandwidth between the base station and a target terminal based on bandwidth comprises:
planning path information between all base stations and a target terminal;
acquiring available bandwidths, network congestion degrees and link quality corresponding to different path information;
calculating available bandwidth, network congestion degree and link quality based on preset weights, and acquiring bandwidth priority;
and selecting the path information with the highest bandwidth priority.
5. The method according to claim 2, wherein the method further comprises:
obtaining channel measurement indexes, wherein the channel measurement indexes comprise signal strength, signal to noise ratio and channel quality indication of path information;
selecting a corresponding terminal or node to perform resource optimization based on the channel measurement index and the scene information;
and sending a resource optimization instruction and monitoring a signal measurement index.
6. The method of claim 5, wherein selecting the corresponding terminal or node for resource optimization based on the channel measurement indicator and the context information comprises:
when the scene information is that network connection is established, the scene information is sent to a terminal or a node with the worst channel quality indication for optimization operation;
and when the scene information is the enhanced network quality, performing optimization operation on the terminal or the node with the lowest bandwidth.
7. An ad hoc network control device is characterized in that,
the wireless signal coverage module is used for controlling the base station to cover wireless signals;
the direct sight distance judging module is used for judging whether the target terminal is positioned in the direct sight distance;
the login information acquisition module is used for acquiring login information of the target terminal if the target terminal is positioned in the direct line of sight;
the optimal path planning module is used for acquiring terminal information in infinite signals and planning an optimal path between the terminal information and the target terminal if the target terminal is located outside the direct line of sight;
and the wireless signal forwarding module is used for forwarding the wireless signal to the target terminal based on the planned optimal path.
8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 6 when the computer program is executed.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311645165.XA CN117377019A (en) | 2023-12-04 | 2023-12-04 | Ad hoc network control method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311645165.XA CN117377019A (en) | 2023-12-04 | 2023-12-04 | Ad hoc network control method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117377019A true CN117377019A (en) | 2024-01-09 |
Family
ID=89406245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311645165.XA Pending CN117377019A (en) | 2023-12-04 | 2023-12-04 | Ad hoc network control method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117377019A (en) |
-
2023
- 2023-12-04 CN CN202311645165.XA patent/CN117377019A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9893985B2 (en) | Utilizing remote storage for network formation in IoT networks | |
| Al Islam et al. | Channel assignment techniques for multi-radio wireless mesh networks: A survey | |
| CN107005480B (en) | System and method for SDT interworking with NFV and SDN | |
| US7978632B2 (en) | Wireless mesh network transit link topology optimization method and system | |
| US8085672B2 (en) | Wireless routing implementation | |
| US20120030150A1 (en) | Hybrid Learning Component for Link State Routing Protocols | |
| Wu et al. | Maximizing network lifetime of WirelessHART networks under graph routing | |
| CN109699033B (en) | LoRa power Internet of things base station deployment method and device for cost and load balancing | |
| CA2538150A1 (en) | Load leveling in mobile ad-hoc networks to support end-to-end delay reduction, qos and energy leveling | |
| Oda et al. | Implementation and experimental results of a WMN testbed in indoor environment considering LoS scenario | |
| US7936704B2 (en) | Method for routing and load balancing in communication networks | |
| Tanha et al. | Disaster management and response for modern cellular networks using flow-based multi-hop device-to-device communications | |
| Kumar et al. | EMEEDP: Enhanced multi-hop energy efficient distributed protocol for heterogeneous wireless sensor network | |
| Kumar et al. | Energy aware distributed protocol for heterogeneous wireless sensor network | |
| CN102821115B (en) | A kind of method and apparatus of point-to-point P2P transfer resource | |
| Yun et al. | A method for deciding node densities in non-uniform deployment of wireless sensors | |
| CN107006005B (en) | Method and module for processing channels in radio spectrum | |
| KR101680262B1 (en) | Method for constructing topology in wireless mesh backhaul network | |
| CN117377019A (en) | Ad hoc network control method, device, equipment and storage medium | |
| WO2016072838A1 (en) | A system and method for next hop selection in a wireless sensor network | |
| US20230131226A1 (en) | Method for providing multi-site orchestration in public network for factory automation, orchestrator, and communication system | |
| JP6120411B2 (en) | Network control method and apparatus | |
| WO2014185768A1 (en) | A method of spectrum aware routing in a mesh network and a system derived thereof | |
| CN110198544B (en) | Industrial wireless network topology management method | |
| Huang et al. | Relay placement for reliable base station connectivity in polymorphous 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 |