Computer Science – Networking and Internet Architecture
Scientific paper
2009-09-07
Computer Science
Networking and Internet Architecture
21 pages, 6 figures, 1 table, submitted to IEEE Transactions on Communications, uses stackrel.sty
Scientific paper
Timer-based mechanisms are often used to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a monotone non-increasing function of its local suitability metric. The best node 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 success 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.
Mehta Neelesh B.
Shah Virag
Yim Raymond
No associations
LandOfFree
Optimal Timer Based Selection Schemes 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 Optimal Timer Based Selection Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Timer Based Selection Schemes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-296074