信息通信
信息通信
신식통신
Information & Communications
2015年
11期
1-3
,共3页
张冬雯%张沙沙%任军%张光华
張鼕雯%張沙沙%任軍%張光華
장동문%장사사%임군%장광화
城市环境%安全传输%TPM芯片%好感值%Floyd算法
城市環境%安全傳輸%TPM芯片%好感值%Floyd算法
성시배경%안전전수%TPM심편%호감치%Floyd산법
the urban environment%secure transport%TPM chip%friendly value%Floyd algorithm
针对城市车载网络中因自私节点及恶意节点存在造成的消息成功传输率低下的问题,提出一种消息安全传输机制。在城市环境下,用TPM芯片标识车辆。综合节点间成功转发消息及接触次数,得出好感值,并融入对车辆节点的移动方向及速度的考虑,得出节点的效用值,以此衡量节点间的信任程度,找出适当的下一跳车辆节点,保证消息的安全传输。同时,利用两次握手协议来确保节点间的连通性,减少网络中断问题,增加消息的成功传输率。此外,引入图论的概念,构造城市车载网络中的无向加权图,利用Floyd算法求出消息的最短传输路径,减少网络开销。仿真结果表明,该种机制下的消息成功传输率达到90%以上,且网络开销性能值低于200。
針對城市車載網絡中因自私節點及噁意節點存在造成的消息成功傳輸率低下的問題,提齣一種消息安全傳輸機製。在城市環境下,用TPM芯片標識車輛。綜閤節點間成功轉髮消息及接觸次數,得齣好感值,併融入對車輛節點的移動方嚮及速度的攷慮,得齣節點的效用值,以此衡量節點間的信任程度,找齣適噹的下一跳車輛節點,保證消息的安全傳輸。同時,利用兩次握手協議來確保節點間的連通性,減少網絡中斷問題,增加消息的成功傳輸率。此外,引入圖論的概唸,構造城市車載網絡中的無嚮加權圖,利用Floyd算法求齣消息的最短傳輸路徑,減少網絡開銷。倣真結果錶明,該種機製下的消息成功傳輸率達到90%以上,且網絡開銷性能值低于200。
침대성시차재망락중인자사절점급악의절점존재조성적소식성공전수솔저하적문제,제출일충소식안전전수궤제。재성시배경하,용TPM심편표식차량。종합절점간성공전발소식급접촉차수,득출호감치,병융입대차량절점적이동방향급속도적고필,득출절점적효용치,이차형량절점간적신임정도,조출괄당적하일도차량절점,보증소식적안전전수。동시,이용량차악수협의래학보절점간적련통성,감소망락중단문제,증가소식적성공전수솔。차외,인입도론적개념,구조성시차재망락중적무향가권도,이용Floyd산법구출소식적최단전수로경,감소망락개소。방진결과표명,해충궤제하적소식성공전수솔체도90%이상,차망락개소성능치저우200。
For the problems of the low forward successfully rate of news which because of selfish nodes and malicious nodes in the city VANETs, this paper proposed a message security transport mechanism. In urban environments, TPM chip as the unique identification of the vehicles nodes. Comprehensive the successful forwarding messages and contact number between nodes, the friendly values could be got. Then in order to determine the appropriate the next-hop message forwarding nodes, the mechanism was calculate the utility value of nodes through take the moving direction and speed of the nodes into consideration based on friendly values. At the same time, this mechanism used the two-handshake protocol before forwarded messages to ensure the connectivity between nodes. Besides, in the field of promote the transmit speed, the mechanism made full use of Floyd algorithm to find the shortest path to transmit to news by built a non-direction graph in city. After this, it can be ensured that message trans-mission quickly and reduce the network overhead. Simulation results show that the successful forwarding rate of the news is over 90%and network overhead is below 200 under the mechanism.