CN101932063A - Credible secure routing method for vehicular ad hoc network - Google Patents
Credible secure routing method for vehicular ad hoc network Download PDFInfo
- Publication number
- CN101932063A CN101932063A CN201010260460XA CN201010260460A CN101932063A CN 101932063 A CN101932063 A CN 101932063A CN 201010260460X A CN201010260460X A CN 201010260460XA CN 201010260460 A CN201010260460 A CN 201010260460A CN 101932063 A CN101932063 A CN 101932063A
- Authority
- CN
- China
- Prior art keywords
- node
- experience
- credit worthiness
- network
- credible
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention provides a credible secure routing method for a vehicular ad hoc network, which comprises the following steps: setting a credibility standard for the experience trust of a node, calculating the experience trust value and the credibility of the node, and establishing a secure credible dynamic packet forwarding rule based on the experience trust. The routing method can establish a credible secure data transmission path between a source node and a destination node, and can identify nodes which possibly initiate a malicious selfish behavior and build up trust among strange codes.
Description
Technical field
The present invention relates to computer network, network service, network service standard, network security, relate in particular to a kind of life span, the successful mutual ratio of node and the credit worthiness of a last hop node and be converted into a kind of credible tolerance that is referred to as the experience trust, and be applied to the credible routing method of vehicular ad hoc network node.
Background technology
(Vehicular Ad Hoc Networks, VANETs) the provisional autonomous system of being made up of one group of vehicle that has a wireless transmitter is by the intercommunication mutually between vehicle, the generation that can effectively avoid traffic accident for vehicular ad hoc network.Vehicular ad hoc network has the numerous characteristics that is different from traditional Internet, the quality of wireless channel instability, node distributes and limited to by road, node motion speed is fast, change in topology frequent, the path life-span is short, flooded broadcast can blocking data the transmission of bag, the abundant and noenergy constraint of outer secondary supplementary information etc.So, routing issue in the vehicular ad hoc network faces significant challenge: at a high speed dynamic topological structure makes routing iinformation under attack easily, malicious node scatters deceptive information and upsets route, selfish node refusal and other node cooperations, stop routing forwarding, causing that network interrupts, and causes loss of data etc. vehicular ad hoc network has self-organizing, acentric characteristics simultaneously, and the safe practice of original maturation can not be applicable to vehicular ad hoc network fully in the cable network.
One of key technology of vehicular ad hoc network is the design of Routing Protocol.In vehicular ad hoc network, use maximum Routing Protocols that is based on positional information at present.This type of Routing Protocol does not need to safeguard a path end to end, just can realize communicating by letter end to end as long as each node is known the position of the position of destination node, the position of oneself and neighbor node.Such Routing Protocol does not need to store routing table, does not need routing table update yet and can support all node transfer data packets in a certain geographic area, therefore can better adapt to network size and changes of topology structure.Wherein, GPSR (Greedy Perimeter Stateless Routing) is typical case's representative of such Routing Protocol.It is that a kind of greediness is transmitted with periphery transmitted the stateless Routing Protocol that combines.It does not need to exchange periodically routing iinformation with other node, does not need to store routing iinformation yet, so reduced the load of network and to the requirement of node processing ability, therefore had extensive use in VANETs.But GPSR lacks the consideration to safety factor, and when existing malicious node altered data bag, selfish node not to transmit situation such as packet in the network, GPSR does not provide solution, and the acceptance rate that divides into groups this moment is very low.Some sensitivities or confidential information are eavesdropped or are stolen probably in transmission course among the VANETs, and malicious node may scatter the mass data bag and cause network paralysis, and these all need solve by credible effective Routing Protocol.
The credible routing method of a kind of vehicular ad hoc network provided by the invention can effectively be safeguarded the fail safe of routing procedure in the vehicular ad hoc network.Selfish node in network and malicious node increase Shi Buhui gradually the grouping of network acceptance rate are produced considerable influence.
Summary of the invention
The invention provides a kind of credible secure routing method of vehicular ad hoc network.This method for routing comprises: the experience of node is trusted trusted standard, the experience trust value of computing node, credit worthiness and the safe and reliable dynamic bag forwarding rule of trusting based on described experience.This method for routing can be implemented in and set up credible and secure data transmission channel between source node and the destination node, and can discern the node that to initiate malice or selfish behavior, between strange node, break the wall of mistrust, improve network packet acceptance rate and throughput, reduce the expense of network packet time of delay and routing overhead.The present invention is according to designed neighbor table of accompanying drawing 1 and node cycle interaction locations information on every side, the credible routing method that experience is trusted carries out work according to workflow shown in the accompanying drawing 2, and according to the workflow shown in the accompanying drawing 3 behavior of neighbor node is estimated.
Description of drawings
The structure chart of Fig. 1 neighbor table.
The particular flow sheet of the credible route of the vehicular ad hoc network that Fig. 2 experience is trusted.
Fig. 3 estimates the particular flow sheet of neighbor node.
Embodiment
The present invention is by providing experience trust value and the credit worthiness value of calculating neighbor node, and trusts trusted standard based on described experience, and a kind of credible secure routing method of vehicular ad hoc network is provided.
The notion that proposition experience of the present invention is trusted comes specified node to select high believable node to jump as next as the standard of credible tolerance with this, by life span, the successful mutual ratio of node and three factors decisions of credit worthiness of a last hop node.It is long that experienced and elder person that enjoy a good reputation can be abstracted in the network life span, big to the network contribution, and the node that enjoys a good reputation; On the contrary, the elder person that lack of experience and credit worthiness are low can be mapped as life span in network long, but node little to the contribution of network and that credit worthiness is low.Wherein life span is represented the time of staying of node in network; The contribution that the mutual ratio reflection node of node success is made network; The credit worthiness of a last hop node is the important evidence that a last hop node is estimated the present node credit worthiness.When present node was correctly transmitted the packet that upstream node transmits, the credit worthiness of a last hop node was high more, and then present node credit worthiness increasing degree is big more, otherwise increasing degree is more little; When present node did not have correctly to transmit the packet that upstream node transmits, the credit worthiness of a last hop node was high more, and then the amplitude that reduces of present node credit worthiness is big more, otherwise the minimizing amplitude is more little.Hence one can see that, and node successful mutual ratio in network is big more, and life span is long more, and it helps a last hop node credit worthiness of forwarding high more, and then current forward node credit worthiness is big more, and easy more quilt is trusted; And selfish node makes the experience trust value reduce gradually because of refusal cooperation meeting, when the experience trust value is tending towards 0, can be eliminated by network, will can not be routed selection again.
Introduce the experience trust value and the credit worthiness of node below:
(1) experience trust value: the unit interval interior nodes is the mutual ratio of success in network.
(2) credit worthiness: the credit worthiness of node has identical variation tendency with the experience trust value.When the contribution of node to network increases then node credit worthiness increase; Otherwise, reduce.
The present invention has revised the forwarding rule of GPSR agreement for improving the reliability of data packet delivery, in distance destination node all neighbours less than present node, packet is transmitted to the neighbor node of credit worthiness maximum.The local neighbor table of preserving oneself of each node in the network, and periodic and neighbours' exchange, the structural design of neighbor table as shown in Figure 1.Consider that from objective trust the introducing experience is trusted the standard of notion as credible tolerance, instruct node to select the node of high credit worthiness to participate in route, its flow process as shown in Figure 2, the idiographic flow that neighbor node experience trust value and node credit worthiness are estimated is as shown in Figure 3.
Shown in the accompanying drawing 1 is the structure of neighbor table, constitute by node identification, node location information and node credit worthiness, all node and periodic neighbor table of neighbours in the network is so that node can select believable forward node to transmit packet according to neighbours' relevant information.
The workflow of the credible route of vehicular ad hoc network that the experience that is based on shown in the accompanying drawing 2 is trusted, source node sends packet to destination node, after source node or intermediate node receive packet, at first in neighbor table the chosen distance destination node less than among the neighbours of present node and the neighbor node with maximum credit worthiness jump as next, packet is sent to next-hop node, monitor its behavior, and according to the experience trust value and the credit worthiness of snoop results evaluation node, upgrade next-hop node experience trust value and credit worthiness simultaneously, be delivered to destination node from source node up to packet.
Shown in the accompanying drawing 3 is the workflow of estimating neighbor node experience trust value and node credit worthiness, after node is selected trusted node and is transmitted packet, the transmission situation of supervision packet in the Δ t time, if next-hop node is successfully transmitted packet, then increase the experience trust value of next-hop node and the credit worthiness of node; Otherwise, reduce the experience trust value and the node credit worthiness of next-hop node, and upgrade next-hop node experience trust value and credit worthiness.
This method for routing can be realized the credible and secure route in a kind of vehicular ad hoc network, improves the credibility and the fail safe of vehicular ad hoc network Routing Protocol, and concrete workflow is as follows:
A) source node sends packet;
B) node that receives packet judges whether oneself is destination node, if change step h); Otherwise continuation step c);
C) when intermediate node receives packet, select to have the neighbor node of maximum credit worthiness in less than the neighbor node of present node as next-hop node in the distance destination node;
D) send packet to the next-hop node of selecting in the step c);
E) present node startup promiscuous mode monitor data wraps in the transmission situation in the Δ t time;
F), then increase the experience trust value and the credit worthiness value of node if next-hop node is successfully transmitted packet; Otherwise, the experience trust value and the credit worthiness value of minimizing node;
G) the experience trust value and the credit worthiness value of renewal next-hop node;
H) finish.
The present invention turns to experience trust trusted standard by the measures of reputation of a ratio that life span, the success of node is mutual and a last hop node, make and to avoid data and message are routed on the node with a low credibility in the routing procedure, improved the credibility and the fail safe of routing procedure; The credit worthiness of node is calculated according to the experience trust value of node, has identical variation tendency with the experience trust value of node; The experience trust value of node and the computation complexity of credit worthiness are lower, and all calculating all is linear calculating, and node only need safeguard the credit worthiness of the node in the jumping scope of self periphery, therefore are adapted at using in the vehicular ad hoc network of node high-speed mobile; Trust credible tolerance by the introducing experience, formed tolerance, can more fully reflect the safe condition of network, thereby formulate the believable routing policy of vehicular ad hoc network that adapts the node credibility.
And the present invention carries out emulation experiment by writing code at emulation tool NS2 to the present invention.Emulation experiment proves, in the vehicular ad hoc network of the credible routing method that has adopted this vehicular ad hoc network, even there is the selfish node of significant proportion to exist, also can not have much impact to normal routing procedure, and the fail safe that has improved routing procedure is with credible.
It should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is had been described in detail with reference to preferred embodiment, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spirit and scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (1)
1. the credible secure routing method of a vehicular ad hoc network, be used to improve the credibility and the fail safe of vehicular ad hoc network Routing Protocol, it is characterized in that, described method for routing comprises the experience trust trusted standard of node, the experience trust value and the credit worthiness of computing node are transmitted rule based on the safe and reliable dynamic bag that described experience is trusted;
The experience of above-mentioned node is trusted trusted standard and is weighed the trusting degree of node in network with the angle of objective trust, is used for the selfish node and the malicious node of recognition network, breaks the wall of mistrust between strange node;
The experience trust value of aforementioned calculation node and credit worthiness are subjected to the protection of the credible chip of TPM, have only by the node of legal authorization and could revise experience trust value and the credit worthiness of being protected by TPM, the experience trust value of aforementioned calculation node is unit interval interior nodes mutual ratio of success in network, and the experience trust value of the credit worthiness of aforementioned calculation node and above-mentioned node should have identical variation tendency;
Above-mentioned safe and reliable dynamic bag of trusting based on experience is transmitted rule, the neighbor node that requires node to select to have maximum credit worthiness in less than the neighbours of present node in the distance destination node is transmitted packet, make Route Selection avoid selfish node and malicious node, reach the credible and purpose of safety of safeguarding routing procedure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010260460XA CN101932063A (en) | 2010-08-24 | 2010-08-24 | Credible secure routing method for vehicular ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010260460XA CN101932063A (en) | 2010-08-24 | 2010-08-24 | Credible secure routing method for vehicular ad hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101932063A true CN101932063A (en) | 2010-12-29 |
Family
ID=43370899
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010260460XA Pending CN101932063A (en) | 2010-08-24 | 2010-08-24 | Credible secure routing method for vehicular ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101932063A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075424A (en) * | 2011-01-11 | 2011-05-25 | 华中科技大学 | Feedback updating mechanism-based trust routing method |
| WO2012095860A3 (en) * | 2011-01-13 | 2012-10-04 | Tata Consultancy Services Limite | Method and system for trust management in distributed computing systems |
| CN102946606A (en) * | 2012-11-30 | 2013-02-27 | 清华大学 | Method for detecting attack of wireless ad-hoc network |
| CN103298059A (en) * | 2013-05-13 | 2013-09-11 | 西安电子科技大学 | Connectivity sensing routing method on basis of location prediction in vehicle ad hoc network |
| CN103347011A (en) * | 2013-06-21 | 2013-10-09 | 北京工业大学 | Ad hoc network security routing method based on trust model |
| CN103987103A (en) * | 2014-04-30 | 2014-08-13 | 重庆邮电大学 | Vehicular ad hoc network route selection method based on game theory |
| CN105163308A (en) * | 2015-05-25 | 2015-12-16 | 华南理工大学 | Secure routing protocol based on trust detection in vehicle-mounted ad hoc network |
| CN106060890A (en) * | 2016-07-29 | 2016-10-26 | 北京智芯微电子科技有限公司 | Method and device for path selection based on reputation value |
| CN107509228A (en) * | 2017-07-24 | 2017-12-22 | 长安大学 | A kind of data trusted transmission method under car networking |
| CN108632824A (en) * | 2017-03-22 | 2018-10-09 | 腾讯科技（深圳）有限公司 | Information transferring method and information carrying means |
| CN110445788A (en) * | 2019-08-09 | 2019-11-12 | 西安电子科技大学 | The trust evaluation system and method for content oriented under a kind of vehicular ad hoc network environment |
| CN114584455A (en) * | 2022-03-04 | 2022-06-03 | 吉林大学 | Small and medium-sized high-performance cluster monitoring system based on enterprise WeChat |
-
2010
- 2010-08-24 CN CN201010260460XA patent/CN101932063A/en active Pending
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075424A (en) * | 2011-01-11 | 2011-05-25 | 华中科技大学 | Feedback updating mechanism-based trust routing method |
| CN102075424B (en) * | 2011-01-11 | 2012-11-21 | 华中科技大学 | Feedback updating mechanism-based trust routing method |
| WO2012095860A3 (en) * | 2011-01-13 | 2012-10-04 | Tata Consultancy Services Limite | Method and system for trust management in distributed computing systems |
| CN102946606A (en) * | 2012-11-30 | 2013-02-27 | 清华大学 | Method for detecting attack of wireless ad-hoc network |
| CN103298059A (en) * | 2013-05-13 | 2013-09-11 | 西安电子科技大学 | Connectivity sensing routing method on basis of location prediction in vehicle ad hoc network |
| CN103298059B (en) * | 2013-05-13 | 2015-09-30 | 西安电子科技大学 | The degree of communication perception method for routing of position-based prediction in car self-organization network |
| CN103347011A (en) * | 2013-06-21 | 2013-10-09 | 北京工业大学 | Ad hoc network security routing method based on trust model |
| CN103347011B (en) * | 2013-06-21 | 2016-12-28 | 北京工业大学 | Ad hoc network safety routing method based on faith mechanism |
| CN103987103A (en) * | 2014-04-30 | 2014-08-13 | 重庆邮电大学 | Vehicular ad hoc network route selection method based on game theory |
| CN103987103B (en) * | 2014-04-30 | 2017-12-26 | 重庆邮电大学 | A kind of vehicle self-organizing network route selection method based on game theory |
| WO2016188116A1 (en) * | 2015-05-25 | 2016-12-01 | 华南理工大学 | Credibility detection-based security routing protocol in vehicular ad hoc network |
| CN105163308A (en) * | 2015-05-25 | 2015-12-16 | 华南理工大学 | Secure routing protocol based on trust detection in vehicle-mounted ad hoc network |
| CN105163308B (en) * | 2015-05-25 | 2019-03-05 | 华南理工大学 | A kind of safety routing method based on degree of belief detection in vehicular ad hoc network |
| CN106060890A (en) * | 2016-07-29 | 2016-10-26 | 北京智芯微电子科技有限公司 | Method and device for path selection based on reputation value |
| CN106060890B (en) * | 2016-07-29 | 2019-10-22 | 北京智芯微电子科技有限公司 | A kind of path selecting method and device based on reputation value |
| CN108632824A (en) * | 2017-03-22 | 2018-10-09 | 腾讯科技（深圳）有限公司 | Information transferring method and information carrying means |
| CN108632824B (en) * | 2017-03-22 | 2021-02-12 | 腾讯科技（深圳）有限公司 | Information transmission method and information transmission device |
| CN107509228A (en) * | 2017-07-24 | 2017-12-22 | 长安大学 | A kind of data trusted transmission method under car networking |
| CN110445788A (en) * | 2019-08-09 | 2019-11-12 | 西安电子科技大学 | The trust evaluation system and method for content oriented under a kind of vehicular ad hoc network environment |
| CN110445788B (en) * | 2019-08-09 | 2021-07-27 | 西安电子科技大学 | Content-oriented trust evaluation system and method under vehicle-mounted ad hoc network environment |
| CN114584455A (en) * | 2022-03-04 | 2022-06-03 | 吉林大学 | Small and medium-sized high-performance cluster monitoring system based on enterprise WeChat |
| CN114584455B (en) * | 2022-03-04 | 2023-06-30 | 吉林大学 | Small and medium-sized high-performance cluster monitoring system based on enterprise WeChat |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101932063A (en) | Credible secure routing method for vehicular ad hoc network | |
| Yang et al. | Improvement of GPSR protocol in vehicular ad hoc network | |
| Lee et al. | Robust routing in wireless ad hoc networks | |
| Hu et al. | SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks | |
| Jhaveri et al. | Improving route discovery for AODV to prevent blackhole and grayhole attacks in MANETs | |
| US20050030921A1 (en) | Routing protocol for ad hoc networks | |
| Khemariya et al. | An efficient algorithm for detection of blackhole attack in aodv based manets | |
| Carbunar et al. | JANUS: towards robust and malicious resilient routing in hybrid wireless networks | |
| Sekar et al. | Lightweight reliable and secure multicasting routing protocol based on cross‐layer for MANET | |
| Dixit et al. | A novel approach of trust based routing to select trusted location in AODV based vanet: A survey | |
| Hmouda et al. | Detection and prevention of attacks in MANETs by improving the EAACK protocol | |
| Vassilaras et al. | Security and cooperation in clustered mobile ad hoc networks with centralized supervision | |
| Alajeely et al. | Catabolism attack and anabolism defense: A novel attack and traceback mechanism in opportunistic networks | |
| Li et al. | AWF-NA: A complete solution for tampered packet detection in VANETs | |
| Selvakumar et al. | Secure group key management protocol for mobile ad hoc networks | |
| Anitha et al. | EFFICIENT POSITION BASED PACKET FORWARDING PROTOCOL FOR WIRELESS SENSOR NETWORKS. | |
| Sundararajan et al. | Performance analysis of selfish node aware routing protocol for mobile ad hoc networks | |
| Usha et al. | Multi Hop Acknowledgement Scheme based Selfish NodeDetection in Mobile Ad hoc Networks | |
| Vinayakan et al. | Security for Multipath Routing Protocol using Trust based AOMDV In MANETs | |
| Priyanka | ENERGY-EFFICIENT DYNAMIC WIRELESS COMMUNICATION FOR WIRELESS MOBILE AD HOC NETWORKS USING HYBRID CRYPTOGRAPHY-BASED ACKNOWLEDGEMENT METHOD. | |
| Naz et al. | Secure Routing in Mobile Ad hoc Network | |
| Ahmad et al. | Security on MANETs using block coding | |
| Sachan et al. | Authenticated routing for ad-hoc on-demand distance vector routing protocol | |
| Wang et al. | A secure DSDV routing protocol for ad hoc mobile networks | |
| Xue et al. | A trust-based routing protocol for ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20101229 |