Greedy Least Interference Forwarding Algorithm Using Directional Antennas for Cellular Ad-Hoc Networks

Free registration required

Executive Summary

Cellular ad-hoc networks facilitate rapid deployment of familiar communication technology in hostile battlefield environments. They are comprised of randomly organized portable base stations that share the same frequency spectrum and cooperatively relay each other's traffic to centralized base stations. Such portable base stations have limited battery power and processing capabilities. Owing to its simplicity and minimal requirements, Geographic Greedy Forwarding (GGF) algorithms are generally well suited for cellular ad-hoc networks. But GGF algorithms are not interference aware. Interference between base stations is a major factor limiting the achievable throughput capacity in such networks.

  • Format: PDF
  • Size: 666.4 KB