arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.0053cs.NI
收藏

动态无线网络信噪比监测的缩放定律实现

Achieving the Scaling Law of SNR-Monitoring in Dynamic Wireless Networks

Hongyi Yao, Xiaohang Li, Soung Chang Liew

摘要:

无线通信信道的特性可能由于衰落、环境变化和移动无线设备的移动而随时间变化。因此,跟踪和估计无线信道的信道增益是许多无线通信系统的基本重要元素。特别地,许多无线网络中的接收机需要借助于训练序列来估计信道增益。研究了无线网络中信道增益监测开销与网络规模的缩放定律。我们首先调查的情况下,接收器需要跟踪相对于多个发射器的信道增益。具体而言,假设有n个发射机,并且在当前一轮信道增益估计中,不超过k个信道自上一轮以来遭受显著变化。我们证明了“Θ(k \log((n+1)/k))时隙”是赶上k个变化信道所需的最小时隙数。同时,我们提出了一种新的信道增益监测方案ADMOT,以达到开销下限。ADMOT利用无线通信中的信号处理和干扰处理中的压缩感测的最新进展,以使接收机能够在O(k \log((n+1)/k))个时隙内以可靠且计算高效的方式估计所有n个信道。据我们所知,所有先前的信道跟踪方案都需要Θ(n)个时隙,而不管k。注意,基于上述针对单个接收器场景的结果,实现了其中存在多个发射器、中继节点和接收器的一般设置的缩放定律。

英文摘要:

The characteristics of wireless communication channels may vary with time due to fading, environmental changes and movement of mobile wireless devices. Tracking and estimating channel gains of wireless channels is therefore a fundamentally important element of many wireless communication systems. In particular, the receivers in many wireless networks need to estimate the channel gains by means of a training sequence. This paper studies the scaling law (on the network size) of the overhead for channel gain monitoring in wireless network. We first investigate the scenario in which a receiver needs to track the channel gains with respect to multiple transmitters. To be concrete, suppose that there are n transmitters, and that in the current round of channel-gain estimation, no more than k channels suffer significant variations since the last round. We proves that "Θ(k\log((n+1)/k)) time slots" is the minimum number of time slots needed to catch up with the k varied channels. At the same time, we propose a novel channel-gain monitoring scheme named ADMOT to achieve the overhead lower-bound. ADMOT leverages recent advances in compressive sensing in signal processing and interference processing in wireless communication, to enable the receiver to estimate all n channels in a reliable and computationally efficient manner within O(k\log((n+1)/k)) time slots. To our best knowledge, all previous channel-tracking schemes require Θ(n) time slots regardless of k. Note that based on above results for single receiver scenario, the scaling law of general setting is achieved in which there are multiple transmitters, relay nodes and receivers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑