U}sing QPN to Model a New Routing in {DTN

Shih-Yang Yang; Jiun-Ting Jiang; Po-Zung Chen

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.

Select Volume / Issues:

• Volume 5,Issue 3,May 2014

Year:

2014

Type of Publication:

Article

Keywords:

DTN; Routing; Queueing Petri Network; Inter Meeting Time; Contact Time; OOPFE; NS2

Journal:

IJECCE

Volume:

5

Number:

3

Pages:

547-553

Month:

May