CN111010720B - Opportunity route transmission control method for parking apron non-communication network - Google Patents

Opportunity route transmission control method for parking apron non-communication network Download PDF

Info

Publication number
CN111010720B
CN111010720B CN201911308928.5A CN201911308928A CN111010720B CN 111010720 B CN111010720 B CN 111010720B CN 201911308928 A CN201911308928 A CN 201911308928A CN 111010720 B CN111010720 B CN 111010720B
Authority
CN
China
Prior art keywords
node
nodes
data packet
transmission
weight
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
CN201911308928.5A
Other languages
Chinese (zh)
Other versions
CN111010720A (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.)
Civil Aviation University of China
Original Assignee
Civil Aviation University of China
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 Civil Aviation University of China filed Critical Civil Aviation University of China
Priority to CN201911308928.5A priority Critical patent/CN111010720B/en
Publication of CN111010720A publication Critical patent/CN111010720A/en
Application granted granted Critical
Publication of CN111010720B publication Critical patent/CN111010720B/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
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • 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
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

An opportunity routing transmission control method for an apron unconnected network. The method comprises the steps of initializing data packet attributes and node self attributes; selecting a first transmission node from N nodes in the boundary subzone, and determining the transmission priority of the nodes; selecting the rest two nodes from the rest nodes in the boundary sub-domain and forming a triangle with the vertex by taking the first transmission node as the vertex of the triangle, and enabling the area of the triangle to be minimum so as to determine the optimal topology; when a new node is encountered in the data packet transmission process, judging whether topology updating is needed or not; and the data packet arrives at the termination position of the data packet transmission and sends a receiving instruction. The nodes can be efficiently and accurately screened, so that the transmission of the data packets is always performed in an optimal topology mode, and the transmission performance of the network is improved. Meanwhile, the reliability of transmission can be guaranteed, the delivery rate is improved, and only three copies of the data packet exist in the network at any time, so that the load rate and the cost of the network can be reduced in a certain sense.

Description

Opportunity route transmission control method for parking apron non-communication network
Technical Field
The invention belongs to the technical field of wireless network communication, and particularly relates to an opportunity route transmission control method for an airport apron unconnected network.
Background
The airport has a wide apron area, node resources are distributed unevenly, and phenomena such as local boundary subdomains exist, as shown in fig. 2, a Wireless Sensor Network (WSN) composed of static nodes is arranged inside a boundary, and an ON (opportunistic network) composed of dynamic nodes is arranged outside the boundary. In order to overcome the defects, the opportunistic routing strategy is applied to the airport network by combining the social attributes of airport nodes, namely the dynamic characteristics and the static characteristics of the nodes and the characteristics of data packets.
The opportunistic network has low requirement on the connectivity of the network, and mainly uses a storage-carrying-forwarding mode. Factors mainly affecting the opportunistic network routing are the selection of the alternative forwarding nodes of the next hop and the priority of the alternative forwarding nodes.
Currently, there is little research on airport opportunistic networks, but opportunistic network routing methods have tended to mature in other areas. In an end-to-end shortest path mode, the selection of a next hop node is designed based on hop count, geographical distance and shortest path expected transmission count, but the state of a neighbor node is not considered, so that the performance of an alternative forwarding node cannot be accurately measured, and the problem of link interruption is easy to occur; a packet REQ-ACK mode is controlled, a higher delivery rate is obtained through a small amount of REQ and ACK overhead, strict requirements are placed on the geographical position of a node, and the selection of an alternative forwarding node is limited; the network coding method is used for improving the throughput and carrying a plurality of messages at one time, and coding the messages, but ignores the topology and the dynamic characteristic of the network, reduces the reliability of single-hop transmission and increases the network load.
Disclosure of Invention
In order to solve the above problems, an object of the present invention is to provide an opportunistic routing transmission control method for a network where an apron is not connected.
In order to achieve the above object, the opportunistic routing transmission control method for an apron unconnected network provided by the invention comprises the following steps in sequence:
step 1, initializing data packet attributes including data packet importance degree, data packet size and termination position of data packet transmission; initializing the self attributes of the nodes, including the moving destinations, the node energy and the moving speeds of the nodes for determining the destination weights of the nodes;
step 2, selecting a first transmission node from N nodes in the boundary subdomain according to the attribute of the data packet, and determining the transmission priority of the nodes;
step 3, taking the first-pass node as a vertex of the triangle, selecting the rest two nodes A and B from the rest N nodes in the boundary subdomain according to the attributes of the nodes, forming the triangle with the vertex, and enabling the area of the triangle to be minimum, thereby determining the optimal topology gamma { L, A, B };
step 4, when a new node is encountered in the process of transmitting the data packet according to the optimal topology gamma { L, A, B }, judging whether topology updating is needed;
and 5, when the data packet reaches the termination position of the data packet transmission and sends a receiving instruction, the data packet transmission process is finished.
In step 2, the specific steps of selecting a first transmission node from the N nodes in the boundary subdomain according to the attribute of the data packet and determining the transmission priority of the node are as follows:
the participants of the competitive game are N nodes in the boundary subdomain, and each node is independent; the importance of a packet is first divided into three levels, important, next important and unimportant, and the corresponding metrics are shown in the following table:
Figure BDA0002323966070000031
then, the data packet size is divided into a large data packet, a medium data packet and a small data packet, and the corresponding measurement criteria are shown in the following table:
Figure BDA0002323966070000032
constructing a game payment matrix according to the importance degree of the data packet, the size of the data packet and corresponding measuring standards, wherein the table is as follows:
Figure BDA0002323966070000033
obtaining the income value obtained by the node which participates in or does not participate in the competition of the first transmission node by using a game payment matrix, wherein I in brackets (I and II) represents the income value obtained by the node which participates in the competition of the first transmission node, and II represents the income value obtained by the node which does not participate in the competition of the first transmission node; then theAll the profit values are sorted from large to small to obtain the sending sequence of the data packets and the data packets are marked with n 1 ，n 2 ，…，n N Wherein the symbol n 1 The node is the first transmission node L selected by the game;
and in the subsequent data packet transmission process, the nodes corresponding to the labels generated by the game are transmitted in sequence without recalculation to increase network overhead.
In step 3, the specific steps of selecting the remaining two nodes a and B from the remaining N nodes in the boundary subdomain according to their own attributes and forming a triangle with the vertices, and minimizing the area of the triangle, thereby determining the optimal topology Γ { L, a, B } are as follows:
firstly, determining the node destination weight of each node: defining the destination weight of the node as G; firstly, dividing the data packet into three concentric circles by taking the end position of the data packet transmission as the center of a circle and R as the radius, namely performing area division, wherein the radius of a central area is R1, the radius of a secondary central area adjacent to the central area is R2, the radius of an edge area adjacent to the secondary central area is R3, and performing node purpose weight G distribution on nodes in each area;
firstly, judging the relation between the moving destination of the node and the termination position of data packet transmission, and then distributing corresponding node destination weight G to each node according to the relation;
the distribution method of the node destination weight G is as follows:
Figure BDA0002323966070000041
when R is more than or equal to 0 and less than or equal to R1,
Figure BDA0002323966070000042
when R2 is more than R and less than or equal to R3,
Figure BDA0002323966070000043
wherein, the node purpose weight G2 value of the node in the secondary central area with R1 more than R2 less than or equal to R2 is set as 1, when the node is in the central area with R0 less than or equal to R1, the node purpose weight G1 of the area is increased on the basis of 1
Figure BDA0002323966070000051
At the moment, the value of the node destination weight G1 is greater than 1; when the node is positioned in the edge region with R2 < R ≦ R3, the node destination weight G3 of the region is decreased on the basis of 1>
Figure BDA0002323966070000052
At the moment, the value of the node destination weight G3 is less than 1;
secondly, determining the node energy of each node: defining a function of node energy as E (l), describing by energy epsilon required by unit distance, and calculating the transmissible distance l of each node energy by the following formula:
Figure BDA0002323966070000053
wherein E i (l) Representing the energy of the ith node, wherein the larger the transmissible distance l is, the higher the energy of the node is;
then determining the node moving speed of each node: if an optimal topology is formed, the node moving speed of each node needs to be determined; the moving speed difference between the nodes i, j, k is:
ΔV ij ＝|V i -V j |
ΔV jk ＝|V j -V k |
ΔV ki ＝|V k -V i |
when the node moving speed difference between the nodes is large, the topology can be severely deformed, so that the optimal topology is decomposed, namely the nodes forming the optimal topology need to meet the following requirements:
Figure BDA0002323966070000054
Figure BDA0002323966070000055
Figure BDA0002323966070000056
function V = Δ V defining the speed of movement of the node ij +ΔV jk +ΔV ki ；
According to the node target weight G, the node energy E and the node moving speed V, a utility function is obtained as follows: u { G, E, V } = α G + β E + γ V
Wherein, alpha represents the constraint coefficient of node energy E and node moving speed V to the node weight G, beta represents the constraint coefficient of node weight G and node moving speed V to the node energy E, and gamma represents the constraint coefficient of node weight G and node moving speed E to the node moving speed V;
in the selection process of the nodes A and B, the property sequence of each node needs to be judged, firstly, the destination weight G of the node is judged, and the node with the same or similar termination position of data packet transmission is selected according to the size of the destination weight G of the node; then measuring the node energy E, calculating the transmissible distance l of the node energy E according to the energy required by the unit transmission distance of the data packet, and selecting a node with a large transmissible distance l according to the calculation result; finally, the moving speed V of the node is constrained to keep the optimal topology;
after the three options, respectively calculating the utility values of the M nodes by using the utility function;
in the expression of utility function, the coefficient is constrained
Figure BDA0002323966070000061
Restraint coefficient>
Figure BDA0002323966070000062
Constraint coefficient γ =1;
selecting two nodes with the maximum utility values from the M nodes, and requiring the minimum area of a triangle formed by the two nodes and the first transmission node L, wherein the two nodes are the nodes A and B;
wherein the coordinates of the nodes A and B are respectively (x) A ，y A )、(x B ，y B ) Then the euclidean distance between nodes a, B is:
Figure BDA0002323966070000063
the expression for the straight line AB in the coordinate system is:
Figure BDA0002323966070000071
namely:
Figure BDA0002323966070000072
wherein the order
Figure BDA0002323966070000073
Then the first pass node L (x) init ，y init ) The distance to the straight line AB is:
Figure BDA0002323966070000074
then the triangle area is:
Figure BDA0002323966070000075
in step 4, when a new node is encountered during the transmission of the packet according to the optimal topology Γ { L, a, B }, the specific step of determining whether topology update is required is as follows:
and (3) calculating the utility value of the new node by using the methods in the steps 1 to 3, playing a game with the current nodes A and B, selecting two nodes with large utility values from the new node, and if a new node is added into the two selected nodes, transmitting a data packet by the updated topology.
The opportunistic routing transmission control method for the parking apron disconnected network provided by the invention can efficiently and accurately screen the nodes, so that the transmission of the data packet is always carried out in an optimal topology mode, and the transmission performance of the network is improved. Meanwhile, the reliability of transmission can be ensured, the delivery rate is improved, and only three copies of the data packet exist in the network at any time, so that the load rate and the cost of the network can be reduced in a certain sense.
Drawings
FIG. 1 is a flow chart of an opportunistic routing transmission control method of an apron disconnected network provided by the invention;
FIG. 2 is a diagram of the bounding subdomains formed by the tarmac network;
FIG. 3 is a schematic diagram of a method for selecting a first-pass node;
FIG. 4 is a node destination weight area allocation diagram;
FIG. 5 is a diagram of a utility function acquisition process;
fig. 6 is a schematic diagram of the optimal topology Γ { L, a, B }.
Detailed Description
As shown in fig. 1, the opportunistic routing transmission control method for an apron-disconnected network provided by the invention comprises the following steps in sequence:
step 1, initializing data packet attributes including data packet importance degree, data packet size and termination position of data packet transmission; initializing the self attributes of the nodes, including the moving destinations, the node energy and the moving speeds of the nodes for determining the destination weights of the nodes;
step 2, selecting a first transmission node from N nodes in the boundary subdomain according to the attribute of the data packet, and determining the transmission priority of the nodes;
as shown in fig. 3, the specific steps are as follows:
the participants of the competition game are N nodes in the boundary subdomain, and each node is independent; the importance of a packet is first divided into three levels, important, sub-important and unimportant, and the corresponding metrics are shown in the following table:
Figure BDA0002323966070000081
then, the data packet size is divided into a large data packet, a medium data packet and a small data packet, and the corresponding measurement criteria are shown in the following table:
Figure BDA0002323966070000082
constructing a game payment matrix according to the importance degree of the data packet, the size of the data packet and corresponding measuring standards, wherein the table is as follows:
Figure BDA0002323966070000091
the profit value obtained by each node participating or not participating in the competition first-pass node can be obtained by utilizing a game payment matrix, wherein I in brackets (I and II) represents the profit value obtained by the node participating in the competition first-pass node, and II represents the profit value obtained by the node not participating in the competition first-pass node; then all the profit values are sorted from big to small to obtain the sending sequence of the data packets and label n for the sending sequence 1 ，n 2 ，…，n N Wherein the symbol n 1 The node is the first transmission node L selected by the game.
And in the subsequent data packet transmission process, the nodes corresponding to the labels generated by the game are transmitted in sequence without recalculation to increase network overhead.
Step 3, taking the first-pass node as a vertex of the triangle, selecting the rest two nodes A and B from the rest N nodes in the boundary subdomain according to the attributes of the nodes, forming the triangle with the vertex, and enabling the area of the triangle to be minimum, thereby determining the optimal topology gamma { L, A, B };
the method comprises the following specific steps:
firstly, determining the node destination weight of each node: defining the destination weight of the node as G; firstly, dividing the data packet into three concentric circles by taking the end position of the data packet transmission as the center of a circle and taking R as the radius, namely, performing area division, as shown in FIG. 4, wherein the radius of a central area is R1, the radius of a secondary central area adjacent to the central area is R2, the radius of an edge area adjacent to the secondary central area is R3, and performing node purpose weight G distribution on nodes in each area;
because the moving destination of the node does not necessarily need to be consistent with the end position of data packet transmission, the node transmission range only needs to reach the end position of data packet transmission, but the moving destination of the node needs to be close to the end position of data packet transmission, otherwise, the transmission distance is increased, the transmission load is further increased, and even the transmission is terminated if the moving destination of the node and the end position of data packet transmission are different, therefore, the relationship between the moving destination of the node and the end position of data packet transmission is judged at first, and then the corresponding node destination weight G is distributed to each node according to the relationship;
the distribution method of the node destination weight G is as follows:
Figure BDA0002323966070000101
when R is more than or equal to 0 and less than or equal to R1,
Figure BDA0002323966070000102
when R2 is more than R and less than or equal to R3,
Figure BDA0002323966070000103
wherein, the node destination weight G2 value of the node in the sub-central region with R1 < R2 is set as 1, when the node is in the central region with R < R1 > 0, the node destination weight G1 of the region is increased on the basis of 1
Figure BDA0002323966070000104
At the moment, the value of the node destination weight G1 is more than 1, and when the radius R1 of the central area is reduced, the node destination weight of the area is more than 1G1 increases, indicating that the closer to the end of packet transmission, the stronger its destination; when the node is positioned in the edge region with R2 < R ≦ R3, the node destination weight G3 of the region is decreased on the basis of 1>
Figure BDA0002323966070000105
At this time, the value of the node destination weight G3 is less than 1, and when the radius R3 of the edge region increases, the node destination weight G3 of the region decreases, which means that the farther from the end position of the packet transmission, the weaker the destination is.
Secondly, determining the node energy of each node: the node energy is a key for determining whether delivery can be effective, if the node energy is too low, transmission interruption is caused, the delivery rate is reduced, and unnecessary routing overhead is caused, so that after the destination weight G of the node is determined, the node energy needs to be determined. Defining the function of the node energy as E (l), and describing the function by the energy epsilon required by a unit distance, and calculating the transmissible distance l of each node energy by the following formula:
Figure BDA0002323966070000111
wherein E i (l) Representing the energy of the ith node, the larger the transmissible distance l is, the higher the energy of the node is.
Then determining the node moving speed of each node: if an optimal topology is formed, the node moving speed of each node needs to be determined; the moving speed difference between the nodes i, j, k is:
ΔV ij ＝|V i -V j |
ΔV jk ＝|V j -V k |
ΔV ki ＝|V k -V i |
when the node moving speed difference between the nodes is large, the topology can be severely deformed, the optimal topology is decomposed, and the nodes forming the optimal topology need to meet the following requirements:
Figure BDA0002323966070000112
Figure BDA0002323966070000113
Figure BDA0002323966070000114
function V = Δ V defining the speed of movement of the node ij +ΔV jk +ΔV ki ；
As shown in fig. 5, according to the node destination weight G, the node energy E and the node moving speed V, the utility function can be obtained as follows:
U{G，E，V}＝αG+βE+γV
wherein, alpha represents the constraint coefficient of node energy E and node moving speed V to the node weight G, beta represents the constraint coefficient of node weight G and node moving speed V to the node energy E, and gamma represents the constraint coefficient of node weight G and node energy E to the node moving speed V;
judging the property sequence of each node in the selection process of the nodes A and B, firstly judging a node target weight G, and selecting a node with the same or similar termination position as the data packet transmission according to the size of the node target weight G; then measuring the node energy E, calculating the transmissible distance l of the node energy E according to the energy required by the unit transmission distance of the data packet, and selecting a node with a large transmissible distance l according to the calculation result; and finally, constraining the moving speed V of the node to keep the optimal topology.
And respectively calculating the utility values of the M nodes by using the utility function after the three options.
In the expression of utility function, the coefficient is constrained
Figure BDA0002323966070000121
That is, when the node energy E is sufficient and the difference of the node moving speed V is small, the node purpose is increasedAnd the weight G enables the nodes with strong destination, sufficient energy and consistent speed to receive larger game benefits.
To avoid energy E at the ith node i (l) When the node moving speed V is very small and the node target weight G is also very small, the constraint coefficient alpha influences the node target weight G to ensure that the constraint coefficient
Figure BDA0002323966070000122
And when the node target weight G is smaller and the constraint coefficient alpha is larger, weighting the node energy E. When the node moving speed V is large, the constraint coefficient β can also balance the influence of the node moving speed V on the node weight G.
Because:
Figure BDA0002323966070000131
therefore, the influence of the node moving speed V on the utility function is minimal, and a constraint coefficient γ =1 is taken.
Two nodes with the maximum utility value are selected from the M nodes, and the area of a triangle formed by the two nodes and the first-pass node L is required to be the minimum, so that the two nodes are the required nodes a and B, as shown in fig. 6.
Wherein the coordinates of the nodes A and B are respectively (x) A ，y A )、(x B ，y B ) Then the euclidean distance between nodes a, B is:
Figure BDA0002323966070000132
the expression for the straight line AB in the coordinate system is:
Figure BDA0002323966070000133
namely:
Figure BDA0002323966070000134
wherein the order
Figure BDA0002323966070000135
Then the first pass node L (x) init ，y init ) The distance to the straight line AB is:
Figure BDA0002323966070000136
then the triangle area is:
Figure BDA0002323966070000137
step 4, when a new node is encountered in the process of transmitting the data packet according to the optimal topology gamma { L, A, B }, judging whether topology updating is needed;
and (3) calculating the utility value of the new node by using the methods in the steps 1 to 3, playing a game with the current nodes A and B, selecting two nodes with large utility values from the new node, and if a new node is added into the two selected nodes, transmitting a data packet by the updated topology.
And 5, when the data packet reaches the termination position of the data packet transmission and sends a receiving instruction, the data packet transmission process is finished.

Claims (4)

1. An opportunity routing transmission control method for an apron non-communication network is characterized by comprising the following steps: the opportunistic routing transmission control method comprises the following steps which are carried out in sequence:
step 1, initializing data packet attributes including data packet importance degree, data packet size and termination position of data packet transmission; initializing the self attributes of the nodes, including node energy, node moving speed and a node moving destination for determining a node destination weight; the calculation mode of the node destination weight G is as follows:
firstly, dividing the data packet into three concentric circles by taking the end position of the data packet transmission as the center of a circle and R as the radius, namely performing area division, wherein the radius of a central area is R1, the radius of a secondary central area adjacent to the central area is R2, the radius of an edge area adjacent to the secondary central area is R3, and performing node purpose weight G distribution on nodes in each area;
and (3) allocation rule: the distribution calculation formula of the node destination weight G is as follows:
Figure FDA0004092386470000011
when R is more than or equal to 0 and less than or equal to R1,
Figure FDA0004092386470000012
when R2vR is less than or equal to R3,
Figure FDA0004092386470000013
step 2, selecting a first transmission node from N nodes in the boundary subdomain according to the attribute of the data packet, and determining the transmission priority of the nodes;
step 3, taking the first-pass node L as a vertex of the triangle, selecting the other two nodes A and B with the maximum utility values from the rest N nodes in the boundary subdomain according to the attributes of the nodes, forming the triangle with the vertex, and minimizing the area of the triangle, thereby determining the optimal topology gamma { L, A, B };
step 4, when a new node is encountered in the process of transmitting the data packet according to the optimal topology gamma { L, A, B }, judging whether topology updating is needed;
and 5, when the data packet reaches the end position of the data packet transmission and sends a receiving instruction, the data packet transmission process is finished.
2. The opportunistic routing transmission control method of an apron-disconnected network according to claim 1, characterized in that: in step 2, the specific steps of selecting a first transmission node from the N nodes in the boundary subzone according to the attribute of the data packet, and determining the transmission priority of the node are as follows:
the participants of the competition game are N nodes in the boundary subdomain, and each node is independent; the importance of a packet is first divided into three levels, important, next important and unimportant, and the corresponding metrics are shown in the following table:
Figure FDA0004092386470000021
then, the data packet size is divided into a large data packet, a medium data packet and a small data packet, and the corresponding measurement criteria are shown in the following table:
Figure FDA0004092386470000022
constructing a game payment matrix according to the importance degree of the data packet, the size of the data packet and corresponding measuring standards, wherein the table is as follows:
Figure FDA0004092386470000023
obtaining the income value obtained by the node which participates in or does not participate in the competition of the first transmission node by using a game payment matrix, wherein I in brackets (I and II) represents the income value obtained by the node which participates in the competition of the first transmission node, and II represents the income value obtained by the node which does not participate in the competition of the first transmission node; then all the profit values are sorted from big to small to obtain the sending sequence of the data packets and label n for the sending sequence 1 ，n 2 ，…，n N Wherein the symbol n 1 The node is the first transmission node L selected by the game;
and in the subsequent data packet transmission process, the nodes corresponding to the labels generated by the game are transmitted in sequence without recalculation to increase network overhead.
3. The opportunistic routing transmission control method of an apron-disconnected network according to claim 1, characterized in that: in step 3, the specific steps of taking the first-pass node L as a vertex of the triangle, selecting two nodes a and B with the maximum utility values from the remaining N nodes in the boundary subdomain according to the attributes of the nodes, forming the triangle with the vertex, and minimizing the area of the triangle, thereby determining the optimal topology Γ { L, a, B } are as follows:
firstly, determining the node destination weight of each node: defining the destination weight of the node as G; firstly, dividing a data packet into three concentric circles by taking an end position of data packet transmission as a circle center and R as a radius, namely performing area division, wherein the radius of a central area is R1, the radius of a secondary central area adjacent to the central area is R2, the radius of an edge area adjacent to the secondary central area is R3, and distributing node purpose weight G to nodes in each area;
firstly, judging the relation between the moving destination of the node and the termination position of data packet transmission, and then distributing corresponding node destination weight G to each node according to the relation;
the distribution method of the node destination weight G is as follows:
Figure FDA0004092386470000031
when R is more than or equal to 0 and less than or equal to R1,
Figure FDA0004092386470000032
when R2 is more than R and less than or equal to R3,
Figure FDA0004092386470000041
wherein, the node destination weight G2 value of the node in the sub-central region with R1 < R2 is set as 1, when the node is in the central region with R < R1 > 0, the node destination weight G1 of the region is increased on the basis of 1
Figure FDA0004092386470000042
At this time, the node destination weightThe value of G1 is greater than 1; when the node is positioned in the edge region with R2 < R ≦ R3, the node destination weight G3 of the region is decreased on the basis of 1>
Figure FDA0004092386470000043
At the moment, the value of the node destination weight G3 is less than 1;
secondly, determining the node energy of each node: defining the function of the node energy as E (l), describing by the energy epsilon required by a unit distance, and calculating the transmissible distance l of each node energy by the following formula:
Figure FDA0004092386470000044
wherein E i (l) Representing the energy of the ith node, wherein the larger the transmissible distance l is, the higher the energy of the node is;
then determining the node moving speed of each node: if an optimal topology is formed, the node moving speed of each node needs to be determined; the moving speed difference between the nodes i, j and k is as follows:
ΔV ij ＝|V i -V j |
ΔV jk ＝|V j -V k |
ΔV ki ＝|V k -V i |
when the node moving speed difference between the nodes is large, the topology can be severely deformed, so that the optimal topology is decomposed, namely the nodes forming the optimal topology need to meet the following requirements:
Figure FDA0004092386470000045
Figure FDA0004092386470000046
Figure FDA0004092386470000047
function V = Δ V defining the speed of movement of the node ij +ΔV jk +ΔV ki ；
According to the node target weight G, the node energy E and the node moving speed V, a utility function is obtained as follows:
U{G,E,V}＝αG+βE+γV
wherein, alpha represents the constraint coefficient of node energy E and node moving speed V to the node weight G, beta represents the constraint coefficient of node weight G and node moving speed V to the node energy E, and gamma represents the constraint coefficient of node weight G and node energy E to the node moving speed V;
judging the property sequence of each node in the selection process of the nodes A and B, firstly judging a node target weight G, and selecting a node with the same or similar termination position as the data packet transmission according to the size of the node target weight G; then measuring the node energy E, calculating the transmissible distance l of the node energy E according to the energy required by the unit transmission distance of the data packet, and selecting a node with a large transmissible distance l according to the calculation result; finally, the moving speed V of the node is restrained so as to keep the optimal topology;
after the three options, respectively calculating the utility values of the M nodes by using the utility function;
in the expression of utility function, the coefficient is constrained
Figure FDA0004092386470000051
Restraint factor->
Figure FDA0004092386470000052
Constraint coefficient γ =1;
selecting two nodes with the maximum utility values from the M nodes, and requiring the minimum area of a triangle formed by the two nodes and the first transmission node L, wherein the two nodes are the nodes A and B;
wherein the coordinates of the nodes A and B are respectively (x) A ，y A )、(x B ，y B ) Then, the euclidean distance between nodes a, B is:
Figure FDA0004092386470000053
the expression for the straight line AB in the coordinate system is:
Figure FDA0004092386470000054
namely:
Figure FDA0004092386470000055
wherein order
Figure FDA0004092386470000056
Then the first pass node L (x) init ，y init ) The distance to the straight line AB is:
Figure FDA0004092386470000057
the triangle area is then:
Figure FDA0004092386470000058
4. the opportunistic routing transmission control method of an apron-disconnected network according to claim 1, characterized in that: in step 4, when a new node is encountered during the transmission of the packet according to the optimal topology Γ { L, a, B }, the specific step of determining whether topology update is required is as follows:
and (3) calculating the utility value of the new node by using the methods in the steps 1 to 3, playing a game with the current nodes A and B, selecting two nodes with large utility values from the new node, and if a new node is added into the two selected nodes, transmitting a data packet by the updated topology.
CN201911308928.5A 2019-12-18 2019-12-18 Opportunity route transmission control method for parking apron non-communication network Active CN111010720B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911308928.5A CN111010720B (en) 2019-12-18 2019-12-18 Opportunity route transmission control method for parking apron non-communication network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911308928.5A CN111010720B (en) 2019-12-18 2019-12-18 Opportunity route transmission control method for parking apron non-communication network

Publications (2)

Publication Number Publication Date
CN111010720A CN111010720A (en) 2020-04-14
CN111010720B true CN111010720B (en) 2023-04-07

Family

ID=70115916

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911308928.5A Active CN111010720B (en) 2019-12-18 2019-12-18 Opportunity route transmission control method for parking apron non-communication network

Country Status (1)

Country Link
CN (1) CN111010720B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105933224A (en) * 2016-04-15 2016-09-07 国网河北省电力公司 Opportunistic routing method for improving reliability of communication network
CN106068027A (en) * 2016-05-25 2016-11-02 重庆邮电大学 The system adaptive recognition method of Situation Awareness in chance intelligent perception network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8027259B2 (en) * 2006-06-30 2011-09-27 Nokia Corporation Opportunistic routing protocol in ad hoc networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105933224A (en) * 2016-04-15 2016-09-07 国网河北省电力公司 Opportunistic routing method for improving reliability of communication network
CN106068027A (en) * 2016-05-25 2016-11-02 重庆邮电大学 The system adaptive recognition method of Situation Awareness in chance intelligent perception network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
《基于移动agent的机坪机会传输控制方法》;陈维兴，张天娇，林家泉，刘贵行;《江苏大学学报》;20180531;第39卷(第3期);全文 *
《基于节点可靠度的无线传感器网络拓扑控制算法》;刘洲洲，彭寒;《吉林大学学报》;20180331;第48卷(第2期);全文 *
《基于节点速度和能量的MPR节点集选择》;陈炳才 , 孙少玮 , 宁芊;《传感技术学报》;20190630;第32卷(第6期);全文 *

Also Published As

Publication number Publication date
CN111010720A (en) 2020-04-14

Similar Documents

Publication Publication Date Title
CN110149671B (en) Routing method of unmanned aerial vehicle swarm network
CN111065105B (en) Distributed intelligent routing method for unmanned aerial vehicle network slice
CN103781148B (en) Stable cluster method for routing based on link-aware in vehicular ad hoc network
CN104080112B (en) A kind of method for improving wireless self-organization network service reliability
US20060007863A1 (en) Signal propagation delay routing
CN109673035A (en) A kind of Route establishment and maintaining method suitable for wireless self-organization network
Karenos et al. Traffic management in sensor networks with a mobile sink
CN110191413B (en) Method and system for broadcasting in mobile ad hoc network based on greedy ant colony algorithm
CN101600227A (en) A kind of distributed network route selection method and routing device
KR20210143021A (en) System for uav assisted relay ad-hoc network system and method based on reinforcement learning
CN108616893A (en) A kind of topology control method of high energy efficiency
Zhang et al. A realistic spatial-distribution-based connectivity-aware routing protocol in multilevel scenarios of urban VANETs
CN109688614A (en) Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET
CN114641049A (en) Unmanned aerial vehicle ad hoc network layered routing method based on fuzzy logic
CN111010720B (en) Opportunity route transmission control method for parking apron non-communication network
CN113094857A (en) Energy-saving controller layout method for software defined vehicle network
Suraki et al. FCLCC: fuzzy cross-layer congestion control in mobile ad hoc networks
CN107318143A (en) Communication optimization method between cluster in a kind of multiple gateway WMN of sub-clustering under IEEE802.11s
Rekha Defective Motes Uncovering and Retrieval for Optimized Network
CN108040016A (en) Towards the WSN web impact factor dispatching methods of airport goods station goods information collection
CN114501575A (en) Agricultural Internet of things self-adaptive routing method based on fuzzy logic
Prabu et al. Performance analysis of modified OLSR protocol for MANET using ESPR algorithm
CN113705902A (en) Traffic hub passenger transport organization evaluation method based on crowd management
CN106454899A (en) Method for optimizing survival time for wireless mesh network
CN111901846A (en) Ad-hoc network system adopting multiple NB-IoT node gateways

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