Shah, Virag and Mehta, Neelesh B and Yim, Raymond (2009) Analysis,Insights and Generalization of a Fast Decentralized Relay Selection Mechanism. In: IEEE International Conference on Communications (ICC 2009), JUN 14-18, 2009, Dresden, pp. 3349-3354.
fast.pdf - Published Version
Restricted to Registered users only
Download (183Kb) | Request a copy
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q >= 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||08 Sep 2010 07:22|
|Last Modified:||19 Sep 2010 06:15|
Actions (login required)