arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.2162cs.NI
收藏

室内到室外合作网络中伙伴选择的实验研究

Partner selection in indoor-to-outdoor cooperative networks: an experimental study

Paolo Castiglione, Stefano Savazzi, Monica Nicoli, Thomas Zemen

摘要:

在本文中,我们开发了一个合作伙伴选择协议,以提高在合作无线网络的网络寿命。案例研究是合作中继传输从固定的室内节点到一个共同的室外接入点。一个随机双变量模型的衰落参数的空间分布,管理的链路性能,即Rician K因子和路径损耗,提出和验证通过真实的信道测量。伙伴选择协议基于这些衰落参数的函数的实时估计,即,编码增益。为了降低链路质量评估的复杂性,提出了一种贝叶斯方法,该方法使用特定于站点的双变量模型作为编码增益估计的先验信息。该链路质量估计器允许网络寿命增益几乎就像所有K因子值都是已知的一样。此外,它适合IEEE 802.15.4兼容的网络,因为它有效地利用从接收机信号强度指示器获取的信息。大量的数值结果突出了复杂性,鲁棒性模型失配和网络寿命性能之间的权衡。例如,我们表明,不频繁更新的特定于站点的模型,通过K因子估计的一个子集的链接是足够的,至少增加一倍的网络寿命相对于现有的算法仅基于路径损耗信息。

英文摘要:

In this paper, we develop a partner selection protocol for enhancing the network lifetime in cooperative wireless networks. The case-study is the cooperative relayed transmission from fixed indoor nodes to a common outdoor access point. A stochastic bivariate model for the spatial distribution of the fading parameters that govern the link performance, namely the Rician K-factor and the path-loss, is proposed and validated by means of real channel measurements. The partner selection protocol is based on the real-time estimation of a function of these fading parameters, i.e., the coding gain. To reduce the complexity of the link quality assessment, a Bayesian approach is proposed that uses the site-specific bivariate model as a-priori information for the coding gain estimation. This link quality estimator allows network lifetime gains almost as if all K-factor values were known. Furthermore, it suits IEEE 802.15.4 compliant networks as it efficiently exploits the information acquired from the receiver signal strength indicator. Extensive numerical results highlight the trade-off between complexity, robustness to model mismatches and network lifetime performance. We show for instance that infrequent updates of the site-specific model through K-factor estimation over a subset of links are sufficient to at least double the network lifetime with respect to existing algorithms based on path loss information only.

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

↑