Probabilistic localization of mobile ad hoc networks

  • Authors:
  • Gergely V. Zaruba;Sajal K. Das;Rui Huang

  • Affiliations:
  • The University of Texas at Arlington;The University of Texas at Arlington;The University of Texas at Arlington

  • Venue:
  • Probabilistic localization of mobile ad hoc networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The mobile ad hoc network localization problem deals with estimating the physical location of the nodes that do not have a direct way (e.g., GPS) to determine their own locations. Being an enabling technology that is considered essential to the success of the future implementation of ad hoc networks in the real world, localization is a fundamental problem that needs to be solved with the best possible accuracy and efficiency. For this research, we study the localization problem in its various incarnations such as localization through static beacons, mobile beacons, dynamically deployed beacons and link longevity estimation based on relative locations. We will show the fundamental difficulty of the localization problem using computational complexity theories. We will also propose a probabilistic framework that serves as an approximation framework for this difficult problem. We will demonstrate the effectiveness of this framework via analysis and simulation.