Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 232

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI

Wen, Dingzhu, Liu, Peixi, Zhu, Guangxu, Shi, Yuanming, Xu, Jie, Eldar, Yonina C., Cui, Shuguang · 2024 · IEEE Transactions on Wireless Communications

Abstract

This paper studies a new multi-device edge artificial-intelligent (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) to enable low-latency intelligent services at the network edge. In this system, multiple ISAC devices perform radar sensing to obtain multi-view data, and then offload the quantized version of extracted features to a centralized edge server, which conducts model inference based on the cascaded feature vectors. Under this setup and by considering classification tasks, we measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain, which is defined as the distance of two classes in the Euclidean feature space under normalized covariance. To maximize the discriminant gain, we first quantify the influence of the sensing, computation, and communication processes on it with a derived closed-form expression. Then, an end-to-end task-oriented resource management approach is developed by integrating the three processes into a joint design. This integrated sensing, computation, and communication (ISCC) design approach, however, leads to a challenging non-convex optimization problem, due to the complicated form of discriminant gain and the device heterogeneity in terms of channel gain, quantization level, and generated feature subsets. Remarkably, the considered non-convex problem can be optimally solved based on the sum-of-ratios method. This gives the optimal ISCC scheme, that jointly determines the transmit power and time allocation at multiple devices for sensing and communication, as well as their quantization bits allocation for computation distortion control. By using human motions recognition as a concrete AI inference task, extensive experiments are conducted to verify the performance of our derived optimal ISCC scheme.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/twc.2023.3303232

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 46

  1. 10.1109/MCOM.001.1900103 · DOI · Paper page
  2. 10.1109/JPROC.2019.2941458 · DOI · Paper page
  3. 10.1109/COMST.2020.3007787 · DOI · Paper page
  4. 10.1073/pnas.2024789118 · DOI · Paper page
  5. 10.1109/LWC.2022.3149783 · DOI
  6. 10.1109/JSAC.2021.3118346 · DOI · Paper page
  7. Han, 2015, Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding, arXiv:1510.00149 · arXiv
  8. 10.1109/TMC.2021.3125793 · DOI
  9. 10.1109/TGCN.2021.3058657 · DOI · Paper page
  10. 10.1109/INFOCOMWKSHPS47286.2019.9093772 · DOI
  11. 10.1109/JIOT.2020.2997128 · DOI
  12. 10.1109/TWC.2019.2946140 · DOI · Paper page
  13. 10.1109/MCOM.001.2000373 · DOI · Paper page
  14. 10.1109/SPAWC48557.2020.9154306 · DOI
  15. 10.1109/JSAC.2021.3126087 · DOI · Paper page
  16. 10.1109/TWC.2022.3221778 · DOI
  17. 10.1109/TWC.2022.3165824 · DOI
  18. 10.1109/JSAC.2023.3242724 · DOI
  19. 10.1109/MNET.010.2100152 · DOI · Paper page
  20. 10.1109/TSP.2021.3116343 · doi:10.1109/tsp.2021.3116343
  21. 10.1109/TSP.2021.3095726 · doi:10.1109/tsp.2021.3095726
  22. 10.1109/TVT.2021.3056408 · DOI
  23. 10.1109/TSP.2018.2847648 · DOI · Paper page
  24. 10.1109/MSP.2020.2983832 · DOI · Paper page
  25. Pritzker, 2022, Transmit precoder design approaches for dual-function radar-communication systems, arXiv:2203.09571 · arXiv
  26. 10.1109/JSAC.2022.3155507 · DOI · Paper page
  27. 10.1109/tvt.2023.3262513 · DOI · Paper page
  28. 10.1109/JSTSP.2021.3117404 · DOI · Paper page
  29. 10.1109/twc.2022.3233795 · DOI
  30. 10.1109/ICC45855.2022.9839016 · DOI
  31. 10.1109/LCOMM.2022.3181612 · DOI
  32. 10.1214/aoms/1177729694 · DOI · Paper page
  33. 10.1109/SPAWC51858.2021.9593198 · DOI
  34. 10.1109/TVT.2022.3184182 · DOI
  35. 10.1109/TPDS.2011.45 · doi:10.1109/tpds.2011.45
  36. 10.1007/s11432-022-3652-2 · DOI · Paper page
  37. 10.1049/iet-map.2012.0450 · DOI · Paper page
  38. 10.1109/JSTSP.2021.3118219 · DOI
  39. Shlezinger, 2021, Deep task-based quantization, Entropy, 23, 1, 10.3390/e23010104 · DOI
  40. 10.1109/TSP.2013.2280111 · DOI · Paper page
  41. Jong, 2012, An efficient global optimization algorithm for nonlinear sum-of-ratios problem, Optim. Online, 1
  42. 10.1109/TWC.2015.2403327 · DOI
  43. 10.1109/TWC.2020.3021177 · DOI
  44. 10.1109/TWC.2021.3092075 · DOI
  45. 10.1109/INFOCOM.2019.8737464 · DOI · Paper page
  46. 2022, Pedestrian and Bicyclist Classification Using Deep Learning

Metadata

Authors
Wen, D., Liu, P., Zhu, G., Shi, Y., Xu, J., Eldar, Y. C., & Cui, S.
Venue
IEEE Transactions on Wireless Communications
Published
2024-03
Volume
23
Issue
3
Pages
2486-2502
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W4385819926
Cited by
232
References
7
FWCI
26.05
Type
journal article
Language
en
Open access
closed
Funders
  • Shanghai Sailing Program (23YF1427400)
  • National Natural Science Foundation of China (62001310, 62271318, U2001208, 92267202)
  • Basic and Applied Basic Research Foundation of Guangdong Province (2022A1515010109)
  • Internal Project Fund through the Shenzhen Research Institute of Big Data (J00120230001)
  • Natural Science Foundation of Shanghai (21ZR1442700)
  • Basic Research Project of Hetao Shenzhen-HK S&T Cooperation Zone (HZQB-KCZYZ-2021067)
  • Shenzhen Fundamental Research Program (JCYJ20210324133405015)
  • Guangdong Provincial Key Laboratory of Future Networks of Intelligence (2022B1212010001)
  • Israel Science Foundation (536/22)
  • European Research Council (ERC) through the European Union’s Horizon 2020 Research and Innovation Programme (101000967)
  • NSFC (62293482)
  • Basic Research Project of Hetao Shenzhen-Hong Kong Science and Technology (HK S&T) Cooperation Zone (HZQB-KCZYZ-2021067)
  • National Key Research and Development Program of China (2018YFB1800800)
  • Shenzhen Outstanding Talents Training Fund (202002)
  • Guangdong Research Projects (2017ZT07X152, 2019CX01X104)
  • Shenzhen Key Laboratory of Big Data and Artificial Intelligence (ZDSYS201707251409055)
  • Special Project for Research and Development in Key areas of Guangdong Province (2018B030338001)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.