English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62797/95867 (66%)
造訪人次 : 3739099      線上人數 : 356
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/112738


    題名: Using QPN to model a New Routing in DTN
    作者: Shih-Yang Yang, Jiun-Ting Jiang, Po-Zung Chen
    關鍵詞: DTN, Routing, Queueing Petri Network, Inter Meeting Time, Contact Time, OOPFE, NS2
    日期: 2014-05
    上傳時間: 2018-03-02 12:11:22 (UTC+8)
    摘要: Abstract - In order to better understand the characteristics of a new routing method, modeling of this routing method would be a good way. We have expressed the basic method in [3] for using QPN to model the routing protocol in DTNs. And, we have proposed the equivalent method in [11] for using QPN to express a new routing method under RWP mobility in DTNs. Now, we extend these studies to model the new routing method, named as "OOPFE routing" and designed by us at last years.
    In this work, not only to better understand the characteristics of the new routing method but also to get an interesting example for research the characteristics of QPN. Because QPN is a strong modeling tool for using in the performance testing of the new system begin or the new system established. This paper is a good example for using QPN to analyze new problems.
    We will divide into two parts to discuss the OOPFE. The first part is that we consider no any neighbor node in “One broadcast” process of OOPFE and transfer from simple Markov state diagram to a QPN figure. The second part is that we consider the numbers of neighbor nodes in “One broadcast” process of OOPFE and transform to QPN figure.
    關聯: IJECCE,Volume 5, Issue 3
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    Using QPN to model a New Routing in DTN.pdf1095KbAdobe PDF11檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋