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

一阶Marcum $Q$ -函数的逼近及其在网络连通性分析中的应用

An Approximation of the First Order Marcum $Q$-Function with Application to Network Connectivity Analysis

Mohammud Bocus, Carl Dettmann, Justin Coon

摘要:

提出了一阶Marcum $Q$ -函数的指数型逼近,该逼近对第一个参数的变化具有鲁棒性,并且可以容易地对第二个参数进行积分.这些特征在网络连接分析中特别有用。在Marcum $Q$ -函数的第一个参数很小的情况下,所提出的近似是精确的,在这种情况下,可以解析地得到最优参数。对于第一参数的较大值,解决了优化问题,并且可以使用回归分析准确地表示参数。数值结果表明,所提出的方法的结果非常接近实际的Marcum $Q$ -函数的第一个参数的小和中等值的近似。我们证明了近似的准确性,用它来分析随机ad hoc网络在莱斯衰落环境中运行的连接特性。

英文摘要:

An exponential-type approximation of the first order Marcum $Q$-function is presented, which is robust to changes in its first argument and can easily be integrated with respect to the second argument. Such characteristics are particularly useful in network connectivity analysis. The proposed approximation is exact in the limit of small first argument of the Marcum $Q$-function, in which case the optimal parameters can be obtained analytically. For larger values of the first argument, an optimization problem is solved, and the parameters can be accurately represented using regression analysis. Numerical results indicate that the proposed methods result in approximations very close to the actual Marcum $Q$-function for small and moderate values of the first argument. We demonstrate the accuracy of the approximation by using it to analyze the connectivity properties of random ad hoc networks operating in a Rician fading environment.

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

↑