CN111417164B - MANET active routing method based on SVM - Google Patents

MANET active routing method based on SVM Download PDF

Info

Publication number
CN111417164B
CN111417164B CN202010156715.1A CN202010156715A CN111417164B CN 111417164 B CN111417164 B CN 111417164B CN 202010156715 A CN202010156715 A CN 202010156715A CN 111417164 B CN111417164 B CN 111417164B
Authority
CN
China
Prior art keywords
node
beacon
neighbor
information
sending period
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
CN202010156715.1A
Other languages
Chinese (zh)
Other versions
CN111417164A (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.)
South China University of Technology SCUT
Original Assignee
South China University of Technology SCUT
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 South China University of Technology SCUT filed Critical South China University of Technology SCUT
Priority to CN202010156715.1A priority Critical patent/CN111417164B/en
Publication of CN111417164A publication Critical patent/CN111417164A/en
Application granted granted Critical
Publication of CN111417164B publication Critical patent/CN111417164B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/21—Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
    • G06F18/214—Generating training patterns; Bootstrap methods, e.g. bagging or boosting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/24—Classification techniques
    • G06F18/241—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
    • G06F18/2411—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches based on the proximity to a decision surface, e.g. support vector machines
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention belongs to the field of MANET network communication, and relates to a MANET active routing method based on an SVM. The method comprises the following steps: constructing a beacon model based on an SVM, inputting sensor information of a node and a neighbor node thereof, and outputting a beacon pre-sending period; obtaining a beacon pre-sending period in real time based on a beacon model of an SVM, obtaining link remaining time based on a mobile model, and determining a beacon sending period by integrating the beacon sending period and the link remaining time through a beacon sending period self-adaptive mechanism; according to the beacon sending period obtained by the beacon sending period in a self-adaptive mode, the routing information updating mechanism broadcasts beacon information in a one-hop neighborhood periodically, meanwhile, the stability of the neighbor nodes is determined, and different routing information is updated according to the stability of the neighbor nodes and the received information. The invention solves the problems of low route discovery efficiency, untimely route fracture discovery and low adaptability to high dynamic change of network topology of the conventional MANET active routing method.

Description

MANET active routing method based on SVM
Technical Field
The invention belongs to the field of MANET network communication, and relates to a MANET active routing method based on an SVM.
Background
The mobile ad hoc network (MANET) is an ad hoc network supporting a dynamic topological structure and free movement of nodes, has the characteristics of independence, movement, multi-hop and no center, and can quickly construct a mobile communication network without infrastructure. In a MANET, nodes are also routers at the same time, and the failure of any one node will not cause network failure. The movement of the nodes causes links between hosts to increase or decrease, and thus, the movement causes the network topology to change continuously. When no basic communication facility is available, the MANET can quickly and flexibly establish a wireless communication network, so that the wireless communication network is widely applied to scenes such as disaster-resistant emergency, battle system, scientific research and exploration and the like. In a wireless network, the performance of a routing protocol has an important influence on the performance of the network, and therefore, a routing method is an important index that restricts the performance of the network.
In the conventional active routing method of the MANET, a beacon message is periodically broadcast in a one-hop neighborhood through a node, so that a neighbor node can sense network topology change by receiving routing information in the beacon message, but link stability is not considered when a routing path is selected, so that the probability of route breakage is high, and meanwhile, the beacon sending period is fixed, so that the channel occupancy rate is high or the route breakage cannot be timely sensed under the conditions of node moving speed change and neighbor node quantity change, so that the routing efficiency is not high.
Disclosure of Invention
Aiming at the problems of low route discovery efficiency, untimely route breakage discovery and low adaptability to high dynamic change of network topology of the conventional MANET active routing method, the invention provides the MANET active routing method based on the SVM, which realizes the updating of routing information based on link stability and the self-adaptive selection of a beacon sending period and improves the network performance of the MANET route.
The invention is realized by adopting the following technical scheme:
a MANET active routing method based on SVM includes: constructing a beacon model based on an SVM, a beacon sending period self-adaptive mechanism and a routing information updating mechanism; wherein:
the method comprises the steps that sensor information of nodes and neighbor nodes is input into a beacon model based on an SVM, and the output is a beacon pre-sending period; in the beacon sending period self-adaptive mechanism, a node obtains a beacon pre-sending period through a beacon model based on an SVM (support vector machine), calculates the link remaining time based on a movement model of the node, and determines the beacon sending period by integrating the beacon sending period, the link remaining time and the allowed minimum threshold of the beacon sending period; in the route information updating mechanism, a node periodically broadcasts beacon information in a one-hop neighborhood according to a beacon sending period, and the node updates different route information according to the type of the received information.
Preferably, constructing the SVM-based beacon model comprises:
collecting sensor information and network performance information, taking the sensor information of a node and neighbor nodes as a data set, taking a beacon sending period corresponding to the optimal network performance information as a label, and converting the beacon sending period selection problem into a classical multi-classification problem;
the sensor information comprises node position information, speed information and angle information, and during data processing, the sensor information of the node and the neighbor nodes is processed into: taking the processing result of the sensor information of the node and the neighbor nodes as the input of an SVM-based beacon model, and the beacon pre-sending period TmodelIs the output.
Preferably, the node-based mobility model includes:
the calculation formula of the link residual time in the two-dimensional space is as follows:
Figure GDA0003414117410000021
wherein, RL is the link residual time;
Figure GDA0003414117410000022
Figure GDA0003414117410000023
c＝ys-yn，d＝xs-xn，vsis the velocity magnitude, v, of node snIs the magnitude of the velocity of the neighboring node n,
Figure GDA0003414117410000024
is the included angle between the moving direction of the node s and the direction axis X,
Figure GDA0003414117410000025
is the included angle between the motion direction of the node n and the direction axis X; x is the number ofsIs a coordinate value, X, of the node s on the direction axis XnIs a coordinate value, y, of the neighbor node n on the direction axis XsIs a section ofCoordinate value of point s on direction axis Y, YnIs a coordinate value of the neighbor node n on the direction axis Y; and R is the maximum transmission distance between the node s and the neighbor node n.
The calculation formula of the link residual time in the three-dimensional space is as follows:
Figure GDA0003414117410000026
where RL is the link remaining time, b ═ zs-zn，
Figure GDA0003414117410000027
d＝ys-yn，
Figure GDA0003414117410000028
f＝xs-xn，vsIs the velocity magnitude, v, of node snIs the magnitude of the velocity of the neighboring node n,
Figure GDA0003414117410000029
being the elevation angle of the direction of motion of the node s,
Figure GDA00034141174100000210
is the elevation angle of the moving direction of the neighbor node n; thetasAzimuth angle of direction of motion of node s, thetanIs the azimuth angle, x, of the moving direction of the neighbor node nsIs a coordinate value, X, of the node s on the direction axis XnIs a coordinate value, y, of the neighbor node n on the direction axis XsIs a coordinate value of the node s on the direction axis Y, YnIs a coordinate value, z, of the neighbor node n on the direction axis YsIs a coordinate value of the node s on the direction axis Z, ZnIs the coordinate value of the neighbor node n on the direction axis Z, and R is the maximum transmission distance between the node s and the neighbor node n.
Preferably, the beacon transmission period adaptation mechanism includes:
the node utilizes the sensor information of the node and the neighbor nodes and a beacon model based on the SVM to obtain a beacon pre-sending period T in real timemodelTaking TmodelMinimum value RL of link remaining time with all links in useminIf the smaller value is larger than the allowed beacon sending period threshold value, the smaller value is taken as the beacon sending period, otherwise, the allowed beacon sending period threshold value is taken as the beacon sending period.
Preferably, the judgment process of using the link includes:
the head of the transmitted data packet comprises a previous hop node for forwarding or transmitting the data packet, and the relay node receiving the data packet determines which neighbor node the node for forwarding or transmitting the data packet is by receiving the data packet; acquiring the service time of the neighbor node from the neighbor information table; and if the difference value between the use time of the neighbor node and the current time is within a certain range, the link between the node and the neighbor node is considered to be used.
Preferably, the routing information update mechanism includes:
the node periodically broadcasts beacon messages in a one-hop neighborhood according to the beacon sending period;
the routing information updating mechanism comprises beacon message triggering and data packet message triggering; the beacon message triggering means that the node receives the beacon message and updates a neighbor information table and a routing table; and the data packet message triggering means that the node updates the neighbor information table when receiving the data packet message.
Preferably, the beacon message trigger comprises:
the node receives the beacon message, updates a neighbor information table and a routing table according to the beacon message, wherein the neighbor information table comprises a stable mark; if the stable mark indicates that the beacon sending node is an unstable neighbor node, the routing table is updated only if a destination node routing path which is not in the local routing table exists in the beacon message, if the stable mark indicates that the beacon sending node is a stable node, the routing table is updated by preferentially utilizing a stable link of the routing table in the beacon message, and the routing table is updated by utilizing an unstable link only if the stable link does not exist.
Preferably, the packet message trigger comprises:
the node receives the data packet message, and acquires a source node, a previous hop node, a relay node and a destination node of the data packet message; and if the node receiving the data packet is the relay node or the destination node in the data packet, updating the service time of the previous hop node to the current time in the neighbor information table.
Preferably, the routing process of the node includes:
initializing a network, and taking an initial value of a beacon sending period as the beacon sending period;
periodically broadcasting beacon messages within a one-hop range according to beacon transmission periods;
receiving beacon messages of all neighbor nodes;
updating a neighbor information table according to the received beacon message and the self sensor information, and calculating the stability of a neighbor node by the node by using the self sensor information and the data in the beacon message;
taking sensor information of neighbor nodes in a neighbor information table and self sensor information as input of a beacon model based on an SVM, and calculating to obtain a beacon pre-sending period through the beacon model based on the SVM;
comparing the smaller value of the minimum link remaining time and the beacon pre-sending period of the link in use in the neighbor information table with the allowed minimum beacon sending period threshold value, and taking the larger value as the beacon sending period;
and updating the routing table according to the routing information in the received beacon message and the stability of the neighbor node, and preferentially updating the routing table by using the routing information of the stable neighbor node.
Preferably, the process of calculating the stability of the neighbor node by the node using the self sensor information and the data in the beacon message includes:
the beacon message comprises a sending time stamp and the next sending time; when the node receives the beacon message, the beacon sending period of the neighbor node is obtained through the difference value between the sending time stamp in the beacon message and the next sending time; two conditions need to be met when the neighbor node is judged to be in a stable state: one is that the link remaining time of the neighbor node has not expired, and the other is that no beacon messages have been lost.
Compared with the prior art, the invention has the following advantages and beneficial effects:
1. the MANET active routing method based on the SVM judges the stability of the link according to the beacon sending period and the link remaining time in the process of maintaining the routing information, selects the stable link as far as possible to transmit the data packet, can improve the stability of the routing path, keeps the accuracy of the routing information to a certain extent in high dynamic topology change, and further reduces the delay and the expense caused by the breakage of the routing path.
2. And collecting sensor information, network performance information and beacon sending period information as a data set, and training the SVM model to obtain the SVM-based beacon model. And a beacon sending period is selected in real time in the actual motion process by utilizing the SVM-based beacon model, so that the network performance is improved.
3. Under the condition that the node is selected as the relay node, the beacon sending period is adaptively adjusted, so that the node can sense the route breakage more accurately, and the time delay is reduced.
Drawings
FIG. 1 is a flow diagram of on-node routing processing for an SVM based MANET active routing method in accordance with one embodiment of the present invention;
FIG. 2 is a flow diagram of a node sending or forwarding data packets in an SVM based MANET active routing method in accordance with one embodiment of the present invention;
FIG. 3 is a flow chart of a MANET active routing method based on SVM in accordance with one embodiment of the present invention;
FIG. 4 is a flow chart of beacon model establishment in one embodiment of the present invention;
fig. 5 is a flowchart of a beacon message triggered in a routing information update mechanism according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, but embodiments of the present invention are not limited thereto.
The processing process of the MANET active routing method based on SVM of the invention on the nodes is shown in figure 1, and the method periodically updates the routing information of the MANET active routing method, and comprises the following steps:
initializing a network, and taking an initial value of a beacon sending period as the beacon sending period;
periodically broadcasting beacon messages within a one-hop range according to beacon transmission periods;
receiving beacon messages of all neighbor nodes;
updating a neighbor information table according to the received beacon message and the self sensor information, and calculating the stability of the neighbor node by using the self sensor information and the data in the beacon message;
taking sensor information of neighbor nodes in a neighbor information table and self sensor information as input of a beacon model based on the SVM, and calculating to obtain a beacon pre-sending period T through the beacon model based on the SVMmodel；
Taking the minimum link remaining time RL of the in-use link in the neighbor information tableminWith beacon pre-transmission period TmodelComparing the smaller value of the beacon interval with the threshold value of the minimum allowed beacon sending period, and taking the larger value as the beacon sending period;
and updating the routing table according to the routing information in the received beacon message and the stability of the neighbor node, and preferentially updating the routing table by using the routing information of the stable neighbor node.
The flow of the data packet sent or forwarded by the node is as shown in fig. 2, and when the data packet needs to be sent, the routing table is directly used to find an available routing message.
In the active routing method, a node periodically broadcasts a routing beacon message in a one-hop range so that the node can sense network topology change and update the change of a whole network routing path in real time, wherein the beacon message needs to comprise a neighbor information table and a routing table of the node, and when the node needs to send or forward a data packet, the routing information stored in the node can be immediately used for sending the data packet, so that the node does not need to wait for a route discovery process, and the time delay is reduced.
A MANET active routing method based on SVM is disclosed, as shown in figure 3, and comprises beacon model establishment based on SVM, a beacon sending period self-adaptive mechanism and a routing information updating mechanism. A beacon sending period self-adaptive mechanism obtains a beacon pre-sending period which accords with a node environment in real time through a beacon model based on an SVM, and obtains an actually used beacon sending period through comparing the beacon with the sending period, the remaining time of a link in a using link and an allowable minimum beacon sending period threshold value; the route updating mechanism determines the stability of the neighbor nodes through the beacon sending period and the sensor information in the beacon message, and updates different route information according to the stability of the neighbor nodes and the received message.
Beacon model establishment based on SVM
The beacon model establishing process based on the SVM comprises the following steps: collecting sensor information and network performance information of a node and neighbor nodes thereof, taking the sensor information of the node and the neighbor nodes as a data set, taking a beacon sending period corresponding to optimal network performance information as a label, and converting a beacon sending period selection problem into a classical multi-classification problem; the input of the beacon model has six parameters, which are respectively: the average value and the standard deviation of the speed difference value of the neighbor nodes, the number of the neighbor nodes and the number change of the neighbor nodes, and the average value and the standard deviation of the direction difference value of the neighbor nodes; output of beacon model based on SVM is beacon pre-sending period Tmodel。
(II) Beacon Transmission period Adaptation mechanism
The beacon transmission period adaptive mechanism adaptively adjusts the beacon transmission period through a beacon model based on the SVM and the remaining time of the link using the link.
The beacon model based on the SVM is a multi-classification model established based on the SVM, and a beacon pre-sending period T is obtainedmodel(ii) a Obtaining the minimum link remaining time RL in all the links in use through the neighbor information tableminIf T ismodelAnd RLminIs greater than the allowed minimum beaconing period Threshold, TmodelAnd RLminThe smaller value of (2) is the next beacon transmission period T, otherwise, the next beacon transmission period T is Threshold, which is shown in equation (1). The calculation of the next beacon transmission period is performed at the time of beacon message transmission.
Figure GDA0003414117410000061
The judgment basis of the using link is whether the difference value between the using time of the neighbor node in the neighbor information table and the current time is within a certain threshold value; selecting the minimum link remaining time of the using link in the neighbor information table as RLmin。
(III) route information update mechanism
A routing information updating mechanism updates a neighbor information table and a routing table by receiving beacon messages and data packet messages broadcast by neighbor nodes in a one-hop neighborhood; the beacon message is used for updating a neighbor information table and a routing table of a neighbor node, and comprises the following steps: the system comprises a source node, a sending timestamp, next sending time, sensor information, a neighbor information table and a routing table; the data packet header is used for updating the neighbor information table, and comprises the following steps: a source node, a previous hop node, a relay node and a destination node; the neighbor information table is used for adaptively adjusting a beacon transmission period, and comprises the following steps: neighbor node identification, beacon sending time, beacon sending period, link remaining time, sensor information, a stable mark and using time; the routing table is used for the nodes to find routing paths and at least comprises destination nodes, relay nodes, hop counts and stable marks.
Both the neighbor information table and the routing table automatically delete the overdue information after the information is expired; the expiration time of the routing table is the expiration time of the relay node of the route in the neighbor information table; and deleting the related routing information of the neighbor node after the beacon message of the neighbor node is not received twice continuously or the remaining time of the link is expired in the neighbor beacon table, and deleting the routing information taking the neighbor node as the relay node in the routing table.
Sensor information in the beacon message is acquired through a node sensor; the relay node of the data packet header is a node for forwarding the data packet; the link remaining time in the neighbor information table is calculated through sensor information of the node and the neighbor node and is used for estimating the link available time.
The node receives the beacon message of the neighbor node, calculates the link remaining time according to the sensor information of the neighbor node in the beacon message and the sensor information of the node, compares the link remaining time with the beacon sending period, if the beacon sending period is longer and the beacon message is not lost, the neighbor node is a stable neighbor node, otherwise, the neighbor node is an unstable neighbor node; the routing table neighbor information table changes the state of the neighbor node into an unstable node when the beacon message of the neighbor node is not received for the first time but the link remaining time is not expired.
The link remaining time is calculated based on a mobile model of the node, and since the beacon transmission cycle time is short, the change of the movement speed and the movement direction of the node is considered to be small, and the link remaining time is obtained based on the mobile model.
The calculation formula of the link residual time in the two-dimensional space is as follows:
Figure GDA0003414117410000071
wherein, RL is the remaining time of the link,
Figure GDA0003414117410000072
Figure GDA0003414117410000073
c＝ys-yn，d＝xs-xn，vsis the velocity magnitude, v, of node snIs the magnitude of the velocity of the neighboring node n,
Figure GDA0003414117410000074
is the included angle between the moving direction of the node s and the direction axis X,
Figure GDA0003414117410000075
is the included angle between the motion direction of the node n and the direction axis X; x is the number ofsIs a coordinate value, X, of the node s on the direction axis XnIs a coordinate value, y, of the neighbor node n on the direction axis XsIs a coordinate value of the node s on the direction axis Y, YnIs the coordinate value of the neighbor node n on the direction axis Y, and R is the maximum transmission distance between the node s and the neighbor node n.
The calculation formula of the link residual time in the three-dimensional space is as follows:
Figure GDA0003414117410000076
where RL is the link remaining time, b ═ zs-zn，
Figure GDA0003414117410000077
d＝ys-yn，
Figure GDA0003414117410000078
f＝xs-xn，vsIs the velocity magnitude, v, of node snIs the magnitude of the velocity of the neighboring node n,
Figure GDA0003414117410000079
being the elevation angle of the direction of motion of the node s,
Figure GDA00034141174100000710
is the elevation angle of the moving direction of the neighbor node n; thetasAzimuth angle of direction of motion of node s, thetanIs the azimuth angle, x, of the moving direction of the neighbor node nsIs a coordinate value, X, of the node s on the direction axis XnIs a coordinate value, y, of the neighbor node n on the direction axis XsIs a coordinate value of the node s on the direction axis Y, YnIs a coordinate value, z, of the neighbor node n on the direction axis YsIs a coordinate value of the node s on the direction axis Z, ZnIs the coordinate value of the neighbor node n on the direction axis Z, and R is the maximum transmission distance between the node s and the neighbor node n.
If the beacon message of the stable neighbor node is received, updating the routing table of the beacon message by using the routing table information of the beacon message; and if the beacon message of the unstable neighbor node is received, updating the routing information of the unstable link by using the routing table information of the beacon message.
And if the data packet sent by the neighbor node is received, updating the neighbor information table, and updating the service time of the neighbor node in the neighbor information table to be the current time.
Procedure for updating routing information in routing table: the node receives the routing information in the beacon message, when the beacon message has a destination node which is not in the routing table of the node, the routing path is added into the routing table, the relay node is changed into a neighbor node which sends the beacon message, and the hop count is added by 1; and when the hop count of the routing path to the destination node in the beacon message is shorter than the hop count of the routing path in the routing table per se by 2 or more, updating the routing path.
And (3) updating the information in the neighbor information table: the node receives the beacon message, if the neighbor node information does not exist in the neighbor information table, the neighbor node information is added into the neighbor information table, and if the neighbor node information exists, the neighbor node information is updated; and when the node receives the data packet message, updating the service time of the neighbor node in the neighbor information table.
Examples
In this embodiment, the MANET active routing method is implemented by improving the conventional OLSR routing method and adding the SVM-based beacon model establishment, the beacon transmission period adaptation mechanism, and the routing information update mechanism shown in fig. 3, which are innovative in the present invention.
The conventional OLSR routing method updates the neighbor information table by broadcasting HELLO messages, and updates the routing table by broadcasting TC messages. The present invention refers to HELLO messages and TC messages as beacon messages, and the transmission period thereof is a beacon transmission period. The transmission period of the HELLO message is equal to the transmission period of the TC message.
In this embodiment, the conventional HELLO message is modified, and the modified HELLO message is shown in table 1 below, where: reserved this field is set to "0000000000000"; the sending node address determines a sending node of the beacon message; the transmission timestamp is the transmission time of the beacon message; the next sending time is the sending time of the next beacon message; the transmission intention is the degree to which the node is willing to become a relay node; the position X on the X axis, the position Y on the Y axis and the position Z on the Z axis are jointsThe location of the point in three-dimensional space; the moving speed v is node speed information; elevation angle
Figure GDA0003414117410000082
The azimuth angle theta is node angle information; the neighbor node addresses are all the neighbor node addresses of the node.
TABLE 1 HELLO message Format
Figure GDA0003414117410000081
Figure GDA0003414117410000091
Beacon model establishment based on SVM
The process of establishing the SVM-based beacon model is shown in fig. 4, and includes: data acquisition, data processing, data set construction and SVM modeling are carried out, and finally a beacon model is obtained. The data acquisition is that the MANET carries out a plurality of tests in a plurality of different beacon sending periods, acquires sensor information of nodes and neighbor nodes thereof and network performance information, takes the sensor data of the nodes and the neighbor nodes thereof as data, takes the beacon sending period corresponding to the optimal network performance as a label to form a data set, converts the adjustment problem of the beacon sending period into a multi-classification problem, and then converts the multi-classification into a two-classification problem by using a one-to-many mode; and training the SVM model by using the data set to obtain a beacon model.
(II) Beacon Transmission period Adaptation mechanism
The beacon transmission period self-adaptive mechanism aims to adjust the beacon transmission period and comprises beacon model establishment and beacon transmission period adjustment based on the SVM. The establishment of the beacon model based on the SVM is to establish the beacon model under the offline condition, is used for obtaining the beacon pre-sending period and participates in the beacon sending period adjusting process. The adjustment of the beacon sending period comprises the steps of firstly obtaining the beacon pre-sending period based on a beacon model of an SVM, and then adjusting the beacon sending period according to the beacon pre-sending period and the condition of the link remaining time of a link being used.
In the training process of the beacon model based on the SVM, data processing mainly processes sensor information of a node and a neighbor node thereof into 6 parameters which are respectively as follows: average value change VelMean and standard deviation change Velstd of speed difference values of the nodes and the neighbor nodes, number n of the neighbor nodes, number change nodes of the neighbor nodes, and average value change DirMean and standard deviation change Dirstd of direction difference values of the nodes and the neighbor nodes; the output of the model is a beacon pre-transmission period Tmodel。
The calculation formula of the average value changeVelMean of the speed difference value between the node and the neighbor node is as follows:
Figure GDA0003414117410000092
the calculation formula of the standard deviation changeVelstd of the speed difference value between the node and the adjacent node is as follows:
Figure GDA0003414117410000101
the calculation formula of the changed node with the number of the neighbor nodes is as follows:
Figure GDA0003414117410000102
the calculation formula of the average value changeDirMean of the direction difference value of the node and the neighbor node is as follows:
Figure GDA0003414117410000103
the calculation formula of the standard deviation changeDirstd of the direction difference value between the node and the neighbor node is as follows:
Figure GDA0003414117410000104
wherein the content of the first and second substances,
Figure GDA0003414117410000105
for the speed of the node i at time t,
Figure GDA0003414117410000106
is the speed of the node j at the time t, n is the number of neighbor nodes of the node i at the time t,
Figure GDA0003414117410000107
the set of neighbor nodes for node i at time t-1,
Figure GDA0003414117410000108
a set of neighbor nodes for node i at time t,
Figure GDA0003414117410000109
and is the direction included angle between the node i at the time t and the leading node j.
The kernel function of the beacon model based on the SVM adopts a Gaussian kernel, and the specific formula is as follows:
Figure GDA00034141174100001010
wherein: x is the number ofi、xjIs an input vector; and sigma is an adjustable parameter and is adjusted according to the actual training process.
xi＝{changeVelMeani changeVelStdi ni changeNodei changeDirMeanichangeDirstdi}xj＝{changeVelMeanj changeVelStdj nj changeNodej changeDirMeanjchangeDirstdj}。
The beacon transmission period adjustment procedure aims to adjust the beacon transmission period when the beacon pre-transmission period is not well aware of the link conditions being used.
The currently used link judgment condition is that the difference value between the current time currTime and the use time t is less than the threshold value liT, namely currTime-t is less than liT; obtaining in-use chains from neighbor information tableMinimum link remaining time RL of a wayminIf T ismodel≥RLminIf > Threshold, the beacon transmission period T is RLminIf T ismodel≥Threshold＞RLminIf the beacon transmission period T is equal to the Threshold, otherwise, the beacon transmission period T is equal to the Tmodel。
(III) route information update mechanism
The routing information includes a neighbor information table and a routing table.
The neighbor information table is shown in table 1 below, and a neighbor node identifier (neighbor) is a unique identifier that is different from other nodes by a neighbor node; the sending time (time) is the time of last updating the neighbor node information, namely the time of receiving the beacon message sent by the neighbor node last time; the transmission period (period) is a beacon transmission period of the neighbor node, and is a difference value between the next transmission time and the transmission time stamp in the received beacon message; the link residual time RL is calculated by sensor information of a node and a neighbor node and a formula (2) or a formula (3), wherein the motion scene is a two-dimensional space using the formula (2), and the motion scene is a three-dimensional space using the formula (3); the position X on the X axis, the position Y on the Y axis and the position Z on the Z axis are positions of the nodes in the three-dimensional space; the moving speed v is node speed information; elevation angle
Figure GDA0003414117410000112
The azimuth angle theta is node angle information; the stable flag bit indicates whether the neighbor node is a stable node, the selectable value is {0,1}, 0 is a stable neighbor node, and 1 is an unstable neighbor node; the use time is the time of transmitting or receiving the data packet transmitted by the neighbor node at the last time, and the use time is set to be null only when the beacon message is received and the data packet of the neighbor node is not transmitted or received.
Table 1 neighbor information table
Figure GDA0003414117410000111
Figure GDA0003414117410000121
As shown in table 2, the destination node identifier (neighbor or dest) is the destination node of the routing path; a relay node identifier (neighbor) is a relay node of the next hop of the routing path, and if the node has only one hop from the destination node to the node, the relay node identifier is null; the hop count is the number of forwarding times to the destination node; the stable flag is used to identify whether the path is stable, and the selectable value is {0,1}, where 0 is stable and 1 is unstable.
Table 2 routing table
Destination node identification Relay node identification Hop count Stability flag bit
neighbor1 Is free of 1 1
… … 1 …
neighborn Is free of 1 0
dest1 neighbork1 h1 1
… … … …
dests neighborks hs 0
The routing information updating mechanism comprises data packet message triggering and beacon message triggering; the data packet message triggering is executed after the node receives the data packet and is used for updating the neighbor information table; the beacon message triggering is executed after the node receives the beacon message and is used for updating the neighbor information table and the routing table.
Both the neighbor information table and the routing table automatically delete the overdue information after the information is expired; the expiration time of the routing table is the expiration time of the relay node of the route in the neighbor information table; and deleting the related routing information of the neighbor node after the beacon message of the neighbor node is not received twice continuously or the remaining time of the link is expired in the neighbor beacon table, and deleting the routing information taking the neighbor node as the relay node in the routing table.
The packet format is shown in table 3, and includes: packet length, packet sequence number, message type, validity time, message length, sending node address, forwarding node address, relay node address, destination node address, TTL, hop count, message sequence number, and message body. Wherein: the data packet length is the length of the data packet and the unit is bit; the sequence number of the data packet is added by one when the data packet is sent every time; the message type is the type of the message; the valid time is the time when the node considers the message as available within the valid time when receiving the message; the message length is the message body length; the address of the previous hop node is the node for forwarding the data packet; the relay node address is the next node address of the routing path to forward the data packet; the destination node address is the destination node address of the data packet; TTL is the survival hop count of the message, the value is subtracted by 1 every time the message is forwarded, and when the value is 0, the node does not forward the data packet any more; the hop count is the number of times the message is forwarded, 1 is added to the value every time the message is forwarded, and the initial value is 1; the message sequence number is the sequence number of the message; the message body is the content of the message.
TABLE 3 packet format
Figure GDA0003414117410000131
The data packet triggering means that when the node acquires the data packet forwarded by the neighbor node and the node is not the destination node of the data packet, the node updates the service time in the neighbor information table to be the current time.
As shown in fig. 5, the beacon message triggering process is that the node acquires the beacon message of the neighbor node, and updates the neighbor node identifier (neighbor), the transmission time (time), the transmission period (period), the position X on the X axis, the position Y on the Y axis, the position Z on the Z axis, the moving speed v, the elevation angle in the neighbor information table
Figure GDA0003414117410000132
An azimuth angle; substituting the position information, the speed information and the angle information in the beacon message into a formula (3) to calculate the link remaining time; and updating the stable flag bit by comparing the residual time RL of the link with the period of sending, wherein if RL is more than period, the flag is set to be 0, otherwise, the flag is set to be 1. If the received stable flag bit is 0, updating the routing table of the routing table by using the routing table information of the beacon message, wherein the unstable routing information can only be used for updating an unstable routing path; if the stable flag bit is 1, it indicates that the neighbor node is an unstable node,the routing path for which no stable route exists is updated only with the routing table information of the beacon message.
Procedure for updating routing information in routing table: the node receives the routing information in the beacon message, when the beacon message has a destination node which is not in the routing table of the node, the routing path is added into the routing table, the relay node is changed into a neighbor node which sends the beacon message, and the hop count is increased by one; and when the hop count of the routing path to the destination node in the beacon message is shorter than the hop count of the routing path in the routing table per se by 2 or more, updating the routing path.
And (3) updating the information in the neighbor information table: the node receives the beacon message, if the neighbor node information does not exist in the neighbor information table, the neighbor node information is added into the neighbor information table, and if the neighbor node information exists, the neighbor node information is updated; and when the node receives the data packet message, updating the service time of the neighbor node in the neighbor information table.
The above embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and all such changes, modifications, substitutions, combinations, and simplifications are intended to be included in the scope of the present invention.

Claims (7)

1. A MANET active routing method based on SVM is characterized by comprising the following steps: constructing a beacon model based on an SVM, a beacon sending period self-adaptive mechanism and a routing information updating mechanism; wherein:
the method comprises the steps that sensor information of nodes and neighbor nodes is input into a beacon model based on an SVM, and the output is a beacon pre-sending period; in the beacon sending period self-adaptive mechanism, a node obtains a beacon pre-sending period through a beacon model based on an SVM (support vector machine), calculates the link remaining time based on a movement model of the node, and determines the beacon sending period by integrating the beacon sending period, the link remaining time and the allowed minimum threshold of the beacon sending period; in a routing information updating mechanism, a node periodically broadcasts beacon information in a one-hop neighborhood according to a beacon sending period, and the node updates different routing information according to the type of the received information;
constructing a beacon model based on SVM, comprising:
collecting sensor information and network performance information, taking the sensor information of a node and neighbor nodes as a data set, taking a beacon sending period corresponding to the optimal network performance information as a label, and converting the beacon sending period selection problem into a classical multi-classification problem;
the sensor information comprises node position information, speed information and angle information, and during data processing, the sensor information of the node and the neighbor nodes is processed into: taking the processing result of the sensor information of the node and the neighbor nodes as the input of an SVM-based beacon model, and the beacon pre-sending period TmodelIs an output;
the node-based mobility model includes:
the calculation formula of the link residual time in the two-dimensional space is as follows:
Figure FDA0003414117400000011
wherein, RL is the link residual time;
Figure FDA0003414117400000012
Figure FDA0003414117400000013
c＝ys-yn，d＝xs-xn，vsis the velocity magnitude, v, of node snIs the magnitude of the velocity of the neighboring node n,
Figure FDA0003414117400000014
is the included angle between the moving direction of the node s and the direction axis X,
Figure FDA0003414117400000015
is the included angle between the motion direction of the node n and the direction axis X; x is the number ofsIs a coordinate value, X, of the node s on the direction axis XnIs a coordinate value, y, of the neighbor node n on the direction axis XsIs a coordinate value of the node s on the direction axis Y, YnIs a coordinate value of the neighbor node n on the direction axis Y; r is the maximum transmission distance between the node s and the neighbor node n;
the calculation formula of the link residual time in the three-dimensional space is as follows:
Figure FDA0003414117400000016
where RL is the link remaining time, b ═ zs-zn，
Figure FDA0003414117400000017
d＝ys-yn，
Figure FDA0003414117400000021
f＝xs-xn，vsIs the velocity magnitude, v, of node snIs the magnitude of the velocity of the neighboring node n,
Figure FDA0003414117400000022
being the elevation angle of the direction of motion of the node s,
Figure FDA0003414117400000023
is the elevation angle of the moving direction of the neighbor node n; thetasAzimuth angle of direction of motion of node s, thetanIs the azimuth angle, x, of the moving direction of the neighbor node nsIs a coordinate value, X, of the node s on the direction axis XnIs a coordinate value, y, of the neighbor node n on the direction axis XsIs a coordinate value of the node s on the direction axis Y, YnIs a coordinate value, z, of the neighbor node n on the direction axis YsIs a coordinate value of the node s on the direction axis Z, ZnFor neighbor node n at sideA coordinate value on the axial Z, wherein R is the maximum transmission distance between the node s and the neighbor node n;
the beacon transmission period adaptive mechanism comprises:
the node utilizes the sensor information of the node and the neighbor nodes and a beacon model based on the SVM to obtain a beacon pre-sending period T in real timemodelTaking TmodelMinimum value RL of link remaining time with all links in useminIf the smaller value is larger than the allowed beacon sending period threshold value, the smaller value is taken as the beacon sending period, otherwise, the allowed beacon sending period threshold value is taken as the beacon sending period.
2. The MANET active routing method of claim 1, wherein the determination that a link is being used comprises:
the head of the transmitted data packet comprises a previous hop node for forwarding or transmitting the data packet, and the relay node receiving the data packet determines which neighbor node the node for forwarding or transmitting the data packet is by receiving the data packet; acquiring the service time of the neighbor node from the neighbor information table; and if the difference value between the use time of the neighbor node and the current time is within a certain range, the link between the node and the neighbor node is considered to be used.
3. The MANET active routing method of claim 1, wherein the routing information update mechanism comprises:
the node periodically broadcasts beacon messages in a one-hop neighborhood according to the beacon sending period;
the routing information updating mechanism comprises beacon message triggering and data packet message triggering; the beacon message triggering means that the node receives the beacon message and updates a neighbor information table and a routing table; and the data packet message triggering means that the node updates the neighbor information table when receiving the data packet message.
4. The MANET active routing method of claim 3, wherein the beacon message trigger comprises:
the node receives the beacon message, updates a neighbor information table and a routing table according to the beacon message, wherein the neighbor information table comprises a stable mark; if the stable mark indicates that the beacon sending node is an unstable neighbor node, the routing table is updated only if a destination node routing path which is not in the local routing table exists in the beacon message, if the stable mark indicates that the beacon sending node is a stable node, the routing table is updated by preferentially utilizing a stable link of the routing table in the beacon message, and the routing table is updated by utilizing an unstable link only if the stable link does not exist.
5. The MANET active routing method of claim 3, wherein the packet message trigger comprises:
the node receives the data packet message, and acquires a source node, a previous hop node, a relay node and a destination node of the data packet message; and if the node receiving the data packet is the relay node or the destination node in the data packet, updating the service time of the previous hop node to the current time in the neighbor information table.
6. The MANET active routing method of claim 1, wherein the node routing process comprises:
initializing a network, and taking an initial value of a beacon sending period as the beacon sending period;
periodically broadcasting beacon messages within a one-hop range according to beacon transmission periods;
receiving beacon messages of all neighbor nodes;
updating a neighbor information table according to the received beacon message and the self sensor information, and calculating the stability of a neighbor node by the node by using the self sensor information and the data in the beacon message;
taking sensor information of neighbor nodes in a neighbor information table and self sensor information as input of a beacon model based on an SVM, and calculating to obtain a beacon pre-sending period through the beacon model based on the SVM;
comparing the smaller value of the minimum link remaining time and the beacon pre-sending period of the link in use in the neighbor information table with the allowed minimum beacon sending period threshold value, and taking the larger value as the beacon sending period;
and updating the routing table according to the routing information in the received beacon message and the stability of the neighbor node, and preferentially updating the routing table by using the routing information of the stable neighbor node.
7. The MANET active routing method of claim 6, wherein the node utilizing the self sensor information and data in the beacon message to compute neighbor node stability procedure comprises:
the beacon message comprises a sending time stamp and the next sending time; when the node receives the beacon message, the beacon sending period of the neighbor node is obtained through the difference value between the sending time stamp in the beacon message and the next sending time; two conditions need to be met when the neighbor node is judged to be in a stable state: one is that the link remaining time of the neighbor node has not expired, and the other is that no beacon messages have been lost.
CN202010156715.1A 2020-03-09 2020-03-09 MANET active routing method based on SVM Active CN111417164B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010156715.1A CN111417164B (en) 2020-03-09 2020-03-09 MANET active routing method based on SVM

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010156715.1A CN111417164B (en) 2020-03-09 2020-03-09 MANET active routing method based on SVM

Publications (2)

Publication Number Publication Date
CN111417164A CN111417164A (en) 2020-07-14
CN111417164B true CN111417164B (en) 2022-03-29

Family

ID=71494221

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010156715.1A Active CN111417164B (en) 2020-03-09 2020-03-09 MANET active routing method based on SVM

Country Status (1)

Country Link
CN (1) CN111417164B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109688614A (en) * 2019-01-14 2019-04-26 西安电子科技大学 Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7957356B2 (en) * 2002-05-13 2011-06-07 Misomino Chi Acquisitions L.L.C. Scalable media access control for multi-hop high bandwidth communications

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109688614A (en) * 2019-01-14 2019-04-26 西安电子科技大学 Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Routing Protocols in Airborne Ad-hoc Networks (AANETs): A Study;Pardeep Kumar，Seema Verma;《International Journal of Computer Sciences and Engineering》;20190430;全文 *
基于链路生存时间的AOMDV 协议的研究;李健，黄廷辉，崔更申，杨旻;《计算机应用与软件》;20150930;全文 *

Also Published As

Publication number Publication date
CN111417164A (en) 2020-07-14

Similar Documents

Publication Publication Date Title
CN108600942B (en) Routing method of unmanned aerial vehicle ad hoc network
Ji et al. SDGR: An SDN-based geographic routing protocol for VANET
CN110324877B (en) Relay robot routing method based on servo backbone network and Vikor multi-standard decision
US8284775B2 (en) Six-address scheme for multiple hop forwarding in wireless mesh networks
CN110691379B (en) Active route communication method suitable for wireless ad hoc network
CN108449271B (en) Routing method for monitoring path node energy and queue length
CN111343608B (en) Internet of vehicles reinforcement learning routing method based on position information
CN108513330B (en) Routing protocol distributed self-adaptive switching method based on network context awareness
CN108024228B (en) Vehicle-mounted network GPSR protocol improvement method based on road network and QOS model
CN108770003A (en) A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing
CN111148178B (en) DSR routing protocol implementation method based on unmanned aerial vehicle ad hoc network
CN113727408B (en) Speed and energy perception-based unmanned aerial vehicle ad hoc network improved AODV routing method
CN111417164B (en) MANET active routing method based on SVM
CN108282791B (en) Ad Hoc data transmission method based on directional antenna
KR100664685B1 (en) Method for Decision of Greedy Packet Forwarding Path in Wireless Networks
Gupta et al. Enhanced flooding scheme for aodv routing protocol in mobile ad hoc networks
Gruber et al. Ad hoc routing for cellular coverage extension
Zhou et al. A bidirectional Q-learning routing protocol for UAV networks
KR20070122424A (en) Method for route setup by exploiting medium access control with multiple rate in mobile ad-hoc network
CN106658634B (en) Software-defined vehicle-mounted network system
CN108307411B (en) Mobile self-organizing network self-adaptive gateway selection method based on biological elicitation
CN106792975B (en) AODV routing protocol optimization method based on distance estimation
Chakravarthy et al. A Neighbor coverage based probabilistic rebroadcast for reducing routing overhead in mobile ad hoc networks
CN114158108B (en) Method for realizing HWMP-based hybrid routing protocol
JP4396976B2 (en) Inter-vehicle communication device

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