RF Energy Harvester-based Wake-up Receiver

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

On the analysis of expected distance between sensor nodes and the base station in randomly deployed WSNs

In this study, we focus on the analytical derivation of the expected distance between all sensor nodes and the base station (i.e., E[dtoBS]) in a randomly deployed WSN. Although similar derivations appear in the related literature, to the best of our knowledge, our derivation, which assumes a particular scenario, has not been formulated before. In this specific scenario, the sensing field is a square-shaped region and the base station is located at some arbitrary distance to one of the edges of the square. Having the knowledge of E[dtoBS] value is important because E[dtoBS] provides a network designer with the opportunity to make a decision on whether it is energy-efficient to perform clustering for WSN applications that aim to pursue the clustered architectures. Similarly, a network designer might make use of this expected value during the process of deciding on the modes of communications (i.e., multi-hop or direct communication) after comparing it with the maximum transmission ranges of devices. Last but not least, the use of our derivation is not limited to WSN domain. It can be also exploited in any domain when there is a need for a probabilistic approach to find the average distance between any given number of points which are all assumed to be randomly and uniformly located in any square-shaped region and at a specific point outside this region. © Springer International Publishing Switzerland 2014

A review on hierarchical routing protocols for wireless sensor networks

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

Multi-hop hierarchical routing based on the node health status in wireless sensor network

© Springer Nature Switzerland AG 2019. This paper proposed multi-hop hierarchical routing to monitor forest fire using wireless sensor network. The node health status is introduced in choosing Cluster Head (CH) in order to avoid route breakages caused by CH that burns off. CHs transmit their data to the closest CH which is in the direction to the Base Station. The performance of the proposed method is compared to the Leach, MTE, and the direct algorithm. The extensive simulation is done by NS2 with results showing that the proposed method outperforms others in term of the number of packets received, energy consumed, the number of nodes alive, and average end to end delay

Resonant Photoemission in f-Electron Systems: Pu and Gd

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

Production of phi Mesons in Au+Au Collisions at 11.7 A GeV/c

We report on a measurement of phi-meson production in Au+Au collisions at a beam momentum of 11.7 A GeV/c by Experiment E917 at the AGS. The measurement covers the midrapidity region 1.2 < y < 1.6. Transverse-mass spectra and the rapidity distribution are presented as functions of centrality characterized by the number of participant projectile nucleons. The yield of phi's per participant projectile nucleon increases strongly in central collisions in a manner similar to that observed for kaons.Comment: 12 pages, 3 table, 14 eps figures which use \includegraphics, revtex 4, revised version submitted to Phys. Rev.