Engset multi‐rate state‐dependent loss models with QoS guarantee

We consider a single link loss system of quasi‐random input, described by the Engset multirate loss model (EnMLM). Blocked calls may once reattempt to be connected to the system requiring less bandwidth; then the system is described by the single retry model for finite sources (f‐SRM). The EnMLM and the f‐SRM are extended with the single threshold finite source model (f‐STM), where calls may attempt to be connected to the system with less bandwidth requirements, according to the link occupancy, before blocking occurs. We focus on CBP equalization in the EnMLM, f‐SRM and f‐STM, under the bandwidth reservation (BR) policy. For this analysis, we apply two approximate methods, the Roberts' method and the method of reverse transition rates (RTR), which lead to a recursive CBP calculation. We evaluate the accuracy of the above models under the BR policy by comparing the analytical with simulation CBP results, based on the relative approximation errors (RAE). The results are highly satisfactory because they show that the proposed models (formulas) lead to small RAE. Copyright © 2005 John Wiley & Sons, Ltd.     

Performance Constraint Analysis of WDM LANs with Nonzero Propagation Delays and Destination Conflicts

In this paper, we study the effect of the round trip propagation delay on performance measures of wavelength division multiplexing (WDM) networks. Even though the impact of propagation delay is substantial in the optical network's behavior, most of the studies ignore the effect of this time component in throughput and delay evaluation. We assume a WDM local area network (LAN) where the round trip propagation delay is less or equal to a data packet transmission time. The proposed asynchronous transmission policy avoids data channel collision. In the analysis, we take into account the propagation delays and the effect of receiver collision for a system with a finite number of stations.     

Energy considerations for topology-unaware TDMA MAC protocols

Since the energy budget of mobile nodes is limited, the performance of a networking protocol for such users should be evaluated in terms of its energy efficiency, in addition to the more traditional metrics such as throughput. In this paper, two topology-unaware MAC protocols—in which the scheduling time slots are allocated irrespectively of the underline topology—are considered and their energy consumption is derived. It turns out that the per frame power consumption is lower for the less throughput-efficient protocol, suggesting that energy savings are achieved at the expense of throughput.A finer energy consumption study is carried out in the sequel, focusing on the amount of energy consumed to successfully transmit a certain number of packets, or equivalently, on the per successful transmission power consumption. It is shown that the more throughput-efficient protocol consumes less energy per successful transmission under certain conditions (which are derived), due to the lower number of transmission attempts before a data packet is successfully transmitted. The same energy-efficiency relation is observed under certain conditions (which are derived) when data packets are delay constrained and, thus, may become obsolete if not transmitted successfully within a specific time interval. The conditions under which the per successful transmission power consumption is minimized for delay-constrained packets, are also established in this work and it is observed that when the system throughput is maximized, the power consumed is close to the minimum. Simulation results support the claims and the expectations of the aforementioned analysis.     

Design and Analysis of an Efficient Communication Strategy for Hierarchical and Highly Changing Ad-hoc Mobile Networks

In this work we introduce two practical and interesting models of ad-hoc mobile networks: (a) hierarchical ad-hoc networks, comprised of dense subnetworks of mobile users interconnected by a very fast yet limited backbone infrastructure, (b) highly changing ad-hoc networks, where the deployment area changes in a highly dynamic way and is unknown to the protocol. In such networks, we study the problem of basic communication, i.e., sending messages from a sender node to a receiver node. For highly changing networks, we investigate an efficient communication protocol exploiting the coordinated motion of a small part of an ad-hoc mobile network (the runners support) to achieve fast communication. This protocol instead of using a fixed sized support for the whole duration of the protocol, employs a support of some initial (small) size which adapts (given some time which can be made fast enough) to the actual levels of traffic and the (unknown and possibly rapidly changing) network area, by changing its size in order to converge to an optimal size, thus satisfying certain Quality of Service criteria. Using random walks theory, we show that such an adaptive approach is, for this class of ad-hoc mobile networks, significantly more efficient than a simple non-adaptive implementation of the basic runners support idea, introduced in [9,10]. For hierarchical ad-hoc networks, we establish communication by using a runners support in each lower level of the hierarchy (i.e., in each dense subnetwork), while the fast backbone provides interconnections at the upper level (i.e., between the various subnetworks). We analyze the time efficiency of this hierarchical approach. This analysis indicates that the hierarchical implementation of the support approach significantly outperforms a simple implementation of it in hierarchical ad-hoc networks. Finally, we discuss a possible combination of the two approaches above (the hierarchical and the adaptive ones) that can be useful in ad-hoc networks that are both hierarchical and highly changing. Indeed, in such cases the hierarchical nature of these networks further supports the possibility of adaptation.     

Determination of gas dispersion in vapor extraction of heavy oil and bitumen

In this work, a mathematical model is developed and simulated to determine gas dispersion along with solubility during the vapor extraction (Vapex) of live oil from a laboratory scale physical model. The physical model is a rectangular block of homogenous porous medium saturated with heavy oil and bitumen. At a given temperature and pressure, the block is initially exposed on its side to a solvent gas, which diffuses into the medium and gets absorbed. The absorption of gas reduces the viscosity of heavy oil and bitumen causing it to drain under gravity. The low-viscosity “live oil” is produced at the bottom of the porous block. The production of live oil with time is accompanied by the shrinkage of oil in the block as well as its increased exposure to gas from top. These phenomena of Vapex are described by the mathematical model, which is used to calculate live oil production with various values of gas solubility and dispersion. Their optimal values are determined for the vapor extraction of Cold Lake bitumen with butane by matching calculated live oil production with its experimental values published earlier.     

Facial expression recognition in image sequences using geometric deformation features and Support Vector Machines.

In this paper, two novel methods for facial expression recognition in facial image sequences are presented. The user has to manually place some of Candide grid nodes to face landmarks depicted at the first frame of the image sequence under examination. The grid-tracking and deformation system used, based on deformable models, tracks the grid in consecutive video frames over time, as the facial expression evolves, until the frame that corresponds to the greatest facial expression intensity. The geometrical displacement of certain selected Candide nodes, defined as the difference of the node coordinates between the first and the greatest facial expression intensity frame, is used as an input to a novel multiclass Support Vector Machine (SVM) system of classifiers that are used to recognize either the six basic facial expressions or a set of chosen Facial Action Units (FAUs). The results on the Cohn-Kanade database show a recognition accuracy of 99.7% for facial expression recognition using the proposed multiclass SVMs and 95.1% for facial expression recognition based on FAU detection.     

Trust establishment in cooperative wireless relaying networks

In cooperative wireless networks, relay nodes are employed to improve the performance of the network in terms of throughput and reliability. However, the presence of malicious relay nodes in the network may severely degrade the performance of the system. When a relay node behaves maliciously, there exists a possibility that such a node refuses to cooperate when it is selected for cooperation or deliberately drops the received packets. Trust establishment is a mechanism to detect misbehaving nodes in a network. In this paper, we propose a trust establishment method for cooperative wireless networks by using Bayesian framework. In contrast with the previous schemes proposed in wireless networks, this approach takes the channel state information and the relay selection decisions into account to derive a pure trust value for each relay node. The proposed method can be applied to any cooperative system with a general relay selection policy whose decisions in each cooperative transmission are independent of the previous ones. Moreover, it does not impose additional communication overhead on the system as it uses the available information in relay selection procedure. Copyright © 2012 John Wiley & Sons, Ltd.     

Analysis and design of punctured rate-1/2 turbo codes exhibiting low error floors

The objective of this paper is two-fold. Initially, we present an analytic technique to rapidly evaluate an approximation to the union bound on the bit error probability of turbo codes. This technique exploits the most significant terms of the union bound, which can be calculated straightforwardly by considering the properties of the constituent convolutional encoders. Subsequently, we use the bound approximation to demonstrate that specific punctured rate-1/2 turbo codes can achieve a lower error floor than that of their rate-1/3 parent codes. In particular, we propose pseudo-random puncturing as a means of improving the bandwidth efficiency of a turbo code and simultaneously lowering its error floor.