• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.308-326
• /
• 2013

Mobility Model has drawn more and more attentions since its critical role in Mobile Wireless Networks performance evaluation. This paper analyzes the mobility patterns in the catastrophe rescue scenario, and proposes the Random Waypoint with Base Point mobility model to model these characteristics. We mathematically analyze the speed and spatial stationary distributions of the nodes and derive explicit expressions for the one dimensional case. In order to keep the stationary distribution through the entire simulation procedure, we provide strategies to initialize the speed, location and destination of the nodes at the beginning of the simulation. The simulation results verify the derivations and the proposed methods in this paper. This work gives a deep understanding of the properties of the Random Waypoint with Base Point mobility model and such understanding is necessary to avoid misinterpretation of the simulation results. The conclusions are of practical value for performance analysis of mobile wireless networks, especially for the catastrophe rescue scenario.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1075-1080
• /
• 2014

One of the important roles used to ensure victory in a war is to maximize the overall military forces and to make sure that the capability of the military forces can be sustained as much as possible. Although several researchers have proposed various possible methodologies for logistics support, no research trials have been undertaken to investigate logistics support that considers all relevant elements of such. Unlike previous in trials that consider and analyze the system fault ratio as the main methodology, we propose an approach that simultaneously decides and recommends logistic priority by reflecting and combining item costs, transportation, fault-ratio, and system complexity. Also, we designed an algorithm that can recommend optimized logistics support priority using stationary distribution.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.25-29
• /
• 2005

We analyze an M/G/1 queueing system under $P_{\lambda,\tau}^M$ service policy. By using the level crossing theory and solving the corresponding integral equations, we obtain the stationary distribution of the workload in the system explicitly.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2007.04a
• /
• pp.461-465
• /
• 2007

The BMAP/M/N/O queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is calculated. Loss probability and other performance measures are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.153-159
• /
• 1996

Sums of independent random variables $S_n = X_1 + X_ + cdots + X_n$ are considered, where the X$_{n}$ are chosen according to a stationary process of distributions. Given the time t .geq. O, let N (t) be the number of indices n for which O < $S_n$ $\geq$ t. In this set up we prove that N (t)/t converges almost surely and in $L^1$ as t longrightarrow $\infty$, which generalizes classical renewal theorem.m.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.301-306
• /
• 2004

We consider the $P_\lambda\;^M$ service policy for an M/G/1 queue in which the service rate is increased from 1 to M at the exponential setup time after the level of workload exceeds $\lambda$. The stationary distribution of the workload is explicitly obtained through the level crossing argument.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1101-1103
• /
• 2006

For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1345-1352
• /
• 2008

An inventory with constant demand is studied. We adopt a renewal argument to obtain the transient and stationary distribution of the level of the inventory. We show that the stationary distribution can be also derived by making use of either the level crossing technique or the renewal reward theorem. After assigning several managing costs to the inventory, we calculate the long-run average cost per unit time. A numerical example is illustrated to show how we optimize the inventory.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.4
• /
• pp.39-45
• /
• 2007

The BMAP/M/N/0 queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is derived. Loss probability and other performance measures of the system also are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.485-490
• /
• 1998

We consider a class of discrete parameter processes on a locally compact Polish space $S$ arising from successive compositions of strictly stationary Markov random maps on $S$ into itself. Sufficient conditions for the existence of the stationary solution and the weak convergence of the distributions of $\{\Gamma_n \Gamma_{n-1} \cdots \Gamma_0x \}$ are given.