CN107148063B - Selection method for predicting candidate relay node based on anchor node reliable routing protocol - Google Patents

Selection method for predicting candidate relay node based on anchor node reliable routing protocol Download PDF

Info

Publication number
CN107148063B
CN107148063B CN201710275605.5A CN201710275605A CN107148063B CN 107148063 B CN107148063 B CN 107148063B CN 201710275605 A CN201710275605 A CN 201710275605A CN 107148063 B CN107148063 B CN 107148063B
Authority
CN
China
Prior art keywords
node
relay node
current relay
link
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.)
Active
Application number
CN201710275605.5A
Other languages
Chinese (zh)
Other versions
CN107148063A (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN201710275605.5A priority Critical patent/CN107148063B/en
Publication of CN107148063A publication Critical patent/CN107148063A/en
Application granted granted Critical
Publication of CN107148063B publication Critical patent/CN107148063B/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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/025—Services making use of location information using location based information parameters
    • H04W4/027—Services making use of location information using location based information parameters using movement velocity, acceleration information
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a method for selecting a predicted candidate relay node in a reliable routing protocol based on an anchor node, which comprises the following steps: step 1: the current relay node determines the vehicle closest to the destination as the next relay node, and calculates the life cycle of the link; step 2: position prediction is carried out on neighbor nodes of the current relay node; and step 3: judging whether the neighbor node leaves the communication range of the current relay node in the link life cycle, if not, the current relay node sends an unblocked message to the initial anchor node; if the current relay node leaves, the current relay node sends a blocking message to the initial anchor node, and the anchor node immediately selects another shortest path; and 4, step 4: before the life time of the link expires, the initial anchor node is maintained, and once the current relay node is no longer blocked, the non-blocking state of the current relay node in the anchor node is recovered. The invention can optimize the defects of the link quality based on the greedy algorithm and effectively increase the stability of the link.

Description

Selection method for predicting candidate relay node based on anchor node reliable routing protocol
Technical Field
The invention belongs to the technical field of communication, relates to a reliable routing protocol technology based on an anchor node, and particularly relates to a selection method for predicting candidate relay nodes.
Background
With the rapid increase of national economy in China, the vigorous development of automobile manufacturing industry is driven, and the increase of vehicles causes road traffic jam and frequent traffic accidents, so that traffic management faces more and more serious problems. To solve these problems, an Intelligent Transportation System (ITS) concept has come to be developed. The ITS system applies modern high and new technologies such as detection, satellite communication, intelligent control, GPS and the like to a traditional traffic transportation management system so as to improve the road congestion condition, improve the energy utilization rate and prevent traffic accidents.
Internet of Vehicles (IoV) is a typical application of Internet of things (IoT) in ITS, and it is based on Vehicle Area Network (VAN) and vehicle Ad Hoc Networks (VANETs) technologies to implement networking and communication inside and between Vehicles and external communication devices. The VANETs is a multi-hop self-organizing system using vehicles as nodes, and is an application of a Mobile Ad hoc Network (MANET) in a real traffic environment. The basic idea is that vehicles in a certain communication range can exchange information such as vehicle speed and position and data sensed by vehicle-mounted sensors mutually, and automatically connect to establish a mobile network.
VANETs have high mobility and a changing topology and therefore VANETs will experience frequent network fragmentation resulting in very short communication durations. Most of the research on VANETs to date has focused mainly on analyzing routing protocols and handling broadcast storm problems in high density network topologies. Currently, Routing protocols in VANETs can be mainly classified into three categories, (1) Topology based Routing protocols (TBR); (2) position based Routing Protocol (PBR); (3) map based routing protocol (MBR). The routing protocol based on the position has stronger adaptability to frequent changes of network topology, and compared with the routing protocol based on a topological structure, routing table information does not need to be maintained, and related routing information does not need to be stored, so the routing protocol based on the position is more suitable for being used in a vehicle-mounted self-organizing network.
However, the above routing protocols do not solve the problem of network disruption for developing a network topology that can support a high degree of diversity, and it is therefore crucial how to obtain a more reliable and efficient routing protocol. In view of the real-world situation, in order to reduce the frequency of routing failures and data loss while maintaining a low routing overhead, it is objectively necessary to establish a more robust route between a source node and a destination node.
Disclosure of Invention
The present invention aims to solve the above-mentioned network outage problem in the prior art and proposes a method of predicting candidate relay nodes, where a current forwarding vehicle can identify a more reliable link by predicting the existence of candidate relay nodes after the link lifetime.
In order to achieve the above object, the technical solution adopted by the present invention is to provide a method for selecting a predicted candidate relay node in a reliable routing protocol based on an anchor node, which specifically includes the following steps:
step 1: the current relay node determines the vehicle closest to the destination as the next relay node, and calculates the life cycle of the link;
step 2: position prediction is carried out on neighbor nodes of the current relay node;
and step 3: judging whether the neighbor node leaves the communication range of the current relay node in the link life cycle, if not, the current relay node sends an unblocked message to the initial anchor node; if the current relay node leaves, the current relay node sends a blocking message to the initial anchor node, and the anchor node immediately selects another shortest path;
and 4, step 4: before the life time of the link expires, the initial anchor node is maintained, and once the current relay node is no longer blocked, the non-blocking state of the current relay node in the anchor node is recovered.
Further, in step 1, the method for calculating the lifetime of the link includes: let PnAnd PcRepresenting the newly selected relay node and the current relay node, respectively, each vehicle keeps track of its position, speed and direction of movement of the vehicle in its neighbour list, which is updated by Hello beacons exchanged by all neighbouring vehicles, using the information in the neighbour list, PcDetermining the vehicle closest to the destination as the next relay node PnAccording to PcAnd PnThe location and speed information of this link can be estimated by the following equation:
Figure BDA0001278374630000021
in the step 2, the method for predicting the position of the neighbor node includes:
Figure BDA0001278374630000022
Figure BDA0001278374630000023
by the formula (1) to PcThe position of the neighbor node i is predicted, and the neighbor node i and the neighbor node P at the moment are calculated by the formula (2)cIf D < R, the node P is indicatedcThe neighbor node i still moves in the range of R, and the selected street is not blocked; if D is larger than or equal to R, the node P is indicatedcIs not active within the range of R.
In step 3, the shortest path does not include a path having a block.
Compared with the prior art, the invention has the beneficial effects that:
1. according to the invention, by improving the selection of the GPSR based on the greedy algorithm, the defects of the link quality based on the greedy algorithm are optimized, and the stability of the link is increased.
2. The invention reduces the probability of route failure and data loss by predicting the possibility of path blocking in advance, and keeps lower route overhead.
Drawings
FIG. 1 is a model diagram of an occlusion occurrence;
FIG. 2 is a flow chart of a predictive node algorithm.
Detailed Description
The invention is described in further detail below with reference to the accompanying drawings.
Assuming that a Road Side Unit (RSU) is installed only at an intersection of a Road section, the RSU is called to be installed at an intersection of an anchor area, and the RSU is called an anchor node. Defining the segment between two anchor nodes as a street, this routing protocol requires selecting which streets to pass through in order to reach the destination node from the source node. Specifically, the shortest path is taken from the set of streets that are not congested.
Assume that in a road scenario, there is one anchor node for each intersection, and that all vehicles and anchors are equipped with their own Global Positioning System (GPS) and digital maps. The anchor node receives the data packet, generates the street closest to the destination using Dijkstra's algorithm, and forwards the packet to the vehicle on that street. If the anchor node finds that the selected street is blocked, the next street closest to the destination is selected. Fig. 1 shows a specific example:
an example scenario where a blockage occurs on the street closest to the destination (i.e., street 1). In this case, anchor node a, after receiving the blocking message from the relay node, will re-plan the next street 2 that is closest to the destination to which it is routed.
The following is a prediction algorithm of a candidate relay node, and a flow chart of the algorithm is shown in fig. 2:
the main variable descriptions in the algorithm are shown in table 1:
TABLE 1
Figure BDA0001278374630000041
1) Link lifetime estimation
PnAnd PcRespectively representing the newly selected relay node and the current relay node. Each vehicle keeps track of the position, speed and direction of movement of the vehicle in its neighbour list. The routing table is updated by Hello beacons exchanged by all neighboring vehicles. Using the information in the neighbor table, PcDetermining the vehicle closest to the destination as the next relay node PnAccording to PcAnd PnThe location and speed information of this link can be estimated as the lifetime lt _ expire of this link.
Figure BDA0001278374630000042
2) And (3) neighbor prediction:
Figure BDA0001278374630000043
Figure BDA0001278374630000044
by the formula (2) to PcThe position of the neighbor node i is predicted: calculating the neighbor nodes i and P at the moment by the formula (3)cIs measured.
If D < R, the node P is indicatedcIs still active within the range of R, the selected street is not blocked, and thus node P is not activecSending a message to the initial anchor point, P, without link rupturecContinuing to normally receive and send data;
if D is larger than or equal to R, the node P is indicatedcIs not active within R, and the selected street is congested, indicating that there is a link break on the selected street when the link lifetime is over. That is, the neighbor node i sends data that is not being sent by PnUpon reception, the neighbor node i itself has traveled away from the coverage of the vehicle transmission radius R. Node PcUpon receiving such information, the contained blocking message and P are sentnTo the start anchor node, which holds the lt _ expire information in the cache and selects another shortest street to deliver the information (not including the blocked street).
3) Anchor node maintenance
Before the expiration of lt _ expire, a predetermined interval is defined, P for each predetermined intervalcThen re-checking if D is greater than R, if D is less than R, then sending non-blocking message to initial anchor node, at this time the initial anchor node can remove P from high-speed buffercAnd restores the non-blocking status of the blocked street.
It should be noted that the above embodiments are only intended to illustrate the technical solution of the present invention and not to limit the same, and although the present invention has been described in detail by the above preferred embodiments, it should be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the present invention.

Claims (2)

1. The method for selecting the predicted candidate relay node in the reliable routing protocol based on the anchor node is characterized by comprising the following steps of:
step 1: the current relay node determines the vehicle closest to the destination as the next relay node and calculates the life cycle of the link, wherein the calculation method of the life cycle of the link comprises the following steps: let PnAnd PcRepresenting the newly selected relay node and the current relay node, respectively, each vehicle keeps track of its position, speed and direction of movement of the vehicle in its neighbour list, which is updated by Hello beacons exchanged by all neighbouring vehicles, using the information in the neighbour list, PcDetermining the vehicle closest to the destination as the next relay node PnAccording to PcAnd PnThe location and speed information of this link can be estimated by the following equation:
Figure FDA0002406292930000011
where lt _ expire represents the link lifetime, R represents the communication range, (x)n,yn) Indicating the newly selected relay node location, (x)c,yc) Indicating the current relay node location and,
Figure FDA0002406292930000012
(n _ dx, n _ dy) represents a velocity vector of the newly selected relay node,
Figure FDA0002406292930000013
(c _ dx, c _ dy) represents a velocity vector of the current relay node;
step 2: the method for predicting the position of the neighbor node comprises the following steps:
Figure FDA0002406292930000014
Figure FDA0002406292930000015
wherein, (nx)i,nyi) Representing prediction Pc(nb _ x) th neighbor node position of (n b _ x)i,nb_yi) Represents Pc(ii) the ith neighbor node position, (dx)i,dyi) Represents the velocity vector, lt _ expect represents the link lifetime, D represents the distance, (x)c,yc) Indicating a current relay node location;
by the formula (1) to PcThe position of the neighbor node i is predicted, and the neighbor node i and the neighbor node P at the moment are calculated by the formula (2)cIf D < R, the node P is indicatedcThe neighbor node i still moves in the range of R, and the selected street is not blocked; if D is larger than or equal to R, the node P is indicatedcThe neighbor node i of (2) does not move within the range of R;
and step 3: judging whether the neighbor node leaves the communication range of the current relay node in the link life cycle, if not, the current relay node sends an unblocked message to the initial anchor node; if the current relay node leaves, the current relay node sends a blocking message to the initial anchor node, and the anchor node immediately selects another shortest path;
and 4, step 4: before the life time of the link expires, the initial anchor node is maintained, and once the current relay node is no longer blocked, the non-blocking state of the current relay node in the anchor node is recovered.
2. The method of claim 1, wherein the shortest path in step 3 does not include a blocked path.
CN201710275605.5A 2017-04-25 2017-04-25 Selection method for predicting candidate relay node based on anchor node reliable routing protocol Active CN107148063B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710275605.5A CN107148063B (en) 2017-04-25 2017-04-25 Selection method for predicting candidate relay node based on anchor node reliable routing protocol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710275605.5A CN107148063B (en) 2017-04-25 2017-04-25 Selection method for predicting candidate relay node based on anchor node reliable routing protocol

Publications (2)

Publication Number Publication Date
CN107148063A CN107148063A (en) 2017-09-08
CN107148063B true CN107148063B (en) 2020-05-12

Family

ID=59774747

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710275605.5A Active CN107148063B (en) 2017-04-25 2017-04-25 Selection method for predicting candidate relay node based on anchor node reliable routing protocol

Country Status (1)

Country Link
CN (1) CN107148063B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109040950B (en) * 2018-06-15 2021-06-18 广州杰赛科技股份有限公司 Anchor point allocation scheme determining method and device and object positioning method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010044210A1 (en) * 2008-10-15 2010-04-22 パナソニック株式会社 Communication device and communication method
CN102255973A (en) * 2011-08-23 2011-11-23 江苏省邮电规划设计院有限责任公司 Routing method in vehicle wireless communication network and vehicle wireless communication network
CN102916889A (en) * 2012-09-29 2013-02-06 西安电子科技大学 Instant route selection based on multi-path communication time and credibility in VANET (Vehicular Ad-Hoc Network)

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010044210A1 (en) * 2008-10-15 2010-04-22 パナソニック株式会社 Communication device and communication method
CN102255973A (en) * 2011-08-23 2011-11-23 江苏省邮电规划设计院有限责任公司 Routing method in vehicle wireless communication network and vehicle wireless communication network
CN102916889A (en) * 2012-09-29 2013-02-06 西安电子科技大学 Instant route selection based on multi-path communication time and credibility in VANET (Vehicular Ad-Hoc Network)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
《基于城市道路实时信息的VANET动态路由协议》;司桂芳，赵海涛;《电信快报》;20131231;全文 *
VANET中路由协议分析;吴振华，胡鹏;《通信学报》;20151130;全文 *

Also Published As

Publication number Publication date
CN107148063A (en) 2017-09-08

Similar Documents

Publication Publication Date Title
Ullah et al. Advances in position based routing towards its enabled fog-oriented vanet–a survey
JP4908585B2 (en) Processing for routing data packets in a mobile node network and associated terminals
US7352750B2 (en) Mobile terminal, control device and mobile communication method
CN102255973B (en) Routing method in vehicle wireless communication network and vehicle wireless communication network
KR101197520B1 (en) Link mobility tracking method for mobile ad hoc network
Boukerche et al. Improving neighbor localization in vehicular ad hoc networks to avoid overhead from periodic messages
Darwish et al. Traffic aware routing in vehicular ad hoc networks: characteristics and challenges
Khan et al. A Traffic Aware Segment-based Routing protocol for VANETs in urban scenarios
Ahamed et al. Issues and challenges in VANET routing protocols
JP2006221286A (en) Communication device
Leal et al. Information-centric opportunistic data dissemination in vehicular ad hoc networks
Han et al. Speed and position aware dynamic routing for emergency message dissemination in VANETs
JP2009218922A (en) Wireless ad-hoc terminal and ad-hoc network system
WO2020215530A1 (en) Node performance-based opportunity forwarding method in internet of vehicles
Oubbati et al. On-demand routing for urban VANETs using cooperating UAVs
Rana et al. VANET: expected delay analysis for location aided routing (LAR) Protocol
CN107148063B (en) Selection method for predicting candidate relay node based on anchor node reliable routing protocol
KR101601774B1 (en) Routing method for vanet
KR100776327B1 (en) Method for dynamic load-balancing routing in radio mesh network
Brahmi et al. Routing in vehicular ad hoc networks: towards road-connectivity based routing
Stalin et al. A survey on topology and geography based routing protocols in vanets
Al-Mayouf et al. Efficient routing algorithm for VANETs based on distance factor
Hassan et al. Geographic forwarding techniques: Limitations and future challenges in IVC
Saharan et al. QoS provisioning in VANETs using mobile agent
Garrosi Enhanced intersection-based perimeter geo-routing in urban vehicular ad-hoc networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant