CN103079214A - Internet of Things communication relay node deployment method based on road and crossing distribution and density - Google Patents
Internet of Things communication relay node deployment method based on road and crossing distribution and density Download PDFInfo
- Publication number
- CN103079214A CN103079214A CN2012105453329A CN201210545332A CN103079214A CN 103079214 A CN103079214 A CN 103079214A CN 2012105453329 A CN2012105453329 A CN 2012105453329A CN 201210545332 A CN201210545332 A CN 201210545332A CN 103079214 A CN103079214 A CN 103079214A
- Authority
- CN
- China
- Prior art keywords
- crossing
- via node
- data
- vehicle
- cost value
- 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
Abstract
The invention belongs to the communication field of Internet of Things, and particularly relates to a relay node deployment mechanism of Internet of Things auxiliary communication facing to a road network. An auxiliary relay node is used as a message relay for communication between a central vehicle and a workshop of the Internet of Things, and can be used for improving success rate of message delivery of the whole network and reducing message delivery delay. The technology aims to design a relay node deployment strategy, which comprises the following steps of: calculating a cost value of each crossing on the basis of road and crossing distribution situations, establishing a crossing array according to the cost value of each crossing, deploying a plurality of relay nodes in a road network according to the cost value of each crossing, and interacting data of the vehicle through the relay nodes, so that Internet of Things communication on the basis of the relay nodes is realized, and the maximum improvement of performances of the whole network is obtained through the limited number of relay nodes.
Description
Technical field
The invention belongs to the Internet of Things communications field, be specifically related to a kind of via node deployment mechanisms of the Internet of Things subsidiary communications towards highway network.The alternative routing node can be used for promoting the whole network message dilivery success rate and shortens the message dilivery time-delay as the message relay of car in the Internet of Things and inter-vehicle communication.Present technique is intended to design the via node deployment strategy, obtains maximum lift to the whole network performance with limited via node number.
Background technology
Internet of Things is the important component part of intelligent transportation, has broad application prospects.Wherein, the multi-hop wireless communication between vehicle is the important support technology that Internet of Things is used.
In Internet of Things, node motion speed is fast, and network topology change is frequent, and wireless communications environment is abominable, and these features have had a strong impact on wireless data transceiving performance in the Internet of Things.Existing achievement in research shows, strengthens the network architecture by add the communication auxiliary node in Internet of Things, can make network data deliver success rate and be significantly improved.The communication auxiliary node that adds can divide according to its network construction form makes three classes: accessing points Network Based (Access Point, AP), and based on mesh network (mesh), based on isolated via node (relay).Mode based on AP is to assist to carry out data retransmission between vehicle by the accessing points of disposing accessing Internet in the city; Mode based on the mesh net is by disposing with the interconnected communication auxiliary node of mesh network in the city; Then mutually isolated to each other by in the city, disposing based on the mode of relay, possess the short-distance wireless communication ability, can be the give information node of forward relay of moving vehicle.In these three kinds of deployment way, because low-cost and dispose flexibly advantage, become first-selected network architecture enhancements based on the communication supplementary mode of isolated via node.
In general mobile ad hoc network (MANET), the correlative study achievement that has part to dispose about via node, but owing to the Move Mode of the node motion pattern among the MANET with vehicle in the Internet of Things differs greatly, so these achievements in research can't directly be continued to use under scenes of internet of things.The present invention is with mobility and the Structural Feature Design via node deployment mechanisms of emphasis for Internet of Things.
Summary of the invention
The present invention is intended to the deployment way of planned network via node, counts maximum data with the via node of limited quantity and delivers success rate and deliver the time-delay income.
The network that the present invention relates to is by the vehicle that carries short-range wireless communication apparatus, and the via node composition that possesses equally the short-distance wireless communication ability that is deployed in fixed position in the city.Can't direct communication between the via node.Vehicle also must be given other vehicles with package forward by via node.Vehicle is movably, and via node is static.
A kind of via node dispositions method of communicating by letter with the internet of things oriented of crossing distribution and density thereof based on road, in the Internet of Things based on vehicle, calculate the cost value at each crossing based on road and crossing distribution situation, and set up the crossing formation according to each crossing cost value, in road network, dispose a plurality of via nodes according to the cost value at each crossing, vehicle is by the via node interaction data, thereby realization is based on the Internet of Things communication of via node.
Make the road network topology in G (V, E) expression city in the described Internet of Things framework based on via node, each crossing is as a summit, and each highway section is as a limit, and V represents the crossing set, and E represents the highway section set.For crossing x and crossing y, if exist a highway section directly to be communicated with two crossings, and middle without any other crossing, claim that then crossing x and crossing y are adjacent intersections, each via node will only be deployed in the position, crossing, a via node is arranged at most at each crossing, the vehicle swapping data must pass through via node, be that the data source vehicle sends the data to via node, then fetch data by the datum target vehicle from via node, the sparse deployment of via node, non-conterminous mutually each other, the data source vehicle can be given some via nodes with data Replica, and via node will be deleted and successfully be sent to or overtime data copy.
The crossing cost computational methods that wherein said reflection road and crossing distribute specifically comprise: the minimum hop count path of finding the solution any two crossings among the road network topology figure G; Make that Nk (x) representative graph G middle distance crossing x is 1 to the set of the crossing of k-hop, k〉1, Dx represents the number of degrees of crossing x, i.e. the quantity of adjacent intersection; The cost of crossing x is: Cx=Dx+alpha* Σ
Y ∈ Nk (x)-{ x}Dy, 0＜alpha＜1 wherein, the subtraction of "-" representative set.
According to the crossing cost value that calculates, set up the crossing formation from big to small of a cost value; For the identical crossing of cost value, then its order according to the air line distance of position, down town, descending if distance is still identical, is then selected at random.
In road network, dispose a plurality of via node mechanism according to the cost value at each crossing and comprise the steps: step 0: with the color painted white at all crossings among the road network topology figure G; Step 1: a via node is placed at the place, crossing that at first cost value is the highest in the formation of crossing, and the color painted black at all crossings of jumping less than or equal to K with this crossing with apart from the distance at this crossing, then the color with the white neighbours crossing at the crossing of up-to-date painted black in this step is coated with grey; Step 2: recomputate the cost value at each grey crossing, specific as follows: as for each grey crossing x, to set Nk
*(x) be the set of institute's adularescent among the Nk (x) and grey crossing, then Cx=Dx+alpha* Σ
Y ∈ Nk* (x)-{ x}Dy; Step 3: from all grey crossings, select the crossing of cost value maximum to place a via node, and the color painted black at the crossing of jumping less than or equal to K with this crossing with apart from the distance at this crossing, then the color with the white neighbours crossing at up-to-date painted black crossing in this step is coated with grey; Step 4: if also have the grey crossing in the network, then return execution in step 2, until black has all been painted at all crossings among the figure G.
Wherein said vehicle specifically comprises by the via node interaction data: if the information source vehicle runs into a via node in moving process, then its outgoing data is transmitted to this via node, every data can be transmitted to k via node at the most, k is a little natural number, the sum of the via node in k＜=network; When certain via node of target vehicle process, whether via node inspection this locality has the data that need to be transmitted to this vehicle; If have and this vehicle when not yet receiving these data, then be transmitted to this vehicle, then delete this data from this locality; If this vehicle had been received these data, then directly delete this locality, not forwarding data.
Embodiment
The present invention will calculate the crossing cost value, and select the deployed position of via node according to the cost value size.
1) calculate the crossing cost value:
The present invention relates to the computational methods of a kind of crossing cost:
Find the solution the minimum hop count path at any two crossings in the network G;
For any crossing x ∈ V (G), make that Nk (x) representative graph G middle distance crossing x is 1 to the set of the crossing of k-hop, k〉1, Dx represents the number of degrees of crossing x, i.e. the quantity of adjacent intersection;
The cost of crossing x is: the Cx=Dx+alpha* ∑
Y ∈ Nk (x)-{ x}Dy, 0＜alpha＜1 wherein, the subtraction of "-" representative set;
Said method can embody road and crossing density distribution preferably, does not need the extras support, is convenient to realize.
2) set up the crossing formation:
According to the crossing cost value that calculates in the 1st step, set up the crossing formation from big to small of a cost value; For the identical crossing of cost value, then its order according to the air line distance of position, down town, descending if distance is still identical, is then selected at random.
3) based on the deployment via node method that dyes:
Step 0: with the color painted white at all crossings in the network;
Step 1: a via node is placed at the place, crossing that at first cost value is the highest in the formation of crossing, and the color painted black at all crossings of jumping less than or equal to K with this crossing with apart from the distance at this crossing, K is a little positive integer, can be 1 such as K, 2,3 etc., then the color with the white neighbours crossing at the crossing of up-to-date painted black in this step is coated with grey.
Step 2: recomputate the cost at each grey crossing, specific as follows: as for each grey crossing x, to set Nk
*(x) be the set of institute's adularescent among the Nk (x) and grey crossing, then Cx=Dx+alpha* ∑
Y ∈ Nk* (x)-{ x}Dy;
Step 3: from all grey crossings, select one of the cost maximum to place a via node, and the color painted black at the crossing of jumping less than or equal to K with this crossing with apart from the distance at this crossing, then the color with the white neighbours crossing at up-to-date painted black crossing in this step is coated with grey.
Step 4: if also have the grey crossing in the network, then return step 2 and carry out, until black has all been painted at all crossings among the figure.
The via node dispositions method that the present invention relates to can be so that the distance between any via node of disposing be jumped i.e.: K bar highway section more than or equal to K.By regulating the K value, can control the density of via node.
4) by the via node forwarding data:
If the information source vehicle runs into a via node in moving process, then its outgoing data is transmitted to this via node, every data can be transmitted to k via node at the most, and k is a little natural number, and k＜N, N are the via node sums in the network; When certain via node of target vehicle process, whether via node inspection this locality has the data that need to be transmitted to this vehicle; If have and this vehicle when not yet receiving these data, then be transmitted to this vehicle, then delete this data from this locality; If this vehicle had been received these data, then directly delete this locality, not forwarding data.
Claims (6)
1. one kind distributes based on road and crossing and via node dispositions method that the internet of things oriented of density is communicated by letter, it is characterized in that:
In the Internet of Things based on vehicle, calculate the cost value at each crossing based on road and crossing distribution situation, and set up the crossing formation according to each crossing cost value, in road network, dispose a plurality of via nodes according to the cost value at each crossing, vehicle is by the via node interaction data, thereby realization is based on the Internet of Things communication of via node.
2. via node dispositions method according to claim 1 is characterized in that, described Internet of Things framework based on many via nodes specifically comprises:
Make the road network topology in G (V, E) expression city in the described Internet of Things framework based on via node, V represents the crossing set, and E represents the highway section set; Crossing x and crossing y are adjacent intersection, each via node will only be deployed in the position, crossing, a via node is arranged at most at each crossing, the vehicle swapping data must pass through via node, then fetch data by the datum target vehicle from via node, the sparse deployment of via node, non-conterminous mutually each other, the data source vehicle can be given some via nodes with data Replica, and via node will be deleted and successfully be sent to or overtime data copy.
3. via node dispositions method according to claim 2 is characterized in that, the crossing cost computational methods that described reflection road and crossing distribute specifically comprise:
Find the solution the minimum hop count path at any two crossings among the road network topology figure G;
Make that Nk (x) representative graph G middle distance crossing x is 1 to the set of the crossing of k-hop, k〉1, Dx represents the number of degrees of crossing x, i.e. the quantity of adjacent intersection;
The cost of crossing x is: the Cx=Dx+alpha* ∑
Y ∈ Nk (x)-{ x}Dy, 0＜alpha＜1 wherein, Dy represents the number of degrees of crossing y.
4. via node dispositions method according to claim 3 is characterized in that: according to the crossing cost value that calculates, set up the crossing formation from big to small of a cost value; For the identical crossing of cost value, then its order according to the air line distance of position, down town, descending if distance is still identical, is then selected at random.
5. via node dispositions method according to claim 4 is characterized in that, in road network according to each
The cost value at crossing is disposed a plurality of via node mechanism and is comprised the steps:
Step 0: with the color painted white at all crossings among the road network topology figure G;
Step 1: a via node is placed at the place, crossing that at first cost value is the highest in the formation of crossing, and will
The color painted black at this crossing and all crossings of jumping less than or equal to K apart from the distance at this crossing, then the color with the white neighbours crossing at the crossing of up-to-date painted black in this step is coated with grey;
Step 2: recomputate the cost value at each grey crossing, specific as follows: as for each grey crossing x, to set Nk
*(x) be the set of institute's adularescent among the Nk (x) and grey crossing, then Cx=Dx+alpha* ∑
Y ∈ Nk* (x)-{ x}Dy;
Step 3: from all grey crossings, select the crossing of cost value maximum to place a via node, and the color painted black at the crossing of jumping less than or equal to K with this crossing with apart from the distance at this crossing, then the color with the white neighbours crossing at up-to-date painted black crossing in this step is coated with grey;
Step 4: if also have the grey crossing in the network, then return execution in step 2, until black has all been painted at all crossings among the figure G.
6. via node dispositions method according to claim 1 is characterized in that, described vehicle specifically comprises by the via node interaction data:
If the information source vehicle runs into a via node in moving process, then its outgoing data is transmitted to this via node, every data can be transmitted to k via node at the most, and k is a little natural number, the sum of the via node in k＜=network; When certain via node of target vehicle process, whether via node inspection this locality has the data that need to be transmitted to this vehicle; If have and this vehicle when not yet receiving these data, then be transmitted to this vehicle, then delete this data from this locality; If this vehicle had been received these data, then directly delete this locality, not forwarding data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105453329A CN103079214A (en) | 2012-12-16 | 2012-12-16 | Internet of Things communication relay node deployment method based on road and crossing distribution and density |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105453329A CN103079214A (en) | 2012-12-16 | 2012-12-16 | Internet of Things communication relay node deployment method based on road and crossing distribution and density |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103079214A true CN103079214A (en) | 2013-05-01 |
Family
ID=48155598
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012105453329A Pending CN103079214A (en) | 2012-12-16 | 2012-12-16 | Internet of Things communication relay node deployment method based on road and crossing distribution and density |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103079214A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103327507A (en) * | 2013-07-12 | 2013-09-25 | 上海交通大学 | Base station arrangement method for vehicle multi-hop communication network |
| CN109660624A (en) * | 2018-12-26 | 2019-04-19 | 网宿科技股份有限公司 | Planing method, server and the storage medium of content distributing network resource |
| CN110972115A (en) * | 2019-11-21 | 2020-04-07 | 中南大学 | Internet of vehicles data forwarding method for transmitting multimedia data |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101977241A (en) * | 2010-11-15 | 2011-02-16 | 北京邮电大学 | Method for allocating service nodes in vehicle-mounted Ad hoc network |
| CN102014147A (en) * | 2010-07-09 | 2011-04-13 | 北京哈工大计算机网络与信息安全技术研究中心 | Positioning system in Internet of things as well as deploying method and device thereof |
| US20120014285A1 (en) * | 2003-03-24 | 2012-01-19 | Leonid Kalika | Self-configuring, self-optimizing wireless local area network system |
| CN102572992A (en) * | 2012-01-17 | 2012-07-11 | 百年金海安防科技有限公司 | Vehicular network RSU (Roadside Unit) deploy method and data forwarding method thereof |
-
2012
- 2012-12-16 CN CN2012105453329A patent/CN103079214A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120014285A1 (en) * | 2003-03-24 | 2012-01-19 | Leonid Kalika | Self-configuring, self-optimizing wireless local area network system |
| CN102014147A (en) * | 2010-07-09 | 2011-04-13 | 北京哈工大计算机网络与信息安全技术研究中心 | Positioning system in Internet of things as well as deploying method and device thereof |
| CN101977241A (en) * | 2010-11-15 | 2011-02-16 | 北京邮电大学 | Method for allocating service nodes in vehicle-mounted Ad hoc network |
| CN102572992A (en) * | 2012-01-17 | 2012-07-11 | 百年金海安防科技有限公司 | Vehicular network RSU (Roadside Unit) deploy method and data forwarding method thereof |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103327507A (en) * | 2013-07-12 | 2013-09-25 | 上海交通大学 | Base station arrangement method for vehicle multi-hop communication network |
| CN103327507B (en) * | 2013-07-12 | 2015-12-23 | 上海交通大学 | A kind of base station deployment method for vehicle multi-hop communication network |
| CN109660624A (en) * | 2018-12-26 | 2019-04-19 | 网宿科技股份有限公司 | Planing method, server and the storage medium of content distributing network resource |
| CN109660624B (en) * | 2018-12-26 | 2022-05-17 | 网宿科技股份有限公司 | Planning method, server and storage medium for content distribution network resources |
| CN110972115A (en) * | 2019-11-21 | 2020-04-07 | 中南大学 | Internet of vehicles data forwarding method for transmitting multimedia data |
| CN110972115B (en) * | 2019-11-21 | 2021-08-24 | 中南大学 | Internet of vehicles data forwarding method for transmitting multimedia data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | ASGR: An artificial spider-web-based geographic routing in heterogeneous vehicular networks | |
| CN101369982B (en) | Method for data packet greedy forwarding in vehicle-mounted Ad hoc network | |
| Abedi et al. | Enhancing AODV routing protocol using mobility parameters in VANET | |
| CN105307232B (en) | Routing optimization method based on connection probability for vehicle-mounted self-organizing network | |
| CN105245563A (en) | Dynamic clustering method based on vehicle node connection stability | |
| CN105208616A (en) | Road topology based adaptive multi-copy routing method in vehicular ad hoc network | |
| CN106255153B (en) | Vehicle under car networking with caching capabilities divides group's cooperation transmission method | |
| CN112347596B (en) | Urban public transport network optimization method | |
| CN108924793A (en) | A kind of random roadside node deployment algorithm | |
| Juan et al. | BUSNet: Model and usage of regular traffic patterns in mobile ad hoc networks for inter-vehicular communications | |
| CN103079214A (en) | Internet of Things communication relay node deployment method based on road and crossing distribution and density | |
| Silva et al. | Design of roadside infrastructure for information dissemination in vehicular networks | |
| Rashid et al. | Reliability-aware multi-objective optimization-based routing protocol for VANETs using enhanced Gaussian mutation harmony searching | |
| CN105391631A (en) | Enhanced stable routing protocol for vehicle Ad Hoc network | |
| Guo et al. | An adaptive V2R communication strategy based on data delivery delay estimation in VANETs | |
| CN105282813A (en) | Routing method, device and system used in vehicle-mounted network environment | |
| Syfullah et al. | Mobility-based clustering algorithm for multimedia broadcasting over IEEE 802.11 p-LTE-enabled VANET | |
| CN103024046A (en) | Internet of things-oriented communication relay node deployment method | |
| CN104837173A (en) | Metropolitan area vehicle-mounted communication system with parking node | |
| Aravindhan et al. | A cluster approach in VANET using collaborative learning automata-based routing | |
| Gaikwad et al. | A novel mobility model for realistic behavior in vehicular ad hoc network | |
| Wu et al. | A novel routing protocol based on mobile social networks and internet of vehicles | |
| CN111148110A (en) | Vehicle networking road side unit deployment method based on genetic ant colony hybrid algorithm | |
| CN101867997B (en) | Handover-based cluster routing method under environment of vehicular Ad hoc network | |
| Punia et al. | Experimental characterization of routing protocols in urban vehicular communication |
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 |