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

BLMA:一种盲匹配算法及其在认知无线电网络中的应用

BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks

Doha Hamza, Jeff S. Shamma

摘要:

我们考虑一个双边匹配问题与成对稳定的定义概念。本文提出了一种分布式盲匹配算法(BLMA)来解决这一问题。我们证明BLMA产生的解决方案将收敛到一个$ε$ -成对稳定的结果,概率为1。然后,我们考虑认知无线电网络中的匹配问题。次要用户(SU)被允许接入属于主要用户(PU)的频谱的时间,前提是它们中继主要消息。我们提出了一个实现的BLMA产生一个$ε$ -成对稳定的解决方案,假设准凸和准凹效用。在更一般的效用形式的情况下,我们展示了另一种BLMA实现,以提供稳定的解决方案。此外,我们提出了协商机制,使算法偏向市场的一方。我们使用此机制来保护PU对频谱的专有权。在BLMA的所有这些实现中,我们在网络中进行有限的信息交换,以便代理只能计算自己的效用,但没有关于网络中任何其他用户的效用的信息。

英文摘要:

We consider a two-sided matching problem with a defined notion of pairwise stability. We propose a distributed blind matching algorithm (BLMA) to solve the problem. We prove the solution produced by BLMA will converge to an $ε$-pairwise stable outcome with probability one. We then consider a matching problem in cognitive radio networks. Secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. We propose a realization of the BLMA to produce an $ε$-pairwise stable solution assuming quasi-convex and quasi-concave utilities. In the case of more general utility forms, we show another BLMA realization to provide a stable solution. Furthermore, we propose negotiation mechanism to bias the algorithm towards one side of the market. We use this mechanism to protect the exclusive rights of the PUs to the spectrum. In all such implementations of the BLMA, we impose a limited information exchange in the network so that agents can only calculate their own utilities, but no information is available about the utilities of any other users in the network.

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

↑