https://hal-imt.archives-ouvertes.fr/hal-01144304Sinha, AbhishekAbhishekSinhaChattopadhyay, ArpanArpanChattopadhyayECE - Department of Electrical Communication Engineering [Bangalore] - Indian Institute of ScienceNaveen, K.P.K.P.NaveenECE - Department of Electrical Communication Engineering [Bangalore] - Indian Institute of ScienceMondal, PrasenjitPrasenjitMondalCisco Systems - CISCO Systems, IncCoupechoux, MarceauMarceauCoupechouxRMS - Réseaux, Mobilité et Services - LTCI - Laboratoire Traitement et Communication de l'Information - IMT - Institut Mines-Télécom [Paris] - Télécom ParisINFRES - Département Informatique et Réseaux - Télécom ParisTechKumar, AnuragAnuragKumarECE - Department of Electrical Communication Engineering [Bangalore] - Indian Institute of ScienceOptimal Sequential Wireless Relay Placement on a Random Lattice PathHAL CCSD2014[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Télécom Paristech, Admin2019-10-14 11:25:282021-10-19 11:15:572019-10-14 11:29:13enJournal articleshttps://hal-imt.archives-ouvertes.fr/hal-01144304/document10.1016/j.adhoc.2014.04.005application/pdf1Our work is motivated by impromptu (or \as-you-go") deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control centre), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a nite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen.