A novel energy-efficient encryption algorithm for secure data in WSNs

The Journal of Supercomputing - Wireless sensor networks (WSNs) are typically deployed environments, often very hostile and without assistance. A certain level of security must be provided....     

Automatic detection of depth of cut during end milling operation using acoustic emission sensor

Any shortfall in the required depth during milling machining can affect the dimensional accuracy of the part produced and can cause a catastrophic failure to the machine. Corrective remedies to fix the dimensions inaccuracy will increase the machining time and costs. In this work, a depth-of-cut monitoring system was proposed to detect depth of cut in real time using an acoustic emission sensor and prediction model. The characteristics of the sensor signal obtained in machining processes can be complex in terms of both nonlinearity and nonstationarity. To overcome this complexity, a regression model and an artificial neural network model were used to represent the relationship between the acoustic emission signal and the depth of cut. The model was tested under different machining cases and found to be efficient in predicting the depth of cut.     

Probabilistic quality-aware routing in cognitive radio networks under dynamically varying spectrum opportunities

In this paper, we introduce a probabilistic routing metric that considers the peculiar characteristics of the operating environment of cognitive radio networks (CRNs). This metric captures the dynamic changes in channel availabilities due to the randomness of primary user’s activity and the rich channel diversity due to the fact that a CRN is expected to operate over highly separated frequency channels with different propagation characteristics. Our metric, Probability of Success (PoS), statistically quantifies the chances of a successful cognitive radio (CR) packet transmission over a given channel. Based on the PoS metric, we propose a joint probabilistic routing and channel assignment protocol for multi-hop CRNs that attempts at selecting the path with the maximum probability of success among all possible paths for a given CR source-destination pair. Selecting such a path results in minimizing the number of disruptions to CR packet transmissions, which consequently improves network throughput. Simulation results verify the significant throughput improvement achieved by our protocol compared to reference CRN routing protocols.     

Channel assignment mechanism for cognitive radio network with rate adaptation and guard band awareness: batching perspective

Wireless Networks - Cognitive radio (CR) is a promising technology that allows devices to effectively utilize the underutilized or unutilized portions of the licensed spectrum. In literature,...     

The correlation structure for a class of scene-based video modelsand its impact on the dimensioning of video buffers

We analyze the autocorrelation structure for a class of scene-based MPEG video models at the groups-of-pictures (GOP) (course grain) and frame (fine grain) levels assuming an arbitrary scene-length distribution. At the GOP level, we establish the relationship between the scene-length statistics and the short-range/long-range dependence (SRD/LRD) of the underlying model. We formally show that when the intrascene dynamics exhibit SRD, the overall model exhibits LRD if and only if the second moment of the scene length is infinite. Our results provide the theoretical foundation for several empirically derived scene-based models. We then study the impact of traffic correlations on the packet loss performance at a video buffer. Two popular families of scene-length distributions are investigated: Pareto and Weibull. In the case of Pareto distributed scene lengths, it is observed that the performance is rather insensitive to changes in the buffer size even as the video model enters the SRD regime. For Weibull distributed scene lengths, we observe that for small buffers the loss performance under a frame-level model can be larger than its GOP-level counterpart by orders of magnitude. In this case, the reliance on GOP-level models will result in very optimistic results     

Transmission power control in wireless ad hoc networks: challenges, solutions and open issues

Recently, power control in mobile ad hoc networks has been the focus of extensive research. Its main objectives are to reduce the total energy consumed in packet delivery and/or increase network throughput by increasing the channel's spatial reuse. In this article, we give an overview of various power control approaches that have been proposed in the literature. We discuss the factors that influence the selection of the transmission power, including the important interplay between the routing (network) and the medium access control (MAC) layers. Protocols that account for such interplay are presented.     

Cross-virtual concatenation for Ethernet-over-SONET/SDH networks

Ethernet-over-SONET/SDH (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET/SDH transport infrastructure. It typically uses virtual concatenation (VC) for dynamic bandwidth management. The aggregate SONET/SDH bandwidth for a given EoS connection is obtained by “concatenating” a number of equal-capacity virtual channels. Together, these virtual channels form a virtually concatenated group (VCG). In this article, we introduce a new concatenation technique, referred to as cross-virtual concatenation (CVC), which involves the concatenation of virtual channels of heterogeneous capacities. We show that CVC can be implemented through a simple upgrade at the end node, thus utilizing the existing legacy SDH infrastructure. By employing CVC for EoS systems, we show that the SDH bandwidth can be harvested more efficiently than in conventional VC. We consider two problems associated with routing CVC connections: the connection establishment problem and the connection upgrade problem. The goal of the first problem is to compute a set of paths between two EoS end systems such that a total bandwidth demand and a constraint on the differential delay between the paths are satisfied. Among all feasible sets, the one that consumes the least amount of network bandwidth is selected. For this problem, we develop an integer linear program (ILP) and an efficient algorithm based on the sliding-window approach. For the connection upgrade problem, the goal is to augment an existing set of paths so as to increase the aggregate bandwidth, while continue to meet the differential-delay constraint. We model this problem as a flow-maximization problem with a constraint on the delay of the virtual channels with positive flow. We then consider the problem of path selection under imprecise network state information. Simulations are conducted to demonstrate the advantages of employing CVC and to evaluate the performance of the proposed algorithms.

Synthesis and evaluation of the thermal properties of biosourced poly(ether)ureas and copoly(ether)ureas from 1,4:3,6‐dianhydrohexitols

A new series of poly(ether)ureas were prepared by solution polyaddition of three diamines based on 1,4:3,6‐dianhydrohexitols with three types of diisocyanate. The corresponding poly(ether)ureas were obtained with high yields. They were characterized by various analytical techniques (NMR, TGA and differential thermal analysis, DSC). NMR spectroscopy allowed us to confirm structure type and to optimize reaction conditions and DSC proved the high thermal properties of the products obtained (T_g and T_m in the range 126 ? 158 °C and 235 ? 330 °C respectively). Then, copoly(ether)ureas partially based on commercial diamines were synthesized in order to reduce polymer cost and tune their thermal behaviour. The reactivity of both diamines was evaluated by their incorporation in the polymer by means of NMR spectra. Then their thermal properties were compared with fully commercial diamine based polyureas by DSC studies. © 2014 Society of Chemical Industry     

Nitric Oxide Metabolic Pathway in Drought-Stressed Nodules of Faba Bean (Vicia faba L.)

Drought is an environmental stress that strongly impacts plants. It affects all stages of growth and induces profound disturbances that influence all cellular functions. Legumes can establish a symbiosis with Rhizobium-type bacteria, whose function is to fix atmospheric nitrogen in organs called nodules and to meet plant nitrogen needs. Symbiotic nitrogen fixation (SNF) is particularly sensitive to drought. We raised the hypothesis that, in drought-stressed nodules, SNF inhibition is partly correlated to hypoxia resulting from nodule structure compaction and an increased O₂ diffusion barrier, and that the nodule energy regeneration involves phytoglobin–nitric oxide (Pgb–NO) respiration. To test this hypothesis, we subjected faba bean (Vicia faba L.) plants nodulated with a Rhizobium laguerreae strain to either drought or osmotic stress. We monitored the N₂-fixation activity, the energy state (ATP/ADP ratio), the expression of hypoxia marker genes (alcohol dehydrogenase and alanine aminotransferase), and the functioning of the Pgb–NO respiration in the nodules. The collected data confirmed our hypothesis and showed that (1) drought-stressed nodules were subject to more intense hypoxia than control nodules and (2) NO production increased and contributed via Pgb–NO respiration to the maintenance of the energy state of drought-stressed nodules.     

MAC Protocol for Opportunistic Cognitive Radio Networks with Soft Guarantees

Cognitive radio (CR) is the key enabling technology for an efficient dynamic spectrum access. It aims at exploiting an underutilized licensed spectrum by enabling opportunistic communications for unlicensed users. In this work, we first develop a distributed cognitive radio MAC (COMAC) protocol that enables unlicensed users to dynamically utilize the spectrum while limiting the interference on primary (PR) users. The main novelty in COMAC lies in not assuming a predefined CR-to-PR power mask and not requiring active coordination with PR users. COMAC provides a statistical performance guarantee for PR users by limiting the fraction of the time during which the PR users' reception is negatively affected by CR transmissions. To provide such a guarantee, we develop probabilistic models for the PR-to-PR and the PR-to-CR interference under a Rayleigh fading channel model. From these models, we derive closed-form expressions for the mean and variance of interference. Empirical results show that the distribution of the interference is approximately lognormal. Based on the developed interference models, we derive a closed-form expression for the maximum allowable power for a CR transmission. We extend the min-hop routing to exploit the available channel information for improving the perceived throughput. Our simulation results indicate that COMAC satisfies its target soft guarantees under different traffic loads and arbitrary user deployment scenarios. Results also show that exploiting the available channel information for the routing decisions can improve the end-to-end throughput of the CR network (CRN).