Average and randomized communication complexity

The communication complexity of a two-variable function f(x,y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether (1) the worst case or average number of bits is considered, (2) computation errors are allowed and (3) randomization is allowed. Tight bounds are provided for the typical behavior of all bounded-error communication-complexity measures of Boolean functions. In the present work, the authors formally define the deterministic model. They describe randomized protocols and compare them to deterministic ones. They both survey previous work and describe original results     

On the design of Robust‐WDM local area networks

Robust wavelength division multiplexing (Robust‐WDM) is a proposal to realize cost‐effective WDM local area networks (LANs) which can get around the expensive need for laser wavelength stabilization. The type of these networks that relies on an access protocol with aperiodic reservations and lenient‐token‐passing based control channel (the AR/LTP protocol) is promising. We look at the deployment of the AR/LTP analytical model in designing this type of network. The model is used to predict the effect of component and network parameters on the waiting time characteristics of the network. An increase in node operation times (i.e. receiver response time, transmitter select time and reservation period) would result in increasing the average waiting time of a connection request, but the waiting time is more sensitive to the physical span of the network and its size. It is also observed that increasing the inter‐reservation threshold may result in little increase in waiting time up to some limit beyond which delay increases rapidly. Copyright © 2001 John Wiley & Sons, Ltd.     

Cooperative localization techniques for wireless sensor networks: free,signal and angle based techniques

This paper addresses the problem of localization in sensor networks where, initially, a certain number of sensors are aware of their positions (either by using GPS or by being hand‐placed) and are referred to as anchors. Our goal is to localize all sensors with high accuracy, while using a limited number of anchors. Sensors can be equipped with different technologies for signal and angle measurements. These measures can be altered by some errors because of the network environment that induces position inaccuracies. In this paper, we propose a family (AT‐Family) of three new distributed localization techniques in wireless sensor networks: free‐measurement (AT‐Free) where sensors have no capability of measure, signal‐measurement (AT‐Dist) where sensors can calculate distances, and angle‐measurement (AT‐Angle) where sensors can calculate angles. These methods determine the position of each sensor while indicating the accuracy of its position. They have two important properties: first, a sensor node can deduce if its estimated position is close to its real position and contribute to the positioning of others nodes; second, a sensor can eliminate wrong information received about its position. This last property allows to manage measure errors that are the main drawback of measure‐based methods such as AT‐Dist and AT‐Angle techniques. By varying the density and the error rate, simulations show that the three proposed techniques achieve good performances in term of high accuracy of localized nodes and less energy consuming while assuming presence of measure errors and considering low number of anchors. Copyright © 2012 John Wiley & Sons, Ltd.     

Mapping of generalized template matching onto reconfigurable computers

Image processing algorithms for template matching, two-dimensional (2-D) digital filtering, morphologic operations, and motion estimation share some common properties. They can all benefit from using reconfigurable computers that use coprocessor boards based on field-programmable gate array (FPGA) chips. This paper characterizes those applications as generalized template matching (GTM) operations and describes the mapping of the GTM operations onto reconfigurable computers. A three-step approach is described. The first two steps enumerate and prune the design space of basic GTM building blocks, which consist of FPGA buffers and GTM computation cores. The last step is to achieve a solution through an optimal combination of these building blocks where the cost function is the FPGA computation time and the constraints are FPGA coprocessor board resources. Various FPGA buffers are presented so as to introduce design options of basic GTM building blocks. Algorithms used for the mapping are described. Experimental results are summarized to reveal the relationship between the GTM mapping results and FPGA board resource parameters.     

Use of signal processing imaging for the study of a 3D package in harsh environment

Assembly technologies follow the reduction in size of circuit board components and correlatively the number of active layers increases significantly. Therefore, during a conventional acoustic analysis, the obtained image becomes more and more complicated to analyze. In a previous paper, we focused our research on a method for a suitable visualization of the timescale of an acoustic signal (CWT). In this paper we present the use of the non-destructive control for the study of a 3D package submitted to accelerated ageing tests using harsh conditions.     

Quantitative luminescence mapping of Cu(In,Ga)Se2 thin‐film solar cells

We investigate photoluminescence and electroluminescence (PL and EL) emission images from Cu(In,Ga)Se₂‐based solar cells by means of a Hyperspectral Imager. Using the generalized Planck's law, maps of the effective quasi‐Fermi level splitting Δμ_eff in absolute values are obtained. A good agreement is found between the spatially averaged splitting in PL and the global open‐circuit voltage. However, from a local carrier transport discussion, we conclude that the equality does not hold locally. The spatial variations are rather attributed to local depth variations of the quasi‐Fermi level splitting due to material properties spatial fluctuations. By comparing PL and EL emissions, we discuss qualitatively the local effective lifetimes and collection efficiencies. Copyright © 2014 John Wiley & Sons, Ltd.     

Remote‐Controlled Hydrogel Depots for Time‐Scheduled Vaccination

Remote‐controlled drug depots represent a highly valuable tool for the timely controlled administration of pharmaceuticals in a patient compliant manner. Here, the first pharmacologically controlled material that allows for the scheduled induction of a medical response in mice is described. To this aim, a novel, humanized biohybrid material that releases its cargo in response to a small‐molecule stimulus licensed for human use is developed. The functionality of the material in mice is demonstrated by the remote‐controlled delivery of a vaccine against the oncogenic human papillomavirus type 16. It is shown that the biohybrid depot‐mediated immunoprotection is equivalent to the classical multi‐injection‐based vaccination. These results indicate that this material can be used as a universal remote‐controlled vehicle for the patient‐compliant delivery of vaccines and pharmaceuticals.     

AODVCS,a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).     

A Threshold-Free LLR-Based Scheme to Minimize the BER for Decode-and-Forward Relaying

In cooperative communications, the problem of error propagation has a detrimental effect on the diversity order of the wireless system. To mitigate such an effect, we present a relaying scheme that is based on the absolute value of the log-likelihood ratio (LLR) of the received message signals at both the relay node and the destination node. The calculated LLR values are then compared to each other and based on the result of the comparison, a decision is made on whether or not to activate the relay node. The proposed scheme does not rely on any threshold, and is thus simple in nature. A closed-form expression is derived for the bit-error-rate (BER) of the proposed scheme. The theoretical developments are validated by simulations. As a means for performance measurement, the proposed scheme is compared to its counterparts and is shown to provide a better BER performance at a much lower complexity. Furthermore, a closed-form expression of the outage probability is also derived.     

A methodology to benchmark flexible payload architectures in a megaconstellation use case

This paper proposes a methodology to benchmark satellite payload architectures and find the optimal trade‐offs between high flexibility and low complexity. High flexibility would enable the satellite to adapt to various distributions of user terminals on the ground and fulfill the data rate demand of these users. Besides, low complexity is required to keep satellite networks competitive in the context of emerging 5G networks. To estimate the flexibility of a payload, an indicator to characterize the non‐uniformity of user distributions is proposed. Each benchmarked payload may be characterized by a graph relating the throughput to this parameter further denoted . The payload provides the same throughput trends for different scenarios of user distributions with the same parameter. As a consequence, the average capacity of the system may be estimated by (a) calculating the probability distribution of over the orbit and (b) integrating the throughput based on this payload response. It thus results in a straightforward way for benchmarking payloads directly on an estimation of the averaged capacity, accounting for the user distribution over the earth. A simulation platform has been developed to characterize the payload throughput including the implementation of a resource allocation algorithm that accounts for constraints of various payloads. Using this definition and the developed tool, we benchmark a bent‐pipe architecture, a beam hopping architecture and a hybrid beam‐steering architecture for a LEO megaconstellation use case. The methodology showcases the interest for investigating different payload architectures depending on realistic traffic scenario analysis.