Mobility

Comparison of Spatial Hashing Algorithms for Mobile Wireless Network Simulations

Free registration required

Executive Summary

Mobile wireless network simulations require efficient methods for determining which nodes are reachable by other nodes. This operation must be performed repeatedly as wireless nodes move. Alternatively, methods are needed to predict when a node will come within, or go beyond, the range of another node. Such propagation calculations can dominate the simulation of large networks and ultimately limit a model's scalability. Several spatial hashing algorithms have been proposed to improve scalability. The algorithms rapidly locate only nodes within a given range from another node, without involving calculations on all the other nodes. A set of prior and new algorithms are described and surveyed in this paper.

  • Format: PDF
  • Size: 2150.4 KB