Retransmission and backoff strategies for wireless broadcasting

  • Authors:

  • Jesus Arango;Alon Efrat;Srinivasan Ramasubramanian;Stephen Pink;Marwan Krunz

  • Affiliations:

  • Cisco Systems, San Jose, CA, USA;Department of Computer Science, University of Arizona, 1040 E Fourth Street, Tucson, AZ 85721, USA;Department of Electrical and Computer Engineering, The University of Arizona, USA;Computing Department, Lancaster University, UK;Department of Electrical and Computer Engineering, The University of Arizona, USA

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article defines a wireless broadcasting algorithm as having two components: a retransmission strategy and a backoff strategy. Several strategies are proposed in this article and a comparative analysis is presented between existing algorithms and the strategies proposed herein. Simulation experiments and analysis are used to study or demonstrate the properties and performance of specific strategies or to obtain results of a more general nature. Strategies are also evaluated with respect to their impact on routing protocols that rely on broadcasting to perform path discovery. The purpose of this evaluation is to determine which strategies result in more stable routes. The second part of this article analyzes the problem of broadcasting when nodes are assumed to be arranged on a strip. Such arrangement occurs in vehicular broadcasting applications. We present the Strip Broadcasting retransmission strategy that can be modeled as a one-dimensional problem to significantly reduce the number of retransmissions. Analysis and simulation results are presented to analyze the properties of the algorithm.