Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-02-11 DOI:10.1016/j.comnet.2025.111102
Yurong Lai , Xinhui Han , Xueer Wang , Tse-Tin Chan , Haoyuan Pan
{"title":"Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study","authors":"Yurong Lai ,&nbsp;Xinhui Han ,&nbsp;Xueer Wang ,&nbsp;Tse-Tin Chan ,&nbsp;Haoyuan Pan","doi":"10.1016/j.comnet.2025.111102","DOIUrl":null,"url":null,"abstract":"<div><div>This paper examines the concept of information freshness in a collaborative surveillance scenario utilizing non-orthogonal multiple access (NOMA). In this scenario, each monitoring device observes a portion of a common target and reports the latest status to a common access point (AP), which then recovers the complete observations. We use the age of collection (AoC) as a metric for information freshness. Unlike the conventional age of information (AoI) metric, the instantaneous AoC decreases only when the AP receives all partial updates from different devices (i.e., successfully receives a “joint” update). Consequently, existing AoI-oriented analyses on NOMA cannot be easily generalized to AoC due to the different update rules between AoC and AoI. Conventional NOMA schemes typically employ multiuser decoding (MUD) techniques to decode update messages from different devices, referred to here as the MUD-only NOMA system. However, MUD techniques are less effective when the signal-to-noise ratios (SNRs) of different NOMA users are nearly balanced. Therefore, we consider network-coded multiple access (NCMA), an advanced NOMA scheme that integrates MUD with physical-layer network coding (PNC). PNC is a technique that transforms wireless mutual interference into useful network-coded information, working well even when the SNRs of different users are similar. Experimental results using software-defined radios indicate that NCMA is a practical solution for achieving low average AoC under varying channel conditions. The combination of MUD and PNC enables the AP to receive joint update messages much faster, significantly reducing the average AoC of the system.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111102"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625000702","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

This paper examines the concept of information freshness in a collaborative surveillance scenario utilizing non-orthogonal multiple access (NOMA). In this scenario, each monitoring device observes a portion of a common target and reports the latest status to a common access point (AP), which then recovers the complete observations. We use the age of collection (AoC) as a metric for information freshness. Unlike the conventional age of information (AoI) metric, the instantaneous AoC decreases only when the AP receives all partial updates from different devices (i.e., successfully receives a “joint” update). Consequently, existing AoI-oriented analyses on NOMA cannot be easily generalized to AoC due to the different update rules between AoC and AoI. Conventional NOMA schemes typically employ multiuser decoding (MUD) techniques to decode update messages from different devices, referred to here as the MUD-only NOMA system. However, MUD techniques are less effective when the signal-to-noise ratios (SNRs) of different NOMA users are nearly balanced. Therefore, we consider network-coded multiple access (NCMA), an advanced NOMA scheme that integrates MUD with physical-layer network coding (PNC). PNC is a technique that transforms wireless mutual interference into useful network-coded information, working well even when the SNRs of different users are similar. Experimental results using software-defined radios indicate that NCMA is a practical solution for achieving low average AoC under varying channel conditions. The combination of MUD and PNC enables the AP to receive joint update messages much faster, significantly reducing the average AoC of the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
A secure and dynamic fusion addressing scheme for Internet of Vehicles scenarios Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study Range-free localization algorithm based on modified distance and improved black-winged kite algorithm Machine learning approaches for predicting link failures in production networks Exploring coverage and security challenges in wireless sensor networks: A survey
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1