233 research outputs found

    Designing libraries of chimeric proteins using SCHEMA recombination and RASPP

    Get PDF
    SCHEMA is a method for designing libraries of novel proteins by recombination of homologous sequences. The goal is to maximize the number of folded proteins while simultaneously generating significant sequence diversity. Here, we use the RASPP algorithm to identify optimal SCHEMA designs for shuffling contiguous elements of sequence. To exemplify the method, SCHEMA is used to recombine five fungal cellobiohydrolases (CBH1s) to produce a library of more than 390,000 novel CBH1 sequences

    RF Energy Harvester-based Wake-up Receiver

    Get PDF
    Wake-up receivers (WuRxs) can improve the life- time of a wireless sensor network by reducing energy consump- tion from undesirable idle listening. The amplitude level of the incoming RF signal is used by a WuRx to generate an interrupt and wake up the radio of a sleeping sensor node. Existing passive WuRx designs are generally based on RFID tags that incur high cost and complexity. Thus, there is a need for cost-effective and low-complexity WuRxs suited for both long-range and directed wake-ups. In this work, we present a WuRx design using an RF energy harvesting circuit (RFHC). Experimental results show that our RFHC-based WuRx can provide a wake-up range sensitivity around 4 cm/mW at low transmit RF powers ( < 20 mW), which scales to a long wake-up range at high powers. Our design also obtains accurate selective wake-ups. We finally present simulation-based studies for optimizing the design of RFHCs that enhance decoding efficiency with improved rise and fall times

    A network-aware framework for energy-efficient data acquisition in wireless sensor networks

    Get PDF
    Wireless sensor networks enable users to monitor the physical world at an extremely high fidelity. In order to collect the data generated by these tiny-scale devices, the data management community has proposed the utilization of declarative data-acquisition frameworks. While these frameworks have facilitated the energy-efficient retrieval of data from the physical environment, they were agnostic of the underlying network topology and also did not support advanced query processing semantics. In this paper we present KSpot+, a distributed network-aware framework that optimizes network efficiency by combining three components: (i) the tree balancing module, which balances the workload of each sensor node by constructing efficient network topologies; (ii) the workload balancing module, which minimizes data reception inefficiencies by synchronizing the sensor network activity intervals; and (iii) the query processing module, which supports advanced query processing semantics. In order to validate the efficiency of our approach, we have developed a prototype implementation of KSpot+ in nesC and JAVA. In our experimental evaluation, we thoroughly assess the performance of KSpot+ using real datasets and show that KSpot+ provides significant energy reductions under a variety of conditions, thus significantly prolonging the longevity of a WSN

    Resonant Photoemission in f-Electron Systems: Pu and Gd

    Get PDF
    Resonant photoemission in the Pu 5f and Pu 6p states is compared to that in the Gd 4f and Gd 5p states. Spectral simulations, based upon an atomic model with angular momentum coupling, are compared to the Gd and Pu results. Additional spectroscopic measurements of Pu, including core level photoemission and x-ray absorption, are also presented

    A review on hierarchical routing protocols for wireless sensor networks

    Get PDF
    The routing protocol for Wireless Sensor Networks (WSNs) is defined as the manner of data dissemination from the network field (source) to the base station (destination). Based on the network topology, there are two types of routing protocols in WSNs, they are namely flat routing protocols and hierarchical routing protocols. Hierarchical routing protocols (HRPs) are more energy efficient and scalable compared to flat routing protocols. This paper discusses how topology management and network application influence the performance of cluster-based and chain-based hierarchical networks. It reviews the basic features of sensor connectivity issues such as power control in topology set-up, sleep/idle pairing and data transmission control that are used in five common HRPs, and it also examines their impact on the protocol performance. A good picture of their respective performances give an indication how network applications, i.e whether reactive or proactive, and topology management i.e. whether centralized or distributed would determine the network performance. Finally, from the ensuring discussion, it is shown that the chain-based HRPs guarantee a longer network lifetime compared to cluster-based HRPs by three to five times

    O-SPIN: an Opportunistic Data Dissemination Protocol for Folk-enabled Information System in Least Developed Countries

    Get PDF
    International audienceWithout universal access to the Internet, Least Developed Countries are left by the wayside of the digital revolution. Research is underway to overstep the barrier to the development of information technology services in these areas. In this context, the Folk-IS (Folk-enabled Information System) is a new fully decentralized and participatory approach, in which, each individual can transparently perform data management and networking tasks through highly secure, portable, and low-cost storage and computing personal devices, as physically moving, so that global services can finally be delivered by crowd. In this paper we propose Opportunistic SPIN (O-SPIN), an information dissemination protocol that augments the well-known data-centric energy-aware SPIN protocol to enable networking facilities for Folk-nodes, by exploiting opportunistic contacts among users. Performance of the proposed solution has been evaluated through simulations carried out in the OMNeT++ framework under different settings. Achieved results demonstrate its effectiveness and efficiency in the information dissemination process

    Energy Efficient Nano Servers Provisioning for Information Piece Delivery in a Vehicular Environment

    Get PDF
    In this paper, we propose energy efficient Information Piece Delivery (IPD) through Nano Servers (NSs) in a vehicular network. Information pieces may contain any data that needs to be communicated to a vehicle. The available power (renewable or non-renewable) for a NS is variable. As a result, the service rate of a NS varies linearly with the available energy within a given range. Our proposed system therefore exhibits energy aware rate adaptation (RA), which uses variable transmission energy. We have also developed another transmission energy saving method for comparison, where sleep cycles (SC) are employed. Both methods are compared against an acceptable download time. To reduce the operational energy, we first optimise the locations of the NSs by developing a mixed integer linear programming (MILP) model, which takes into account the hourly variation of the traffic. The model is validated through a Genetic Algorithm (GA1). Furthermore, to reduce the gross delay over the entire vehicular network, the available renewable energy (wind farm) is optimally allocated to each NS according to piece demand. This, in turn, also reduces the network carbon footprint. A Genetic Algorithm (GA2) is also developed to validate the MILP results associated with this system. Through transmission energy savings, RA and SC further reduce the NSs energy consumption by 19% and 18% respectively, however at the expense of higher download time. MILP model 4 (with RA) and model 5 (with SC) reduced the delay by 81% and 83% respectively, while minimising the carbon footprint by 96% and 98% respectively, compared to the initial MILP model
    corecore