Optimal design of timer-based, distributed selection with unknown number of nodes

Talak, Rajat and Mehta, Neelesh B (2013) Optimal design of timer-based, distributed selection with unknown number of nodes. In: 2013 National Conference on Communications (NCC), FEB 15-17, 2013, New Delhi, INDIA.

PDF Nati_Conf_Comm_1_2013.pdf - Published Version Restricted to Registered users only Download (155kB) | Request a copy

Abstract

The timer-based selection scheme is a popular, simple, and distributed scheme that is used to select the best node from a set of available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal timer mapping that maximizes the average success probability for the practical scenario in which the number of nodes in the system is unknown but only its probability distribution is known. We show that it has a special discrete structure, and present a recursive characterization to determine it. We benchmark its performance with ad hoc approaches proposed in the literature, and show that it delivers significant gains. New insights about the optimality of some ad hoc approaches are also developed.

Item Type:	Conference Paper
Series.:	National Conference on Communications NCC
Publisher:	IEEE
Additional Information:	Copyright of this article belongs to IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	07 Aug 2013 06:19
Last Modified:	07 Aug 2013 06:19
URI:	http://eprints.iisc.ac.in/id/eprint/46932

Actions (login required)

View Item