Content-based Wake-up for Energy-efficient and Timely Top-k IoT Sensing Data Retrieval
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913735433519104 |
|---|---|
| author | Shiraishi, Junya Kalør, Anders E. Leyva-Mayorga, Israel Chiariotti, Federico Popovski, Petar Yomo, Hiroyuki |
| author_facet | Shiraishi, Junya Kalør, Anders E. Leyva-Mayorga, Israel Chiariotti, Federico Popovski, Petar Yomo, Hiroyuki |
| contents | Energy efficiency and information freshness are key requirements for sensor nodes serving Industrial Internet of Things (IIoT) applications, where a sink node collects informative and fresh data before a deadline, e.g., to control an external actuator. Content-based wake-up (CoWu) activates a subset of nodes that hold data relevant for the sink's goal, thereby offering an energy-efficient way to attain objectives related to information freshness. This paper focuses on a scenario where the sink collects fresh information on top-k values, defined as data from the nodes observing the k highest readings at the deadline. We introduce a new metric called top-k Query Age of Information (k-QAoI), which allows us to characterize the performance of CoWu by considering the characteristics of the physical process. Further, we show how to select the CoWu parameters, such as its timing and threshold, to attain both information freshness and energy efficiency. The numerical results reveal the effectiveness of the CoWu approach, which is able to collect top-k data with higher energy efficiency while reducing k-QAoI when compared to round-robin scheduling, especially when the number of nodes is large and the required size of k is small. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_06026 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Content-based Wake-up for Energy-efficient and Timely Top-k IoT Sensing Data Retrieval Shiraishi, Junya Kalør, Anders E. Leyva-Mayorga, Israel Chiariotti, Federico Popovski, Petar Yomo, Hiroyuki Networking and Internet Architecture Signal Processing Energy efficiency and information freshness are key requirements for sensor nodes serving Industrial Internet of Things (IIoT) applications, where a sink node collects informative and fresh data before a deadline, e.g., to control an external actuator. Content-based wake-up (CoWu) activates a subset of nodes that hold data relevant for the sink's goal, thereby offering an energy-efficient way to attain objectives related to information freshness. This paper focuses on a scenario where the sink collects fresh information on top-k values, defined as data from the nodes observing the k highest readings at the deadline. We introduce a new metric called top-k Query Age of Information (k-QAoI), which allows us to characterize the performance of CoWu by considering the characteristics of the physical process. Further, we show how to select the CoWu parameters, such as its timing and threshold, to attain both information freshness and energy efficiency. The numerical results reveal the effectiveness of the CoWu approach, which is able to collect top-k data with higher energy efficiency while reducing k-QAoI when compared to round-robin scheduling, especially when the number of nodes is large and the required size of k is small. |
| title | Content-based Wake-up for Energy-efficient and Timely Top-k IoT Sensing Data Retrieval |
| topic | Networking and Internet Architecture Signal Processing |
| url | https://arxiv.org/abs/2410.06026 |