Papers
Topics
Authors
Recent
Search
2000 character limit reached

Intelligent Duty Cycling Management and Wake-up for Energy Harvesting IoT Networks with Correlated Activity

Published 10 May 2024 in eess.SY, cs.AI, and cs.SY | (2405.06372v1)

Abstract: This paper presents an approach for energy-neutral Internet of Things (IoT) scenarios where the IoT devices (IoTDs) rely entirely on their energy harvesting capabilities to sustain operation. We use a Markov chain to represent the operation and transmission states of the IoTDs, a modulated Poisson process to model their energy harvesting process, and a discrete-time Markov chain to model their battery state. The aim is to efficiently manage the duty cycling of the IoTDs, so as to prolong their battery life and reduce instances of low-energy availability. We propose a duty-cycling management based on K- nearest neighbors, aiming to strike a trade-off between energy efficiency and detection accuracy. This is done by incorporating spatial and temporal correlations among IoTDs' activity, as well as their energy harvesting capabilities. We also allow the base station to wake up specific IoTDs if more information about an event is needed upon initial detection. Our proposed scheme shows significant improvements in energy savings and performance, with up to 11 times lower misdetection probability and 50\% lower energy consumption for high-density scenarios compared to a random duty cycling benchmark.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. O. L. López, O. M. Rosabal, D. E. Ruiz-Guirola, P. Raghuwanshi, K. Mikhaylov, L. Lovén, and S. Iyer, “Energy-Sustainable IoT Connectivity: Vision, Technological Enablers, Challenges, and Future Directions,” IEEE Open Journal of the Communications Society, vol. 4, pp. 2609–2666, Oct. 2023.
  2. L. Belli, A. Cilfone, L. Davoli, G. Ferrari, P. Adorni, F. Di Nocera, A. Dall’Olio, C. Pellegrini, M. Mordacci, and E. Bertolotti, “IoT-enabled smart sustainable cities: Challenges and approaches,” Smart Cities, vol. 3, no. 3, pp. 1039–1071, Sep. 2020.
  3. Z. Qin, F. Y. Li, G. Y. Li, J. A. McCann, and Q. Ni, “Low-power wide-area networks for sustainable IoT,” IEEE Wireless communications, vol. 26, no. 3, pp. 140–145, Jun. 2019.
  4. D. López-Pérez, A. De Domenico, N. Piovesan, G. Xinli, H. Bao, S. Qitao, and M. Debbah, “A Survey on 5G Radio Access Network Energy Efficiency: Massive MIMO, Lean Carrier Design, Sleep Modes, and Machine Learning,” IEEE Communications Surveys & Tutorials, vol. 24, no. 1, pp. 653–697, Jan. 2022.
  5. D. E. Ruíz-Guirola, C. A. Rodríguez-López, S. Montejo-Sánchez, R. D. Souza, O. L. López, and H. Alves, “Energy-Efficient Wake-Up Signalling for Machine-Type Devices Based on Traffic-Aware Long Short-Term Memory Prediction,” IEEE Internet of Things Journal, vol. 9, no. 21, pp. 21 620–21 631, Nov. 2022.
  6. H. Yomo, Y. Kondo, K. Namba, S. Tang, T. Kimura, and T. Ito, “Wake-up ID and protocol design for radio-on-demand wireless LAN,” in IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC), Sydney, Australia, Sep. 2012, pp. 419–424.
  7. J. Shiraishi, H. Yomo, K. Huang, v. Stefanović, and P. Popovski, “Content-Based Wake-Up for Top-k Query in Wireless Sensor Networks,” IEEE Transactions on Green Communications and Networking, vol. 5, no. 1, pp. 362–377, Mar. 2021.
  8. S. ul Haque, S. Chandak, F. Chiariotti, D. Günduz, and P. Popovski, “Learning to Speak on Behalf of a Group: Medium Access Control for Sending a Shared Message,” IEEE Communications Letters, vol. 26, no. 8, pp. 1843–1847, Aug. 2022.
  9. V. Egorova, A. Gil, J. Segura, and N. Temme, “Computation of the regularized incomplete Beta function,” Dolomites Research Notes on Approximation, vol. 16, no. DRNA Volume 16.3, pp. 10–16, Jul. 2023.
  10. M. Colombo, “Advances in interior point methods for large-scale linear programming,” 2007.
  11. C.-H. Liu, E. Papadopoulou, and D.-T. Lee, “An output-sensitive approach for the L1/L∞subscript𝐿1subscript𝐿L_{1}/L_{\infty}italic_L start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT / italic_L start_POSTSUBSCRIPT ∞ end_POSTSUBSCRIPT k-Nearest-Neighbor Voronoi diagram,” in Algorithms–ESA: 19th Annual European Symposium.   Springer, Saarbrücken, Germany, Sep. 2011, pp. 70–81.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.