CN104837173A - Metropolitan area vehicle-mounted communication system with parking node - Google Patents

Metropolitan area vehicle-mounted communication system with parking node Download PDF

Info

Publication number
CN104837173A
CN104837173A CN201510241792.6A CN201510241792A CN104837173A CN 104837173 A CN104837173 A CN 104837173A CN 201510241792 A CN201510241792 A CN 201510241792A CN 104837173 A CN104837173 A CN 104837173A
Authority
CN
China
Prior art keywords
node
vanet
road
metropolitan area
parking
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
CN201510241792.6A
Other languages
Chinese (zh)
Other versions
CN104837173B (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.)
No 750 Test Field of China Shipbuilding Industry Corp
Original Assignee
No 750 Test Field of China Shipbuilding Industry Corp
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 No 750 Test Field of China Shipbuilding Industry Corp filed Critical No 750 Test Field of China Shipbuilding Industry Corp
Priority to CN201510241792.6A priority Critical patent/CN104837173B/en
Publication of CN104837173A publication Critical patent/CN104837173A/en
Application granted granted Critical
Publication of CN104837173B publication Critical patent/CN104837173B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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 invention relates to a metropolitan area vehicle-mounted communication system with a parking node. The system is compiled throughVC6.0++, a Tcl script language and an ask analysis language in a combined way based on a network simulator NS2-2.29 and a traffic flow generation software VanetMobiSim-1.1 platform. The system is characterized in that a vehicle-mounted self-networking communication strategy carrying the parking node specific to the aim of establishing an efficient vehicle-mounted communication platform is adopted, so that the defect of intermittent connectivity in conventional VANET (Vehicular Ad hoc Network) is overcome; the metropolitan area VANET communication performance is enhanced from the aspects of increasing network effective nodes and judging the branch availability; a topologically-stable and quickly-convergent network connectivity mechanism is provided for the realization of efficient vehicle-mounted communication within a metropolitan area range; and the problem of high packet loss probability caused by random joining or exit behaviors of vehicle nodes is solved.

Description

A kind of metropolitan area Vehicular communication system with parking node
Technical field
The present invention relates to a kind of metropolitan area Vehicular communication system with parking node, be applicable to urban transportation driving, belong to intelligent transportation system (ITS) field.
Background technology
Vehicular ad hoc network (Vehicular Ad hoc Network, VANET) technical research carries out when hypothetical network environment full-mesh, but in fact VANET connection situation has unsteadiness usually, particularly in density regions, communication connection has contingency and randomness.Be embodied in two extreme features: VANET shows as full-mesh network when traffic density is large; When traffic density hour VANET in region shows as the network of intermittent communication.Enough vehicles may do not had in some road to support, and multi-hop forwards, and causes part of nodes to be divided into isolated network or isolated node.And vehicle node is without the need to giving advance notice continually, dynamically accessing and leave network, now network connects the unreliability with height.
In the prior art, typical representative is Military Ad, field tracking transducer network and planetary networks, they are to time delay tolerant network (Delay Tolerant Network, and opportunistic network (Opportunistic Networking DTN), ON) proposition of two kinds of network morphology alleviates the intermittent connectivity of VANET to a certain extent, but also there is unstable end to end connection between its node; And experiment proves: when node speed reaches 100km/h, the possibility that link can maintain 15s only has 57%.
The reason of intermittent communication network environment is caused to be many-sided.The problems such as first, the movement of vehicle node has regularity and high-speed mobility, which results in VANET topological structure frequent variations, the asymmetry of link circuit condition instability and wireless channel; Again, city high density groups of building, city road planning, vehicle relative velocity and driver's random behavior etc. are all the environmental factors of impact connectedness.
For the deficiency of traditional VANET, require that a kind of metropolitan area of design is communicated with the Vehicular communication system that can ensure.
Summary of the invention
The present invention is directed to traditional VANET there is the situation that city road crossing location is inaccurate, route is empty, providing a kind of metropolitan area with parking node to be communicated with the Vehicular communication system that can ensure.For vehicular ad hoc network emulation, need to take into account Macro mobility and microcosmic mobility in vehicle mobility model (vehicular mobility model) simulating vehicle motion process simultaneously.
A kind of metropolitan area Vehicular communication system with parking node of the present invention is that simulator NS2-2.29 Network Based and traffic flow generate software VanetMobiSim-1.1 platform, utilize VC6.0++, Tcl script, ask metalanguage combines to write and form, it is characterized in that: this system is communicated with strategy by a kind of vehicular ad hoc network with parking node set up for the purpose of high-efficiency vehicle-mounted communications platform, overcome the deficiency of traditional VANET intermittent connectivity, from increasing the effective node of network and judging enhancing metropolitan area, branch road availability two aspects VANET connectivity.
Metropolitan area Vehicular communication system with parking node is with greedy algorithm Modling model, propose a kind of geographical position algorithm preferential based on angle, by introducing center stationary nodes in this algorithm, increase effective node in network, enhance connectedness and the availability of branch road.
Traffic flow generates software Vanet-MobiSim-1.1 for completing networking to whole metropolitan area interval VANET, node type, Topology g eneration, graphic software platform.
Parking node is introduced interval VANET, make parking node, mobile node and stationary nodes jointly realize the receives information of VANET, process, broadcast and forwarding, larger liftings VANET is in end-to-end delay, normalization routing cost and throwing bag rate.
The VANET link of band parking forwarding mechanism proposes the route recovery mechanism based on upper hop stationary nodes, thus avoids source node route and again initiate mechanism, solve interval VANET link and to rupture frequent problem.
A method of work for metropolitan area Vehicular communication system with parking node, comprises following step:
Step 1: when source vehicle node S needs to send packet to object vehicle node D, first source node S searches for the IP that whether there is destination node in neighbor list, if existed, directly send, whole process terminates; Otherwise, go to step 2:
Step 2: if there is not destination node in neighbor node table, first search in its neighbor list and whether exist to the Centroid on destination node direction.If had, then by Packet Generation to Centroid, go to step 3, otherwise according to greedy algorithm, by Packet Generation to suitable neighbor node, repeat step 1,2;
Step 3: when packet is forwarded to a Centroid I i(X i, Y i) after, whether the neighbor node table first searching for this Centroid exists destination node.If exist, then directly forward; Otherwise execution following steps: first according to the line angle of following formulae discovery destination node and this Centroid:
According to this crossing road angle recorded in the road angle measuring gauge of Centroid i, calculate =| - i|, determine which bar road packet is mail to by the value of θ:
If a certain road =0o, selects this road, goes to step 4;
If b does not have the road of=0o, selects road in (0o, 90o) interval, such road may be greater than 1, how to choose road and depends on far-reaching probe method.Centroid application central detector method obtains each branch road delayed data, determines to go to step 4 by the branch road that link patency is best;
Step plays 4: after road direction is selected, and forward according to greediness and periphery pass-through mode transmission packet, until packet is forwarded to destination node, whole repeating process terminates.
The present invention adds parking node and participates in multi-hop forwarding in VANET, and VANET mono-aspect adding parking node alleviates the intermittent connectivity of VANET, ensure that the normal delivery of route and data; The fixing roadside unit in the V2I traffic model of cost construction can be reduced or depart from the other hand.
Accompanying drawing explanation
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 band of the present invention/without the VANET schematic diagram of parking forwarding mechanism.
Embodiment
For traditional VANET there is the situation that city road crossing location is inaccurate, route is empty, introduce stationary nodes in each crossroad, as shown in Figure 1.The core of this stationary nodes is the wireless transceiver with storage, forwarding, settlement capability.First stationary nodes utilizes the angle information in the neighbor table of prior preservation center to determine alternative forward-path;
In alternative forward-path, according to the present invention, far-reaching probe algorithm (Far-reachingDetection Method, FDM) is proposed, as shown in Figure 2.Stationary nodes I isend handshake message by the cycle to obtain and real-time update I ito I i+xdelayed data, select delay performance preferably final forward-path;
Band as shown in Figure 3/without the VANET of parking forwarding mechanism, S, M, D are mobile node, and A, B, C, F are for parking node, and S is source node, node for the purpose of D.In VANET with parking forwarding mechanism, one of mobile node M jumps without any mobile node in communication range, only there are four stationary nodes parked cars, and parks node A, F and has assisted multi-hop communication between node S, D.And poor without path connected in the VANET of parking mechanism shown in right figure, finally cannot complete the communication between node S, D.When source vehicle node S needs to send packet to object vehicle node D, its forwarding job step is:
(1) first source node S searches for the IP that whether there is destination node in neighbor list, if existed, directly send, whole process terminates; Otherwise, go to step 2.
(2) if there is not destination node in neighbor node table, first search in its neighbor list and whether exist to the Centroid on destination node direction.If had, then by Packet Generation to Centroid, go to step (3); Otherwise according to greedy algorithm, by Packet Generation to suitable neighbor node, repeat step 1,2.
(3) when packet is forwarded to a Centroid I i(X i, Y i) after, whether the neighbor node table first searching for this Centroid exists destination node.If exist, then directly forward; Otherwise execution following steps: first according to the line angle of following formulae discovery destination node and this Centroid:
According to this crossing road angle recorded in the road angle measuring gauge of Centroid i, calculate =| - i|, determine which bar road packet is mail to by the value of θ:
If a certain road =0o, selects this road, goes to step 4;
If b does not have the road of=0o, selects road in (0o, 90o) interval, such road may be greater than 1, how to choose road and depends on far-reaching probe method.Centroid application central detector method obtains each branch road delayed data, determines to go to step 4 by the branch road that link patency is best.
(4), after road direction is selected, forward according to greediness and periphery pass-through mode transmission packet, until packet is forwarded to destination node, whole repeating process terminates.
Present invention also offers a kind of simulator NS2-2.29 Network Based and traffic flow generation software VanetMobiSim-1.1 platform, utilize VC6.0++, Tcl script, ask metalanguage is combined to write and is formed, stability and the robustness of metropolitan area Vehicular communication system effectively can be verified again in conjunction with Awk metalanguage, overcome the deficiency of traditional VANET intermittent connectivity, from increasing the effective node of network and judging enhancing metropolitan area, branch road availability two aspects VANET connectivity, to rupture frequent problem for interval VANET link, route recovery mechanism based on upper hop stationary nodes is proposed, thus avoid source node route and again initiate mechanism.

Claims (9)

1. the metropolitan area Vehicular communication system with parking node, this system simulator NS2-2.29 Network Based and traffic flow generate software VanetMobiSim-1.1 platform, utilize VC6.0++, Tcl script, ask metalanguage combines to write and form, it is characterized in that: this system is communicated with strategy by a kind of vehicular ad hoc network with parking node set up for the purpose of high-efficiency vehicle-mounted communications platform, overcome the deficiency of traditional VANET intermittent connectivity, from increasing the effective node of network and judging enhancing metropolitan area, branch road availability two aspects VANET connectivity.
2. a kind of metropolitan area Vehicular communication system with parking node according to claim 1, it is characterized in that: the metropolitan area Vehicular communication system of band parking node is with greedy algorithm Modling model, propose a kind of geographical position algorithm preferential based on angle, by introducing center stationary nodes in this algorithm, increase effective node in network, enhance connectedness and the availability of branch road.
3. a kind of metropolitan area Vehicular communication system with parking node according to claim 1, is characterized in that: traffic flow generates software Vanet-MobiSim-1.1 for completing networking to whole metropolitan area interval VANET, node type, Topology g eneration, graphic software platform.
4. a kind of metropolitan area Vehicular communication system with parking node according to claim 1, it is characterized in that: parking node is introduced interval VANET, make parking node, mobile node and stationary nodes jointly realize the receives information of VANET, process, broadcast and forwarding, larger lifting VANET is at end-to-end delay, normalization routing cost and throw bag rate.
5. a kind of metropolitan area Vehicular communication system with parking node according to claim 1 or 4, it is characterized in that: on the VANET link of band parking forwarding mechanism, propose the route recovery mechanism based on upper hop stationary nodes, thus avoid source node route and again initiate mechanism, solve interval VANET link and to rupture frequent problem.
6. require the method for work of a kind of metropolitan area Vehicular communication system with parking node described in 1 according to power, it is characterized in that, comprise following step and play:
Step plays 1: when source vehicle node S needs to send packet to object vehicle node D, first source node S searches for the IP that whether there is destination node in neighbor list, if existed, directly send, whole process terminates; Otherwise, go to step 2:
Whether step plays 2: if there is not destination node in neighbor node table, first search in its neighbor list and exist to the Centroid on destination node direction.
If 7. had, then by Packet Generation to Centroid, go to step 3, otherwise according to greedy algorithm, by Packet Generation to suitable neighbor node, repeat step 1,2;
Step plays 3: when packet is forwarded to a Centroid I i(X i, Y i) after, whether the neighbor node table first searching for this Centroid exists destination node.
8. if exist, then directly forward; Otherwise execution following steps: first according to the line angle of following formulae discovery destination node and this Centroid:
According to this crossing road angle recorded in the road angle measuring gauge of Centroid i, calculate =| - i|, determine which bar road packet is mail to by the value of θ:
If a certain road =0o, selects this road, goes to step 4;
If b does not have the road of=0o, selects road in (0o, 90o) interval, such road may be greater than 1, how to choose road and depends on far-reaching probe method.
9. Centroid application central detector method obtains each branch road delayed data, determines to go to step 4 by the branch road that link patency is best;
Step plays 4: after road direction is selected, and forward according to greediness and periphery pass-through mode transmission packet, until packet is forwarded to destination node, whole repeating process terminates.
CN201510241792.6A 2014-12-14 2015-05-13 A kind of metropolitan area Vehicular communication system of band parking node Active CN104837173B (en)

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 true CN104837173A (en) 2015-08-12
CN104837173B 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)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107025732A (en) * 2017-04-28 2017-08-08 上海斐讯数据通信技术有限公司 Bicycle parking management system and bicycle parking method
CN107920335A (en) * 2017-10-30 2018-04-17 湘潭大学 A kind of networking of wisdom street lamp and communication means
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)

* Cited by examiner, † Cited by third party
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
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

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107025732A (en) * 2017-04-28 2017-08-08 上海斐讯数据通信技术有限公司 Bicycle parking management system and bicycle parking method
CN107920335A (en) * 2017-10-30 2018-04-17 湘潭大学 A kind of networking of wisdom street lamp and communication means
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

Also Published As

Publication number Publication date
CN104837173B (en) 2019-04-05

Similar Documents

Publication Publication Date Title
Chen et al. ASGR: An artificial spider-web-based geographic routing in heterogeneous vehicular networks
Jerbi et al. Towards efficient geographic routing in urban vehicular networks
CN102255973B (en) Routing method in vehicle wireless communication network and vehicle wireless communication network
CN105208616B (en) Adaptive more copy method for routing based on road topology in vehicular ad hoc network
CN102137462B (en) Prediction-based routing method at intersection in vehicle self-organizing network
CN105682046B (en) Interest package transmitting method in vehicle-mounted name data network based on data attribute
CN104135436B (en) A kind of vehicle self-organizing network route selection method
CN102802121B (en) Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions
Wang et al. TIBCRPH: traffic infrastructure based cluster routing protocol with handoff in VANET
Yu et al. A VANET routing based on the real-time road vehicle density in the city environment
CN105307232A (en) Routing optimization method for vehicular self-organized network based on connection probabilities
CN105722176A (en) Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene
CN103379575B (en) A kind of vehicle-mounted network route method that utilizes crossing static node auxiliary data to forward
Li et al. Improved AODV routing protocol for vehicular Ad hoc networks
CN105407517B (en) Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system
Tee et al. Survey of position based routing for inter vehicle communication system
Hashemi et al. Load balanced VANET routing in city environments
CN109640369A (en) A kind of vehicle-mounted net reliable communication method based on adaptive power
CN103781141A (en) Unicast routing forwarding method of vehicle ad-hoc network, chip and a communication system
CN104837173A (en) Metropolitan area vehicle-mounted communication system with parking node
CN106211260A (en) Based on positional information adaptive chance method for routing in a kind of car networking
Oubbati et al. IRTIV: Intelligent routing protocol using real time traffic information in urban vehicular environment
CN104835316B (en) Traffic flow density-based solution to problem of VANET sparse connectivity
Qureshi et al. An enhanced multi-hop intersection-based geographical routing protocol for the internet of connected vehicles network
Zhao et al. A vehicle density and load aware routing protocol for VANETs in city scenarios

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