CN106850553B - A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network - Google Patents
A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network Download PDFInfo
- Publication number
- CN106850553B CN106850553B CN201611193679.6A CN201611193679A CN106850553B CN 106850553 B CN106850553 B CN 106850553B CN 201611193679 A CN201611193679 A CN 201611193679A CN 106850553 B CN106850553 B CN 106850553B
- Authority
- CN
- China
- Prior art keywords
- backbone
- node
- service
- nodes
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 16
- 238000004891 communication Methods 0.000 title claims abstract description 13
- PJISLFCKHOHLLP-UHFFFAOYSA-N 2-diethoxyphosphorylsulfanyl-n,n-diethylethanamine Chemical compound CCOP(=O)(OCC)SCCN(CC)CC PJISLFCKHOHLLP-UHFFFAOYSA-N 0.000 title claims abstract 3
- 238000012423 maintenance Methods 0.000 claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims description 8
- 230000008859 change Effects 0.000 claims description 6
- 238000012360 testing method Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 5
- 238000012790 confirmation Methods 0.000 claims description 3
- 238000012856 packing Methods 0.000 claims description 2
- 239000004576 sand Substances 0.000 claims description 2
- 230000007480 spreading Effects 0.000 claims description 2
- 230000000737 periodic effect Effects 0.000 abstract description 3
- 230000000644 propagated effect Effects 0.000 abstract 1
- 230000008901 benefit Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000010998 test method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/26—Special purpose or proprietary protocols or architectures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0226—Traffic management, e.g. flow control or congestion control based on location or mobility
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/80—Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Computing Systems (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of implementation methods of improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network, and foundation and maintenance, distribution service discovery rule and demand for services packet including backbone network are propagated and service backtracking Route establishment.The present invention utilizes the heartbeat message including node unique identification VIN and geographical location of periodic broadcasting in V2X network, backbone node network is constructed, a large amount of foundation and maintenance message package is saved, reduces the quantity of forward node, by backbone node network, the broadcast and discovery efficiency of service are improved.
Description
Technical Field
The invention relates to a method for realizing an improved DSDP service discovery protocol suitable for a vehicle-mounted short-distance communication network, belonging to the technical field of vehicle-mounted networks.
Background
The Vehicle-mounted short-distance communication (Vehicle to X: V2X) Network is used for communication among a Vehicle (CAN-Controller Area Network), a Vehicle road (Vehicle-2-RSU), a Vehicle (Vehicle-2-Vehicle), a Vehicle outside (Vehicle-2-Infrastructure) and a human Vehicle (Vehicle-2-Person) realized by short-distance communication technologies such as wireless communication, GPS/GIS, sensing and the like.
A service discovery protocol may enable a network node to search for a desired service in a network. As the network scale is continuously enlarged, services on the network are more and more complicated and diversified, so how to find available services from massive network resources becomes a problem to be solved urgently, and a service discovery protocol becomes an important part of network field research.
DSDP (Distributed Service Directory Protocol) is an important Service discovery Protocol in wireless ad hoc networks, and compared with other Service discovery protocols, the DSDP is mainly characterized in that Service discovery capability is improved by establishing and maintaining a backbone network in a network. The service discovery is carried out through the backbone network, so that the information packet overhead is reduced, the response speed is improved, and the transmission efficiency is obviously improved.
In the V2X network, because each vehicle-mounted node periodically broadcasts a message (hereinafter referred to as heartbeat information) including a unique vehicle identifier and a geographic location, the vehicle-mounted node can obtain the geographic location, signal transmission characteristics and other information of the surrounding vehicle-mounted nodes by receiving the heartbeat information broadcast by the surrounding nodes, and the establishment and maintenance of the backbone node network are realized by using the heartbeat information, so that the network overhead caused by the transmission of related messages for establishing and maintaining the backbone nodes in the conventional DSDP protocol can be greatly reduced, and the performance of the DSDP protocol in the V2X network is improved.
The invention aims to improve the traditional DSDP protocol by utilizing heartbeat information periodically broadcast by each node of a V2X network, mainly relates to the establishment and maintenance of the nodes of the traditional DSDP backbone network, enables the traditional DSDP protocol to adapt to the characteristics of V2X, reduces network overhead, improves the speed and efficiency of service discovery, and better meets the realization of the service discovery function in the V2X network.
Disclosure of Invention
The invention provides a method for realizing an improved DSDP Service discovery Protocol suitable for a vehicle-mounted short-distance communication network, which mainly comprises the step of improving the traditional DSDP (Distributed Service Directory Protocol) by utilizing heartbeat information periodically broadcast by each node in the vehicle-mounted short-distance communication network (V2X) so as to adapt to the characteristics of the V2X network.
The invention provides a method for realizing an improved DSDP service discovery protocol suitable for a vehicle-mounted short-distance communication network, which is characterized by comprising three parts of steps S1, S2 and S3 in service broadcasting and discovery, wherein each part comprises the following steps:
s1, establishing and maintaining backbone network, which comprises
S11, calculating the stability;
s12, applying for backbone nodes;
s13, establishing a backbone network;
s14, maintaining the backbone network;
s2, distributing service discovery rules, including
S21, generating a backbone node service broadcast packet:
s22, forwarding and updating service broadcast packet group:
s3, service requirement packet propagation and service backtracking route establishment, which comprises
S31, spreading a service requirement packet;
and S32, establishing the service backtracking route.
Preferably, in step S11, the stability is calculated by using the speed of the node and the distance change from the other vehicle, and the distance change from the other vehicle is obtained by receiving a message (hereinafter, referred to as heartbeat information) including a geographical position, which is periodically broadcast by the other vehicle.
Preferably, in step S12, if the non-backbone node does not receive the identity information broadcast by the backbone node in the period set by the system, the node initiates a backbone node request, and the node with the highest stability becomes the backbone node in the same coverage area.
Preferably, in step S13, after the backbone nodes are established, the next level of backbone nodes are determined by testing from the node with the farthest coverage area using the received heartbeat information, so as to reduce the number of backbone node networks.
Preferably, in step S21, the non-backbone node sends the service information to the backbone nodes to form service broadcast packets, and each backbone node forms a service broadcast packet group in forwarding.
Preferably, in step S22, each backbone node updates the information of the node in the service broadcast packet group during the period that the service broadcast packet group is periodically transmitted in the backbone node network.
Preferably, in step S31, when the service request packet is received, the node information providing the service is found from the service broadcast packet group cached locally, and then the node information is sent to the backbone node in the coverage area, and a service link is formed through the backbone node network.
The invention discloses an improved DSDP service discovery protocol suitable for a vehicle-mounted short-distance communication network, which is characterized in that a backbone node network is constructed by utilizing heartbeat information which is regularly broadcasted in a V2X network and comprises a node unique identifier VIN and a geographical position, so that a large number of message packets are saved, the number of forwarding nodes is reduced, and the broadcasting and discovery efficiency of services is improved through the backbone node network.
Drawings
FIG. 1 is a detailed workflow diagram according to an embodiment of the invention;
FIG. 2 is a format of a backbone node broadcast message;
FIG. 3 is a schematic diagram of a backbone node testing method;
fig. 4 is a format of a service broadcast packet transmitted by a non-backbone node;
fig. 5 is a format of a service broadcast packet of a backbone node;
fig. 6 is a format of a service requirement packet.
Detailed Description
The conventional Service discovery Protocol DSDP (Distributed Service discovery Protocol) improves Service discovery capability through a backbone network in a network. Compared with other service discovery protocols, the service discovery protocol has the advantages that the speed and the efficiency of service discovery and the network consumption are greatly improved due to the adoption of the backbone network, and the service discovery protocol is excellent in performance. However, the establishment and maintenance of a backbone network in the network requires additional message packets, and the message packets are sent and interacted periodically, which occupies a large amount of network resources and affects security applications with extremely high real-time requirements, thereby restricting the application of the protocol in V2X.
In the embodiment, the advantage that in V2X, the vehicle-mounted node periodically broadcasts the heartbeat information including the respective geographical location is fully utilized, the conventional DSDP protocol is improved, the number of message packets and the complexity of the message packets required by the establishment and maintenance of the backbone network are reduced, and the improved DSDP protocol can meet the requirements of the V2X network.
The invention comprises three parts, namely the establishment and maintenance of a backbone network, the transmission of a distributed service discovery rule and a service requirement packet and the establishment of a service backtracking route. Firstly, each node calculates the stability, determines whether the requirements of the backbone nodes are met, the nodes with higher stability become the backbone nodes, then judges and selects the next level of backbone nodes one by one from the farthest nodes in the coverage range according to the received heartbeat information, finally forms a backbone node network, and utilizes the heartbeat information to maintain the nodes according to the same principle. After the backbone node network is established, a service providing packet group consisting of service packets provided by nodes within the coverage range of each backbone node is transmitted in the network, and the service providing packet group is updated in the process of periodic round-trip transmission. The service discovery rule is that a service request node searches a required service in a service broadcast packet group transmitted by a backbone node to form a service requirement packet, the service requirement packet is transmitted to a service providing node by a backbone node network, and the service providing node transmits a service confirmation packet, so that a backtracking route is established, and the service discovery process is completed.
The present invention will be described in further detail with reference to the accompanying drawings and examples.
The improved DSDP service discovery protocol in the embodiment consists of 3 parts, namely the establishment and maintenance of a backbone network, the propagation of a distributed service discovery rule and a service requirement packet and the establishment of a service backtracking route.
The traditional DSDP backbone network establishment process is divided into three stages: packet collection, role determination, and backbone establishment. In the packet collection phase, each node periodically sends hello packets, and the nodes continuously cache the received packets. And after the packet collection phase is finished, entering a role determination phase. In the role determination phase, the node determines its own role according to the collected information. The node with the highest link stability and the undetermined role becomes the backbone node, and the node with the determined role broadcasts the decision of the node to complete the role determination stage. In the stage of backbone network establishment, the backbone nodes determine paths among all backbone nodes according to local routing information collected by the packets, the backbone network establishment is completed, and the stage of backbone network maintenance is entered. DSDP can maintain the effectiveness of backbone network, and deal with the situation of network fracture, loss backbone node, etc.
The improved DSDP protocol utilizes periodic heartbeat information to complete the establishment and maintenance of a backbone network, and comprises the following specific steps:
first part, the establishment and maintenance of backbone networks
The steps of establishing and maintaining the backbone network are as follows:
1.1, calculating the stability:
each vehicle-mounted node periodically reads the geographical position information of the vehicle, and then calculates the driving direction of the vehicle, the speed of the vehicle, the distance change between the vehicle and surrounding vehicles and the vehicle stabilityWherein,is a statistical time t set by the systemsThe average change speed of the own vehicle in the vehicle,is the average distance variation from other vehicles. When S is less than the threshold S set by the systemhThe vehicle meets the stability requirement as a backbone node.
1.2 backbone node application
The backbone node broadcasts the identity information of the backbone node periodically, if the vehicle-mounted node is at the time t set by the systemBIf the broadcast message of the backbone node is not received, each node with stability meeting the backbone requirement randomly sends the broadcast message of the backbone node, and the format is shown in fig. 2. If more than 1 node broadcasts identity information at the same time, the node with the highest stability obtains the identity of the backbone node.
1.3 backbone network establishment
The backbone node determines the selection range of the next-level candidate node by receiving the geographical position information in the heartbeat information periodically broadcast by the surrounding nodes,
determining a vehicle set V ═ V traveling in the same direction as the own nodeH,VBIn which VHIs a set of vehicles travelling in the same direction, V, ahead of the direction of travel of the A nodeBIs a set of vehicles traveling in the same direction behind the a-node traveling direction. Then, according to the geographical position, the distance with the node A is calculated, and then the distance is sequenced according to the distance,
the vehicles with the farthest distance are respectivelyAndfirst chooseThe test is carried out, the test method is as shown in figure 3, the backbone node is towards the nodeSending a node stability request, the nodeSending stability information, and judging whether the stability S of the node is less than a threshold S set by a system by the backbone nodehTo the nodeSending a backbone node request, a nodeIf the backbone node determination message is sent, the next level of backbone nodesAnd (4) determining. If the farthest nodeIf the stability does not meet the requirement, selecting the next-farthest nodeThe same test is performed until the next level of backbone nodes is determined.
And determining the farther backbone node of the next level according to the same method until the next level backbone node can not be found.
In the same way, in the opposite direction of travelThe nodes perform the same operation and establish a backbone network in the reverse direction.
1.4 backbone network maintenance
Backbone network maintenance is divided into two parts, namely, a network is broken, and a non-backbone node is lost and a backbone node is lost
For the maintenance of network fracture, each level of backbone nodes sense the existence of the upper and lower level backbone nodes by receiving respective broadcast heartbeat information. If the nth backbone nodeThe next level backbone node is not received in n periods of system settingAfter the heartbeat information, if the backbone network is interrupted, the backbone nodeExecuting step 1.3 to re-determine the next level backbone nodeIf nodeNo backbone nodes exist in the rangeThen, the method of 1.3 is continued to determine the backbone node at the further levelIt is known to reestablish the backbone network.
For the maintenance of the non-backbone nodes losing the backbone nodes, the non-backbone nodes do not receive the messages periodically broadcast by the backbone nodes in n periods, and the backbone node network is reestablished according to the steps of 1.2 and 1.3 until the non-backbone nodes are connected with the original backbone node network or farther backbone nodes cannot be found.
Second part, Distributed Service Discovery rule (Distributed Service Discovery AlgorithmDSDA)
2.1 generating backbone node service broadcast packet
Non-backbone node A will serve the broadcast PacketASent to the backbone nodes in the format shown in fig. 4, where,
the Type indicates that the Type of the packet is a backbone node service broadcast packet;
the ID represents the number of the packet and is used for distinguishing different service notification packets sent by the node A;
VIN sending node identification code for identifying node A
Content identification of Service description providing Service
The backbone node receives a service broadcast packet sent by a non-backbone node within a coverage area to form a local service Information cache sic (service Information cache), and the format of the local service Information cache sic (service Information cache) is the same as that of fig. 4. After the backbone node and the service broadcast packet (if any) provided by the node are aggregated, a service broadcast packet of the backbone node is formed, and the format is shown in fig. 5, where:
the Type indicates that the Type of the packet is a summary service broadcast packet;
the Service description summarization summarizes the Service content identification of each non-backbone node, and consists of two parts, wherein Sn is the VIN of the non-backbone node, and Service is the Service description of the node.
2.2 Forwarding and updating service broadcast packet groups
A first backbone node NB1First, the aggregated service packageSent to the next backbone node NB2，NB2The summary service of the node is packaged withAfter combining, formAnd then sent to the next backbone node NB3Up to the last backbone node or the largest backbone node NB set by the systemnForming service broadcast packages for each backbone node
After the first transmission and after the delay tau set by the delay system, the backbone node NBnPacketizing service broadcasts into ∑ packetsNBTo reverse transmission, via any backbone node NBiBackbone node NBiUpdating the related service broadcast packet of the service broadcast packet group replaced by the latest service broadcast packet in the coverage area, and then continuously transmitting the updated service broadcast packet to the next level backbone node to complete the updating of the service broadcast packet until the first backbone node NB1。
The above process is repeated to keep the content of the service broadcast packet transmitted between the backbone nodes up to date.
Third part, service requirement packet propagation and service backtracking route establishment
3.1 service requirement packet propagation
When the backbone node broadcasts the service broadcast packet group, the non-backbone nodes in the coverage area receive the service broadcast packet group and store the service broadcast packet group to the local to form a local SIC. Assuming that node B needs M service, searching in SIC, if finding out corresponding node S, taking out node identification VIN providing servicesThen packing the service requirement PacketBAnd the backbone nodes are sent to the backbone nodes in the coverage range of the backbone nodes, forwarded to the next level of backbone nodes by the backbone nodes, know the backbone nodes in the coverage range of the service providing node S and then sent to the service providing node S. Service requirement Packet formatBAs shown in fig. 6. Wherein:
the Type indicates that the Type of the packet is a service requirement packet;
VIN-S denotes a VIN (vehicle identification number) of the service providing node;
the Server ID request service code is used for distinguishing different request services of the same node;
the Requested Service represents description information of the Requested Service;
receiver ID indicates the next hop receiving node's code, which is an added field, with the selected forwarding node VmVIN padding of (1);
VIN-R represents the node identification VIN of the service receiving node;
3.2 service traceback route establishment
Service providing node receives PacketBThen, reply confirmation data PacketsAnd establishing a service backtracking route from the backbone node network to the service request node, wherein subsequent related services can be transmitted between the two nodes through the backbone node network.
The above description is of the preferred embodiment of the present invention and the technical principles applied thereto, and it will be apparent to those skilled in the art that any changes and modifications based on the equivalent changes and simple substitutions of the technical solution of the present invention are within the protection scope of the present invention without departing from the spirit and scope of the present invention.
Claims (1)
1. A method for implementing improved DSDP service discovery protocol suitable for vehicle-mounted short-distance communication network is characterized in that in service broadcasting and discovery, three parts of S1, S2 and S3 are included, each part includes the following steps:
s1, establishing and maintaining backbone network, which comprises
S11, calculating the stability;
s12, applying for backbone nodes;
s13, establishing a backbone network;
s14, maintaining the backbone network;
s2, distributing service discovery rules, including
S21, generating a backbone node service broadcast packet:
s22, forwarding and updating service broadcast packet group:
s3, service requirement packet propagation and service backtracking route establishment, which comprises
S31, spreading a service requirement packet;
s32, establishing a service backtracking route, wherein
The steps of establishing and maintaining the backbone network are as follows:
1.1, calculating the stability:
each vehicle-mounted node periodically reads the geographical position information of the vehicle, and then calculates the driving direction of the vehicle, the speed of the vehicle, the distance change between the vehicle and surrounding vehicles and the vehicle stabilityWherein,is a statistical time t set by the systemsThe average change speed of the own vehicle in the vehicle,is the average distance variation from other vehicles; when S is less than the threshold S set by the systemhWhen the vehicle meets the stability requirement as a backbone node;
1.2 backbone node application
The backbone node broadcasts the identity information of the backbone node periodically, if the vehicle-mounted node is at the time t set by the systemBIf the broadcast message of the backbone node is not received, each node with the stability meeting the backbone requirement randomly sends the broadcast message of the backbone node, and if more than 1 node broadcasts the identity information at the same timeIf yes, the node with the highest stability obtains the identity of the backbone node;
1.3 backbone network establishment
The backbone node determines the selection range of the next-level candidate node by receiving the geographical position information in the heartbeat information periodically broadcast by the surrounding nodes,
determining a vehicle set V ═ V traveling in the same direction as the own nodeH,VBIn which VHIs a set of vehicles travelling in the same direction, V, ahead of the direction of travel of the A nodeBIs a vehicle set which runs in the same direction behind the driving direction of the node A; then, according to the geographical position, the distance with the node A is calculated, and then the distance is sequenced according to the distance,
the vehicles with the farthest distance are respectivelyAndfirst chooseTesting is carried out, from the backbone node to the nodeSending a node stability request, the nodeSending stability information, and judging whether the stability S of the node is less than a threshold S set by the system when the backbone nodehTo the nodeSending a backbone node request, a nodeIf the backbone node determination message is sent, the next level of backbone nodesDetermining; if the farthest nodeIf the stability does not meet the requirement, selecting the next-farthest nodeExecuting the same test until determining the next level of backbone nodes;
determining a more distant primary backbone node by the next primary backbone node according to the same method until the next primary backbone node cannot be found;
in the same way, in the opposite direction of travelThe nodes execute the same operation and establish a backbone network in the reverse direction;
1.4 backbone network maintenance
The backbone network maintenance is divided into two parts, namely, a network is broken and backbone nodes are lost by non-backbone nodes;
for the maintenance of network fracture, each level of backbone nodes sense the existence of the upper and lower level of backbone nodes by receiving respective broadcast heartbeat information; if the nth backbone nodeThe next level backbone node is not received in n periods of system settingAfter the heartbeat information, if the backbone network is interrupted, the backbone nodeExecuting step 1.3 to re-determine the next level backbone nodeIf nodeIf no backbone node exists in the range, determining the backbone node at the farther level according to the method of 1.3Until the backbone network is reestablished;
for maintenance of the non-backbone nodes losing the backbone nodes, the non-backbone nodes do not receive messages periodically broadcast by the backbone nodes in n periods, and the backbone node network is reestablished according to the steps of 1.2 and 1.3 until the non-backbone nodes are connected with the original backbone node network or farther backbone nodes cannot be found;
the distributed service discovery rules include
2.1 generating backbone node service broadcast packet
Non-backbone node A will serve the broadcast PacketAAnd is sent to the backbone node, wherein,
the backbone nodes receive service broadcast packets sent by non-backbone nodes in a coverage range to form local service information cache, and the backbone nodes and the service broadcast packets provided by the backbone nodes are aggregated to form service broadcast packets of the backbone nodes;
2.2 Forwarding and updating service broadcast packet groups
A first backbone node NB1First, the aggregated service packageSent to the next backbone node NB2，NB2The summary service of the node is packaged withAfter combining, formAnd then sent to the next backbone node NB3Up to the last backbone node or the largest backbone node NB set by the systemnForming service broadcast packages for each backbone node
After the first transmission and after the delay tau set by the delay system, the backbone node NBnPacketizing service broadcasts into ∑ packetsNBTo reverse transmission, via any backbone node NBiBackbone node NBiThe related service broadcast packet of the service broadcast packet group is replaced by the latest service broadcast packet in the coverage area, and then the service broadcast packet is continuously transmitted to the next level backbone node to complete the updating of the service broadcast packet until the first backbone node NB1；
The above process is repeated, and the content of the service broadcast packet transmitted between the backbone nodes is kept up to date;
service requirement packet propagation and service traceback route establishment includes
3.1 service requirement packet propagation
When the backbone node broadcasts the service broadcast packet group, the non-backbone nodes in the coverage area receive the service broadcast packet group and store the service broadcast packet group to the local to form local service information cache; supposing that the node B needs M service, searching in the local service information cache, if finding the corresponding node S, taking out the node identification VIN providing servicesThen packing the service requirement PacketBSent to the backbone nodes in the coverage area and forwarded to the next level backbone nodes by the backbone nodes until reaching the service providing nodesThe backbone node in the coverage area of the S is then sent to the service providing node S;
3.2 service traceback route establishment
Service providing node receives PacketBThen, reply confirmation data PacketsAnd establishing a service backtracking route from the backbone node network to the service request node, wherein subsequent related services can be transmitted between the two nodes through the backbone node network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611193679.6A CN106850553B (en) | 2016-12-21 | 2016-12-21 | A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611193679.6A CN106850553B (en) | 2016-12-21 | 2016-12-21 | A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106850553A CN106850553A (en) | 2017-06-13 |
| CN106850553B true CN106850553B (en) | 2019-11-29 |
Family
ID=59136110
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611193679.6A Active CN106850553B (en) | 2016-12-21 | 2016-12-21 | A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106850553B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107360609B (en) * | 2017-06-27 | 2020-11-27 | 同济大学 | Message forwarding method for realizing low-delay communication in V2V communication of Internet of vehicles |
| CN107222904A (en) * | 2017-06-27 | 2017-09-29 | 同济大学 | The low time delay transmission method forwarded in car networking communication based on key vehicle |
| US11026069B2 (en) * | 2019-02-18 | 2021-06-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods, apparatus, and computer-readable media for discovery of application server and/or services for V2X communications |
| US10892938B1 (en) * | 2019-07-31 | 2021-01-12 | Abb Power Grids Switzerland Ag | Autonomous semantic data discovery for distributed networked systems |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242431A (en) * | 2008-01-21 | 2008-08-13 | 北京航空航天大学 | Layer-cross mobile Ad Hoc network service discovery method |
| CN105813159A (en) * | 2014-12-30 | 2016-07-27 | 北京大唐高鸿数据网络技术有限公司 | Improved GeoGRID routing method in vehicle-mounted short distance communication network |
-
2016
- 2016-12-21 CN CN201611193679.6A patent/CN106850553B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242431A (en) * | 2008-01-21 | 2008-08-13 | 北京航空航天大学 | Layer-cross mobile Ad Hoc network service discovery method |
| CN105813159A (en) * | 2014-12-30 | 2016-07-27 | 北京大唐高鸿数据网络技术有限公司 | Improved GeoGRID routing method in vehicle-mounted short distance communication network |
Non-Patent Citations (2)
| Title |
|---|
| Service discovery in mobile ad hoc networks: an overall perspective on architectural choices and network layer support issues;Ulas C. Kozat et al;《www.elseviercomputerscience.com》;20140131;全文 * |
| 移动Ad hoc 网络服务发现协议综述;苏俭，郭伟;《计算机科学》;20080425;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106850553A (en) | 2017-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| Alsharif et al. | $ i $ CAR-II: Infrastructure-based connectivity aware routing in vehicular networks | |
| Chen et al. | A connectivity-aware intersection-based routing in VANETs | |
| Jarupan et al. | PROMPT: A cross-layer position-based communication protocol for delay-aware vehicular access networks | |
| CN106850553B (en) | A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network | |
| CN105743983B (en) | A kind of name data In-vehicle networking data distributing method based on navigation routine | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| CA2580790A1 (en) | Linked equivalent cell header-based approach and protocol for organizing an ad-hoc network | |
| CN101431468B (en) | Greed data forwarding method based on direction in vehicle-mounted network | |
| CN101431784B (en) | Optimized data transmission method based on geographical position in vehicle-mounted network | |
| CN101741715A (en) | Method for sending message, access routing node device and data cache system | |
| Duarte et al. | Receiver mobility in vehicular named data networking | |
| Aparecido | Data dissemination in vehicular networks: Challenges, solutions, and future perspectives | |
| Amoroso et al. | The farther relay and oracle for VANET. preliminary results | |
| Zafar et al. | Decentralized receiver-based link stability-aware forwarding scheme for ndn-based vanets | |
| Sakthipriya et al. | A reliable communication scheme for VANET communication environments | |
| Ksouri et al. | Hybrid routing for safety data with intermittent V2I connectivity | |
| Tariq et al. | An Intelligent Forwarding Strategy in SDN-Enabled Named-Data IoV. | |
| CN106304237B (en) | Terminal vehicle communication method based on wireless protocol | |
| Al-Mayouf et al. | Efficient routing algorithm for VANETs based on distance factor | |
| Wang et al. | Varied priority-based data forwarding via NDN in VANET | |
| Saravanan et al. | A brief survey on performance analysis and routing strategies on VANETs | |
| Brahmi et al. | Routing in vehicular ad hoc networks: towards road-connectivity based routing | |
| Palizian et al. | A multi‐level routing method in vehicular ad hoc networks using unnamed aerial vehicle nodes | |
| Moussaoui et al. | Towards enhanced reactive routing in urban Vehicular Ad hoc Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 322002 no.968, Xuefeng West Road, Beiyuan street, Yiwu City, Jinhua City, Zhejiang Province Patentee after: Datang Gaohong information communication (Yiwu) Co.,Ltd. Address before: 322002 no.968, Xuefeng West Road, Beiyuan street, Yiwu City, Zhejiang Province Patentee before: DATANG GOHIGH INFORMATION AND COMMUNICATION RESEARCH INSTITUTE (YIWU) CO.,LTD. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211230 Address after: 400040 No. 35, Jinghe Road, Huxi street, high tech Zone, Shapingba District, Chongqing Patentee after: Datang Gaohong Zhilian Technology (Chongqing) Co.,Ltd. Address before: 322002 no.968, Xuefeng West Road, Beiyuan street, Yiwu City, Jinhua City, Zhejiang Province Patentee before: Datang Gaohong information communication (Yiwu) Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: Room 505, 5th Floor, Building 2, No. 299 Kexue Avenue, Zengjia Town, High tech Zone, Jiulongpo District, Chongqing, China 400040 Patentee after: CITIC Technology Zhilian Technology Co.,Ltd. Country or region after: China Address before: 400040 No. 35, Jinghe Road, Huxi street, high tech Zone, Shapingba District, Chongqing Patentee before: Datang Gaohong Zhilian Technology (Chongqing) Co.,Ltd. Country or region before: China |