Computer Science – Networking and Internet Architecture
Scientific paper
2009-11-23
Computer Science
Networking and Internet Architecture
20 pages, 7 figures, 1 table, Accepted for publication in IEEE Transactions on Wireless Communications
Scientific paper
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new `contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best $Q \ge 1$ relays, and analyze and optimize it. Even for a large number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.
Mehta Neelesh B.
Shah Virag
Yim Raymond
No associations
LandOfFree
Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-173066