English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 78818/78818 (100%)
造訪人次 : 34702051      線上人數 : 1183
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49592


    題名: 耐延遲網路下結合社會網絡之資料傳播技術;Delay-Tolerant Data Dissemination Technology with Social Networking Pattern
    作者: 胡誌麟
    貢獻者: 通訊工程系
    關鍵詞: mobile device;mobility model;routing algorithm;data dissemination;social network;delay-tolerant network;mobile ad hoc network;mobile computing;研究領域:電信工程
    日期: 2011-08-01
    上傳時間: 2012-01-17 19:05:14 (UTC+8)
    出版者: 行政院國家科學委員會
    摘要: 耐延遲網路技術相較於傳統的行動隨意網路模型,更強調節點的高移動性、節點存在的不確定性以及節點間連線建立的偶然性,並且耐延遲網路拓撲是破碎且難以維護,任兩節點間沒有固定的路由路徑,兩者間資料傳遞必須經由中繼節點在彼此短暫的相遇時間之內轉送資料,反覆地以此方式慢慢地將資料送達到目的端。由於耐延遲網路環境的嚴苛限制以及節點移動具有時間上與空間上的變動,這些因素造成網路資料傳輸的效能受到嚴重的影響,面對這樣的情況,要如何提出有效的研究方案,以協助耐延遲網路服務和資料傳輸技術之發展,是極負有價值的研究議題。文獻耙梳顯示行動網路中群體移動行為符合真實的社會網絡模型,並且節點的移動模式對於耐延遲網路資料傳輸方法之設計及其效能有關鍵的影響。若能夠在耐延遲網路中導入社會網絡模型,這將有機會推演出準確的節點移動模型,據以發展有效的資料傳輸技術;因此,本計畫之研究擬研發一系列在耐延遲網路環境下結合社會網絡之資料傳輸機制,研究內容主要包括以下四個部分,依序進行:第一部分,設計一套符合真實社會網絡模型之節點移動模型,並加入地理位置與社群權重,以提升該模型的擬真度;第二部分,定量分析社群關係,並發展以社群關係為導向的路由機制;第三部分,利用節點相遇記錄預測區域性的節點密度,並據以設計以節點密度為設計導向的路由機制;第四部分,分析現有的耐延遲路由方式結合檔案編碼技術之可行性,研發結合檔案編碼之新型路由機制。計畫執行至最後,我們將具體提出耐延遲網路中社會網絡模型之參考架構,完成上述的三項新型路由機制之整合設計及其效能之量測和分析。Delay-tolerant networks, compared with conventional mobile ad hoc networks, emphasize the aspects of high node mobility, uncertainty of node presence, and opportunity of network connecting among nodes. The network topologies in such network environments are partitioned extremely, without maintenance and resiliency. There is not any persistent connection in delay-tolerant network environments. Thus, the data delivery between two nodes must depend on intermediate relay nodes that repeatedly forward data packets to neighboring nodes encountered during their movements. However, due to strict restrictions and dynamics of networking, environmental and node’s conditions, it is difficult to guarantee the performance and reliability of routing mechanisms in delay-tolerant networks. Under crucial phenomena above, it is very important that we can come up with a promising solution to facilitate the design and development of delay-tolerant data dissemination technologies – a vital research dimension. The literature study shows that the patterns of nodes’ interaction and mobility conform with the social network model in reality. Node mobility influences the data dissemination, to a crucial extent, in highly dynamic and unreliable network environments. Integrating social networking in delay-tolerant networks would be much beneficial for the design of appropriate node mobility models, and data delivery and services. Therefore, this research project aims to develop new data dissemination techniques and applications based on social network models in delay-tolerant network environments. This project proposal consists of four parts, as follows. First, we will formulate a node mobility model with geographic features and social weighting. Second, we will specify and quantify the social relationship among nodes and then develop a social-oriented routing scheme. Third, we will study the method for spatial node density estimation and then develop a density-oriented routing scheme. Finally, we will analyze the feasibility of several coding techniques in delay-tolerant networks and then develop a new coding-based routing scheme to potentially enhance performance and reliability. In accordance with all above, this research study will achieve a dedicated social-based mobility pattern and several novel delay-tolerant data dissemination mechanisms in delay-tolerant network environments. 研究期間:10008 ~ 10107
    關聯: 財團法人國家實驗研究院科技政策研究與資訊中心
    顯示於類別:[通訊工程學系] 研究計畫

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML541檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明