在耐延遲網路環境下節點的相遇情況不是很頻繁,這可能導致節點間的連線斷斷續續,使得有效地將訊息傳遞成為一件困難的事情。藉由社群感知轉送機制的中間度指標特性,可以來提升傳送成功率。雖然大多數研究幾乎都是將訊息轉送到單一目的地或是多個且已知的目的地。然而,一些應用像是廣告的散佈,要將訊息送給對訊息有興趣的人,但卻不知道是誰。因此,關鍵的問題為如何建立社群網路關係的親密度機制,來選擇作為轉送訊息的節點,並利用群體廣播的方式盡可能有效地傳播至最多可能目標目的地,進而提升效能。
本論文以群播機制和社群感知當作基礎概念,來設計新的轉送訊息的方法和公式化選擇中繼節點的機制。最後,我們使用政治大學實際軌跡來模擬,將模擬結果與其它路由演算法比較,其結果證明我們所提出的方法能提高訊息傳送成功率和正確率,降低傳送延遲時間和傳送訊息的成本。 / In delay tolerant networks (DTNs), nodes infrequently encounter with each others. This results in intermittent connectivity of the nodes, and makes it difficult to deliver the message effectively. A social-aware forwarding scheme can help for successful delivery ratio by utilizing the characteristic of their centrality metric. Most of the previous studies focus on message delivery to single destination or some priori known destinations. However, some applications like advertisement dissemination may not know who will be the interested persons to be delivered. Therefore, the key challenge is how to establish the social relationship strategy to select appropriate nodes as relays, and furthermore to use multicasting to disseminate effectively as many “target” destinations as possible to improve the performance.
This thesis developed a new strategy which has a new forwarding message scheme and formulates the selection of the relay nodes based on the concept of the multicasting and the social network. Finally, we used the reality trace data of National Chengchi University to simulate. The simulation results are compared to others DTNs routing protocols as well as other social-aware forwarding schemes. The results showed that our proposed approach can enhance the successful delivery ratio and delivery accuracy, decrease the delivery delay and reduce the delivery overhead.
Identifer | oai:union.ndltd.org:CHENGCHI/G0100753036 |
Creators | 林煜泓, Lin, Yu Hong |
Publisher | 國立政治大學 |
Source Sets | National Chengchi University Libraries |
Language | 英文 |
Detected Language | English |
Type | text |
Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0791 seconds