Conference Paper

A Time Dependent Performance Model for Multihop Wireless Networks with CBR Traffic

Grad. Telecommun. & Networking Program, Univ. of Pittsburgh, Pittsburgh, PA, USA
DOI: 10.1109/PCCC.2010.5682301 Conference: Performance Computing and Communications Conference (IPCCC), 2010 IEEE 29th International
Source: IEEE Xplore

ABSTRACT

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.

Download full-text

Full-text

Available from: David Tipper
  • Source
    • ". We have developed an approximate fluid flow modeling approach to model the mean transient/nonstationary behavior of a variety of queuing systems [8], [19], [9], [20], [21], [22]. Additionally, these methods could be used as the basic mathematical model for developing dynamic routing and flow control mechanisms along the lines discussed and illustrated in [23] [20]. "

    Full-text · Article · Jan 2015 · IEEE Transactions on Vehicular Technology
  • Source
    • "Since many network controls are designed and implemented on the basis of average quantities, such as the average delay on the links, we have focused on determining the mean transient/nonstationary behavior of networks. With the concept of PSFFA [16], we have developed an approximate fluid flow modeling approach to model the mean transient/nonstationary behavior of a variety of queuing systems in a series of papers [17], [19], [20], [21]. The idea of PSFFA is to model the average number in the queuing system as a function of time by a single nonlinear differential equation, which is solved numerically using standard numerical integration techniques (e.g., Runge Kutta). "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we develop a performance modeling technique for analyzing the time varying network layer queuing behavior of multihop wireless networks with constant bit rate (CBR) traffic. Our approach is a hybrid of a time varying adjacency matrix and a fluid flow queuing network model. Mobile network topology is modeled using time varying adja- cency matrix, while node queues are modeled using fluid flow based differential equations which are solved using numerical methods. Numerical and simulation experiments show that this new approach can provide reasonably accurate results. Moreover, when compared to the computation time required in a standard discrete event simulator, the fluid flow based model is shown to be a more scalable tool. Finally, an illustrative example of our modeling technique application is given to show its capability of capturing the time varying network performance as a function of traffic load, node mobility and wireless link quality.
    Full-text · Article · Aug 2014 · IEEE Transactions on Vehicular Technology
  • Source
    • "Second, an orientated patch matching algorithm is designed for texture propagation. Our work has a broad range of applications including image localization [7] [8], privacy protection [9] [10] [11], and other network based applications [12] [13] [14] [15] [16]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: With the explosive growth of Web-based cameras and mobile devices, billions of photographs are uploaded to the Internet. We can trivially collect a huge number of photo streams for various goals, such as 3D scene reconstruction and other big data applications. However, this is not an easy task due to the fact the retrieved photos are neither aligned nor calibrated. Furthermore, with the occlusion of unexpected foreground objects like people, vehicles, it is even more challenging to find feature correspondences and reconstruct realistic scenes. In this paper, we propose a structure-based image completion algorithm for object removal that produces visually plausible content with consistent structure and scene texture. We use an edge matching technique to infer the potential structure of the unknown region. Driven by the estimated structure, texture synthesis is performed automatically along the estimated curves. We evaluate the proposed method on different types of images: from highly structured indoor environment to the natural scenes. Our experimental results demonstrate satisfactory performance that can be potentially used for subsequent big data processing: 3D scene reconstruction and location recognition.
    Full-text · Conference Paper · Apr 2014
Show more