在耐延遲網路環境下，訊息資料的傳送依賴於節點間因移動性而產生的間斷性連結，並使用「儲存並攜帶再轉送」的方式傳遞至其目的地，因此網路中各個節點的儲存空間以及與其他節點的「接觸關連性」將扮演訊息傳遞品質的重要因素。
本論文提出一以Flooding-based與Forwarding-based兩類路由協定為基礎設計結構、並加以擴充考量訊息優先權於轉發機制之三階段式路由演算法。其主要概念在於利用網路中節點的移動特性來週期性地預測節點與節點間未來的相遇人氣做為訊息散播時的分配權重、及以累計相遇時間之比率為接觸關聯性做為訊息是否進一步轉送之依據、最後並在訊息傳送順序上加入優先權排序的策略。根據與其他路由演算法的模擬實驗，顯示我們所提的演算法能有較高的訊息傳遞成功率、相對低的資源耗費、以及差異化訊息傳送服務的效能。 / Delay Tolerant Networks (DTNs) use the “Store-Carry-and-Forward” approach to deliver the messages to the destinations. It relies on the intermittent link that occurs when two nodes contact each other due to mobility. Therefore, the buffer and “contact association” of nodes are two important factors that affect the delivery performance.
In this thesis, we propose a three-phase algorithm (SFMS: Spray and Forwarding scheme with Message Scheduling) that integrates the concepts of flooding-based and forwarding-based protocols, and considers message priority. The main idea of SFMS is to periodically predict the contact popularity and contact association among nodes, such that we can determine the fast message spraying and efficient forwarding strategy. Furthermore, we come up with a message scheduling mechanism to enhance the resource allocation. Simulation results show that our scheme has a better performance for delivering messages. Besides, it also achieves a differential delivery performance for different priorities of messages while maintaining a better resource allocation.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0099753008 |
| Creators | 陳英明, Chen, Ying Ming |
| 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.0019 seconds