台灣最大程式設計社群網站
線上人數
1694
 
會員總數:246570
討論主題:190029
歡迎您免費加入會員
討論區列表 >> 網管 / 資安 / VM >> 不知道這可不可以問,關於這篇車載網路內容
[]  
[我要回覆]
回應主題 加入我的關注話題 檢舉此篇討論 將提問者加入個人黑名單
不知道這可不可以問,關於這篇車載網路內容
價值 : 100 QP  點閱數:1903 回應數:0
樓主

ckvir
門外漢
0 4
40 2
發送站內信

這篇是關於車載網路的文章
不知道可不可以問
他大意是說,利用車子上的sensor感應heading(方向) and speed(速度)來找出能連接AP的時間最長
但是我看不太懂他所表達的cte1,cte2,cte3的意思,不知道可不可以幫我解答??

VEHICULAR NETWORK PATH SELECTION
In general, broken paths increase overhead and latency.
For this reason, selecting paths with the longest expected connection time may be a good idea.

We present three connection time estimate (CTE) metrics that use heading and speed hints to estimate whether a path in a vehicular network is likely to be long-lived.
Let the ordered sequence (u1,...,uj) denote a j − 1 hop path, dh(ui,ui+1) denote the difference in heading of nodes ui and ui+1 (from 0 to 180 degrees), and s(ui) denote the speed of ui (in m/s).
Our three CTE metrics, called cte1,cte2, and cte3, are defined for a path R = (u1,...,uj)
數學式子

The metrics use the assumption that a small difference in heading indicates nodes are moving in the same direction on the same road, and are therefore likely to stay connected longer.
The cte3 metric includes the additional assumption that speed is inversely correlated with connection duration.

Because cte1 multiplies the inverse of heading differences at each hop, it is biased toward single-hop paths.
The cte2 metric, by contrast, evaluates a path only by its worst hop, scoring multi-hop paths higher than cte1.
The cte3 metric multiples the inverse of the sum of node speeds with the cte1 value.

本篇文章發表於2012-01-30 16:56
== 簽名檔 ==
大家好
目前尚無任何回覆
   

回覆
如要回應,請先登入.