527 research outputs found
An efficient hybrid model and dynamic performance analysis for multihop wireless networks
Multihop wireless networks can be subjected to nonstationary phenomena due to a dynamic network topology and time varying traffic. However, the simulation techniques used to study multihop wireless networks focus on the steady-state performance even though transient or nonstationary periods will often occur. Moreover, the majority of the simulators suffer from poor scalability. In this paper, we develop an efficient performance modeling technique for analyzing the time varying queueing behavior of multihop wireless networks. The one-hop packet transmission (service) time is assumed to be deterministic, which could be achieved by contention-free transmission, or approximated in sparse or lightly loaded multihop wireless networks. Our model is a hybrid of time varying adjacency matrix and fluid flow based differential equations, which represent dynamic topology changes and nonstationary network queues, respectively. Numerical experiments show that the hybrid fluid based model can provide reasonably accurate results much more efficiently than standard simulators. Also an example application of the modeling technique is given showing the nonstationary network performance as a function of node mobility, traffic load and wireless link quality. © 2013 IEEE
A time dependent performance model for multihop wireless networks with CBR traffic
In this paper, we develop a performance modeling technique for analyzing the time varying network layer queueing behavior of multihop wireless networks with constant bit rate traffic. Our approach is a hybrid of fluid flow queueing modeling and a time varying connectivity matrix. Network queues are modeled using fluid-flow based differential equation models which are solved using numerical methods, while node mobility is modeled using deterministic or stochastic modeling of adjacency matrix elements. Numerical and simulation experiments show that the new approach can provide reasonably accurate results with significant improvements in the computation time compared to standard simulation tools. © 2010 IEEE
A Framework of Efficient Hybrid Model and Optimal Control for Multihop Wireless Networks
The performance of multihop wireless networks (MWN) is normally studied via simulation over a fixed time horizon using a steady-state type of statistical analysis procedure. However, due to the dynamic nature of network connectivi- ty and nonstationary traffic, such an approach may be inap- propriate as the network may spend most time in a transien- t/nonstationary state. Moreover, the majority of the simu- lators suffer from scalability issues. In this work, we presents a performance modeling framework for analyzing the time varying behavior of MWN. Our framework is a hybrid mod- el of time varying connectivity matrix and nonstationary network queues. Network connectivity is captured using s- tochastic modeling of adjacency matrix by considering both wireless link quality and node mobility. Nonstationary net- work queues behavior are modeled using fluid flow based differential equations. In terms of the computational time, the hybrid fluid-based model is a more scalable tool than the standard simulator. Furthermore, an optimal control strategy is proposed on the basis of the hybrid model
Threshold queueing describes the fundamental diagram of uninterrupted traffic
Queueing due to congestion is an important aspect of road traffic. This paper provides a brief overview of queueing models for traffic and a novel threshold queue that captures the main aspects of the empirical shape of the fundamental diagram. Our numerical results characterises the sources of variation that influence the shape of the fundamental diagram
Mathematical Models of Multiserver Queuing System for Dynamic Performance Evaluation in Port
We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by M-X/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance (or whole and part batch rejections) and the interarrival and service times are exponentially distributed. Results related to the batch blocking probability and the blocking probability of an arbitrary vessel in nonstationary and stationary states have been obtained. Numerical results and computational experiments are reported to evaluate the efficiency of the models for the real system
Mathematical Models of Multiserver Queuing System for Dynamic Performance Evaluation in Port
We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by M-X/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance (or whole and part batch rejections) and the interarrival and service times are exponentially distributed. Results related to the batch blocking probability and the blocking probability of an arbitrary vessel in nonstationary and stationary states have been obtained. Numerical results and computational experiments are reported to evaluate the efficiency of the models for the real system
Drift rate control of a Brownian processing system
A system manager dynamically controls a diffusion process Z that lives in a
finite interval [0,b]. Control takes the form of a negative drift rate \theta
that is chosen from a fixed set A of available values. The controlled process
evolves according to the differential relationship dZ=dX-\theta(Z) dt+dL-dU,
where X is a (0,\sigma) Brownian motion, and L and U are increasing processes
that enforce a lower reflecting barrier at Z=0 and an upper reflecting barrier
at Z=b, respectively. The cumulative cost process increases according to the
differential relationship d\xi =c(\theta(Z)) dt+p dU, where c(\cdot) is a
nondecreasing cost of control and p>0 is a penalty rate associated with
displacement at the upper boundary. The objective is to minimize long-run
average cost. This problem is solved explicitly, which allows one to also solve
the following, essentially equivalent formulation: minimize the long-run
average cost of control subject to an upper bound constraint on the average
rate at which U increases. The two special problem features that allow an
explicit solution are the use of a long-run average cost criterion, as opposed
to a discounted cost criterion, and the lack of state-related costs other than
boundary displacement penalties. The application of this theory to power
control in wireless communication is discussed.Comment: Published at http://dx.doi.org/10.1214/105051604000000855 in the
Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute
of Mathematical Statistics (http://www.imstat.org
- …