CN107508855A - Node communication method and car networking node in car networking - Google Patents
Node communication method and car networking node in car networking Download PDFInfo
- Publication number
- CN107508855A CN107508855A CN201710566184.1A CN201710566184A CN107508855A CN 107508855 A CN107508855 A CN 107508855A CN 201710566184 A CN201710566184 A CN 201710566184A CN 107508855 A CN107508855 A CN 107508855A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- mrow
- source node
- circle
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Abstract
Node communication method and car networking node, methods described in a kind of car networking of present invention offer include：Source node generates data request information, and asked Data Identification and source node identification are carried in data request information；Source node sends data request information into car networking the next-hop node of circle of friends, so that next-hop node determines whether there is asked data according to Data Identification, circle of friends is by least one determination in the frequent situation of communication between the node in car networking and source node and the data degree of closeness having.Node communication method and car networking node in car networking provided by the invention can improve the reliability that the node in car networking communicates in moving process.
Description
Technical field
The present invention relates to the node communication method in the communication technology, more particularly to a kind of car networking and car networking node.
Background technology
Today's society, pursuit of the people for mobility, security increasingly heat up, and current transmission control protocol/because
Special net interconnection protocol (Transmission Control Protocol/Internet Protocol, abbreviation：TCP/IP) network
The problems such as poor mobility, security deficiency this framework is increasingly difficult to meet the needs of people existing for framework.
In the prior art, it is necessary to know mesh when the node in car networking is based on TCP/IP frameworks progress end-to-end communication
Internet protocol (Internet Protocol, IP) address of node is marked, it is necessary in source node and target before data are sent
Between node communication link is established according to ICP/IP protocol.However, under car networking environment, vehicle node has high-speed mobility,
This feature causes the reliability of communication link between vehicle node not high.For example, under the traffic conditions of reality, vehicle node
Send data request packet, it is more likely that can be because the high-speed mobile of vehicle node, purpose vehicle node have been sailed in a short time
Go out the scope that can be communicated, cause request of data to fail.
Therefore, prior art can not meet that the node in car networking communicates for ambulant requirement.
The content of the invention
The present invention provides node communication method and car networking node in a kind of car networking, to meet the node in car networking
Communication reliability in moving process.
In a first aspect, the present invention provides the node communication method in a kind of car networking, including：
Source node generates data request information, and asked Data Identification, source node identification are carried in data request information
And type of message；
Source node sends data request information into car networking the next-hop node of circle of friends, so that next-hop node root
Determine whether that there are asked data according to Data Identification, circle of friends is by the communication frequency between the node and source node in car networking
At least one determination in numerous situation and the data degree of closeness having.
Second aspect, the present invention provide the node communication method in a kind of car networking, including：
Receiving node receives the data request information that source node is sent, and asked data mark is carried in data request information
Knowledge and source node identification；
If receiving node determines there is an asked data according to Data Identification, will be asked according to source node identification
Data are sent to source node；Or
If receiving node determines do not have asked data according to Data Identification, data request information is forwarded to car
The next-hop node of circle of friends in networking, so that next-hop node determines whether there is asked data according to Data Identification,
Circle of friends by the frequent situation of communication between the node in vehicle net and receiving node and the data degree of closeness having extremely
A few determination.
The third aspect, the present invention provide a kind of car networking node, including：
Generation module, carried for generating data request information, in data request information asked Data Identification and
Source node identification；
Sending module, for data request information to be sent into car networking to the next-hop node of circle of friends, so that next
Hop node determines whether there is asked data according to Data Identification, and circle of friends is by other nodes and source node in car networking
Between the frequent situation of communication and at least one determination in the data degree of closeness that has.
Fourth aspect, the present invention provide a kind of car networking node, including：
Receiving module, for receiving the data request information of source node transmission, carry what is asked in data request information
Data Identification and source node identification；
Judge module, for judging whether this node has asked data according to Data Identification；
Sending module, if this node has asked data, the data asked are sent according to source node identification
To source node；Or
If this node does not have asked data, data request information is forwarded to the next of circle of friends in car networking
Hop node, so that next-hop node determines whether there is asked data according to Data Identification, circle of friends is by vehicle net
At least one determination in the frequent situation of communication between node and receiving node and the data degree of closeness having.
Node communication method and car networking node in car networking provided in an embodiment of the present invention, this method is according to car networking
The degree of closeness of the frequent situation to be communicated between interior joint and/or the data having establishes the circle of friends of node, and request of data disappears
Breath and the data-message returned are reliably transmitted between the node in the circle of friends of node and node.Either node
Data request information or returned data message are sent, without knowing destination node position in advance.Improve car networking
In the reliability that is communicated in moving process of node.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are this hairs
Some bright embodiments, for those of ordinary skill in the art, without having to pay creative labor, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the node communication method embodiment one in car networking of the present invention；
Fig. 2 is the flow chart of the node communication method embodiment two in car networking of the present invention；
Fig. 3 is the structural representation of the node embodiment one in car networking of the present invention；
Fig. 4 is the structural representation of the node embodiment two in car networking of the present invention；
Fig. 5 is the structural representation of the node embodiment three in car networking of the present invention；
Fig. 6 is the structural representation of the node embodiment four in car networking of the present invention.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
Part of the embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
Fig. 1 is the flow chart of the node communication method embodiment one in car networking of the present invention.As shown in figure 1, the present embodiment
Method can include：
Step 101, source node generation data request information, carry in data request information asked Data Identification and
Source node identification；
Step 102, source node send data request information into car networking the next-hop node of circle of friends, so that next
Hop node determines whether there is asked data according to Data Identification, and circle of friends is by between the node and source node in car networking
The frequent situation of communication and the data degree of closeness that has at least one determination.
During specific implementation, in a step 101, when source node needs request data, data request information can be generated,
That is request bag, asked Data Identification is carried in the data request information.
The Data Identification being related in the embodiment of the present invention, for the name being named using the naming rule of name data network
Claim, the object for needing to name in car networking includes but is not limited to vehicle node, roadside unit node and data.It names every tool
Body can use following form, such as："/type/ID/option1/option2/... ", each field in title are referred to as name
Claim element.For example, a certain vehicle node in car networking can be named as "/car/10000/taxi/ "；Can be by car networking
A certain numerical nomenclature is "/data/10000/video/a.mp4 ".We can identify the vehicle in car networking by title
Data in node, or failure vehicle net.Carry out identification object in this way, overcome IPv4 addresses in TCP/IP frameworks
The problem of insufficient space.
Name data network (Named Data Network, abbreviation：NDN) by clearly naming data, network is made more
Easily monitor which type of data is requested, and can be carried out under the network architecture by the information signed to data requester
Encryption so that NDN has higher security.On the other hand, NDN using name come identification data packet, without comprising clear and definite
The positional information such as main frame or interface IP address, its communication is driven by request of data, and request bag is only according to self-contained content
It is route.
Entrained source node identification can be the MAC Address of source node and/or the life using NDN in data request information
Name title of the name rule to source node.
In a step 102, source node sends data request information into car networking the next-hop node of circle of friends, so that
Next-hop node determines whether there is asked data according to Data Identification, and circle of friends is by the node and source node in car networking
Between the frequent situation of communication and at least one determination in the data degree of closeness that has.
In the embodiment of the present invention, source node sends data request information by circle of friends, wherein, the circle of friends of source node
Need to communicate frequent situation between the node in car networking and source node and/or the data degree of closeness that has establishes source section
The circle of friends of point.
Specifically, the frequent situation that communicates, which is the adjacent node reflected in circle of friends, has frequently communication contact, to ensure
The data request information that source node is sent reliably can be sent between the node in circle of friends, and ensures that destination node is returned
The data returned can smoothly reach source node in circle of friends.
Degree of closeness with data be reflect car networking interior joint between interest degree of closeness, with ensure source node with
Node in its circle of friends has similar hobby field, to ensure that the data that source node is asked can be returned quickly.
Therefore, as described above, circle of friends can be according to the frequency that communicated between other nodes in source node and vehicle net
Numerous situation and/or data degree of closeness the two factors having consider that to establish specific establish can use various algorithms
To calculate and realize.
After next-hop node receives the data request information of source node transmission, according to the data mark carried in the message
Know to confirm locally whether be stored with the data, if next-hop node has the data, the data are directly returned into source section
Point.If not having the data, next-hop node continues the data request information under being forwarded in the circle of friends of oneself
One hop node, subsequently by that analogy.
Node communication method in the car networking that the present embodiment provides, the rule by using name data network join to car
Node and data in net are named, and source node is in request data, it is only necessary to carry source node and the mark of requested data
Know, without advance hard objectives node where., will be with according to the frequent situation of communication and the degree of closeness of data between node
The node of source node close relation sets up the circle of friends to form source node, and reliable request of data is carried out in circle of friends with returning
Return, realize reliable communication of the node under situation of movement in car networking.During request of data, data request information
Main frame or interface position information (such as IP address) need not be carried, data request information enters walking along the street according to the Data Identification asked
By meeting requirement of the node in car networking to security., can be more due to having taken into full account the social relationships between node
The efficient communication realized between node.
It should be noted that any node in car networking, it can have the circle of friends of oneself.In above-described embodiment
On the basis of, the circle of friends that following examples further provide any node in vehicle net establishes process, specifically establishes process
It is as follows：
Each node in car networking all constantly can send beacon bags to surroundings nodes, so that other nodes can be sent out
Show oneself；Also the beacon bags that other nodes are sent can be constantly received, to find other nodes.Beacon bags carry
The title of sending node, MAC Address, the title for the data having, the title for the data met and meet number.
When a certain node receives the beacon bags that other nodes are sent, the data in beacon bags can be read, will
The title of sending node in beacon bags, MAC Address, the title for the data having, the title for the data met and meet time
Number is stored in the neighbor list of this node.Neighbor list needs constantly to be updated according to the beacon bags received.Work as this section
, can be by the relevant information of the node from originally when point does not receive the beacon bags that a certain node is sent at a certain time interval
Deleted in the neighbor list of node.The time interval can be 5 seconds or other times interval.When a certain node is present in this
In the neighbor list of node, it is referred to as the node and is contacted with this node, the existing time is the time contacted.
Each node in car networking by the title of data, the title for the data met possessed by oneself and can meet this
The number of data is stored in the pending required list (Pending Interest Table, abbreviation PIT) of this node.
, can be according to the physical link and logic between the node in this node and neighbor list for any node
Contact, calculates the social relationships intensity between this node and the node.Wherein, physical link is used to represent the communication between node
Frequent situation, logical communication link are used to represent the data degree of closeness having between node；It is strong that if social relationships intensity is more than setting
Threshold value is spent, then the node can be included to the circle of friends of this node.
Further, the specific calculation for calculating physical link and logical communication link is provided in the present embodiment：
As optional embodiment, the calculating of the physical link Wp between two nodes can use following algorithm：
Wherein, Wp represents the physical link between two nodes, and contact_time represents the total time of two node contacts,
Whole time of total_time fingering row observation statistics, such as a hour.Wp value is bigger, and physics joins between illustrating two nodes
System is more frequent, illustrates that actionable space registration between the two is bigger, that is to say, that have similar hobby field between two nodes
Probability it is bigger.
As optional embodiment, the logical communication link Wl for node j of node i calculating can use following calculate
Method：
Wherein, WlijRepresent the logical communication link for node j of node i, same_dataijRepresent node i, the phase that j has
Same data item number, total_dataiRepresent the data item that node i has.Logical communication link value is bigger, emerging between expression node
Interest is more close.
It should be noted that the logical communication link value for other side of two nodes is likely to different, because both are each
The data item sum having may not be certain total identical.For example, node i has 40 data, node j has 100 data, node i
There are 30 identical data with node j.For node i, node j is exactly seemingly intimate general, because the big portion of node i
Divided data node j has, so the logical communication link Wl for node j of node iijIt is worth for 0.75；And for node j,
Only sub-fraction back end i also has, so the node j logical communication link Wl for node ijiIt is worth for 0.3.
Because perhaps contact is frequent between some nodes, physical link is close, but actually interest is far from each other；And some are saved
Although interest is similar between point, logical communication link is close, and contact is entirely that a coincidence may simply brush past.Therefore, it is necessary to
Consider the frequent situation of communication and the data degree of closeness having, physical link Wp is weighted with logical communication link Wl and combined
To calculate the social relationships intensity Ws between two nodes.Social relationships intensity Ws calculation formula is as follows：
Wsij=α Wlij+(1-α)Wp (3)
Wherein, WsijRepresent the social relationships intensity for node j of node i, WlijRepresent node i for node j's
Logical communication link, Wp represent node i, and the physical link between j, α value is between 0 to 1.
The social relationships intensity level of each node in the neighbor list for source node of source node is calculated, by itself and I
Intensity threshold set in advance be compared, the node more than preset strength threshold value is included the circle of friends of source node.
Data request information is sent in circle of friends by source node has the node of requested data or to requested data
Meet the maximum node of number.So-called to meet meet number of the number finger joint point to data, node meets number to data
It is more, illustrate that node and the nodal distance with the data are nearer.
Further, it is under some implement scenes, it is necessary to each to other node broadcasts for the node in vehicle net
Kind message.The embodiment of the present invention additionally provides the embodiment for sending broadcast message, specific as follows：
When the node in car networking is needed to other node broadcasts message, the node just turns into broadcast node, the broadcast
The broadcast area of node is exactly using the broadcast node as the center of circle, is at a certain distance the prototype region of radius, such as can should
Distance is arranged to 1km.
All nodes of the source node into neighbor list send broadcast message, and broadcast message is carried in the message to be broadcasted
Hold, source node passes through global positioning system (Global Positioning System, abbreviation：GPS the self-position letter) obtained
Breath, broadcast area scope (such as source node need send broadcast message broadcast area be using source node as the center of circle, 1km is
The round region of radius, then the value range of the broadcast area can be set to 1km), type of message, broadcast message title.And will
The title of the broadcast message is recorded in PIT tables.
Further, for the node in vehicle net, it is necessary to be needed to similar interests under some implement scenes
Other nodes asked send message.The embodiment of the present invention additionally provides implementation below, specific as follows：
There is multicast user groups the node in the car networking in similar hobby field to form by a group, the choosing of multicast group user
Select and determined according to the contact between node.
A multicast user groups are given, judge whether source node has similar hobby field to the multicast user groups, such as
Fruit source node has similar hobby field to the multicast user groups, then source node can send multicast to the multicast user groups and disappear
Breath.Source node is calculated to the logical reach of multicast group by equation below：
Wherein, i represents source node, and G represents multicast group, and j is the node in multicast group, WlijIt is source node i for multicast
The logical communication link of node j in group, WpijFor the physical link of the node j in source node i and multicast group, DiGRepresent that source node arrives
The logical reach of multicast group.
When the logical reach of source node to multicast group is less than the threshold value pre-set, judge that source node has with the multicast group
There is similar hobby field, multicast message can be sent to the multicast group.
When source node receives the packet of other nodes return, asked data are parsed from packet and are carried
For the mark of the node of the data.
Node communication method in the car networking that the present embodiment provides, by the foundation of circle of friends, is realized in car networking
Node between communication.Source node is when sending data request information, without being concerned about that whom destination node is, without being concerned about target section
Point it is specific where, communication link need not be more pre-established between source node and destination node, it is only necessary to by what is asked
Data Identification is included in data request information.Therefore it can be very good to meet that the node in vehicle communicates for mobility
Requirement.
Fig. 2 is the flow chart of the node communication method embodiment two in car networking of the present invention.As shown in Fig. 2 the present embodiment
Method can include：
Step 201, receiving node receive data request information, and asked data mark is carried in the data request information
Knowledge and source node identification；
Step 202, receiving node search receiving node according to the Data Identification asked carried in data request information
PIT tables, judge receiving node whether there are asked data；
Step 203a, if receiving node has asked data, the source node identification in data request information
The mark of the data asked and this node is packaged into packet and is sent to source node；
This entrained node identification can be the MAC Address of this node and/or the naming rule using NDN in packet
Name title to this node.
If step 203b, receiving node does not have asked data, data request information is transmitted to this reception section
There is the node of requested data in the circle of friends of point or the maximum node of number is met to requested data.
A kind of possible situation of the present embodiment, when receiving node receives a broadcast message, receiving node is first
According to the PIT tables of this node of the identifier lookup of the broadcast message, judge whether receiving node has treated the broadcast message.If
In the PIT tables of receiving node, broadcast message mark can be matched, then updates in PIT tables and meets number.If saved receiving
Point PIT tables in, match less than the broadcast message identify, then by the identification record of the broadcast message receiving node PIT tables
In, then according to the GPS position information of the broadcast node carried in the GPS position information and broadcast message of receiving node, calculate
Physical distance between receiving node and broadcast node.If the physical distance between two nodes is less than the service area carried in broadcast message
The value of domain scope, then receiving node be located in the broadcast area of broadcast node, receiving node parses to the broadcast message, carries
Relevant information is taken, and the broadcast message is transmitted to all nodes in the neighbor list of receiving node.If the thing between two nodes
Reason is more than the value of the scope of the broadcast area carried in broadcast message, then illustrates the receiving node beyond broadcast node
Broadcast area, then the broadcast message is not processed, directly abandoned.
The alternatively possible situation of the present embodiment, when receiving node receives a multicast message, directly parsed
Obtain relevant information.
Node communication method in the car networking that the present embodiment provides, receiving node are sending asked number to source node
According to when, without being concerned about the particular location of source node, it is only necessary to know that the mark of source node, more without in advance receiving node with
Communication link is established between source node, therefore can be very good to meet the communication of the node in vehicle for ambulant requirement.
Fig. 3 is the structural representation of the node embodiment one in car networking of the present invention.The node 30 includes:Generation module
301 and sending module 302.
Generation module 301, carried for generating data request information, in data request information asked Data Identification with
And source node identification；
Sending module 302, for data request information to be sent into car networking to the next-hop node of circle of friends, so that under
One hop node determines whether there is asked data according to Data Identification, and circle of friends is saved by other nodes in car networking and source
At least one determination in the frequent situation of communication between point and the data degree of closeness having.
Fig. 4 is the structural representation of the node embodiment two in car networking of the present invention.Base of the present embodiment in Fig. 3 embodiments
Realized on plinth, it is specific as follows：
Alternatively, in addition to：
Receiving module 303, for receiving the broadcast beacon bags of any node in car networking.
Computing module 304, for according to the physical link and logical communication link between source node and the node, calculating source node
Social relationships intensity between the node, physical link are used to represent the frequent situation of communication between node, and logical communication link is used
The data degree of closeness having between node is represented.
Optionally, computing module 304 is used for according to the physical link between formula (1) calculating source node and this node, root
The logical communication link between source node and this node is calculated according to formula (2), is calculated according to formula (3) between source node and this node
Social relationships intensity.
Determining module 305, when social relationships intensity is more than setting intensity threshold, then the node is included source node by source node
Circle of friends.
Optionally, sending module 302 is additionally operable to broadcast the message in the broadcast area of source node, the node in broadcast area
Physical distance to source node is less than setpoint distance threshold value.
Optionally, sending module 302 is additionally operable to the multicast message in multicast group, and the logical reach of source node to multicast group is small
In setpoint distance threshold value.
Optionally, computing module 304 is additionally operable to calculate source node to the logical reach of multicast group according to formula (4).
Node embodiment 1 and 2 is corresponding with the embodiment of the method shown in Fig. 1, and its specific implementation procedure refers to method
The corresponding contents of embodiment.
Fig. 5 is the structural representation of the node embodiment three in car networking of the present invention.The node 50 includes:Receiving module
501st, judge module 502 and sending module 503.
Receiving module 501, for receiving the data request information of source node transmission, carry and asked in data request information
Data Identification and source node identification；
Judge module 502, for judging whether this node has asked data according to Data Identification；
Sending module 503, if this node has asked data, the data asked are sent out according to source node identification
Give source node；Or
If this node does not have asked data, data request information is forwarded to the next of circle of friends in car networking
Hop node, so that next-hop node determines whether there is asked data according to Data Identification, circle of friends is by vehicle net
At least one determination in the frequent situation of communication between node and receiving node and the data degree of closeness having.
Fig. 6 is the structural representation of the node embodiment four in car networking of the present invention.Base of the present embodiment in Fig. 5 embodiments
Realized on plinth, it is specific as follows：
Alternatively, in addition to：
Determining module 504, for having the node of requested data in each node by circle of friends or to requested data
The maximum node of number of meeting be used as next-hop node, meet each node that number is used to represent in circle of friends and meet the institute and ask
Seek the number of data.
Node embodiment 3 and 4 is corresponding with the embodiment of the method shown in Fig. 2, and its specific implementation procedure refers to method
The corresponding contents of embodiment.
Node in the car networking of the offer of the present embodiment, it can be used for the technical scheme for performing above method embodiment,
Its implementing principle and technical effect is similar, and here is omitted.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above-mentioned each method embodiment can lead to
The related hardware of programmed instruction is crossed to complete.Foregoing program can be stored in a computer read/write memory medium.The journey
Sequence upon execution, execution the step of including above-mentioned each method embodiment；And foregoing storage medium includes：ROM, RAM, magnetic disc or
Person's CD etc. is various can be with the medium of store program codes.
Finally it should be noted that：Various embodiments above is merely illustrative of the technical solution of the present invention, rather than its limitations；To the greatest extent
The present invention is described in detail with reference to foregoing embodiments for pipe, it will be understood by those within the art that：Its according to
The technical scheme described in foregoing embodiments can so be modified, either which part or all technical characteristic are entered
Row equivalent substitution；And these modifications or replacement, the essence of appropriate technical solution is departed from various embodiments of the present invention technology
The scope of scheme.
Claims (22)
- A kind of 1. node communication method in car networking, it is characterised in that including：Source node generates data request information, and asked Data Identification and source node mark are carried in the data request information Know；The source node sends the data request information into car networking the next-hop node of circle of friends, so that described next Hop node determines whether there is asked data according to the Data Identification, and the circle of friends is by the node in car networking and institute State at least one determination in the frequent situation of communication between source node and the data degree of closeness having.
- 2. according to the method for claim 1, it is characterised in that described to send the data request information into car networking Before the next-hop node of circle of friends, in addition to：The source node receives any node broadcast beacon bags in car networking；The source node according to the physical link and logical communication link between this node and the node, calculate this node and the node it Between social relationships intensity, the physical link is used to represent the frequent situation of communication between node, and the logical communication link is used for Represent the data degree of closeness having between node；If the social relationships intensity is more than setting intensity threshold, the source node includes the node friend of this node Friend's circle.
- 3. according to the method for claim 2, it is characterised in that the source node is according to the thing between this node and the node Reason contact and logical communication link, before calculating the social relationships intensity between this node and the node, in addition to：According toDetermine the physical link between node；Wherein, the Wp represents physical link, and contact_time represents the total time of two node contacts, total_time fingering The whole time of row observation statistics.
- 4. according to the method for claim 2, it is characterised in that the source node is according to the thing between this node and the node Reason contact and logical communication link, before calculating the social relationships intensity between this node and the node, in addition to：According toDetermine the logical communication link between node；Wherein, WlijRepresent the logical communication link for node j of node i, same_dataijRepresent node i, the identical that j has Data item number, total_dataiRepresent the data item sum that node i has.
- 5. according to the method for claim 2, it is characterised in that the source node is according to the thing between this node and the node Reason contact and logical communication link, calculate the social relationships intensity between this node and the node, specifically include：According toWsij=α Wlij+ (1- α) Wp determine the social relationships intensity between node；Wherein, WsijRepresent the social relationships intensity for node j of node i, WlijRepresent the logic for node j of node i Contact, Wp expression node is, the physical link between j, α value is between 0 to 1.
- 6. according to the method for claim 2, it is characterised in that the source node sends the data request information to car In networking before the next-hop node of circle of friends, in addition to：By the node in each node of the circle of friends with requested data or to requested data to meet number maximum Node is described to meet number for representing that each node in the circle of friends meets the number of request as the next-hop node According to number.
- 7. according to the method for claim 2, it is characterised in that methods described also includes：The source node broadcasts the message in broadcast area, physical distance of the node in the broadcast area to the source node Less than setpoint distance threshold value.
- 8. according to the method for claim 2, it is characterised in that methods described also includes：Source node multicast message in multicast group, the logical reach of the source node to multicast group are less than setpoint distance threshold Value.
- 9. according to the method for claim 8, it is characterised in that the logical reach of the source node to multicast group is less than setting Distance threshold, in addition to：According to<mrow> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mi>G</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>&Element;</mo> <mi>G</mi> </mrow> </msub> <msub> <mi>Wl</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>&Element;</mo> <mi>G</mi> </mrow> </msub> <msub> <mi>Wp</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </mfrac> </mrow>Determine source node to the logical reach of multicast group；Wherein, i represents source node, and G represents multicast group, and j is the node in multicast group, WlijIt is source node i in multicast group Node j logical communication link, WpijFor the physical link of the node j in source node i and multicast group, DiGRepresent source node to multicast The logical reach of group.
- A kind of 10. node communication method in car networking, it is characterised in that including：Receiving node receives the data request information that source node is sent, and asked data mark is carried in the data request information Knowledge and the source node identification；, will according to the source node identification if the receiving node determines there is asked data according to the Data Identification The data asked are sent to the source node；OrIf the receiving node determines do not have asked data according to the Data Identification, by the data request information The next-hop node of circle of friends in car networking is forwarded to, so that the next-hop node determines whether have according to the Data Identification The data asked, the circle of friends is by the frequent situation of communication and tool between the node in vehicle net and the receiving node At least one determination in some data degrees of closeness.
- 11. according to the method for claim 10, it is characterised in that described that the data request information is forwarded to car networking Before the next-hop node of middle circle of friends, in addition to：By the node in each node of the circle of friends with requested data or to requested data to meet number maximum Node is described to meet number for representing that each node in the circle of friends meets the number of request as the next-hop node According to number.
- A kind of 12. car networking node, it is characterised in that including：Generation module, carried for generating data request information, in the data request information asked Data Identification and Source node identification；Sending module, for the data request information to be sent into car networking to the next-hop node of circle of friends, so that described Next-hop node determines whether there is asked data according to the Data Identification, and the circle of friends is by other in car networking At least one determination in the frequent situation of communication between node and source node and the data degree of closeness having.
- 13. node according to claim 12, it is characterised in that also include：Receiving module, for receiving the broadcast beacon bags of any node in car networking；Computing module, for according to the physical link and logical communication link between source node and the node, calculating source node and the section Social relationships intensity between point, the physical link are used to represent the frequent situation of communication between node, the logical communication link For the data degree of closeness for representing to have between node；Determining module, if being more than setting intensity threshold for the social relationships intensity, the source node includes the node The circle of friends of source node.
- 14. node according to claim 13, it is characterised in that the computing module is additionally operable to：According toDetermine the physical link between node；Wherein, the Wp represents physical link, and contact_time represents the total time of two node contacts, total_time fingering The whole time of row observation statistics.
- 15. node according to claim 13, it is characterised in that the computing module is additionally operable to：According toDetermine the logical communication link between node；Wherein, WlijRepresent the logical communication link for node j of node i, same_dataijRepresent node i, the identical that j has Data item number, total_dataiRepresent the data item sum that node i has.
- 16. node according to claim 13, it is characterised in that the computing module is specifically used for：According toWsij=α Wlij+ (1- α) Wp determine the social relationships intensity between node；Wherein, WsijRepresent the social relationships intensity for node j of node i, WlijRepresent the logic for node j of node i Contact, Wp expression node is, the physical link between j, α value is between 0 to 1.
- 17. node according to claim 13, it is characterised in that the determining module is additionally operable to：By the node in each node of the circle of friends with requested data or to requested data to meet number maximum Node is described to meet number for representing that each node in the circle of friends meets the number of request as the next-hop node According to number.
- 18. node according to claim 13, it is characterised in that the sending module is additionally operable to：In the broadcast of source node Broadcast the message in region, the physical distance of node to source node in the broadcast area is less than setpoint distance threshold value.
- 19. node according to claim 13, it is characterised in that the sending module is additionally operable to：The multicast in multicast group Message, the logical reach of source node to multicast group are less than setpoint distance threshold value.
- 20. according to the method for claim 19, it is characterised in that the computing module is additionally operable to：According to<mrow> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mi>G</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>&Element;</mo> <mi>G</mi> </mrow> </msub> <msub> <mi>Wl</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>&Element;</mo> <mi>G</mi> </mrow> </msub> <msub> <mi>Wp</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </mfrac> </mrow>Determine source node to the logical reach of multicast group；Wherein, i represents source node, and G represents multicast group, and j is the node in multicast group, WlijIt is source node i in multicast group Node j logical communication link, WpijFor the physical link of the node j in source node i and multicast group, DiGRepresent source node to multicast The logical reach of group.
- A kind of 21. car networking node, it is characterised in that including：Receiving module, for receiving the data request information of source node transmission, carry what is asked in the data request information Data Identification and the source node identification；Judge module, for judging whether this node has asked data according to the Data Identification；Sending module, if this node has asked data, the data asked are sent according to the source node identification To the source node；OrIf this node does not have asked data, the data request information is forwarded to the next of circle of friends in car networking Hop node, so that the next-hop node determines whether there is asked data, the circle of friends according to the Data Identification By in the frequent situation of communication between the node in vehicle net and the receiving node and the data degree of closeness having at least One determination.
- 22. node according to claim 21, it is characterised in that also include：Determining module, for having the node of requested data or the chance to requested data in each node by the circle of friends See the maximum node of number as the next-hop node, each node chance met number and be used to represent in the circle of friends See the number of the requested data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710566184.1A CN107508855B (en) | 2017-07-12 | 2017-07-12 | Node communication method in Internet of vehicles and Internet of vehicles node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710566184.1A CN107508855B (en) | 2017-07-12 | 2017-07-12 | Node communication method in Internet of vehicles and Internet of vehicles node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107508855A true CN107508855A (en) | 2017-12-22 |
| CN107508855B CN107508855B (en) | 2020-03-27 |
Family
ID=60679737
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710566184.1A Active CN107508855B (en) | 2017-07-12 | 2017-07-12 | Node communication method in Internet of vehicles and Internet of vehicles node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107508855B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108834098A (en) * | 2018-04-28 | 2018-11-16 | 长安大学 | A kind of car networking data forwarding method based on name data network |
| CN109283562A (en) * | 2018-09-27 | 2019-01-29 | 北京邮电大学 | Three-dimensional vehicle localization method and device in a kind of car networking |
| CN110311753A (en) * | 2019-06-21 | 2019-10-08 | 杭州飞步科技有限公司 | Communication means, device, node, storage medium and system |
| CN112153599A (en) * | 2020-09-22 | 2020-12-29 | 大唐高鸿数据网络技术股份有限公司 | Message transmission method and device, Internet of vehicles equipment and management node |
| US11159644B2 (en) | 2018-10-26 | 2021-10-26 | Ford Global Technologies, Llc | Named-data networks for vehicle-to-infrastructure communication |
| US11789442B2 (en) | 2019-02-07 | 2023-10-17 | Ford Global Technologies, Llc | Anomalous input detection |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0782120A1 (en) * | 1995-12-28 | 1997-07-02 | Matsushita Electric Industrial Co., Ltd. | Method and apparatus for searching a route |
| CN105228180A (en) * | 2015-09-29 | 2016-01-06 | 江苏大学 | A kind of vehicle-mounted Delay Tolerant Network method for routing estimated based on node transfer capability |
| CN105657777A (en) * | 2016-03-14 | 2016-06-08 | 西安电子科技大学 | Routing protocol design method based on link quality and node forwarding capacity |
| CN106657261A (en) * | 2016-11-08 | 2017-05-10 | 西安电子科技大学宁波信息技术研究院 | Coalition game and distance prediction based inter-vehicle data transmission method in Internet of Vehicles |
-
2017
- 2017-07-12 CN CN201710566184.1A patent/CN107508855B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0782120A1 (en) * | 1995-12-28 | 1997-07-02 | Matsushita Electric Industrial Co., Ltd. | Method and apparatus for searching a route |
| CN105228180A (en) * | 2015-09-29 | 2016-01-06 | 江苏大学 | A kind of vehicle-mounted Delay Tolerant Network method for routing estimated based on node transfer capability |
| CN105657777A (en) * | 2016-03-14 | 2016-06-08 | 西安电子科技大学 | Routing protocol design method based on link quality and node forwarding capacity |
| CN106657261A (en) * | 2016-11-08 | 2017-05-10 | 西安电子科技大学宁波信息技术研究院 | Coalition game and distance prediction based inter-vehicle data transmission method in Internet of Vehicles |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108834098A (en) * | 2018-04-28 | 2018-11-16 | 长安大学 | A kind of car networking data forwarding method based on name data network |
| CN109283562A (en) * | 2018-09-27 | 2019-01-29 | 北京邮电大学 | Three-dimensional vehicle localization method and device in a kind of car networking |
| US11159644B2 (en) | 2018-10-26 | 2021-10-26 | Ford Global Technologies, Llc | Named-data networks for vehicle-to-infrastructure communication |
| US11789442B2 (en) | 2019-02-07 | 2023-10-17 | Ford Global Technologies, Llc | Anomalous input detection |
| CN110311753A (en) * | 2019-06-21 | 2019-10-08 | 杭州飞步科技有限公司 | Communication means, device, node, storage medium and system |
| CN110311753B (en) * | 2019-06-21 | 2022-04-15 | 杭州飞步科技有限公司 | Communication method, communication device, communication node, communication storage medium and communication system |
| CN112153599A (en) * | 2020-09-22 | 2020-12-29 | 大唐高鸿数据网络技术股份有限公司 | Message transmission method and device, Internet of vehicles equipment and management node |
| CN112153599B (en) * | 2020-09-22 | 2023-03-24 | 中信科智联科技有限公司 | Message transmission method and device, internet of vehicles equipment and management node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107508855B (en) | 2020-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107508855A (en) | Node communication method and car networking node in car networking | |
| Wang et al. | A survey on geographic routing protocols in delay/disruption tolerant networks | |
| Sadilek et al. | Crowdphysics: Planned and opportunistic crowdsourcing for physical tasks | |
| Blazevic et al. | A location-based routing method for mobile ad hoc networks | |
| Zhao et al. | IPARK: Location-aware-based intelligent parking guidance over infrastructureless VANETs | |
| CN101772193A (en) | Method, system and mobile access gateway for optimizing local routing | |
| Sharma et al. | An update on location based services: Current state and future prospects | |
| CN103874022A (en) | Method for information communication based on positions, mobile terminal and service platform | |
| Li et al. | Adaptive fuzzy multiple attribute decision routing in VANETs | |
| Kumbhar et al. | DT-VAR: Decision tree predicted compatibility-based vehicular ad-hoc reliable routing | |
| Ma et al. | Traffic-aware data delivery scheme for urban vehicular sensor networks | |
| Madasamy et al. | Geographical angular zone‐based optimal resource allocation and efficient routing protocols for vehicular ad hoc networks | |
| CN108121725A (en) | A kind of searching method and device | |
| Jabbarpour et al. | Analyzing the impacts of velocity and density on intelligent position-based routing protocols | |
| Urquiza-Aguiar et al. | 2hGAR: 2-hops geographical anycast routing protocol for vehicle-to-infrastructure communications | |
| Keshavarz et al. | Beacon-based geographic routing protocols in vehicular ad hoc networks: a survey and taxonomy | |
| Liya et al. | An efficient traffic geographic static-node-assisted routing in VANET | |
| CN105119905B (en) | A kind of information push method and device | |
| Bhatia et al. | Generating Trips and Assigning Route to a SUMO Network Through the Origin–Destination Matrix: A Case Study of Mobility Routing Model for VANETs | |
| Liu et al. | A grid and vehicle density prediction-based communication scheme in large-scale urban environments | |
| Langa et al. | Evaluating Named Data Networking forwarding strategies in different IoT topologies | |
| Malathi et al. | IMPENDING USE OF NAME DATA NETWORKING IN VEHICLE-TO-VEHICLE COMMUNICATION. | |
| CN104426769A (en) | Routing method and router | |
| CN107888495A (en) | A kind of route computing method and device | |
| CN103096277B (en) | Method and device for obtaining geographical location information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |