CN114513471B - Marine node network selection method and system based on dynamic composite priority - Google Patents

Marine node network selection method and system based on dynamic composite priority Download PDF

Info

Publication number
CN114513471B
CN114513471B CN202210037323.2A CN202210037323A CN114513471B CN 114513471 B CN114513471 B CN 114513471B CN 202210037323 A CN202210037323 A CN 202210037323A CN 114513471 B CN114513471 B CN 114513471B
Authority
CN
China
Prior art keywords
service
priority
representing
parameter
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210037323.2A
Other languages
Chinese (zh)
Other versions
CN114513471A (en
Inventor
毛忠阳
张治霖
刘传辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Naval Aeronautical University
Original Assignee
Naval Aeronautical University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Naval Aeronautical University filed Critical Naval Aeronautical University
Priority to CN202210037323.2A priority Critical patent/CN114513471B/en
Publication of CN114513471A publication Critical patent/CN114513471A/en
Application granted granted Critical
Publication of CN114513471B publication Critical patent/CN114513471B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/6235—Variable service order
    • 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 is suitable for the technical field of node network selection, and provides a method and a system for selecting an offshore node network based on dynamic composite priority. Simulation experiments and result analysis show that in the network selection scene of the mobile node in the offshore wave environment based on the service priority, compared with a time priority algorithm and a dynamic priority control algorithm based on the dynamic composite priority, the method can effectively improve the service completion rate and the queue fluency and improve the performance of the whole communication network on the basis of ensuring the service priority requirement.

Description

Marine node network selection method and system based on dynamic composite priority
Technical Field
The invention relates to the technical field of node network selection, in particular to a method and a system for selecting an offshore node network based on dynamic composite priority.
Background
The offshore operation ships and the airplanes have various services in the sea, the timeliness, the urgency and the priority of each service are different, and the current network development needs can not be met far by only one or more networks, so that under the traction of the needs, the offshore heterogeneous network stands out through the advantages of wide coverage, complex network types and the like. The user under the coverage of multiple networks needs to consider parameters such as bandwidth, distance, packet delay and the like when want to complete the transmission task, which is why the complexity of the network selection algorithm is high.
The communication channel of the offshore heterogeneous network is different from land, and the influence of reflected waves on transmission is greatly increased due to the fact that the shielding is small. Although the offshore environment is more open than the terrestrial environment, the volatility caused by interference in the transmission environment is still a non-negligible factor, wherein interference includes natural factor interference and human factor interference. Therefore, how to maintain a stable transmission rate and service completion rate in a fluctuating environment is one of the problems to be solved.
Disclosure of Invention
The invention provides a method and a system for selecting an offshore node network based on dynamic composite priority, which aim to solve the technical problems in the prior art determined in the background art.
The invention discloses a dynamic composite priority-based offshore node network selection method, which specifically comprises the following steps:
adding the newly generated service into a request access queuing sequence, and clearing the expired service and the finished service to release the bandwidth;
updating network parameters around the mobile stations in the path range, and rearranging the service in the request access queuing sequence according to the network parameters of the mobile stations;
updating the request access queuing sequence according to the execution urgency, the residual value and the environment weight of the service, wherein the environment weight is used for representing the preference of the current service type to the network parameters;
and executing service for the updated service in the request access queuing sequence.
As a further scheme of the invention: the step of updating network parameters around the mobile station in the path range and rearranging the service in the request access queuing sequence according to the network parameters of the mobile station specifically comprises the following steps:
defining the ith network parameter of the motorized site as f i ；
Determining the optimal parameters respectively
Figure BDA0003468974060000021
And worst parameter->
Figure BDA0003468974060000022
According to the optimum parameter f i * And worst parameter f i - Calculation S j And R is j ；
Figure BDA0003468974060000023
Figure BDA0003468974060000024
/>
Wherein omega i Representing the corresponding demand weight of the service, S j And R is j Is a method for measuring rank, f i * Representing the parameter closest to the ideal value, f i - Representing compromised parameters, S j Scheme representing maximum population benefit, R j Representing a scheme after group concessions;
obtaining Q from the above result j
Figure BDA0003468974060000025
Wherein S is * ＝minS j ，S - ＝maxS j ，R * ＝minR j ,R - ＝maxR j V=0.5, last Q j Descending order of Q j The motorized station with the smallest value is used as the connection scheme.
As still further aspects of the invention: the step of updating the request access queuing sequence according to the execution urgency, the residual value and the environment weight of the service, wherein the environment weight is used for representing the preference of the current service type to the network parameters, and the method comprises the following steps of:
defined as dynamic composite priority ω (t);
Figure BDA0003468974060000026
wherein D (t) represents the residual value,
Figure BDA0003468974060000031
representing execution urgency, V ij (t) represents an environmental weight;
Figure BDA0003468974060000032
Figure BDA0003468974060000033
Figure BDA0003468974060000034
wherein k represents a service parameter, T r Representing the relative remaining time, which is defined as the difference between the service deadline and the served time, V 0 Represents initial value, q represents the product of service type and service class, d i The absolute deadline is represented, t represents real-time, i represents the number of the motorized site which is most suitable for connection at present, j represents the jth network environment parameter which is more important to the type of the current service, and the network parameters at the moment t of the ith motorized site are { alpha }, respectively 1t ,α 2t ,α 3t ,...}，i＝1,2,…，n。
As still further aspects of the invention: the step of accessing the service execution service in the queuing sequence according to the updated request comprises the following steps:
judging whether the residual bandwidth meets the service requirement;
when the residual bandwidth is required to be served or not, executing the service in the request access queuing sequence in sequence, and enabling the service which does not meet the requirement to enter a waiting sequence;
and classifying the services in the waiting sequence into a request access queuing sequence for reordering until the request access queuing sequence is completely executed.
Another object of the present invention is to provide a dynamic composite priority based offshore node network selection system, comprising:
the initial module is used for adding the newly generated service into the request access queuing sequence, and clearing the expired service and the finished service to release the bandwidth;
the service rearrangement module is used for updating network parameters around the mobile stations in the path range and rearranging the service in the request access queuing sequence according to the network parameters of the mobile stations;
the sequence updating module is used for updating the request access queuing sequence according to the execution urgency, the residual value and the environment weight of the service, wherein the environment weight is used for representing the preference of the current service type to the network parameters;
and the service execution module is used for executing service on the updated service in the request access queuing sequence.
Compared with the prior art, the invention has the beneficial effects that: in the network selection scene of the mobile node in the offshore wave environment based on the service priority, compared with a time priority algorithm and a dynamic priority control algorithm, the algorithm based on the dynamic composite priority can effectively improve the service completion rate and the queue fluency and improve the performance of the whole communication network on the basis of ensuring the service priority requirement.
Drawings
Fig. 1 is a flow chart of a method for selecting an offshore node network based on dynamic composite priority.
Fig. 2 is a diagram of an offshore heterogeneous wireless network architecture.
Fig. 3 is a motorized site location diagram.
Fig. 4 is a comparison chart of real-time traffic completion rates.
Fig. 5 is a traffic class completion number comparison chart.
Fig. 6 is a traffic type completion number comparison chart.
Fig. 7 is a graph comparing performance of network selection algorithms.
FIG. 8 is a graph of real-time blockage rate versus time.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Specific implementations of the invention are described in detail below in connection with specific embodiments.
As shown in fig. 1, a flowchart of a method for selecting an offshore node network based on dynamic composite priority according to an embodiment of the present invention includes the following steps:
s100, adding the newly generated service into a request access queuing sequence, and clearing the expired service and the finished service to release the bandwidth;
s200, updating network parameters around the mobile stations in the path range, and rearranging the service in the request access queuing sequence according to the network parameters of the mobile stations;
s300, updating the request access queuing sequence according to the execution urgency, the residual value and the environment weight of the service, wherein the environment weight is used for representing the preference of the current service type to the network parameters;
s400, executing service for the updated service in the request access queuing sequence.
In the embodiment of the invention, the offshore operation ships and the airplanes have various services in the sea, the timeliness, the urgency and the priority of each service are different, and the current network development needs can not be met by one or more networks, so that the offshore heterogeneous network has the advantages of wide coverage, complex network types and the like under the traction of the requirements. The user under the coverage of multiple networks needs to consider parameters such as bandwidth, distance, packet delay and the like when want to complete the transmission task, which is why the complexity of the network selection algorithm is high.
The architecture of the offshore heterogeneous wireless network adopted in the embodiment of the invention is shown in fig. 2. The communication channel of the offshore heterogeneous network is different from land, and the influence of reflected waves on transmission is greatly increased due to the fact that the shielding is small. Although the offshore environment is more open than the terrestrial environment, the volatility caused by interference in the transmission environment is still a non-negligible factor, wherein interference includes natural factor interference and human factor interference.
In practical application, the mobile station and network parameters in the receiving range are continuously changed due to random movement of the node and fluctuation of surrounding environment. The embodiment of the invention adopts a VIKOR method (intuitive fuzzy multi-attribute decision method) to provide a proper real-time access scheme for the mobile node, selects environment weight, residual value and execution urgency as the standards of service change priority, and fully considers the type, initial value and timeliness of the service. According to the optimal access scheme provided by the VIKOR method, the selected motor site environment parameters are converted into environment weights, the environment weights are provided for the priority function for dynamic updating, and the requested access service is ordered and accessed according to the priority result.
As a preferred embodiment of the present invention, the step of updating network parameters around the mobile station in the path range and rearranging the service in the request access queuing sequence according to the network parameters of the mobile station specifically includes:
defining the ith network parameter of the motorized site as f i ；
Determining the optimal parameters respectively
Figure BDA0003468974060000061
And worst parameter->
Figure BDA0003468974060000062
According to the optimum parameter f i * And worst parameter f i - Calculation S j And R is j ；
Figure BDA0003468974060000063
Figure BDA0003468974060000064
Wherein omega i Representing the corresponding demand weights of the services, wherein the demand weights are different for different services, for example, omega can be used 1 Representing the corresponding demand weight, omega of voice service 2 Representing the corresponding needs of interactive servicesWeighting, omega 3 Representing the corresponding demand weight of the streaming media service. S is S j And R is j Is a method used to measure rank in VIKOR method, f i * Representing the parameter closest to the ideal value, f i - Representing compromised parameters, S j Scheme representing maximum population benefit, R j Representing a scheme after group concessions;
obtaining Q from the above result j
Figure BDA0003468974060000065
Wherein S is * ＝minS j ，S - ＝maxS j ，R * ＝minR j ,R - ＝maxR j V=0.5, last Q j Descending order of Q j The motorized station with the smallest value is used as the connection scheme.
In the embodiment of the invention, network parameters around the mobile stations change every moment, the size and the change rate of the parameters are random, the VIKOR method can select the mobile station with the largest benefit from a plurality of network parameters, and a connection scheme which is more suitable for the current-stage environment transmission can be effectively provided for the mobile node aiming at the problem of environment fluctuation.
As another preferred embodiment of the present invention, the step of updating the request access queuing sequence according to the execution urgency, the residual value and the environmental weight of the service, wherein the environmental weight is used for characterizing the preference amount of the current service type to the network parameters, includes:
defined as dynamic composite priority ω (t);
Figure BDA0003468974060000071
/>
in the embodiment of the invention, the service is arranged according to the service priority (namely, dynamic composite priority) in the queue sequence for waiting for accessing the request, and the higher the service priority is, the more priority is given to accessing under the condition of bandwidth permission. Considering the influence of the fluctuation environment of the node on the service transmission, compared with the prior art, the embodiment also considers the environment weight, so that the service can be preferentially served by the service suitable for the current-stage environment transmission in the queue sequencing.
Wherein D (t) represents the residual value,
Figure BDA0003468974060000072
representing execution urgency, V ij (t) represents an environmental weight;
Figure BDA0003468974060000073
Figure BDA0003468974060000074
Figure BDA0003468974060000075
wherein k represents a service parameter, T r Representing the relative remaining time, which is defined as the difference between the service deadline and the served time, V 0 Represents initial value, q represents the product of service type and service class, d i The absolute deadline is represented, t represents real-time, i represents the number of the motorized site which is most suitable for connection at present, j represents the jth network environment parameter which is more important to the type of the current service, and the network parameters at the moment t of the ith motorized site are { alpha }, respectively 1t ,α 2t ,α 3t ,...}，i＝1,2,…，n。
In the embodiment of the invention, the types and the grades of the services cause different service timeliness, and the timeliness change rules also have certain difference. For high priority conversational class services, the timeliness is only kept for a very short time after the service is generated, while for high priority interactive class and streaming media class services, the timeliness existence area is relatively wider than that of the conversational class service of the same class. The high-priority session class service and the low-priority session class service have the same service type, but the time-effectiveness existence areas are slightly different due to the difference of the priorities. Although the timeliness area of the session service is smaller than that of the interactive service, the dynamic composite priority function is required to give the priority of the high-priority interactive service the opportunity that the time difference of the request access exceeds the priority of the low-priority session service, otherwise, the service type overhead service level is caused, and the situation that the high-priority interactive service and the streaming media service are frequently dequeued by the low-priority session service is caused.
Based on the above considerations, the residual value and execution urgency function are modified on the basis of the prior art.
For the residual value, redefining the residual value according to the characteristic of high timeliness of the offshore service, strengthening the corresponding relation between the service priority and the service duration, and optimizing the value difference value corresponding to the time interval; for executing urgency, the correlation of service type, service grade and urgency is enhanced, an urgency curve is smoothed, compared with the original expression, the urgency change under the same time difference can be more uniform, and the urgency change under each time change is more obvious; for the environment weight, the environment weight is calculated by a normalization method according to an access scheme provided by a VIKOR algorithm, and because different service types have different requirements on different network parameters, the session service attention packet delay parameter, the interactive service attention packet loss rate parameter and the streaming media service attention bandwidth parameter are set.
As another preferred embodiment of the present invention, the step of accessing the service execution service in the queuing sequence according to the updated request includes:
s401, judging whether the residual bandwidth meets the service requirement;
s402, when the residual bandwidth is required to be served or not, executing the service in the request access queuing sequence in sequence, and entering a waiting sequence for the service which does not meet the requirement;
s403, classifying the services in the waiting sequence into the request access queuing sequence for reordering until the request access queuing sequence is completely executed.
In the embodiment of the invention, the environment weight, the residual value and the execution urgency are selected as the standards of the service change priority, and the type, the initial value and the timeliness of the service are fully considered. According to the optimal access scheme provided by the VIKOR method, the selected motor site environment parameters are converted into environment weights, the environment weights are provided for the priority function to dynamically update (namely, the dynamic composite priority function), and the request access service is ordered and accessed according to the priority result until the request access queuing sequence is completely executed.
The embodiment of the invention also provides a system for selecting the offshore node network based on the dynamic composite priority, which comprises the following steps:
the initial module is used for adding the newly generated service into the request access queuing sequence, and clearing the expired service and the finished service to release the bandwidth;
the service rearrangement module is used for updating network parameters around the mobile stations in the path range and rearranging the service in the request access queuing sequence according to the network parameters of the mobile stations;
the sequence updating module is used for updating the request access queuing sequence according to the execution urgency, the residual value and the environment weight of the service, wherein the environment weight is used for representing the preference of the current service type to the network parameters;
and the service execution module is used for executing service on the updated service in the request access queuing sequence.
In the embodiment of the invention, the mobile node collects network attribute parameters of surrounding mobile stations, calculates execution urgency and residual value of generated services, forms final dynamic composite priority based on a VIKOR method by using parameter weights of different types of services, provides a proper connection scheme for environmental network parameters, and sorts and accesses the services requesting access. And finally, obtaining the service parameter weight of the real-time environment weight updating service after the dynamic composite priority weighting calculation. The service timeliness characteristic is enhanced, and the adaptability to the environment fluctuation network parameters is also considered.
Simulation scene
The simulation scene of the method of the embodiment of the invention is set as a temporary motor site environment at sea, and the position of the motor site is shown in figure 3. The motorized station slowly moves towards the positive direction of the x axis at the speed of 15 knots at sea level, the mobile node starts from the original point, and then continuously and randomly moves at the speed of 150m/s for 800s. Since the simulation uses the relative distance of the motorized site and the offshore node, the speed of movement of the motorized site can be considered approximately stationary with respect to the offshore node. The communication range of the motorized station is the line-of-sight range, and exceeding the communication range is considered no signal. The starting point of the mobile node is set as the origin of coordinates, and Monte Carlo simulation is performed by taking this as an example.
In the simulation process, the maximum bandwidth of the mobile node is set to be 150kHz, the maximum number of the waiting queues and the service queues is 10, and when the waiting queues and the service queues are full, the network congestion is defined when the service access request is generated again. The service generation interval satisfies poisson distribution with the parameter of 3, the network parameter fluctuation of the mobile station is simulated in a Markov chain mode, the state transition probability is 0.5, the parameter of the current time is only related to the parameter of the previous time, the parameter value of the current time is irrelevant to the parameter value of other time, the network parameter fluctuation range of the mobile station is shown in a table 1, and the simulation parameter table.
TABLE 1 simulation parameter Table
Figure BDA0003468974060000091
The service parameter bandwidth parameters are shown in table 2, the service parameter table shows that for facilitating numerical calculation, the bandwidths required by three services are reduced by one order of magnitude, the reduced numerical values do not affect the numerical value and meaning of the subsequent calculation step, and according to the rules that the high priority value is higher than the low priority value, the session class is higher than the interaction class, and the interaction class is higher than the streaming media class.
Table 2, simulation parameter table
Figure BDA0003468974060000101
The service time and the number of classes of service are specified in table 3, and the sum of the expected service times of the three classes of service is approximately equal to the required service time of class two according to the statistical principle. The service state is divided into three states of waiting, service and expiration, the expiration service refers to service time when the service waiting time exceeds k times of the service waiting time, k is respectively set to 0.8, 1.2 and 1.5 according to the timeliness of different grades of service according to the service grade one-two three, and the expiration service does not enter the request access sequence for queuing any more and is automatically judged to be failed in transmitting the service.
Table 3, service level table
Figure BDA0003468974060000102
Analysis of results
To verify the performance of the method according to the embodiments of the present invention, it is compared with an improved dynamic priority control algorithm based on distance and time priority algorithms. The base station connection selection scheme is selected according to the distance, the time priority is ordered according to the sending time of the service access request, and the improved dynamic priority control algorithm is a part for connecting the base stations based on the distance is added on the basis of the prior art (Zhang Xiaoliang, heterogeneous wireless network access selection algorithm research, chongqing university's thesis).
Dividing the completed business by all the businesses generated in the period of time to obtain the business completion rate, and measuring the business execution condition of the algorithm. The completion rate comparison chart shown in fig. 4 is obtained after a certain simulation is finished, and it can be seen that the completion rates of several algorithms before 70s are almost the same, because the service sequences are not completely full and the difference between the algorithms is not obvious. After the service sequence is full, the queue service completion rate ordered according to the dynamic priority is obviously better than that of the time priority queue, because when the service time of the high-priority service is less, the high-priority service can be served in advance, so that the situation that the high-priority service cannot be accessed to the final failure due to long-time occupation of the bandwidth by the high-bandwidth low-priority service can be avoided. After 50 Monte Carlo simulation averaging, the composite priority algorithm is improved by 0.71% compared with the priority control algorithm, and is improved by 3.85% compared with the time priority, because the residual value of the composite priority and the executing urgency function increase the timeliness area of the effective difference according to the timeliness characteristics of different services, and the situation that the high priority is always queued by the service with the low priority which sends the access request first because of the late sending of the access request is avoided.
Fig. 5 shows a comparison of the number of completions of different service classes of two algorithms in simulation time, and under the condition of dense service transmission requirements, the total service completion amount of the dynamic composite priority algorithm is obviously higher than that of other two algorithms, and the result is obtained after 50 monte carlo simulation averages. This is because the algorithm increases the priority of high priority service, sacrificing a portion of low priority traffic with greater bandwidth requirements, and allowing the queue to quickly service low bandwidth demand traffic. Compared with a dynamic priority control algorithm, the method provided by the embodiment of the invention has the advantages that the service grade I finish amount is increased by 17.59%, the service grade II finish amount is increased by 5.819%, and the service grade III finish amount is increased by 11.76%. The method provided by the embodiment of the invention actively improves the service time of the high-priority service, and also improves the smoothness of the whole queuing sequence, so that the service completion rate of each priority can be improved.
Fig. 6 shows a comparison of the completion amounts of different service types, the completion of the service types is related to the network parameters of the mobile station and the bandwidths of the service types, and the streaming media service has lower service completion amount due to larger required bandwidths. By taking the average value after 50 Monte Carlo simulations, compared with a time priority algorithm, the method provided by the embodiment of the invention improves the completion of the session service by about 67%, improves the completion of the interactive service by about 19.42%, and reduces the completion of the streaming media service by 21%. The session type service has minimum requirement as three types of services, can be quickly accessed to service when the high-priority session type service requests, and has minimum influence on the request access queuing queue, so that the session type service is promoted most obviously. Also, in the case of high bandwidth demand and low priority streaming media class traffic, a corresponding service location can be set aside for high priority low bandwidth demand traffic. Compared with a dynamic priority control algorithm, the method has the advantages that the completion rate of the high-priority service is improved, the completion rate of the corresponding service type is also improved, the session service completion amount of the method provided by the embodiment of the invention is improved by 6.5%, the interactive service completion amount is improved by 5.5%, and the streaming media service completion amount is improved by 3%.
The fluctuation of the environment parameters is uncontrollable, the environment adaptability of the algorithm is reflected in providing a proper connection scheme from a large number of changeable network parameters of the mobile station, and the parameter tendency of the connection scheme is transferred to a service request access queue, so that the real-time network parameters are selected to measure the fluctuation environment adaptability. As can be seen by comparing fig. 7, the vicor method provides a compromise scheme with smaller packet delay, packet jitter and packet loss rate under four collision parameters of bandwidth, packet delay, packet jitter and packet loss rate, which is very beneficial to the transmission of session type and interactive type services, but the cost of the scheme is smaller bandwidth. The VIKOR method provides environmental weights for service sequencing, and can effectively promote the service to be sequenced according to the sequence suitable for environmental transmission.
Fig. 8 shows a comparison of blocking rates of three algorithms in simulation time, where the blocking rate is defined as the number of services waiting to be accessed in a request access queue divided by the number of services in a full queue, and it can be seen from the figure that the real-time blocking rate of the method provided by the embodiment of the invention is always at a lower value, and the other two algorithms are both at higher values. When the blocking rate of the algorithm is in a full state, if new service is regenerated at the next moment, the service is expired due to network blocking, and the service completion rate is reduced, so that the low blocking rate means that the smoothness of the node service queue is ensured, and the performance of the whole communication network can be improved to a certain extent. In the combination of fig. 6 and fig. 7, on the basis of improving the service completion rate by dynamic composite priority, the mobile station connection with better parameters is selected by combining with the VIKOR method, and the service is in a good network parameter environment, so that the service quality can be improved better.
Aiming at the problems that the timeliness characteristics of the service type and the service class are not outstanding and the algorithm has poor adaptability to the fluctuation environment, a multi-attribute network access selection algorithm based on a VIKOR method and dynamic priority is provided. Firstly, selecting a proper network access scheme by a VIKOR method, then transmitting the network environment parameter weight of a scheme station to a service connection request queue of a mobile node, establishing a dynamic composite priority model by combining the improved residual value and execution urgency, and finally establishing a simulation environment to simulate the performance of the dynamic composite priority model. Simulation experiments and result analysis show that in the network selection scene of the mobile node in the offshore wave environment based on the service priority, compared with a time priority algorithm and a dynamic priority control algorithm based on the dynamic composite priority, the method can effectively improve the service completion rate and the queue fluency and improve the performance of the whole communication network on the basis of ensuring the service priority requirement.
Other embodiments of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (2)

1. The marine node network selection method based on the dynamic composite priority is characterized by comprising the following steps of:
adding the newly generated service into a request access queuing sequence, and clearing the expired service and the finished service to release the bandwidth;
updating network parameters around the mobile stations in the path range, and rearranging the service in the request access queuing sequence according to the network parameters of the mobile stations; the method comprises the following specific steps:
defining the ith network parameter of the motorized site as f i ；
Determining the optimal parameters respectively
Figure FDA0004178938790000011
And worst parameter->
Figure FDA0004178938790000012
According to the optimum parameter f i * And worst parameter f i - Calculation S j And R is j ；
Figure FDA0004178938790000013
Figure FDA0004178938790000014
Wherein omega i Representing the corresponding demand weight of the service, S j And R is j Is a method for measuring rank, f i * Representing the parameter closest to the ideal value, f i - Representing compromised parameters, S j Scheme representing maximum population benefit, R j Representing a scheme after group concessions;
obtaining Q from the above result j
Figure FDA0004178938790000015
Wherein S is * ＝minS j ，S - ＝maxS j ，R * ＝minR j ,R - ＝maxR j V=0.5, last Q j Descending order of Q j The motorized site with the smallest value is used as a connection scheme;
updating the request access queuing sequence according to the execution urgency, the residual value and the environment weight of the service, wherein the environment weight is used for representing the preference of the current service type to the network parameters; the method comprises the following specific steps:
defined as dynamic composite priority ω (t);
Figure FDA0004178938790000021
wherein D (t) represents the residual value,
Figure FDA0004178938790000022
representing execution urgency, V ij (t) represents an environmental weight;
Figure FDA0004178938790000023
Figure FDA0004178938790000024
Figure FDA0004178938790000025
wherein k represents a service parameter, T r Representing the relative remaining time, which is defined as the difference between the service deadline and the served time, V 0 Representing initial priceThe value q represents the product of the service type and the service class, d i The absolute deadline is represented, t represents real-time, i represents the number of the motorized site which is most suitable for connection at present, j represents the jth network environment parameter which is more important to the type of the current service, and the network parameters at the moment t of the ith motorized site are { alpha }, respectively 1t ,α 2t ,α 3t ,...}，
i＝1,2,…，n；
Executing service for the updated service in the request access queuing sequence; the method comprises the following specific steps:
judging whether the residual bandwidth meets the service requirement;
when the residual bandwidth is required to be served or not, executing the service in the request access queuing sequence in sequence, and enabling the service which does not meet the requirement to enter a waiting sequence;
and classifying the services in the waiting sequence into a request access queuing sequence for reordering until the request access queuing sequence is completely executed.
2. An offshore node network selection system based on dynamic composite priority, characterized by a system applying the offshore node network selection method based on dynamic composite priority as claimed in claim 1.
CN202210037323.2A 2022-01-13 2022-01-13 Marine node network selection method and system based on dynamic composite priority Active CN114513471B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210037323.2A CN114513471B (en) 2022-01-13 2022-01-13 Marine node network selection method and system based on dynamic composite priority

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210037323.2A CN114513471B (en) 2022-01-13 2022-01-13 Marine node network selection method and system based on dynamic composite priority

Publications (2)

Publication Number Publication Date
CN114513471A CN114513471A (en) 2022-05-17
CN114513471B true CN114513471B (en) 2023-05-26

Family

ID=81548980

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210037323.2A Active CN114513471B (en) 2022-01-13 2022-01-13 Marine node network selection method and system based on dynamic composite priority

Country Status (1)

Country Link
CN (1) CN114513471B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116600268A (en) * 2023-05-17 2023-08-15 中国人民解放军海军工程大学 Self-adaptive service gateway based on ship formation heterogeneous wireless network and control method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101155093A (en) * 2006-09-30 2008-04-02 华为技术有限公司 Band width distribution method and device for wireless communication network
CN108259390A (en) * 2016-12-29 2018-07-06 华为技术有限公司 The priority method for pushing and device of virtual channel in interconnection bus
CN112887206A (en) * 2021-01-20 2021-06-01 西安电子科技大学 Router queue scheduling method based on dynamic priority in quantum metropolitan area network

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080025318A1 (en) * 2006-07-31 2008-01-31 Harris Corporation Systems and methods for dynamically customizable quality of service on the edge of a network
US8693345B2 (en) * 2011-10-12 2014-04-08 Mayflower Communications Company, Inc. Dynamic management of wireless network topology with diverse traffic flows
US9571384B2 (en) * 2013-08-30 2017-02-14 Futurewei Technologies, Inc. Dynamic priority queue mapping for QoS routing in software defined networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101155093A (en) * 2006-09-30 2008-04-02 华为技术有限公司 Band width distribution method and device for wireless communication network
CN108259390A (en) * 2016-12-29 2018-07-06 华为技术有限公司 The priority method for pushing and device of virtual channel in interconnection bus
CN112887206A (en) * 2021-01-20 2021-06-01 西安电子科技大学 Router queue scheduling method based on dynamic priority in quantum metropolitan area network

Also Published As

Publication number Publication date
CN114513471A (en) 2022-05-17

Similar Documents

Publication Publication Date Title
CN111954236B (en) Hierarchical edge calculation unloading method based on priority
CN107682135B (en) NOMA-based network slice self-adaptive virtual resource allocation method
CN107241134B (en) Channel allocation method of low-earth-orbit satellite communication system
CN109756578B (en) Low-delay task scheduling method for dynamic fog computing network
CN109743778B (en) Resource allocation optimization method and system based on reinforcement learning
CN111711666B (en) Internet of vehicles cloud computing resource optimization method based on reinforcement learning
CN111935722B (en) Dynamic spectrum sharing method based on user online learning and low-overhead cooperation
CN114513471B (en) Marine node network selection method and system based on dynamic composite priority
CN100337445C (en) QoS scheduler for voice service in broadband wireless MAN and method thereof
CN111371701B (en) MAC layer queue scheduling method based on TDMA
CN109041247B (en) Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy
Wang et al. Multi-access edge computing based vehicular network: Joint task scheduling and resource allocation strategy
Borin et al. Uplink Scheduler and Admission Control for the IEEE 802.16 standard
CN114845338A (en) Random back-off method for user access
CN115118783A (en) Task unloading method based on heterogeneous communication technology ultra-reliable low-delay reinforcement learning
CN110138863B (en) Self-adaptive consistency protocol optimization method based on Multi-Paxos grouping
CN113778682B (en) Resource allocation method for MEC system
Anusuya et al. Fuzzy logic controller based priority model for VANET scheduling
CN113784390B (en) Wireless communication system for realizing dynamic distribution of network load
Sun et al. EC-DDPG: DDPG-Based Task Offloading Framework of Internet of Vehicle for Mission Critical Applications
Kadoch et al. Courteous algorithm: performance optimization in WiMAX networks
US8422368B2 (en) Call admission control method
Dosciatti et al. Time frame optimization using PSO to guarantee QoS in IEEE 802.16 networks
CN117997413A (en) Load balancing method of star-ground fusion network
Ma et al. Adaptive Resource Allocation for DASH-based Video Streaming in Mobile 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