CN103079250A - Internet of Things unicast data transmission method based on traffic density - Google Patents
Internet of Things unicast data transmission method based on traffic density Download PDFInfo
- Publication number
- CN103079250A CN103079250A CN2012105466899A CN201210546689A CN103079250A CN 103079250 A CN103079250 A CN 103079250A CN 2012105466899 A CN2012105466899 A CN 2012105466899A CN 201210546689 A CN201210546689 A CN 201210546689A CN 103079250 A CN103079250 A CN 103079250A
- Authority
- CN
- China
- Prior art keywords
- crossing
- vehicle
- highway section
- packet
- cost
- 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.)
- Pending
Links
Images
Landscapes
- Traffic Control Systems (AREA)
Abstract
The invention belongs to the technical field of wireless sensor network protocol, in particular to an Internet of Things unicast data transmission method based on traffic density. The method comprises the following steps of: calculating cost of a section according to two-way traffic density and section length information thereof on each section; combining an information source s position, a sink t position and a map to build an expander graph; obtaining a shortest path between each two nodes in a network from the expander graph; and end-to-end forwarding a unicast data packet section by section and hop by hop according to the calculated path.
Description
Technical field
The invention belongs to the Internet of Things communications field, relate to a kind of Internet of Things unicast data transmission method based on vehicle density, be used for vehicle from motion to fixed target node delivery data.Among the present invention, destination node and information destination node, the stay of two nights, three terms have identical implication.The computational methods of the end-to-end delivery cost of a kind of Internet of Things based on vehicle density have been proposed in this technology, and corresponding route selection algorithm based on cost.Use the success rate that this technology can transmit with data multi-hop in the limited expense Effective Raise Internet of Things and shorten end-to-end delivery time-delay.
Background technology
The Internet of Things that the present invention relates to refers in particular to the mobile ad hoc network that is formed by a plurality of vehicle self-organizings with vehicle-mounted short-range wireless communication apparatus.In Internet of Things, node motion speed is fast, and change in topology is frequent, and vehicle movement is retrained by urban road simultaneously, and these characteristics make Internet of Things significantly be different from general mobile wireless ad hoc networks network.Transfer of data in the Internet of Things can be passed through the wireless mode multi-hop transmission, also can pass through the vehicle carrying mode, also can " multi-hop mode ", " vehicle carries " dual mode hockets.
The Internet of Things routing algorithm that is comprised of vehicle at present can divide work three classes: based on the route in geographical position, based on the route of inundation with based on the route of telecommunication flow information.In the route based on the geographical position, packet sends in neighbours' vehicle vehicle near the target location by holding vehicle always.Under this routing mode, the local extreme points in the road topology, or sparse vehicle all can cause occurring in the data forwarding process not having the situation of available link, and therefore packet is delivered time-delay increases, or even abandons because of overtime.In the route based on inundation, packet is transmitted with direct diffusion way, the carrying vehicle and data copy can be copied to the vehicle of not yet holding arbitrarily this copy in neighbours' vehicle of packet.Can obtain higher delivery success rate and less delivery time-delay based on the route of inundation, but because network overhead is large, usually not be suitable for busy network.The study hotspot in Internet of Things route field in recent years based on the route of telecommunication flow information, the cost that such route is transmitted along the path multi-hop based on traffic flow information estimated data bag usually, thus data retransmission is carried out in the path of selecting to have less forwarding cost.In the existing routing algorithm based on telecommunication flow information, mostly require accurate real-time traffic stream information to be used for calculating the cost that road is transmitted, in highly dynamic road traffic environment, be difficult to obtain ideal effect, and higher computation complexity is generally arranged.
Summary of the invention
For overcoming the such scheme shortcomings and deficiencies, the present invention relates to a kind of Internet of Things unicast data transmission method of lightweight, by quantizing the highway section vehicle density, estimation highway section transmission cost and along the end-to-end transmission cost of different paths forwarding data bag is determined the selection foundation of next-hop node with as package forward the time.
The two-way wagon flow forwarding data of the utilization that the present invention relates to, the data that make the vehicle that possesses the short-distance wireless communication ability on the highway section can participate in any direction on this highway section send.Compare with the data retransmission mechanism that only relies on unidirectional wagon flow, more fully communication opportunity is arranged between vehicle, thereby improve the data delivery success rate, and shorten the data delivery time-delay.In addition, the present invention supposes that vehicle can obtain its current location by certain location technology (such as assembling GPS receiving equipment), and can obtain road real-time traffic flow density situation in the city or nearest historical statistical data information by electronic chart.Each node has the directional communication antenna, and the communication radius note of all nodes is R.In general, 50 meters to 200 meters of the spans of R.
A kind of Internet of Things unicast data transmission method based on vehicle density, according to the cost in two-way vehicle density on each highway section and this highway section of road section length information calculations thereof, and in conjunction with information source s position, stay of two nights t position and Map building expander graphs; Obtain each internodal shortest path in the network by this expander graphs; Unicast packet is pursued highway section, the end-to-end forwarding of hop-by-hop according to the path of calculating.
Described transmission method, during along shortest path forwarding data bag, the stage is transmitted in the highway section that comprises packet and the stage is transmitted at the crossing, during transmit in the highway section preferentially with package forward in the shortest path near the vehicle at down hop crossing; Preferentially will arrive the minimum and current crossing of all neighbours crossing path costs during transmit at the crossing has crossing that vehicle exercises to this neighbours crossing as the down hop crossing of package forward, and the minimum delivery cost of the stay of two nights is arrived at a crossing for this crossing apart from the delivery cost of the stay of two nights.
In the present invention, owing to only use the road-section average vehicle density to carry out path and link cost estimation, and in computational process, carried out quantification treatment, therefore lower to precision and the requirement of real-time of telecommunication flow information, reduced routing cost.On the other hand, because vehicle only needs data are mail to the neighbours crossing of relatively optimum (relatively minimum end-to-end path cost) at the place, crossing, therefore quantification mechanism of the present invention guarantees enough that in most of situation vehicle carries out correct forwarding decision.
Description of drawings
Fig. 1 is that data packet transmission is transmitted embodiment.
Embodiment
1) highway section cost computational methods:
The city road network topology model construction is become undirected weighted graph G (V, E), and each crossing is as a summit, the set at V (G) expression crossing, the set in E (G) expression highway section is then when crossing x and crossing y are adjacent intersection, (x, y) ∈ E (G) is arranged.
Make r
XyRepresent the vehicle density value on the highway section (x, y), L
XyRepresent the length in highway section (x, y), Num
XyRepresent the dual-way vehicle sum (comprise on the highway section (x, y), from crossing x to crossing y and all vehicles on from crossing y to crossing x both direction) in highway section (x, y), r is arranged
Xy=Num
Xy/ L
Xy
Suppose traffic density according to from dredging to the close N of a being divided into grade, set is { [0, r between corresponding density region
1], (r
1, r
2] ..., (r
N-2, r
N-1], (r
N-1, ∞) }, 0＜r
1＜r
2＜...,＜r
N-1＜∞, wherein r
1=r
2-r
1=r
3-r
2=...=r
N-1-r
N-2, will also number behind the traffic density information quantization on the road, note is done
Work as r
XyDuring ∈ [0, r1],
Work as r
Xy∈ (r
1, r
2] time,
Work as r
Xy∈ (r
N-1, in the time of ∞),
After the roading density information quantization, the highway section cost weights in each highway section (x, y) in the define grid are as follows:
2) based on the expansion drawing generating method of information source and the stay of two nights:
New expander graphs G ' is constructed in given information source s position and stay of two nights t position and based on the topological diagram G of flow, and concrete grammar is as follows:
●V(G’)=V(G),E(G’)=E(G)；
● if s is in certain highway section (x among the figure G, y) among, then add a new virtual crossing O in the s position, V (G ')=V (G ')+{ O}, E (G ')=E (G ')+{ (x, O), (O, y) }-{ (x, y) }, the union operation of "+" representative set wherein, "-" representative set subtract computing, r
XO=r
Oy=r
XyOtherwise, if information source s is in a certain crossing among the former figure G, at this moment, then directly this crossing is remembered as O;
● if t is among the figure G among certain highway section (i, j), then adds a new virtual crossing D in the t position, V (G ')=V (G ')+{ D}, E (G ')=E (G ')+{ (i, D), (D, j) }-{ (i, j) }, make r
ID=r
Dj=r
IjOtherwise, if stay of two nights t is in a certain crossing among the former figure G, then directly this crossing is remembered as D;
● the complete G ' of structure expander graphs.
3) in conjunction with the shortest path computational methods of expander graphs:
According to the cost in each highway section among road topology figure G ' and the G ', then can calculate from figure arbitrarily crossing i to shortest path and the path cost C thereof of target crossing D according to the Dijkstra shortest path algorithm
ID, i will become with transmitting by the highway section of packet.
4) in conjunction with the data packet forwarding method of above-mentioned path calculation method:
Data forwarding process comprised for two stages: the stage is transmitted in the highway section and the stage is transmitted at the crossing.
● in transmit in the highway section, vehicle for each bag that holds data, if there is more the vehicle near the down hop crossing in the neighbor node, then give this vehicle with package forward, if there are a plurality of such neighbours, then be transmitted to the vehicle at the most close down hop crossing, if there is no such neighbours, this vehicle then oneself carries this packet, until arrive the down hop crossing, or until run into vehicle than oneself more close down hop crossing, if run into the stay of two nights of packet in the traveling process, then directly packet is handed to the stay of two nights, the middle forward node on the highway section does not allow to change the down hop crossing direction of packet.
● in transmit at the crossing, when the vehicle v of the bag m that holds data is positioned at crossing x, x ∈ V (G '), the neighbours crossing collection N (x) of x is at first determined in meeting, then calculates each neighbours crossing y according to the vehicle density expander graphs G ' after quantizing and delivers cost C to the minimum at crossing, stay of two nights t place
Yt, y ∈ N (x) wherein is subsequently according to the C that calculates each neighbours crossing
YtValue sorts by the end-to-end minimum cost order from small to large of delivering to the crossing in N (x) set, the crossing set N after being sorted in order
*(x); Obtaining N
*(x) after, vehicle v will select N
*(x) just there is being the direction of Vehicle Driving Cycle at limit priority and current crossing as the package forward direction in, the party other end crossing that makes progress is deposited in the data packet head as the down hop crossing of packet, and with packet mail to that the party makes progress near neighbours' vehicle at down hop crossing.
Instantiation one:
1) traffic density quantization parameter r
1, r
N-1, the system of selection example of N.
At first road section length is carried out normalization, the length normalization method of highway section (x, y) is L
Xy=L
Xy/ R.If r
Xy＜1/3, think that then vehicle is too sparse, be difficult to carry out multi-hop transmission, therefore, a kind of possible mode is to set r
1=10, r
2=20, r
3=30, N=4.
2) the present invention is further illustrated below in conjunction with accompanying drawing and example.
In accompanying drawing 1, left figure represents the vehicle density on road topology and the respective stretch, is convenient and describes, and establish the highway section isometric, and length is 1.If density quantize Interval Set be combined into [0,10], (10,20], (20,30], (30, ∞) }, then the highway section vehicle density can be quantified as 1,2,3,4 four grade.After quantized value is got inverse, can calculate the highway section cost shown in accompanying drawing 1 right figure.Suppose to have the vehicle that is positioned at X place, crossing to have data to mail to destination node T, this vehicle will calculate neighbours crossing A, B, C to the least estimated cost of T delivery data based on shortest path first.According to result of calculation, crossing B has minimum cost and estimates, therefore is selected as the down hop crossing.After the down hop crossing was selected, the vehicle at crossing X place then can be given the vehicle that travels at highway section XB with Packet Generation.After packet arrives crossing B, then can repeat said process, until packet is finally delivered to destination node T.
Claims (6)
1. Internet of Things unicast data transmission method based on vehicle density is characterized in that:
According to the cost in two-way vehicle density on each highway section and this highway section of road section length information calculations thereof, and in conjunction with information source s position, stay of two nights t position and Map building expander graphs; Obtain each internodal shortest path in the network by this expander graphs; Unicast packet is pursued highway section, the end-to-end forwarding of hop-by-hop according to the path of calculating.
2. transmission method according to claim 1 is characterized in that:
During along shortest path forwarding data bag, the stage is transmitted in the highway section that comprises packet and the stage is transmitted at the crossing, during transmit in the highway section preferentially with package forward in the shortest path near the vehicle at down hop crossing; Preferentially will arrive during transmit at the crossing in all neighbours crossings and to deliver Least-cost and current crossing apart from the stay of two nights and crossing that vehicle exercises to this neighbours crossing is arranged as the down hop crossing of package forward, crossing is the minimum delivery cost of this crossing to the stay of two nights apart from the delivery cost of the stay of two nights.
3. transmission method according to claim 1 is characterized in that wherein comprising the steps: according to the cost in two-way vehicle density on each highway section and this highway section of road section length information calculations thereof
● the city road network topology model construction is become undirected weighted graph G (V, E), and each crossing is as a summit, the set at V (G) expression crossing, the set in E (G) expression highway section is then when crossing x and crossing y are adjacent intersection, (x, y) ∈ E (G) is arranged;
● make r
XyRepresent the vehicle density value on the highway section (x, y), L
XyRepresent the length in highway section (x, y), Num
XyRepresent the dual-way vehicle sum in highway section (x, y), r is arranged
Xy=Num
Xy/ L
Xy
● according to from dredging close N the grade that be divided into, set is { [0, r between corresponding density region with traffic density
1], (r
1, r
2] ..., (r
N-2, r
N-1], (r
N-1, ∞) }, 0＜r
1＜r
2＜...,＜r
N-1＜∞, wherein r
1=r
2-r
1=r
3-r
2=...=r
N-1-r
N-2, will also number behind the traffic density information quantization on the road, note is done
Work as r
Xy∈ [0, r
1] time,
Work as r
Xy∈ (r
1, r
2] time,
Work as r
Xy∈ (r
N-1, in the time of ∞),
● calculate the path cost weights of each highway section (x, y) ∈ E (G):
4. transmission method according to claim 3 is characterized in that, describedly comprising in conjunction with information source s and stay of two nights t position and Map building road topology expander graphs G ':
●V(G’)=V(G),E(G’)=E(G)；
● if s is in certain highway section (x among the figure G, y) among, then add a new virtual crossing O in the s position, V (G ')=V (G ')+{ O}, E (G ')=E (G ')+{ (x, O), (O, y) }-{ (x, y) }, wherein "+" represents the union operation of set, and "-" represents the computing that subtracts of set, makes r
XO=r
Oy=r
XyOtherwise, if information source s is in a certain crossing among the former figure G, at this moment, then directly this crossing is remembered as O;
● if t is among the figure G among certain highway section (i, j), then adds a new virtual crossing D in the t position, V (G ')=V (G ')+{ D}, E (G ')=E (G ')+{ (i, D), (D, j) }-{ (i, j) }, make r
ID=r
Dj=r
Ij, otherwise, if stay of two nights t is in a certain crossing among the former figure G, then directly this crossing is remembered as D;
● G ' is complete for the structure expander graphs.
5. transmission method according to claim 4 is characterized in that, is describedly obtained by expander graphs that each internodal shortest path comprises in the network:
According to the path cost weights in each highway section among road topology expander graphs G ' and the G ', utilize the Dijkstra shortest path algorithm to calculate the shortest path from any crossing i to target crossing D and path cost C thereof from topological diagram
ID, i will become with transmitting by the highway section of packet.
6. transmission method according to claim 5 is characterized in that, described unicast packet comprises that by highway section, the end-to-end forwarding of hop-by-hop the stage is transmitted in the highway section and the stage is transmitted at the crossing according to the path of calculating:
● in transmit in the highway section, vehicle for each bag that holds data, if there is more the vehicle near the down hop crossing in the neighbor node, then give this vehicle with package forward, if there are a plurality of such neighbours, then be transmitted to the vehicle at the most close down hop crossing, if there is no such neighbours, this vehicle then oneself carries this packet, until arrive the down hop crossing, or run into the vehicle than oneself more close down hop crossing, if run into stay of two nights t in the traveling process, then directly packet is handed to the stay of two nights, the middle forward node on the highway section does not allow to change the down hop crossing direction of packet;
● in transmit at the crossing, when the vehicle v of the bag m that holds data is positioned at crossing x, x ∈ V (G '), the neighbours crossing collection N (x) of x is at first determined in meeting, the expander graphs G ' after then quantizing according to vehicle density calculates each neighbours crossing y and delivers cost C to the minimum at crossing, stay of two nights t place
Yt, y ∈ N (x) wherein is subsequently according to the C that calculates each neighbours crossing
YtValue sorts by the end-to-end minimum cost order from small to large of delivering to the crossing in N (x) set, the crossing set N after being sorted in order
*(x); Obtaining N
*(x) after, vehicle v will select N
*(x) just there is being the direction of Vehicle Driving Cycle at limit priority and current crossing as the package forward direction in, the party other end crossing that makes progress is deposited in the data packet head as the down hop crossing of packet, and with packet mail to that the party makes progress near neighbours' vehicle at down hop crossing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105466899A CN103079250A (en) | 2012-12-16 | 2012-12-16 | Internet of Things unicast data transmission method based on traffic density |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105466899A CN103079250A (en) | 2012-12-16 | 2012-12-16 | Internet of Things unicast data transmission method based on traffic density |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103079250A true CN103079250A (en) | 2013-05-01 |
Family
ID=48155631
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012105466899A Pending CN103079250A (en) | 2012-12-16 | 2012-12-16 | Internet of Things unicast data transmission method based on traffic density |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103079250A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104683427A (en) * | 2013-11-29 | 2015-06-03 | 现代摩比斯株式会社 | Communication apparatus for performing inter-vehicular communication |
| CN105703971A (en) * | 2016-03-04 | 2016-06-22 | 福州华鹰重工机械有限公司 | Vehicular communication method and system based on mixing detection |
| CN106254250A (en) * | 2016-08-03 | 2016-12-21 | 成都之达科技有限公司 | Car networking short-distance networking method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040236811A1 (en) * | 2003-05-19 | 2004-11-25 | Kode, A Corporation Of France | Method of computation of a short path in valued graphs |
| CN101720059A (en) * | 2009-11-05 | 2010-06-02 | 浙江大学城市学院 | Method for realizing vehicle-mounted mobile self-organized network routing |
| CN102810118A (en) * | 2012-07-05 | 2012-12-05 | 上海电力学院 | K nearest neighbor search method for variable weight network |
-
2012
- 2012-12-16 CN CN2012105466899A patent/CN103079250A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040236811A1 (en) * | 2003-05-19 | 2004-11-25 | Kode, A Corporation Of France | Method of computation of a short path in valued graphs |
| CN101720059A (en) * | 2009-11-05 | 2010-06-02 | 浙江大学城市学院 | Method for realizing vehicle-mounted mobile self-organized network routing |
| CN102810118A (en) * | 2012-07-05 | 2012-12-05 | 上海电力学院 | K nearest neighbor search method for variable weight network |
Non-Patent Citations (1)
| Title |
|---|
| JERBI, M. , ET AL.: "《Communications, 2007. ICC "07. IEEE International Conference on》", 28 June 2007 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104683427A (en) * | 2013-11-29 | 2015-06-03 | 现代摩比斯株式会社 | Communication apparatus for performing inter-vehicular communication |
| CN105703971A (en) * | 2016-03-04 | 2016-06-22 | 福州华鹰重工机械有限公司 | Vehicular communication method and system based on mixing detection |
| CN106254250A (en) * | 2016-08-03 | 2016-12-21 | 成都之达科技有限公司 | Car networking short-distance networking method |
| CN106254250B (en) * | 2016-08-03 | 2019-04-02 | 成都之达科技有限公司 | Car networking short-distance networking method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106961707B (en) | Multifactor decision making Routing Protocol based on connectivity in a kind of VANET | |
| Luo et al. | MI-VANET: A new mobile infrastructure based VANET architecture for urban environment | |
| CN104640168B (en) | Vehicular ad hoc network method for routing based on Q study | |
| Liu et al. | Parking-area-assisted spider-web routing protocol for emergency data in urban VANET | |
| CN104637328B (en) | Distributed real-time navigation method based on RSU in a kind of vehicle self-organizing network | |
| CN104734372A (en) | Energy adaptive charging method combined with geographical location routing in WRSNs | |
| CN105307232A (en) | Routing optimization method for vehicular self-organized network based on connection probabilities | |
| CN103281742A (en) | Vehicular Ad hoc network routing method based on autonomously acquired road information | |
| Zhao et al. | A novel adaptive routing and switching scheme for software-defined vehicular networks | |
| CN108650656B (en) | Distributed city Internet of vehicles routing method based on intersection | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| CN105592138A (en) | Crossing ad hoc node assisted urban vehicle routing protocol method | |
| CN101383768A (en) | Vehicle network data routing method based on digital map and mobile prediction | |
| CN109275154B (en) | Dynamic self-adaptive routing path planning method based on double-layer topological routing algorithm | |
| CN103079249A (en) | Internet of Things multicast data transmission method based on traffic density | |
| CN111130853A (en) | Future route prediction method of software defined vehicle network based on time information | |
| Oubbati et al. | IRTIV: Intelligent routing protocol using real time traffic information in urban vehicular environment | |
| CN104185239B (en) | Intersection method for routing based on road section length in vehicle self-organizing network | |
| CN103379575A (en) | Vehicular network routing protocol utilizing intersection static nodes to assist with data forwarding | |
| CN108093458A (en) | Suitable for car networking based on cluster structured fast and stable method for routing and device | |
| Yarinezhad et al. | A new routing algorithm for vehicular ad-hoc networks based on glowworm swarm optimization algorithm | |
| CN107454650A (en) | Method for routing based on Q study and electronic map in vehicular ad hoc network | |
| Li et al. | An efficient reinforcement learning based charging data delivery scheme in VANET-enhanced smart grid | |
| Shen et al. | AODV-PNT: An improved version of AODV routing protocol with predicting node trend in VANET | |
| CN103079250A (en) | Internet of Things unicast data transmission method based on traffic density |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130501 |