Search

Wireless Power Transfer has become a commercially viable technology to charge devices because of the convenience of no power wiring and the reliability of continuous power supply. This paper concerns the fundamental issue of wireless charger placement with electromagnetic radiation (EMR) safety. Although there are a few wireless charging schemes consider EMR safety, none of them addresses the charger placement issue. In this paper, we propose PESA, a wireless charger Placement scheme that guarantees EMR SAfety for every location on the plane. First, we discretize the whole charging area and formulate the problem into the Multidimensional 0/1 Knapsack (MDK) problem. Second, we propose a fast approximation algorithm to the MDK problem. Third, we propose a near optimal scheme to improve speed by double partitioning the area. We prove that the output of our algorithm is better than $(1-\epsilon)$ of the optimal solution to PESA with a smaller EMR threshold $(1-\epsilon /2)R_{t}$ and a larger EMR coverage radius $(1+\epsilon /2)D$. We conducted both simulations and field experiments to evaluate the performance of our scheme. Our experimental results show that in terms of charging utility, our algorithm outperforms the comparison algorithms. [ABSTRACT FROM AUTHOR]

Wireless power transfer technology is considered as one of the promising solutions to address the energy limitation problems for end-devices, but its incurred potential risk of electromagnetic radiation (EMR) exposure is largely overlooked by most existing works. In this paper, we consider the Safe Charging with Adjustable PowEr (SCAPE) problem, namely, how to adjust the power of chargers to maximize the charging utility of devices, while assuring that EMR intensity at any location in the field does not exceed a given threshold Rt . We present novel techniques to reformulate SCAPE into a traditional linear programming problem, and then remove its redundant constraints as much as possible to reduce computational effort. Next, we propose a series of distributed algorithms, including a fully distributed algorithm that provably achieves $(1-\epsilon)$ approximation ratio and requires only communications with neighbors within a constant distance for each charger. Through extensive simulation and testbed experiments, we demonstrate that our proposed algorithms can outperform the set-cover algorithm by up to 17.05%, and has an average performance gain of 41.1% over the existing algorithm in terms of the overall charging utility. [ABSTRACT FROM PUBLISHER]

As battery-powered mobile devices become more popular and energy hungry, wireless power transfer technology, which allows the power to be transferred from a charger to ambient devices wirelessly, receives intensive interests. Existing schemes mainly focus on the power transfer efficiency but overlook the health impairments caused by RF exposure. In this paper, we study the safe charging problem (SCP) of scheduling power chargers so that more energy can be received while no location in the field has electromagnetic radiation (EMR) exceeding a given threshold Rt . We show that SCP is NP-hard and propose a solution, which provably outperforms the optimal solution to SCP with a relaxed EMR threshold (1-\epsilon )Rt . Testbed results based on 8 Powercast TX91501 chargers validate our results. Extensive simulation results show that the gap between our solution and the optimal one is only 6.7% when $\epsilon = 0.1$ , while a naive greedy algorithm is 34.6% below our solution. [ABSTRACT FROM PUBLISHER]

Recent pioneer work has shown that packet receptions on adjacent links are correlated, which contradicts the long held assumption that wireless links are statistically independent. Since wireless link correlation affects a wide range of protocol designs, it is essential to quantify the impact generically. In particular, this paper focuses on a unified transmission cost metric for diversity-based routing schemes, including opportunistic routing, network coding, and hybrid routing. This paper covers both unicast and broadcast. Compared with the legacy metrics, our metric provides a direct and accurate estimation of the transmission cost in the presence of link correlation. The new metric helps a wide range of routing algorithms determine when they can benefit from reception diversity, and how to maximize the benefit, at negligible costs. We evaluate the metric on one 802.11 test bed and three 802.15.4 test beds running TelosB, MICAz, and GreenOrbs nodes. The experimental results show that our metric 1) reduces 92% and 94% of the estimation error of the transmission cost in unicast and broadcast and 2) outperforms the link independent metric in both unicast and broadcast applications. [ABSTRACT FROM PUBLISHER]

Recent work has shown that wireless links are not independent, and that transmissions from a transmitter to multiple receivers are correlated. This finding has profound implications for the performance of network protocols such as broadcast, multicast, opportunistic routing, and network coding. In this paper, we show how link correlation can significantly impact broadcast. We present the design and implementation of CorLayer, a general supporting layer for energy-efficient reliable broadcast that carefully blacklists certain poorly correlated wireless links. The design uses only one-hop information, which makes it work in a fully distributed manner and introduces minimal communication overhead. The highlight of our work is CorLayer's broad applicability and effectiveness. We integrate CorLayer transparently with 16 state-of-the-art broadcast protocols specified in 13 publications on three physical testbeds running TelosB, MICAz, and GreenOrbs nodes, respectively. The experimental results show that CorLayer significantly improves energy efficiency across a wide spectrum of broadcast protocols and that the total number of packet transmissions can be reduced consistently by 47% on average. [ABSTRACT FROM AUTHOR]

In traditional radio-based localization methods, the target object has to carry a transmitter (e.g., active RFID), a receiver (e.g., 802.11\times detector), or a transceiver (e.g., sensor node). However, in some applications, such as safe guard systems, it is not possible to meet this precondition. In this paper, we propose a model of signal dynamics to allow the tracking of a transceiver-free object. Based on radio signal strength indicator (RSSI), which is readily available in wireless communication, three centralized tracking algorithms, and one distributed tracking algorithm are proposed to eliminate noise behaviors and improve accuracy. The midpoint and intersection algorithms can be applied to track a single object without calibration, while the best-cover algorithm has higher tracking accuracy but requires calibration. The probabilistic cover algorithm is based on distributed dynamic clustering. It can dramatically improve the localization accuracy when multiple objects are present. Our experimental test-bed is a grid sensor array based on MICA2 sensor nodes. The experimental results show that the localization accuracy for single object can reach about 0.8 m and for multiple objects is about 1 m. [ABSTRACT FROM AUTHOR]

Transceiver-free object tracking is to trace a moving object that does not carry any communication device in an environment with some monitoring nodes predeployed. Among all the tracking technologies, RF-based technology is an emerging research field facing many challenges. Although we proposed the original idea, until now there is no method achieving scalability without sacrificing latency and accuracy. In this paper, we put forward a real-time tracking system RASS, which can achieve this goal and is promising in the applications like the safeguard system. Our basic idea is to divide the tracking field into different areas, with adjacent areas using different communication channels. So, the interference among different areas can be prevented. For each area, three communicating nodes are deployed on the ceiling as a regular triangle to monitor this area. In each triangle area, we use a Support Vector Regression (SVR) model to locate the object. This model simulates the relationship between the signal dynamics caused by the object and the object position. It not only considers the ideal case of signal dynamics caused by the object, but also utilizes their irregular information. As a result, it can reach the tracking accuracy to around 1 m by just using three nodes in a triangle area with 4 m in each side. The experiments show that the tracking latency of the proposed RASS system is bounded by only about 0.26 m. Our system scales well to a large deployment field without sacrificing the latency and accuracy. [ABSTRACT FROM AUTHOR]

Reliable communications are essential for most applications in wireless sensor networks (WSNs). In traditional approaches, the per-hop and end-to-end (E2E) recovery schemes are widely used. These schemes, however, suffer from low E2E success rate and poor energy efficiency in large-scale real environments. Through empirical studies, in this paper we identify three major problems that hinder the efficient and reliable communications. To address these problems, we propose a novel in-middle recovery scheme and realize it by designing and implementing a proliferation routing. Proliferation routing integrates three core technologies, namely, capability-based path finder, a randomized dispersity, and reproduction. Proliferation routing offers great flexibilities for transmissions. It cannot only be applied with any Medium Access Control (MAC) protocols and routing metrics, but also obtains a desired service quality (i.e., transmission success rate, energy cost, etc.) by controlling the system parameters. To demonstrate the effectiveness of proliferation routing, we thoroughly analyze its performance. We also conduct performance evaluations through implementation experiments as well as simulations. In a specific experimental setup, proliferation routing can increase the E2E transmission success rate up to 80 percent compared with the well-known hop-based routing and flooding. [ABSTRACT FROM PUBLISHER]