CN110943926A - MPR backup method based on link lifetime - Google Patents

MPR backup method based on link lifetime Download PDF

Info

Publication number
CN110943926A
CN110943926A CN201911197117.2A CN201911197117A CN110943926A CN 110943926 A CN110943926 A CN 110943926A CN 201911197117 A CN201911197117 A CN 201911197117A CN 110943926 A CN110943926 A CN 110943926A
Authority
CN
China
Prior art keywords
node
mpr
satellite
nodes
hop neighbor
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911197117.2A
Other languages
Chinese (zh)
Other versions
CN110943926B (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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology 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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201911197117.2A priority Critical patent/CN110943926B/en
Publication of CN110943926A publication Critical patent/CN110943926A/en
Application granted granted Critical
Publication of CN110943926B publication Critical patent/CN110943926B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/18521—Systems of inter linked satellites, i.e. inter satellite service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/026—Details of "hello" or keep-alive messages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/14—Routing performance; Theoretical aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an MPR backup method based on link lifetime, which comprises that a satellite node periodically broadcasts a Hello grouping message outwards and receives the Hello grouping message periodically broadcasted outwards from a neighbor node; generating a neighbor table according to the Hello packet messages of the satellite nodes and the neighbor nodes thereof, and then predicting the link survival time between each satellite node and the neighbor nodes thereof in the satellite self-organizing network; and selecting the MPR node of the satellite node and the alternative MPR node to be added into the MPR set. After the alternative MPR nodes of the satellite nodes are introduced, after the failure problem of the MPR nodes occurs, the backup nodes are directly selected to forward the TC control messages, the Hello messages do not need to be interacted again, the neighbor list is formed again, the MPR nodes are selected again, the MPR nodes are repaired quickly, the resource utilization rate and the operation efficiency are improved, and the correct formation of the whole network topology is ensured.

Description

MPR backup method based on link lifetime
Technical Field
The invention relates to a satellite self-organizing network, in particular to an MPR node backup method of an OLSR routing protocol in the satellite self-organizing network.
Background
In a satellite ad hoc network, each satellite node plays two roles. One is a terminal node that transceives data, and the other is a routing node that forwards data. Through research, a large number of satellite self-organizing network routing protocol schemes are proposed one after another, and the satellite self-organizing network routing protocols have different classification modes according to different standards. Aiming at the routing problem of the satellite self-organizing network, the routing problem can be divided into a post-response routing protocol and a pre-response routing protocol according to different routing establishment modes.
The backward routing protocol is also called as an on-demand routing protocol, does not need to maintain network topology and current routing information, and passively searches for a route from a source node to a destination node when the source node needs to send a packet. Although the post-response routing protocol can reduce the overhead of the control message, uncertainty exists, including uncertainty of whether the destination node is reachable and uncertainty of route setup delay. The existing research shows that the time delay of the post-response type routing protocol is far greater than the time delay of the establishment of the pre-response type routing.
The proactive routing protocol is also called a table-driven routing protocol, and the change of the network topology must be tracked in real time during the network operation process to update the routing table information. Optimized Link State Routing (OLSR) is typically a table-driven proactive routing protocol. The OLSR routing protocol requires the satellite nodes to periodically exchange various Control packets including Hello packets and Topology Control (TC) packets, and perform distributed computation to establish a network Topology.
In a satellite self-organizing network, rapid movement of satellite nodes and frequent change of network topology can bring about rapid update of routing information, a traditional OLSR protocol is unstable, and the rapidly changing topology can cause the problem of link breakage, so that TC control packets cannot be effectively broadcast to each satellite node, and correct and complete topology information cannot be formed. After the problem occurs, the nodes can only wait for the interaction of the Hello packet message again, re-establish a new neighbor table, and re-select the MPR node to broadcast the topology control information, so that the waste of wireless bandwidth resources and satellite node energy is caused, and the operation efficiency of the whole routing protocol is also reduced.
Disclosure of Invention
Aiming at the defects in the prior art, the MPR backup method based on the link lifetime solves the problem that the operating efficiency of the whole routing protocol is reduced due to the fact that the rapidly-changing topological link is broken.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that:
an MPR backup method based on link lifetime is provided, which includes:
s1, the satellite node periodically broadcasts the Hello grouping message and receives the Hello grouping message periodically broadcast from the neighbor node; the Hello packet message comprises a neighbor node of the satellite node, link state information, and a position coordinate and a timestamp when the message is sent;
s2, generating a neighbor table according to the Hello grouping messages of the satellite nodes and the neighbor nodes thereof, and then predicting the link survival time between each satellite node and the neighbor nodes thereof in the satellite self-organizing network;
s3, selecting an MPR node of a satellite node to join an MPR set, and then deleting a 2-hop neighbor node with a unique path with the satellite node and a 1-hop neighbor node selected as the MPR node in a temporary network topological graph A with the initial state identical to the self-organized network topological graph of the satellite;
s4, judging whether a 2-hop neighbor node exists in a 1-hop neighbor node of the satellite node in the temporary network topology graph A, if so, entering the step S5, otherwise, outputting an MPR set;
s5, taking the 1-hop neighbor node as an alternative MPR backup node of the 2-hop neighbor node corresponding to the satellite node, and judging whether at least two alternative MPR backup nodes exist, if so, entering the step S6, otherwise, entering the step S7;
s6, selecting the alternative MPR backup node with the highest reliability as a backup MPR node to be added into the MPR set, deleting all 2-hop neighbor nodes covered by the alternative MPR backup node in the temporary network topology graph A, and entering the step S8;
s7, selecting the only alternative MPR backup node as the backup MPR node to join the MPR set, deleting the 2-hop neighbor node covered by the temporary network topology graph A, and entering the step S8;
and S8, judging whether the satellite node in the temporary network topology graph A has a 2-hop neighbor node, if so, returning to the step S4, otherwise, outputting the MPR set with the backup MPR node.
The invention has the beneficial effects that: after the alternative MPR nodes of the satellite nodes are introduced, after the failure problem of the MPR nodes occurs, the backup nodes are directly selected to forward the TC control messages, the Hello messages do not need to be interacted again, the neighbor list is formed again, the MPR nodes are selected again, the MPR nodes are repaired quickly, the resource utilization rate and the operation efficiency are improved, and the correct formation of the whole network topology is ensured.
In addition, the scheme predicts the survival time of the neighbor link by using the coordinate information provided by the satellite orbit data, provides the reliability by using the survival time of the link, and fully considers the characteristic of frequent change of the satellite self-organizing network topology by listing the reliability into the constraint parameter of the MPR node, thereby greatly improving the reliability of the MPR node.
Drawings
Fig. 1 is a flowchart of an MPR backup method based on link lifetime.
Fig. 2 is a schematic diagram of relative movement between a satellite node and a neighboring node b.
Fig. 3 is a topology diagram one of a satellite ad hoc network.
Fig. 4 is a topology diagram two of a satellite ad hoc network.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate the understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and it will be apparent to those skilled in the art that various changes may be made without departing from the spirit and scope of the invention as defined and defined in the appended claims, and all matters produced by the invention using the inventive concept are protected.
To avoid ambiguity in the description, a 1-hop neighbor node and a 2-hop neighbor node are explained here: all 1-hop neighbor nodes and 2-hop neighbor nodes appearing in the scheme refer to 1-hop neighbor nodes and 2-hop neighbor nodes of the satellite nodes.
Referring to fig. 1, fig. 1 illustrates a flowchart of an MPR backup method based on link lifetime; as shown in fig. 1, the method S includes steps S1 to S9.
In step S1, the satellite node periodically broadcasts out the Hello packet message and receives the periodically broadcast out Hello packet message from the neighbor node; the Hello packet message comprises a neighbor node of the satellite node, link state information, and a position coordinate and a timestamp when the message is sent;
in step S2, a neighbor table is generated according to the Hello packet messages of the satellite node and its neighbor nodes, then the link lifetime between each satellite node and its neighbor nodes in the satellite ad hoc network is predicted, and then the depth of the 1-hop neighbor node of the satellite node is obtained.
Referring to fig. 3, a network topology diagram with a satellite node a as a source node is shown, where nodes b and c are 1-hop neighbor nodes of the source node a, and nodes d, e, and f are 2-hop neighbor nodes of the source node a; the number of symmetrical neighbor nodes of the 1-hop neighbor node except the source node is the depth of the 1-hop neighbor node of the source node a, the depth of the node b is 2, and the depth of the node c is 3.
Referring to fig. 2, a schematic diagram of relative movement between a satellite node and a neighbor node during two consecutive times of broadcasting Hello packet messages by the satellite node is shown, where coordinate points a and b represent the satellite node and the neighbor node b, respectively, and R is a maximum communication distance of the satellite node.
The method for predicting the link lifetime between each satellite node and the neighbor node according to the present scheme is described with reference to fig. 2:
s21, the neighbor node b records the connectionTime t of receiving Hello packet message broadcasted by satellite node twice1Time t2And the position coordinates of the satellite node when the satellite node broadcasts the Hello packet message continuously twice;
s22, the neighbor node b according to the received satellite node position coordinates and the time t1Time t2Calculating the instantaneous movement speed of the satellite node
Figure BDA0002294942390000051
S23, neighbor node b obtains self t by extracting self track information1、t2The position information of two moments, and the instantaneous movement speed of the neighbor node b is calculated according to the position information and the time difference
Figure BDA0002294942390000052
S24, according to the instantaneous movement speed
Figure BDA0002294942390000053
And instantaneous speed of motion
Figure BDA0002294942390000054
Calculating the relative movement speed of the satellite node relative to the neighbor node b
Figure BDA0002294942390000055
S25, according to the relative movement speed
Figure BDA0002294942390000056
And the position coordinates of the satellite node and the neighbor node b, calculating the link survival time of the satellite node and the neighbor node b:
Figure BDA0002294942390000057
wherein, tabThe link survival time of the satellite node and the neighbor node b is set; r is the maximum communication distance of the satellite nodes;
Figure BDA0002294942390000058
the relative distance between the neighbor node b and the satellite node when receiving the Hello packet message for the second time; point a is satellite node at t2Position of time, point b is neighbor node at t2The position of the time; the point c is a foot which is perpendicular to the relative motion track of the satellite node from the neighbor node b,
Figure BDA0002294942390000059
α is the included angle formed by the connection line of the neighboring node b and the satellite node and the relative motion direction of the satellite node when the neighboring node b receives the Hello packet message of the satellite node for the second time.
In step S3, the MPR node of the satellite node is selected to join the MPR set, and the 2-hop neighbor node having the only path with the satellite node and the 1-hop neighbor node selected as the MPR node are deleted from the temporary network topology a in the initial state which is the same as the satellite ad-hoc network topology.
Taking the network topology shown in fig. 3 as an example, the 2-hop neighbor node having a unique path with the satellite node in step S3 is explained, in fig. 3, node f is reached only through node c, and then node f is the 2-hop neighbor node having a unique path with the satellite node.
In an embodiment of the present invention, the adding the MPR node of the selected satellite node into the MPR set further includes:
in step a1, judging whether a satellite node and its 2-hop neighbor node in the satellite self-organizing network topology map have a 1-hop neighbor node with a unique path; if yes, entering step A2, otherwise, entering step A4;
in the network topology shown in fig. 4, nodes d, c, and b are 1-hop neighbor nodes of the source node a, and nodes e, f, and g are 2-hop neighbor nodes of the source node a.
Taking the network topology shown in fig. 4 as an example, whether a 1-hop neighbor node having a unique path exists between a satellite node and a 2-hop neighbor node thereof is explained, in fig. 4, a node e satisfies that a 1-hop neighbor node b having a unique path with a source node a exists, so that the node b is a 1-hop neighbor node having a unique path between the satellite node and the 2-hop neighbor node thereof, and the 2-hop neighbor nodes covered by the node b are nodes e and f.
In step a2, a 1-hop neighbor node having a unique path between a satellite node and its 2-hop neighbor node is added into an MPR set as an MPR node, and the MPR node and all its covered 2-hop neighbor nodes are deleted in a temporary network topology B which is the same as the satellite ad-hoc network topology in the initial state.
In fig. 4, after node b is selected as MPR node, its covered 2-hop neighbor nodes e, f will be deleted, and when MPR node selection is continued, nodes b, e, f will not be considered any more.
In the step A3, determining whether all 2-hop neighbor nodes of the satellite node in the temporary network topology B are deleted, if yes, entering the step a7, otherwise, entering the step a 4;
continuing with the description of step A3 with reference to fig. 4, when the nodes b, e, and f are deleted, the source node a still has a 2-hop neighbor node g, and then proceeds to step a4 to continue MPR node selection.
In step a4, the reachability of all 1-hop neighbor nodes of the satellite nodes in the temporary network topology B is obtained, and whether the number of 1-hop neighbor nodes with the highest reachability is greater than 1 is judged, if yes, step a5 is performed, otherwise, the 1-hop neighbor nodes with the highest reachability are added into the MPR set as MPR nodes, and step a6 is performed;
the reachability refers to the number of next-hop neighbor nodes connected to the node, for example, the reachability of nodes b and c in fig. 4 is 2, and the reachability of node d is 1.
As can be further described with reference to fig. 4 for step a4, after the nodes b, e, and f are deleted, only the nodes c and d remain in the 1-hop neighbor node of the source node a, as can be seen from fig. 4, the reachability of both nodes c and d is 1, and at this time, the reliability of the links acg and adg needs to be seen.
In step a5, according to the link lifetime of the 1-hop neighbor node and the satellite node with the highest reachability and the 2-hop neighbor node reachable therethrough, calculating the reliability of the 1-hop neighbor node with the highest reachability, adding the 1-hop neighbor node with the highest reliability as an MPR node into an MPR set, and entering step a 6;
wherein, the calculation formula of the reliability is as follows:
Figure BDA0002294942390000071
wherein LI is reliability; t is t1The link survival time of the satellite node and the 1-hop neighbor node is obtained; t is ti ′The link survival time of the 1-hop neighbor node and the ith 2-hop neighbor node covered by the 1-hop neighbor node is set; n is the reachability of a 1-hop neighbor node.
In step a6, deleting the MPR node and all the 2-hop neighbor nodes covered by the MPR node in the temporary network topology B, and determining whether all the 2-hop neighbor nodes of the satellite node in the temporary network topology B are deleted, if yes, entering step a7, otherwise, returning to step a 1;
in step a7, MPR node selection for the satellite node is completed.
In step S4, determining whether a 2-hop neighbor node exists in a 1-hop neighbor node of the satellite node in the temporary network topology a, if so, entering step S5, otherwise, outputting an MPR set;
in step S5, the 1-hop neighbor node is used as an alternative MPR backup node of the 2-hop neighbor node corresponding to the satellite node, and it is determined whether there are at least two alternative MPR backup nodes, if yes, step S6 is entered, otherwise, step S7 is entered;
in step S6, selecting the candidate MPR backup node with the highest reliability as the backup MPR node to join in the MPR set, deleting all the 2-hop neighbor nodes covered by the candidate MPR backup node in the temporary network topology a, and proceeding to step S8;
in step S7, selecting a unique candidate MPR backup node as a backup MPR node to join in the MPR set, deleting the 2-hop neighbor node covered by the temporary network topology a, and proceeding to step S8;
in step S8, it is determined whether the satellite node in the temporary network topology a has a 2-hop neighbor node, if yes, the process returns to step S4, otherwise, the MPR set with the backup MPR node is output.
After the alternative MPR nodes are introduced, the following problems existing in the traditional OLSR routing protocol when the traditional OLSR routing protocol is applied to the satellite ad hoc network can be solved:
link failure is caused by the frequently changed topology, and the MPR node cannot effectively broadcast the TC control packet message;
after the problem that the MPR node fails due to link breakage occurs, the method can only wait for the interaction of the Hello message again, re-form a neighbor table, and re-select the MPR node set, so that the problems of resource waste and operation efficiency reduction are caused.
In summary, after the alternative MPR node is selected, the backup MPR node can be used to continue broadcasting the TC control message after detecting the problem of link failure between the source node and the MPR node, so as to ensure the formation of the correct topology, and adapt to the practical application of the satellite ad hoc network.

Claims (5)

1. The MPR backup method based on the link lifetime is characterized by comprising the following steps:
s1, the satellite node periodically broadcasts the Hello grouping message and receives the Hello grouping message periodically broadcast from the neighbor node; the Hello packet message comprises a neighbor node of the satellite node, link state information, and a position coordinate and a timestamp when the message is sent;
s2, generating a neighbor table according to the Hello grouping messages of the satellite nodes and the neighbor nodes thereof, and then predicting the link survival time between each satellite node and the neighbor nodes thereof in the satellite self-organizing network;
s3, selecting an MPR node of a satellite node to join an MPR set, and then deleting a 2-hop neighbor node with a unique path with the satellite node and a 1-hop neighbor node selected as the MPR node in a temporary network topological graph A with the initial state identical to the self-organized network topological graph of the satellite;
s4, judging whether a 2-hop neighbor node exists in a 1-hop neighbor node of the satellite node in the temporary network topology graph A, if so, entering the step S5, otherwise, outputting an MPR set;
s5, taking the 1-hop neighbor node as an alternative MPR backup node of the 2-hop neighbor node corresponding to the satellite node, and judging whether at least two alternative MPR backup nodes exist, if so, entering the step S6, otherwise, entering the step S7;
s6, selecting the alternative MPR backup node with the highest reliability as a backup MPR node to be added into the MPR set, deleting all 2-hop neighbor nodes covered by the alternative MPR backup node in the temporary network topology graph A, and entering the step S8;
s7, selecting the only alternative MPR backup node as the backup MPR node to join the MPR set, deleting the 2-hop neighbor node covered by the temporary network topology graph A, and entering the step S8;
and S8, judging whether the satellite node in the temporary network topology graph A has a 2-hop neighbor node, if so, returning to the step S4, otherwise, outputting the MPR set with the backup MPR node.
2. The link lifetime-based MPR backup method of claim 1, wherein the selecting the MPR node of the satellite node to join the MPR set further comprises:
a1, judging whether a 1-hop neighbor node with a unique path exists between a satellite node and a 2-hop neighbor node in a satellite self-organizing network topological graph; if yes, entering step A2, otherwise, entering step A4;
a2, taking a 1-hop neighbor node with a unique path between a satellite node and a 2-hop neighbor node thereof as an MPR node to be added into an MPR set, and deleting the MPR node and all the 2-hop neighbor nodes covered by the MPR node in a temporary network topology graph B with the same initial state as the satellite self-organizing network topology graph;
a3, judging whether all 2-hop neighbor nodes of the satellite nodes in the temporary network topology graph B are deleted, if yes, entering the step A7, otherwise, entering the step A4;
a4, obtaining the reachability of all 1-hop neighbor nodes of the satellite nodes in the temporary network topology diagram B, judging whether the number of the 1-hop neighbor nodes with the highest reachability is greater than 1, if so, entering the step A5, otherwise, adding the 1-hop neighbor nodes with the highest reachability as MPR nodes into an MPR set, and entering the step A6;
a5, calculating the reliability of the 1-hop neighbor node with the highest arrival according to the 1-hop neighbor node and the satellite node with the highest arrival and the link survival time of the 2-hop neighbor node which can be reached through the satellite node, adding the 1-hop neighbor node with the highest reliability into an MPR set as an MPR node, and entering the step A6;
a6, deleting the MPR node and all the 2-hop neighbor nodes covered by the MPR node in the temporary network topology graph B, and judging whether all the 2-hop neighbor nodes of the satellite node in the temporary network topology graph B are deleted, if yes, entering the step A7, otherwise, returning to the step A1;
and A7, completing the MPR node selection of the satellite node.
3. The link lifetime-based MPR backup method of claim 1, wherein the reliability is calculated by the following formula:
Figure FDA0002294942380000031
wherein LI is reliability; t is t1The link survival time of the satellite node and the 1-hop neighbor node is obtained; t'iThe link survival time of the 1-hop neighbor node and the ith 2-hop neighbor node covered by the 1-hop neighbor node is set; n is the reachability of a 1-hop neighbor node.
4. The link lifetime-based MPR backup method of any of claims 1-3, wherein the method of predicting the link lifetime between each satellite node and the neighbor nodes comprises:
s21, the neighbor node b records the time t when it receives the Hello packet message broadcast by the satellite node twice1Time t2And the position coordinates of the satellite node when the satellite node broadcasts the Hello packet message continuously twice;
s22, the neighbor node b according to the received satellite node position coordinates and the time t1Time t2Calculating the instantaneous movement speed of the satellite node
Figure FDA0002294942380000032
S23 neighbor nodeb obtaining self t by extracting self track information1、t2The position information of two moments, and the instantaneous movement speed of the neighbor node b is calculated according to the position information and the time difference
Figure FDA0002294942380000033
S24, according to the instantaneous movement speed
Figure FDA0002294942380000034
And instantaneous speed of motion
Figure FDA0002294942380000035
Calculating the relative movement speed of the satellite node relative to the neighbor node b
Figure FDA0002294942380000036
S25, according to the relative movement speed
Figure FDA0002294942380000037
And calculating the link survival time of the satellite node and the neighbor node b.
5. The link lifetime-based MPR backup method of claim 4, wherein the link lifetime is calculated by the formula:
Figure FDA0002294942380000038
wherein, tabThe link survival time of the satellite node and the neighbor node b is set; r is the maximum communication distance of the satellite nodes;
Figure FDA0002294942380000039
the relative distance between the neighbor node b and the satellite node when receiving the Hello packet message for the second time; point a is satellite node at t2Position of time, point b being adjacentAt node t2The position of the time; the point c is a foot which is perpendicular to the relative motion track of the satellite node from the neighbor node b,
Figure FDA0002294942380000041
α is the included angle formed by the connection line of the neighboring node b and the satellite node and the relative motion direction of the satellite node when the neighboring node b receives the Hello packet message of the satellite node for the second time.
CN201911197117.2A 2019-11-29 2019-11-29 MPR backup method based on link lifetime Expired - Fee Related CN110943926B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911197117.2A CN110943926B (en) 2019-11-29 2019-11-29 MPR backup method based on link lifetime

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911197117.2A CN110943926B (en) 2019-11-29 2019-11-29 MPR backup method based on link lifetime

Publications (2)

Publication Number Publication Date
CN110943926A true CN110943926A (en) 2020-03-31
CN110943926B CN110943926B (en) 2021-03-23

Family

ID=69909315

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911197117.2A Expired - Fee Related CN110943926B (en) 2019-11-29 2019-11-29 MPR backup method based on link lifetime

Country Status (1)

Country Link
CN (1) CN110943926B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111865778A (en) * 2020-06-24 2020-10-30 北京邮电大学 Satellite laser link periodic interruption solution method and device based on time labels
CN114430580A (en) * 2022-02-10 2022-05-03 西南科技大学 Unmanned aerial vehicle relay node optimization method and device and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102802228A (en) * 2012-08-23 2012-11-28 西北工业大学 AdHoc network multipath routing method oriented to link stability
WO2014167550A2 (en) * 2013-04-12 2014-10-16 Selex Es S.P.A. Two-level routing communication method for a manet network, network node and mobile network implementing this communication method
CN105007570A (en) * 2015-06-19 2015-10-28 北京理工大学 Mobile ad-hoc network congestion control method based on OLSR protocol
CN105407516A (en) * 2015-10-23 2016-03-16 中国人民解放军总参谋部第六十三研究所 Multi-hop ad-hoc-network anti-interference routing method based on link quality factor
CN106658635A (en) * 2016-11-03 2017-05-10 东莞理工学院 Hierarchical routing method based on service quality in wireless multi-hop network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102802228A (en) * 2012-08-23 2012-11-28 西北工业大学 AdHoc network multipath routing method oriented to link stability
WO2014167550A2 (en) * 2013-04-12 2014-10-16 Selex Es S.P.A. Two-level routing communication method for a manet network, network node and mobile network implementing this communication method
CN105007570A (en) * 2015-06-19 2015-10-28 北京理工大学 Mobile ad-hoc network congestion control method based on OLSR protocol
CN105407516A (en) * 2015-10-23 2016-03-16 中国人民解放军总参谋部第六十三研究所 Multi-hop ad-hoc-network anti-interference routing method based on link quality factor
CN106658635A (en) * 2016-11-03 2017-05-10 东莞理工学院 Hierarchical routing method based on service quality in wireless multi-hop network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
FADLALLAH CHBIB，等: ""Improvement of OLSR Protocol by Using Bacis Up MPR and Routing Table Mechanisms"", 《2018 INTERNATIONAL ARAB CONFERENCE ON INFORMATION TECHNOLOGY (ACIT)》 *
刘伟: ""基于链路预测的移动自组织网络路由协议研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑 2011年第04期》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111865778A (en) * 2020-06-24 2020-10-30 北京邮电大学 Satellite laser link periodic interruption solution method and device based on time labels
CN114430580A (en) * 2022-02-10 2022-05-03 西南科技大学 Unmanned aerial vehicle relay node optimization method and device and storage medium
CN114430580B (en) * 2022-02-10 2024-04-02 西南科技大学 Unmanned aerial vehicle relay node optimization method, unmanned aerial vehicle relay node optimization device and storable medium

Also Published As

Publication number Publication date
CN110943926B (en) 2021-03-23

Similar Documents

Publication Publication Date Title
CN110995599B (en) Satellite self-organizing network route anti-damage method based on link survival time
Jain et al. Geographical routing using partial information for wireless ad hoc networks
CN106888490B (en) Routing method and device of wireless ad hoc network
US7362727B1 (en) Telecommunications routing
US20040125795A1 (en) Telecommunications routing
CN103200642B (en) A kind of optimization method of mobile radio network Route Selection
WO2017020619A1 (en) Routing method and device
CN110943926B (en) MPR backup method based on link lifetime
Vijayakumar et al. Efficient location management of mobile node in wireless mobile ad-hoc network
CN110831006B (en) Ad hoc network system and data transmission method thereof
Choi et al. Local flooding-based on-demand routing protocol for mobile ad hoc networks
Sharma et al. A contemporary proportional exploration of numerous routing protocol in VANET
Mahajan et al. Event driven dynamic path optimization for AODV in MANET
Latiff et al. Power reduction quadrant-based directional routing protocol (Q-DIR) in mobile ad hoc network
Gruber et al. Ad hoc routing for cellular coverage extension
CN114390631A (en) Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction
KR20060114592A (en) Method for decision of greedy packet forwarding path in wireless networks
JP2005229624A (en) Routing method based on cost utilizing back-off technique
Banik et al. Design of QoS Routing Framework based on OLSR Protocol
CN106973422B (en) Improved algorithm of DSR protocol
Naushad et al. Analyzing link connectivity to ensure faster failure detection for qos routing in manets: A peculiar outline
EP1269689A1 (en) Telecommunications routing
CN114598638B (en) Multi-path mixed route establishing method applied to peer-to-peer underwater sound multi-hop network
KR20120034433A (en) Multipath maintenance method for mobile ad hoc networks using node position information
Malhotra et al. Analysing geographic based routing protocols in MANETs

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20210323

CF01 Termination of patent right due to non-payment of annual fee