CN104837173B - A kind of metropolitan area Vehicular communication system of band parking node - Google Patents
A kind of metropolitan area Vehicular communication system of band parking node Download PDFInfo
- Publication number
- CN104837173B CN104837173B CN201510241792.6A CN201510241792A CN104837173B CN 104837173 B CN104837173 B CN 104837173B CN 201510241792 A CN201510241792 A CN 201510241792A CN 104837173 B CN104837173 B CN 104837173B
- Authority
- CN
- China
- Prior art keywords
- node
- road
- vanet
- metropolitan area
- central
- 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
Links
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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of metropolitan area Vehicular communication systems of band parking node, the system is based on network simulator NS2-2.29 and traffic flow generates software VanetMobiSim-1.1 platform, utilize VC6.0++, Tcl scripting language, ask metalanguage, which is combined, to be write, it is characterized by: the system is a kind of vehicular ad hoc network connection strategy of band parking node for the purpose of establishing high-efficiency vehicle-mounted communications platform, overcome the deficiency of traditional VANET intermittent connectivity, enhance metropolitan area VANET connectivity in terms of increasing the effective node of network and judging branch availability two, to realize that high-efficiency vehicle-mounted communication provides a topological robust in metropolitan area, the network connectivity mechanism of fast convergence, reduce high packet loss caused by random addition or the reactive power optimization as vehicle node Rate problem.
Description
Technical field
The present invention relates to a kind of metropolitan area Vehicular communication systems of band parking node, are suitable for urban transportation and drive a vehicle, belong to intelligence
It can the field traffic system (ITS).
Background technique
Vehicular ad hoc network (Vehicular Ad hoc Network, VANET) technical research is it is assumed that network environment is complete
It is carried out in the case where connection, but actually VANET connection situation usually has unstability, especially in density regions
Interior, communication connection has contingency and randomness.Be embodied in two extreme features: when traffic density is big, VANET is showed
For full-mesh network；When region traffic density is small, VANET shows as the network of intermittent communication.It may be without foot in certain roads
Enough vehicles support multi-hop transmission, and part of nodes is caused to be divided into isolated network or isolated node.And vehicle node is not necessarily to
Give advance notice continually, dynamically access and leave network, at this time network connection have height unreliability.
In the prior art, typical represent is Military Ad, field tracking transducer network and planetary networks, he
To delay tolerant network (Delay Tolerant Network, DTN) and opportunistic network (Opportunistic
Networking, ON) propositions of two kinds of network morphologies alleviates the intermittent connectivity of VANET, but its node to a certain extent
Between there is also unstable end to end connection；And experiments have shown that: when node speed reaches 100km/h, link is able to maintain that
A possibility that 15s only 57%.
The reason of causing intermittent communication network environment is various.Firstly, the movement of vehicle node have regularity and
High-speed mobility, which results in VANET topological structures frequently to change, and link circuit condition is unstable and the asymmetry of wireless channel
The problems such as；Again, city high density groups of building, city road planning, vehicle relative velocity and driver's random behavior etc. are all shadows
Ring the environmental factor of connectivity.
For the deficiency of traditional VANET, it is desirable that design a kind of Vehicular communication system that metropolitan area connection can ensure.
Summary of the invention
The present invention has that city road crossing positioning is inaccurate, routing is empty for tradition VANET, provides
A kind of Vehicular communication system that the metropolitan area connection of band parking node can ensure.For vehicular ad hoc network emulation, vehicle is mobile
Need to combine Macro mobility and microcosmic in model (vehicular mobility model) simulating vehicle motion process
Mobility.
A kind of metropolitan area Vehicular communication system of band parking node of the present invention is based on network simulator NS2-2.29 and traffic
Stream generate software VanetMobiSim-1.1 platform, combined using VC6.0++, Tcl scripting language, ask metalanguage write and
At, it is characterised in that: the system is a kind of the vehicle-mounted from group of band parking node for the purpose of establishing high-efficiency vehicle-mounted communications platform
Net connection strategy, overcomes the deficiency of traditional VANET intermittent connectivity, from the increase effective node of network and judges branch availability
Two aspects enhance metropolitan area VANET connectivity.
Metropolitan area Vehicular communication system with parking node establishes model with greedy algorithm, proposes a kind of preferential based on angle
Geographical location algorithm, by introducing center stationary nodes in the algorithm, effective node in Lai Zengjia network enhances branch
Connectivity and availability.
Traffic flow generates software Vanet-MobiSim-1.1 for completing the networking to entire metropolitan area interval VANET, node
Type, Topology g eneration, graphic software platform.
Parking node is introduced into interval VANET, parking node, mobile node and stationary nodes is made to realize VANET's jointly
Information receives, processing, broadcasts and forward, and larger promotion VANET is in end-to-end delay, normalization routing cost and package delivering rate.
The route recovery mechanism based on upper hop stationary nodes is proposed on the VANET chain road with parking forwarding mechanism, from
And avoid source node routing and re-initiate mechanism, solve the problems, such as that link breakdown is frequent in interval VANET.
A kind of working method of the metropolitan area Vehicular communication system of band parking node, including the following steps:
Step 1: when source vehicle node S needs to send data packet to purpose vehicle node D, source node S is first in neighbours
Search whether there is the IP of destination node in list, and if so, directly transmitting, whole process terminates；Otherwise, 2 are gone to step:
Step 2: if destination node is not present in neighbor node table, first searching in its neighbor list whether there is to purpose section
Central node on point direction.If so, then sending data packets to central node, 3 are gone to step, otherwise according to greedy algorithm,
Neighbor node appropriate is sent data packets to, steps 1 and 2 are repeated；
Step 3: when data forward a packet to a central node Ii(Xi, Yi) after, first search for the neighbor node of the central node
Table whether there is destination node.If it exists, then it directly forwards；Otherwise following steps are executed: calculating mesh first, in accordance with following formula
Mark the line angle of node and the central node:
According to the crossing road angle recorded in the road angle table of central node i, calculate=|? i|,
It is determined for data packet to be sent to which road by the value of θ:
If a, certain road =0o selects the road, goes to step 4；
If b, not having The road of=0o, selection Road in the section (0o, 90o), such road may be big
In 1, road how is chosen depending on far-reaching probe method.Central node application central detector method obtains each branch delayed data,
It determines the best branch of link patency, goes to step 4；
Step plays 4: after road direction is selected, data packet is sent according to greediness forwarding and periphery pass-through mode, until data packet
It is forwarded to destination node, entire repeating process terminates.
Parking node is added in VANET and participates in multi-hop transmission by the present invention, on the one hand the VANET that parking node is added is alleviated
The intermittent connectivity of VANET, ensure that routing and the normal transmitting of data；On the other hand it can reduce or be detached from cost construction
V2I traffic model in fixation roadside unit.
Detailed description of the invention
Fig. 1 is VANET schematic diagram of the present invention.
Fig. 2 is the far-reaching probe method schematic diagram of the present invention.
Fig. 3 is present invention band/VANET schematic diagram without parking forwarding mechanism.
Specific embodiment
There is a situation where that city road crossing positioning is inaccurate, routing is empty for traditional VANET, in each cross
Crossing introduces stationary nodes, as shown in Figure 1.The core of the stationary nodes be with storage, forwarding, settlement capability it is wireless
Transceiver.Stationary nodes determine alternative forward-path first with the angle information in prior preservation center neighbor table；
In alternative forward-path, far-reaching probe algorithm (Far-reachingDetection is proposed according to the present invention
Method, FDM), as shown in Figure 2.Stationary nodes IiHandshake message, which is sent, by the period obtains simultaneously real-time update IiTo Ii+xProlong
When information, select the preferably final forward-path of delay performance；
Band as shown in Figure 3/the VANET without parking forwarding mechanism, S, M, D are mobile node, and A, B, C, F are to park section
Point, S are source node, and D is purpose node.The one of mobile node M jumps nothing in communication range and appoints in VANET with parking forwarding mechanism
What mobile node, the stationary node to park cars there is only four park the multi-hop between node A, F auxiliary completion node S, D
Communication.And path connected is poor in the VANET shown in right figure without parking mechanism, is finally unable to complete between node S, D
Communication.When source vehicle node S needs to send data packet to purpose vehicle node D, work step is forwarded are as follows:
(1) source node S searches for the IP with the presence or absence of destination node first in neighbor list, and if so, directly sending out
It send, whole process terminates；Otherwise, 2 are gone to step.
(2) if destination node is not present in neighbor node table, first searching in its neighbor list whether there is to destination node
Central node on direction.If so, then sending data packets to central node, (3) are gone to step；Otherwise according to greedy algorithm,
Neighbor node appropriate is sent data packets to, steps 1 and 2 are repeated.
(3) when data forward a packet to a central node Ii(Xi, Yi) after, first search for the neighbor node table of the central node
With the presence or absence of destination node.If it exists, then it directly forwards；Otherwise following steps are executed: calculating target first, in accordance with following formula
The line angle of node and the central node:
According to the crossing road angle recorded in the road angle table of central node i, calculate=|? i|,
It is determined for data packet to be sent to which road by the value of θ:
If a, certain road =0o selects the road, goes to step 4；
If b, not having The road of=0o, selection Road in the section (0o, 90o), such road may be big
In 1, road how is chosen depending on far-reaching probe method.Central node application central detector method obtains each branch delayed data,
It determines the best branch of link patency, goes to step 4.
(4) after road direction is selected, data packet is sent according to greediness forwarding and periphery pass-through mode, until data packet forwards
To destination node, entire repeating process terminates.
The present invention also provides one kind to generate software VanetMobiSim- based on network simulator NS2-2.29 and traffic flow
1.1 platforms are combined using VC6.0++, Tcl scripting language, ask metalanguage and are write, can in conjunction with Awk metalanguage
The effectively stability and robustness of verifying metropolitan area Vehicular communication system, overcomes the deficiency of traditional VANET intermittent connectivity, from increasing
The effective node of screening network and judge the aspect enhancing metropolitan area VANET connectivities of branch availability two, for chain in interval VANET
Road is broken frequent problem, proposes the route recovery mechanism based on upper hop stationary nodes, again so as to avoid source node routing
Initiation mechanism.
Claims (1)
1. a kind of working method of the metropolitan area Vehicular communication system of band parking node, which is characterized in that the metropolitan area with parking node
Vehicular communication system establishes model with greedy algorithm, proposes the geographical location algorithm preferential based on angle, passes through in the algorithm and draw
Enter center stationary nodes, effective node in Lai Zengjia network enhances the connectivity and availability of branch；Specifically band/without parking
The VANET of forwarding mechanism, S, M, D are mobile node, and A, B, C, F are to park node, and S is source node, and D is purpose node, and band stops
The one of mobile node M jumps in communication range without any mobile node in the VANET of vehicle forwarding mechanism, and there is only four to park cars
Stationary node, park node A, F auxiliary complete node S, D between multi-hop communication；Road connects in the VANET of no parking mechanism
The general character is poor, the communication being finally unable to complete between node S, D；When source vehicle node S needs to send number to purpose vehicle node D
When according to packet, work step is forwarded are as follows:
Step 1: when source vehicle node S needs to send data packet to purpose vehicle node D, source node S is first in neighbor list
Middle search whether there is the IP of destination node, and if so, directly transmitting, whole process terminates；Otherwise, 2 are gone to step:
Step 2: if destination node is not present in neighbor node table, first searching in its neighbor list whether there is to destination node side
Upward central node；
If so, then sending data packets to central node, 3 are gone to step, otherwise according to greedy algorithm, is sent data packets to suitable
When neighbor node, repeat steps 1 and 2；
The step 3: when data forward a packet to a central node Ii(Xi, Yi) after, first search for the neighbor node of the central node
Table whether there is destination node；
If it exists, then it directly forwards；Otherwise following steps are executed: calculating destination node and the centromere first, in accordance with following formula
The line angle of point:
According to the crossing road angle recorded in the road angle table of central node i, calculate=|? i|, by θ's
Value determines data packet being sent to which road:
If a, certain road =0o selects the road, goes to step 4；
If b, not having The road of=0o, selection Road in the section (0o, 90o), such road are likely larger than 1,
It chooses road and depends on probe method；
Central node application central detector method obtains each branch delayed data, determines the best branch of link patency, goes to step
4；
Step 4: after road direction is selected, data packet is sent according to greediness forwarding and periphery pass-through mode, until data packet forwards
To destination node, entire repeating process terminates；
In alternative forward-path, according to far-reaching probe algorithm, central node IiIt is obtained by period transmission handshake message and real
Shi Gengxin IiTo Ii+xDelayed data, select the preferably final forward-path of delay performance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510241792.6A CN104837173B (en) | 2014-12-14 | 2015-05-13 | A kind of metropolitan area Vehicular communication system of band parking node |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410762886 | 2014-12-14 | ||
| CN2014107628863 | 2014-12-14 | ||
| CN201510241792.6A CN104837173B (en) | 2014-12-14 | 2015-05-13 | A kind of metropolitan area Vehicular communication system of band parking node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104837173A CN104837173A (en) | 2015-08-12 |
| CN104837173B true CN104837173B (en) | 2019-04-05 |
Family
ID=53814747
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510241792.6A Active CN104837173B (en) | 2014-12-14 | 2015-05-13 | A kind of metropolitan area Vehicular communication system of band parking node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104837173B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107025732A (en) * | 2017-04-28 | 2017-08-08 | 上海斐讯数据通信技术有限公司 | Bicycle parking management system and bicycle parking method |
| CN107920335B (en) * | 2017-10-30 | 2020-12-11 | 湘潭大学 | Networking and communication method of intelligent street lamp |
| CN108040327A (en) * | 2017-11-01 | 2018-05-15 | 深圳市金溢科技股份有限公司 | Message relay method, car-mounted terminal, automobile and intelligent transport system |
| CN110809254A (en) * | 2019-10-29 | 2020-02-18 | 天津大学 | Parking area-based spider web routing protocol in urban VANET |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6304556B1 (en) * | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
| CN102802121A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions |
| CN103326942A (en) * | 2013-06-19 | 2013-09-25 | 华南理工大学 | Reliable routing protocol used for vehicle-mounted Ad Hoc network |
| CN103634871A (en) * | 2013-01-05 | 2014-03-12 | 北京邮电大学 | Connection and distance balancing VANET (Vehicular Ad Hoc Network) geographical routing protocol |
-
2015
- 2015-05-13 CN CN201510241792.6A patent/CN104837173B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6304556B1 (en) * | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
| CN102802121A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions |
| CN103634871A (en) * | 2013-01-05 | 2014-03-12 | 北京邮电大学 | Connection and distance balancing VANET (Vehicular Ad Hoc Network) geographical routing protocol |
| CN103326942A (en) * | 2013-06-19 | 2013-09-25 | 华南理工大学 | Reliable routing protocol used for vehicle-mounted Ad Hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104837173A (en) | 2015-08-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Oubbati et al. | UVAR: An intersection UAV-assisted VANET routing protocol | |
| CN106961707B (en) | Multifactor decision making Routing Protocol based on connectivity in a kind of VANET | |
| Jerbi et al. | GyTAR: improved greedy traffic aware routing protocol for vehicular ad hoc networks in city environments | |
| CN105307232B (en) | Routing optimization method based on connection probability for vehicle-mounted self-organizing network | |
| CN102137462B (en) | Prediction-based routing method at intersection in vehicle self-organizing network | |
| CN105208616B (en) | Adaptive more copy method for routing based on road topology in vehicular ad hoc network | |
| Ji et al. | Efficient and reliable cluster‐based data transmission for vehicular ad hoc networks | |
| CN105722176A (en) | Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene | |
| CN103281742B (en) | Road information vehicular ad hoc network method for routing is obtained based on autonomous | |
| Frank et al. | TrafRoute: A different approach to routing in vehicular networks | |
| CN104837173B (en) | A kind of metropolitan area Vehicular communication system of band parking node | |
| CN102769888A (en) | Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol | |
| CN109640369B (en) | Vehicle-mounted network reliable communication method based on adaptive power | |
| CN105407517B (en) | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| Chang et al. | An energy-efficient geographic routing protocol design in vehicular ad-hoc network | |
| Hashemi et al. | Load balanced VANET routing in city environments | |
| CN104618979A (en) | Adaptive partition routing method based on cross aiding | |
| CN103781141A (en) | Unicast routing forwarding method of vehicle ad-hoc network, chip and a communication system | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| Zhao et al. | A vehicle density and load aware routing protocol for VANETs in city scenarios | |
| CN104185239A (en) | Intersection routing method in vehicle self-organized network on the basis of path segment length | |
| Yang et al. | Comparison and evaluation of routing protocols based on a collaborative simulation using SUMO and NS3 with TraCI | |
| Wu et al. | MEDAL: A moving direction and destination location based routing algorithm for vehicular ad hoc networks | |
| Sukumaran et al. | Intersection based traffic aware routing in VANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |