CN114866406A - Method for rapidly repairing service performance based on fault location in wireless ad hoc network - Google Patents
Method for rapidly repairing service performance based on fault location in wireless ad hoc network Download PDFInfo
- Publication number
- CN114866406A CN114866406A CN202210574529.9A CN202210574529A CN114866406A CN 114866406 A CN114866406 A CN 114866406A CN 202210574529 A CN202210574529 A CN 202210574529A CN 114866406 A CN114866406 A CN 114866406A
- Authority
- CN
- China
- Prior art keywords
- service
- fault
- link
- services
- index
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
-
- 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/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/34—Modification of an existing route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a service performance quick repairing method based on fault location in a wireless ad hoc network, which firstly locates network fault types, comprehensively considers the end-to-end packet loss rate requirement and the end-to-end time delay requirement of services, preferentially meets high-priority services and services which are most required to be repaired by utilizing service priority ordering aiming at the services which do not meet the performance requirement, and finally quickly repairs the services which do not meet the performance requirement by replacing service paths and optimizing two basic repairing strategies of an MAC protocol and link parameters.
Description
Technical Field
The invention belongs to the technical field of wireless networks, and particularly relates to a technology of a service performance quick repairing method based on fault location in a wireless ad hoc network.
Background
With the development of communication technology and the reduction of deployment cost, wireless ad hoc networks are increasingly widely popularized to various fields. The nodes in the network form a wireless network in a self-organizing way without the need of preset infrastructure support, so that the nodes can communicate with each other in a direct-connection wireless link or multi-hop way, and a communication platform is flexibly established in each field.
The limitations of the wireless nodes themselves and the complexity of the wireless communication environment also present challenges to the transmission of traffic in wireless ad hoc networks. The nodes need to adopt a plurality of routes to communicate with each other under the limitation of wireless transmitting power; mobility of nodes of a wireless ad hoc network may also cause network topology changes; the complex diversity of wireless communication environments also requires that wireless ad hoc networks be able to adaptively meet the performance requirements of the services being transported therein.
To address the above challenges and ensure that services meet performance requirements, much research has been directed to improvements in routing protocols and balancing of resource allocations. Literature (ref: S.Peng, Y.Wang, H.Xiao and B.Lin, "Implementation of an Improved AODV Routing Protocol for Markime Ad-hoc Networks," 202013 th International consistency on Image and Signal Processing, BioMedical Engineering and information (CISP-BMEI),2020, pp.7-11, doi:10.1109/CISP-BMEI51763.2020.9263519.) an Improved self-organizing on-demand distance vector Routing Algorithm (AODV) for offshore self-organizing Networks is proposed. The literature (reference: J.Liu, Y.Xu and Z.Li, "Resource Allocation for Performance Enhancement in Mobile Ad Hoc Networks," in IEEE Access, vol.7, pp.73790-73803,2019, doi:10.1109/ACCESS.2019.2921075.) studies on improving the Performance of Mobile Ad Hoc Networks by reasonably allocating network resources.
However, at present, little research is focused on repairing service performance by optimizing the MAC protocol and link parameters in the wireless ad hoc network so as to cope with a complex and changeable network environment in the service transmission process.
Disclosure of Invention
In order to solve the technical problem, the invention provides a method for rapidly repairing the service performance based on fault location in a wireless ad hoc network.
The technical scheme adopted by the invention is as follows: a method for rapidly repairing service performance based on fault location in a wireless ad hoc network comprises the following steps:
s1, positioning the fault type according to the current service distribution characteristics;
s2, based on the service distribution information, ordering the services which do not meet the performance requirement by a high priority regulation strategy;
s3, taking out the next service for optimization according to the sorting result in the step S2, and judging the fault type according to the positioning result in the step S1: if the link level fault occurs, the step goes to step S4, and if the route level fault occurs, the step goes to step S8;
s4, aiming at the current service, updating the MAC protocol and the link parameters on the current service path, if the updating can enable the service to meet the performance requirement, turning to the step S5, otherwise, turning to the step S7;
s5, if all the services which do not meet the performance requirement are traversed, turning to the step S6, otherwise, turning to the step S3;
s6, if all the services meet the performance requirement, turning to the step S9, otherwise, judging whether the upper limit of the iteration times is reached, if so, turning to the step S9, otherwise, turning to the step S2;
s7, if the current service has been changed or the number of times of changing the path reaches the upper limit, go to step S9, otherwise, execute the dynamic route updating method of service perception to change the path for the current service, then go to step S4;
s8, changing the service path aiming at the current service, if the service meets the performance requirement by changing the energy, turning to S5, otherwise, turning to S9 if the current service has changed the service path or the number of times of changing the path reaches the upper limit, otherwise, turning to S8;
and S9, outputting a decision updating scheme.
A network scenario is given below. A wireless network is formed by a plurality of nodes, and the nodes can communicate with each other through direct connection wireless links or multi-hop. There are a number of services in the network that originate from a node and need to be sent to another service. The service is divided into 3 priority levels, and the node preferentially sends or forwards the high-priority service when sending or forwarding the service.
First, a method of locating fault types is proposed. The method obtains the physical position of a problem link according to the service distribution condition of the whole network, then analyzes whether the problem link is distributed densely or not to judge the fault type based on the statistical result, and defines the current fault as a link-level fault or a routing-level fault.
Secondly, a service priority ranking strategy based on a comprehensive evaluation model is utilized to determine which service is optimized preferentially. Firstly, classifying the services according to the priority levels of the services, and then comprehensively evaluating all performance indexes of each service under the current network condition, namely the condition that two indexes of the service end-to-end packet loss rate and the service end-to-end time delay meet the requirements, so as to determine the service performance optimization sequence. The specific evaluation scheme comprises index normalization, weight adjustment and comprehensive evaluation.
And finally, two basic repair strategy optimization decisions are utilized to repair the service performance, including an MAC protocol, a link parameter updating strategy and a service path replacing strategy. The MAC protocol and link parameter updating strategy is mainly based on a particle swarm algorithm and a network calculation module, and a series of MAC protocols and link parameters under the current path of the current service are optimized, wherein the MAC protocols and the link parameters comprise link packet loss rate, link channel rate, time slot selection probability of each node, priority sending proportion of each node, backspacing time upper limit of each node and total time frame length. The service path replacement strategy is mainly based on a service-aware dynamic route updating method to replace the service path.
The invention has the beneficial effects that: the method for rapidly repairing the service performance firstly positions the network fault type, comprehensively considers the end-to-end packet loss rate requirement and the end-to-end time delay requirement of the service, preferentially meets the high-priority service and the service which is most required to be repaired by utilizing service priority sequencing aiming at the service which does not meet the performance requirement, and finally rapidly repairs the service which does not meet the performance requirement by replacing a service path and optimizing two basic repairing strategies, namely an MAC protocol and a link parameter.
Drawings
Fig. 1 is a schematic diagram of a network scenario according to an embodiment of the present invention.
Fig. 2 is a flowchart of a method for rapidly repairing service performance based on fault location in a wireless ad hoc network provided by the present invention.
Detailed Description
In order to facilitate the understanding of the technical contents of the present invention by those skilled in the art, the present invention will be further explained with reference to the accompanying drawings.
Fig. 1 shows a network scenario used in an embodiment of the present invention. A plurality of nodes form a wireless network in the air, and can communicate with each other through direct connection wireless links or multi-hop. There are a number of services in the network that originate from a node and need to be sent to another service. The service is divided into 3 priority levels, and the node preferentially sends or forwards the high-priority service when sending or forwarding the service.
Based on the network scenario, as shown in fig. 2, the method for rapidly repairing service performance based on fault location in a wireless ad hoc network of the present invention includes the following steps:
s1, positioning the fault type according to the current service distribution characteristics;
s2, based on the service distribution information, ordering the services which do not meet the performance requirement by a high priority regulation strategy;
s3, taking out the next service for optimization according to the sorting result in S2, and judging the fault type according to the positioning result in S1: if the link level fault exists, the step goes to S4, and if the route level fault exists, the step goes to S8;
s4, aiming at the current service, updating the MAC protocol and the link parameters on the current service path, if the updating can enable the service to meet the performance requirement, turning to S5, otherwise turning to S7;
s5, if all the services which do not meet the performance requirement are traversed, turning to S6, otherwise, turning to S3;
s6, if all the services meet the performance requirement, turning to S9, otherwise, judging whether the upper limit of the iteration times is reached, if so,
go to S9, otherwise go to S2;
s7, if the current service has changed the service path or the number of times of changing the path reaches the upper limit, go to S9, otherwise, execute the dynamic route updating method of service perception to change the path for the current service, then go to S4;
s8, changing the service path aiming at the current service, if changing the energy to make the service meet the performance requirement, turning to S5, otherwise, if the current service has changed the service path or the number of times of changing the path reaches the upper limit, turning to S9, otherwise, turning to S8;
s9, outputting a decision updating scheme
First, a method of locating the type of failure is proposed in step S1. Firstly, acquiring the physical position of a problem link according to the service distribution condition of the whole network, then analyzing whether the problem link is distributed densely or not to judge the fault type based on a statistical result, and defining the current fault as a link-level fault or a routing-level fault:
(1) if the problematic links in each service are small in distribution range and high in aggregation degree in space, preliminarily defining the problematic links as routing level faults;
(2) if the problematic links in each service are distributed widely in space and have low aggregation, the link-level failure is preliminarily defined.
Whether the problem link distribution is dense or not can be analyzed by constructing a fault matrix. Firstly, the physical distance between each fault link and other fault links is calculated, a fault matrix related to the physical distance is established, and the mean value and the variance of the matrix are respectively calculated. If the variance is greater than the variance threshold, the problem link distribution is considered small and the aggregation is high regardless of the change in the mean. And if the variance is less than or equal to the variance threshold and the mean is greater than the mean threshold, the problem link is considered to be wide in distribution range and low in aggregation degree. In particular, if the number of failed links is less than 3, the variance cannot be obtained, and the link level failure is defined directly.
Secondly, step S2 utilizes a service prioritization policy based on a comprehensive evaluation model to determine which service is optimized preferentially. It is first necessary to determine which service is optimized preferentially. In this embodiment, all performance indexes of each service under the current network condition, that is, the condition that two indexes of the service end-to-end packet loss rate and the end-to-end delay meet the requirements, are comprehensively evaluated to determine the service performance optimization sequence. The specific evaluation scheme comprises index normalization, weight adjustment and comprehensive evaluation.
1. And carrying out normalization processing on all indexes. Specifically, for the end-to-end packet Loss rate plr (packet Loss rate), let t PLR A threshold value for which the indicator meets requirements. If the current service satisfies the threshold t of the index PLR Set to 1, otherwise, normalized to some value less than 1. End-to-end packet loss rate PLR after single service normalization * Can be expressed as:
similarly, for the end-to-end delay DEL (delay), let t DEL In order to make the index meet the required threshold value, its normalized index value DEL * Comprises the following steps:
2. for different types of services, there may be different performance requirements of the metrics, and different weights need to be determined for different types of services. For example, real-time voice services are more sensitive to end-to-end delay, and if the end-to-end packet loss rate index is not so emphasized, the weight of the end-to-end delay index is set to be higher. The CRITIC method can objectively determine the network performance index weight.
For each service, calculating the standard deviation to obtain a weight formula of two indexes:
wherein the content of the first and second substances,
wherein the content of the first and second substances,
and
respectively, the average value of the end-to-end packet loss rate and the end-to-end time delay, S PLR And S DEL The packet loss rate from end to end and the sample standard deviation of the time delay from end to end are respectively, and n is the service quantity.
3. Comprehensive evaluation was performed using TOPSIS. Firstly, in order to make the indexes of all services meet the corresponding threshold requirements, 1 is taken as an ideal optimal solution of each index:
[PLR + ,DEL + ]＝[1,1]
then, taking the minimum value of each index as the worst solution:
[PLR - ,DEL - ]＝[minPLR * ,minDEL * ]
and judging each service type so as to determine the weight, and calculating the distance between each service index value and the optimal solution and the worst solution:
wherein, PLR i And DEL i Respectively the end-to-end packet loss rate and the end-to-end time delay of the ith service.
Finally, calculating the index score of the ith service:
Finally, steps S4 and S8 respectively use two basic repair policy optimization decisions to repair the service performance, including the MAC protocol and link parameter update policy and the service path replacement policy.
The MAC protocol and link parameter updating strategy is mainly based on a particle swarm algorithm and a network calculation module, and a series of MAC protocols and link parameters under the current path of the current service are optimized, wherein the MAC protocols and the link parameters comprise link packet loss rate, link channel rate, time slot selection probability of each node, priority sending proportion of each node, backspacing time upper limit of each node and total time frame length; the service path replacement strategy is mainly based on a service-aware dynamic route updating method to replace the service path.
The MAC protocol and link parameter update strategy is as follows:
(1) index optimization sequence analysis
After determining the order of adjusting the services, the index adjustment order of the services is analyzed as follows:
end-to-end delay of service f (service path, MAC protocol type, MAC protocol parameters, link channel rate)
End-to-end packet loss rate of service g (service path, link packet loss rate)
Since two indexes of the service are respectively associated with a plurality of decision variables, each index is influenced by the plurality of decision variables. However, for a single service, the decision variables that simultaneously affect the end-to-end delay and the end-to-end packet loss rate index of the service are only service paths.
Scheme 1, firstly, service packet loss rate index is adjusted
For a certain service path, the end-to-end packet loss rate of the service is only related to the link packet loss rate of the service path. Suppose a traffic path consists of N links { e } 1 ,...,e N Is formed by connecting links e i The packet loss rate is recorded as p i Then, the end-to-end packet loss rate of the path may be calculated as:
according to the above formula, it can be determined whether the path may meet the end-to-end packet loss rate requirement of the service according to the service path link and the corresponding lower limit of the packet loss rate (if there is no lower limit of the packet loss rate that can be reached by the current environment, it is determined according to the maximum lower limit of the range of the packet loss rate value). If all links on the service path are in the lower bound of the packet loss rate and still cannot meet the service packet loss rate index, the service path is deleted, and the next service path is replaced for evaluation again. And if the service path can meet the requirement of the end-to-end packet loss rate, adjusting the packet loss rate of the link on the service path according to the variable adjustment sequence and the variable adjustment rule.
According to the steps, after a certain service path is determined to meet the end-to-end packet loss rate requirement of the service, the decision variables influencing the end-to-end delay index except the service path are adjusted on the basis of the current service path. The index optimization sequence reduces the search space of the decision variables of the end-to-end delay index.
Scheme 2, firstly, the service time delay index is adjusted
For a certain service path, the end-to-end delay of the service is related to the type of the MAC protocol, the parameters of the MAC protocol and the channel rate of the link. Different from the above parameters, reducing the link packet loss rate on a certain determined service path will reduce the end-to-end packet loss rate of other services, making it easier to meet the end-to-end packet loss rate index, but will not affect the end-to-end delay of any service. Because the influence degree of all decision variables on the delay index is uncertain, whether the path can meet the end-to-end delay requirement or not cannot be determined according to the boundary values of the decision variables. In addition, given a traffic path, adjustment of a decision variable similar to the priority queue sending ratio is likely to make the end-to-end delay of other traffic worse. In this case, the decision variables are adjusted heuristically according to the variable adjustment order and the rules to find a feasible solution, and it cannot be determined whether the service delay index can be satisfied on this path.
Even if a feasible solution of the decision variable meeting the service delay index is found on the path, the service path may not meet the requirement of the service packet loss rate index according to the determination rule described in scheme 1. Therefore, the path needs to be abandoned, and the above feasible solution solving process has no meaning. In summary, for the packet loss rate and the delay index of a given service, the packet loss rate index is preferentially adjusted, and then the delay index is adjusted.
When the network does not operate or the link level fault is determined in the operation process, the MAC protocol and the link layer parameters need to be adjusted first, and feasible solutions are explored through a heuristic algorithm aiming at different parameters. And the priority of parameter optimization is considered, and the parameters under different access protocols are subjected to priority analysis. Specifically, if the current network is operating in distributed TDMA, the adjustable parameters include channel rate, slot selection probability for each node, priority transmission ratio for each node, and total time frame length. The time slot selection probability of the node is increased, so that the transmission delay of the service can be reduced; the transmission ratio of the priority queue of the node is mainly adjusted for conflict resolution. If CSMA is running, the adjustable parameters include the channel rate, the priority queue transmission ratio of each node, the upper limit of the backoff times of each node, and the total time frame length. The sending proportion of the priority queue of the node is also used for conflict resolution; the upper limit of the backoff times of the nodes affects the contention waiting time of the nodes. The optimization of the channel rate can directly improve the performance index of the service, so for different access protocols, the optimization sequence of the parameters can give:
1. distributed TDMA protocol: channel rate, { probability of slot selection per node, priority transmission proportion per node }, total time frame length.
CSMA protocol: channel rate, { priority queue transmission ratio of each node, upper limit of backoff times of each node }.
For the unsatisfied service delay performance, the parameter optimization logic is as follows: when the MAC protocol and the link parameter are updated, the channel rate is optimized firstly. If the service delay can meet the requirements after the optimization is finished, ending the parameter updating; otherwise, different parameters are selected and optimized according to the type of the MAC protocol. For a distributed TDMA protocol, optimizing the time slot selection probability of each node and the priority transmission proportion of each node, if the optimization is finished, the service delay can meet the requirement, ending the parameter updating, otherwise, optimizing the total time frame length; for the CSMA protocol, the priority queue sending proportion of each node and the upper limit of the back-off times of each node are optimized.
TABLE 1 influence degree of different parameters on service index
(2) Optimized modeling
Specifically, for the packet loss rate index, the end-to-end packet loss rate of the service is calculated based on the minimum packet loss rate that the link can reach in the current environment, and if the requirement can be met, the following optimization problem is solved to obtain a link packet loss rate decision.
minPLR i
e k,min ≤e k ≤e k,max
Wherein, PLR i Is the end-to-end packet loss rate of the ith service, e k Is the packet loss rate of link k, e k,min And e k,max Respectively a value lower limit and an upper limit of the link packet loss rate. These links are the links that the ith traffic current path passes through.
For the delay index, when the MAC protocol and the link parameter are adjusted, if the MAC protocol is a TDMA protocol, the following optimization problem is solved according to parameter optimization logic:
1) optimizing channel rates
minD i
r k,min ≤r k ≤r k,max
Wherein D is i Is the end-to-end delay, r, of the ith service k Is the channel rate of link k, r k,min And r k,max Respectively a value lower limit and an upper limit of the k channel rate of the link. These links are the links that the ith traffic current path passes through.
2) Optimizing slot selection probability and priority queue transmission ratio
minD i
Wherein p is j And
selecting probability for time slot of node j and sending proportion of I priority queue of node j, p j,min 、
And
and selecting a value lower limit of the probability, a value lower limit of the 1 st priority of the node j and a value lower limit of the sending proportion of the 2 nd priority queue for the time slot of the node j respectively. These nodes are the nodes that the ith traffic current path passes through.
3) Optimizing total time frame length
minD i
T min ≤T≤T max
Where T represents the total time frame length, T min And T max Respectively, a value lower limit and an upper limit of the total time frame length.
If the MAC protocol is CSMA protocol, the MAC protocol and link parameters are optimized according to the parameter optimization logic. The model 1) is used for optimizing the channel rate, and the optimization model for optimizing the upper limit of the sending proportion and the backoff times of the priority queue can be expressed as follows:
4) optimizing priority queue sending proportion and backspacing time upper limit
minD i
Wherein, B j Represents the upper limit of the backoff number of the node j, B j,min And B j,max And the lower limit and the upper limit of the back-off times of the node j are obtained. These nodes are the nodes that the ith traffic current path passes through.
(3) Link parameter updating method based on particle swarm optimization algorithm
The models can be solved by a particle swarm algorithm. One set of solutions is as a particle and the constraint is as a search space. Due to the fact that the priority of the service is considered, the search space is remarkably reduced, and the calculation complexity of the algorithm is further reduced.
TABLE 2 Link parameter update algorithm based on particle swarm optimization algorithm
The traffic path replacement policy is as follows. When the switching operation is executed, firstly, the network topology is adjusted, a subnet formed by the current path and a one-hop neighbor passing through the node is used as a search domain, the problem link and the problem node are deleted, and then a KSP algorithm is used for continuously searching a new path. The algorithm pseudo code of the search algorithm may be expressed as:
table 3 service aware dynamic route update algorithm
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.
Claims (4)
1. A method for rapidly repairing service performance based on fault location in a wireless ad hoc network comprises the following steps:
s1, positioning the fault type according to the current service distribution characteristics;
s2, based on the service distribution information, ordering the services which do not meet the performance requirement by a high priority regulation strategy;
s3, taking out the next service for optimization according to the sorting result in the step S2, and judging the fault type according to the positioning result in the step S1: if the link level fault exists, the step goes to step S4, and if the route level fault exists, the step goes to step S8;
s4, aiming at the current service, updating the MAC protocol and the link parameters on the current service path, if the updating can enable the service to meet the performance requirement, turning to the step S5, otherwise, turning to the step S7;
s5, if all the services which do not meet the performance requirement are traversed, turning to the step S6, otherwise, turning to the step S3;
s6, if all the services meet the performance requirement, turning to the step S9, otherwise, judging whether the upper limit of the iteration times is reached, if so, turning to the step S9, otherwise, turning to the step S2;
s7, if the current service has been changed or the number of times of changing the path reaches the upper limit, go to step S9, otherwise, execute the dynamic route updating method of service perception to change the path for the current service, then go to step S4;
s8, changing the service path aiming at the current service, if the service meets the performance requirement by changing the energy, turning to S5, otherwise, turning to S9 if the current service has changed the service path or the number of times of changing the path reaches the upper limit, otherwise, turning to S8;
and S9, outputting a decision updating scheme.
2. The method for rapidly repairing service performance based on fault location in a wireless ad hoc network according to claim 1, wherein the specific process of locating the fault type in step S1 is as follows:
firstly, acquiring the physical position of a problem link according to the service distribution condition of the whole network, then analyzing whether the problem link is distributed densely or not to judge the fault type based on a statistical result, and defining the current fault as a link-level fault or a routing-level fault:
(1) if the problematic links in each service are small in distribution range and high in aggregation degree in space, preliminarily defining the problematic links as routing level faults;
(2) if the problematic links in each service are wide in distribution range and low in aggregation degree in space, preliminarily defining the problematic links as link-level faults;
whether the problem link distribution is dense or not is analyzed by constructing a fault matrix: firstly, the physical distance between each fault link and other fault links is calculated, a fault matrix related to the physical distance is established, and the mean value and the variance of the matrix are respectively calculated. If the variance is larger than the variance threshold value, no matter how the mean value changes, the problem link is considered to be small in distribution range and high in aggregation degree; if the variance is less than or equal to the variance threshold and the mean is greater than the mean threshold, the problem link is considered to be wide in distribution range and low in aggregation; if the number of the failed links is less than 3, the variance cannot be solved, and the link level failure is directly defined.
3. The method for rapidly repairing service performance based on fault location in a wireless ad hoc network according to claim 2, wherein step S2 specifically utilizes a service prioritization policy based on a comprehensive evaluation model to determine which service is preferentially optimized.
4. The method for rapidly repairing service performance based on fault location in a wireless ad hoc network according to claim 3, wherein step S2 comprehensively evaluates all performance indexes of each service under the current network condition, that is, the condition that two indexes of service end-to-end packet loss rate and end-to-end delay meet requirements, to determine the service performance optimization sequence, and the specific evaluation scheme includes index normalization, weight adjustment and comprehensive evaluation.
a. All indexes are normalized:
for end-to-end packet loss rate PLR, let t PLR If the index meets the required threshold value, the current service meets the threshold value t of the index PLR If not, normalizing to a certain value smaller than 1, and normalizing the end-to-end packet loss rate PLR of a single service * Expressed as:
for end-to-end delay DEL (delay), let t DEL In order to make the index meet the required threshold value, its normalized index value DEL * Comprises the following steps:
b. for different types of services, there may be different performance requirements of the metrics, and different weights need to be determined for different types of services:
for each service, calculating the standard deviation to obtain a weight formula of two indexes:
wherein the content of the first and second substances,
wherein the content of the first and second substances,
and
respectively, the average value of the end-to-end packet loss rate and the end-to-end time delay, S PLR And S DEL The packet loss rate from end to end and the sample standard deviation of the time delay from end to end are respectively, and n is the service quantity.
c. Comprehensive evaluation was performed using toposis:
firstly, in order to make the indexes of all services meet the corresponding threshold requirements, 1 is taken as an ideal optimal solution of each index:
[PLR + ,DEL + ]＝[1,1]
then, taking the minimum value of each index as the worst solution:
[PLR - ,DEL - ]＝[min PLR * ,min DEL * ]
and judging each service type so as to determine the weight, and calculating the distance between each service index value and the optimal solution and the worst solution:
wherein, PLR i And DEL i Respectively the end-to-end packet loss rate and the end-to-end time delay of the ith service.
Finally, calculating the index score of the ith service:
according to S i And (5) arranging the optimization sequence of the output services in an ascending order.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210574529.9A CN114866406B (en) | 2022-05-25 | 2022-05-25 | Method for rapidly repairing service performance based on fault location in wireless ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210574529.9A CN114866406B (en) | 2022-05-25 | 2022-05-25 | Method for rapidly repairing service performance based on fault location in wireless ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114866406A true CN114866406A (en) | 2022-08-05 |
| CN114866406B CN114866406B (en) | 2023-04-18 |
Family
ID=82639312
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210574529.9A Active CN114866406B (en) | 2022-05-25 | 2022-05-25 | Method for rapidly repairing service performance based on fault location in wireless ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114866406B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003094546A1 (en) * | 2002-04-29 | 2003-11-13 | Harris Corporation | Allocating channels in a mobile ad hoc network |
| CN106209621A (en) * | 2016-06-17 | 2016-12-07 | 中国人民解放军空军工程大学 | The link failure recovery method of qos constraint |
| CN108834173A (en) * | 2018-06-04 | 2018-11-16 | 杭州电子科技大学 | A kind of centralized optimizing distribution method of wireless multi-hop network |
| US10243781B1 (en) * | 2017-07-05 | 2019-03-26 | Juniper Networks, Inc. | Detecting link faults in network paths that include link aggregation groups (LAGs) |
| CN110891294A (en) * | 2019-11-26 | 2020-03-17 | 无锡职业技术学院 | Wireless ad hoc network routing method and system based on service type |
| CN111404727A (en) * | 2020-03-02 | 2020-07-10 | 国网浙江省电力有限公司信息通信分公司 | Route analysis method based on standby route potential risk assessment model |
| CN113114582A (en) * | 2021-05-25 | 2021-07-13 | 电子科技大学 | Link congestion fault prediction and network autonomous control method based on machine learning |
| CN113193996A (en) * | 2021-04-26 | 2021-07-30 | 国网四川省电力公司经济技术研究院 | Power optical transmission network optimization method, device, equipment and storage medium |
| CN114286382A (en) * | 2021-12-22 | 2022-04-05 | 山东航天电子技术研究所 | Capacity-breaking reconfigurable routing strategy based on prior knowledge base |
-
2022
- 2022-05-25 CN CN202210574529.9A patent/CN114866406B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003094546A1 (en) * | 2002-04-29 | 2003-11-13 | Harris Corporation | Allocating channels in a mobile ad hoc network |
| CN106209621A (en) * | 2016-06-17 | 2016-12-07 | 中国人民解放军空军工程大学 | The link failure recovery method of qos constraint |
| US10243781B1 (en) * | 2017-07-05 | 2019-03-26 | Juniper Networks, Inc. | Detecting link faults in network paths that include link aggregation groups (LAGs) |
| CN108834173A (en) * | 2018-06-04 | 2018-11-16 | 杭州电子科技大学 | A kind of centralized optimizing distribution method of wireless multi-hop network |
| CN110891294A (en) * | 2019-11-26 | 2020-03-17 | 无锡职业技术学院 | Wireless ad hoc network routing method and system based on service type |
| CN111404727A (en) * | 2020-03-02 | 2020-07-10 | 国网浙江省电力有限公司信息通信分公司 | Route analysis method based on standby route potential risk assessment model |
| CN113193996A (en) * | 2021-04-26 | 2021-07-30 | 国网四川省电力公司经济技术研究院 | Power optical transmission network optimization method, device, equipment and storage medium |
| CN113114582A (en) * | 2021-05-25 | 2021-07-13 | 电子科技大学 | Link congestion fault prediction and network autonomous control method based on machine learning |
| CN114286382A (en) * | 2021-12-22 | 2022-04-05 | 山东航天电子技术研究所 | Capacity-breaking reconfigurable routing strategy based on prior knowledge base |
Non-Patent Citations (2)
| Title |
|---|
| PUSHP SRA，SATISH CHAND: "QoS in Mobile Ad‑Hoc Networks" * |
| 翁睿，任祥颖，钱松荣: "基于NS2的Ad Hoc网络路由协议性能比较分析" * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114866406B (en) | 2023-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wu et al. | A generic distributed broadcast scheme in ad hoc wireless networks | |
| CN111148116B (en) | WMN gateway deployment and channel allocation joint optimization method facing emergency communication | |
| CN109699033B (en) | LoRa power Internet of things base station deployment method and device for cost and load balancing | |
| KR20090076563A (en) | Method for gateway selecting to optimize network capacity gateway in wireless mesh networks | |
| US20220369200A1 (en) | Clustering and routing method and system for wireless sensor networks | |
| CN111385201A (en) | RPL routing method based on bidirectional father node decision | |
| CN114697229A (en) | Construction method and application of distributed routing planning model | |
| CN110213776A (en) | A kind of WiFi discharging method based on Q study and multiple attribute decision making (MADM) | |
| Shigueta et al. | A strategy for opportunistic cognitive channel allocation in wireless Internet of Things | |
| Devaraj et al. | Genetic algorithm-based optimisation of load-balanced routing for AMI with wireless mesh networks | |
| CN108632785B (en) | Ant colony self-adaptive Internet of vehicles routing method based on link quality | |
| Qiu et al. | Maintaining links in the highly dynamic fanet using deep reinforcement learning | |
| Liao et al. | Adaptive situation-aware load balance scheme for mobile wireless mesh networks | |
| CN114866406B (en) | Method for rapidly repairing service performance based on fault location in wireless ad hoc network | |
| CN116647890A (en) | Multi-attribute multi-metric routing decision method suitable for mobile AdHoc network | |
| Bokhari et al. | i-POCA: Interference-aware partially overlapping channel assignment in 802.11-based meshes | |
| Ding et al. | Energy-efficient topology control mechanism for IoT-oriented software-defined WSNs | |
| CN111447658A (en) | SDWSN-based clustering routing method | |
| CN115134928A (en) | Frequency band route optimized wireless Mesh network congestion control method | |
| Huang et al. | UAV routing protocol based on link stability and selectivity of neighbor nodes in ETX metrics | |
| CN111371572B (en) | Network node election method and node equipment | |
| CN108551664B (en) | Vehicle-mounted heterogeneous network resource cooperation optimization method based on graph theory | |
| Fang et al. | Improve quality of experience of users by optimizing handover parameters in mobile networks | |
| Luo et al. | Optimization of Gateway Deployment with Load Balancing and Interference Minimization in Wireless Mesh Networks. | |
| Yen et al. | A two-stage game for allocating channels and radios to links in wireless backhaul networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |