Pre-reply probe and route request tail: approaches for calculation of intra-flow contention in multihop wireless networks

  • Authors:
  • Kimaya Sanzgiri;Ian D. Chakeres;Elizabeth M. Belding-Royer

  • Affiliations:
  • Department of Computer Science, University of California, Santa Barbara, CA;Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA

  • Venue:
  • Mobile Networks and Applications - Special issue: Recent advances in wireless networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several applications have been envisioned for multihop wireless networks that require different qualities of service from the network. In order to support such applications, the network must control the admission of flows. To make an admission decision for a new flow, the expected bandwidth consumption of the flow must be correctly determined. Due to the shared nature of the wireless medium, nodes along a multihop path contend among themselves for access to the medium. This leads to intra-flow contention; contention between packets of the same flow forwarded by different hops along a multihop path, resulting in an increase in the actual bandwidth consumption of the flow to a multiple of its single hop bandwidth requirement. Determining the amount of intra-flow contention is non-trivial since interfering nodes may not be able to communicate directly if they are outside each other's transmission range. In this paper we examine methods to determine the extent of intra-flow contention along multihop paths in both reactive and proactive routing environments. The highlight of the solutions is that carrier-sensing data is used to deduce information about carrier-sensing neighbors, and no high power transmissions are necessary. Analytical and simulation results show that our methods estimate intra-flow contention with low error, while significantly reducing overhead, energy consumption and latency as compared to previous approaches.