Search arXivSearch

arXiv · 1601.00788

Experimental Study on Battery-less Sensor Network Activated by Multi-point Wireless Energy Transmission

Abstract

This paper empirically validates battery-less sensor activation via wireless energy transmission to release sensors from wires and batteries. To seamlessly extend the coverage and activate sensor nodes distributed in any indoor environment, we proposed multi-point wireless energy transmission with carrier shift diversity. In this scheme, multiple transmitters are employed to compensate path-loss attenuation and orthogonal frequencies are allocated to the multiple transmitters to avoid the destructive interference that occurs when the same frequency is used by all transmitters. In our previous works, the effectiveness of the proposed scheme was validated theoretically and also empirically by using just a spectrum analyzer to measure the received power. In this paper, we develop low-energy battery-less sensor nodes whose consumed power and required received power for activation are respectively 142 uW and 400 uW. In addition, we conduct indoor experiments in which the received power and activation of battery-less sensor node are simultaneously observed by using the developed battery-less sensor node and a spectrum analyzer. The results show that the coverage of single-point and multi-point wireless energy transmission without carrier shift diversity are, respectively, 84.4% and 83.7%, while the coverage of the proposed scheme is 100%. It can be concluded that the effectiveness of the proposed scheme can be verified by our experiments using real battery-less sensor nodes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daiki Maehara, Gia Khanh Tran, Kei Sakaguchi, Kiyomichi Araki. 2016-01-05. Experimental Study on Battery-less Sensor Network Activated by Multi-point Wireless Energy Transmission. https://arxiv.org/abs/1601.00788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI