.png){kind=icon}
返回
Optimal Timer Based Selection Schemes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2010.06.090266.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Timer-based mechanisms are often used to help a given (sink) node select the best helper node from among many available nodes. In these, a node transmits a packet when its timer expires. The timer value is a monotone non-increasing function of its local suitability metric, which ensures that the best node is the first to transmit and is selected successfully if no other node's timer expires within a 'vulnerability' window after its timer expiry and so long as the sink can hear the available nodes. In this paper, we show that the optimal metric-to-timer mapping that (i) maximizes the probability of successful selection or (ii) minimizes the average selection time subject to a minimum constraint on the probability of success, maps the metric into a set of discrete timer values. We specify, in closed-form, the optimal scheme as a function of the maximum selection duration, the vulnerability window, and the number of nodes. An asymptotic characterization of the optimal scheme turns out to be elegant and insightful. For any probability distribution function of the metric, the optimal scheme is scalable, distributed, and performs much better than the popular inverse metric timer mapping. It even compares favorably with splitting-based selection, when the latter's feedback overhead is accounted for.
Keyword:
Selection
timer
cooperative communications
spatial diversity
multiuser diversity
multiple access
relays
VANET
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
The Impact of Channel Feedback on Opportunistic Relay Selection for Hybrid-ARQ in Wireless Networks无线网络中信道反馈对混合ARQ机会中继选择的影响OAAI
OAAI分享收藏Throughput maximization by utilizing multi-user diversity in slow-fading random access channels通过在慢衰落随机接入信道中利用多用户分集来最大化吞吐量
PREAI
分享收藏分享收藏
查看更多内容