Node Scheduling for AF-Based Over-the-Air Computation
Node Scheduling for AF-Based Over-the-Air Computation
复制标题
DOI：
10.1109/lwc.2022.3189010
复制
发表时间：
2022-09-01
影响因子：
6.3
通讯作者：
Obana, Sadao
中科院分区：
文献类型：
--
作者：
Tang, Suhua;Yomo, Hiroyuki;Obana, Sadao
无线计算是一种很有前途的技术，可以有效地聚合传感器网络中的数据。该方法要求所有节点的信号到达接收器时信号幅度一致，这面临着可靠性问题，特别是在信道衰落时。为了解决这个问题，在这封信中，我们提出了一种基于放大转发的中继，即带有节点调度的相干中继（CohR-NS），其中中继节点用于帮助转发多个节点的信号。中继传输功率（TP）随着使用中继的节点数量的增加而增加，这是一个瓶颈。我们研究中继TP如何随着中继位置的变化而变化，并在中继TP的约束下，研究（i）当不能同时支持所有需要中继的节点时如何选择节点使用中继，（ii）当中继TP有剩余时如何选择更多节点使用中继以减少节点TP。我们将其表述为 ILP（整数线性规划）问题，提出一种有效的启发式方法，并通过仿真评估确认其有效性。
Over-the-air computation is a promising technique for efficiently aggregating data in sensor networks. This method requires that signals from all nodes arrive at the sink aligned in signal magnitude, which faces the reliability issue, especially in times of channel fading. To solve this problem, in this letter, we propose an amplify-and-forward based relay, Coherent Relay with Node Scheduling (CohR-NS), where a relay node is used to help forward signals of multiple nodes. Relay transmission power (TP) increases with the number of nodes using the relay, which is a bottleneck. We investigate how relay TP changes with relay position, and under the constraint of relay TP, study (i) how to select nodes to use relay when not all nodes requiring a relay can be supported simultaneously, (ii) how to select more nodes to use relay so as to reduce node TP, when there is a surplus in relay TP. We formulate this as an ILP (integer linear programming) problem, propose an efficient heuristic method, and confirm its effectiveness by simulation evaluation.