|標題：Using QPN to model a New Routing in DTN|
|作品名稱||Using QPN to model a New Routing in DTN|
|著者||Shih-Yang Yang, Jiun-Ting Jiang, Po-Zung Chen|
|著錄名稱、卷期、頁數||Volume 5,Issue 3,May 2014|
|摘要||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  for using QPN to model the routing protocol in DTNs. And, we have proposed the equivalent method in  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.
|關鍵字||DTN, Routing, Queueing Petri Network, Inter Meeting Time, Contact Time, OOPFE, NS2.|
|ISSN||ISSN (Online): 2249–071X, ISSN (Print): 2278–4209|