Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments

Free registration required

Executive Summary

In this paper, the authors consider routing in multi-hop wireless mesh networks. They analyze three standardized and commonly deployed routing mechanisms that they term "Nodepair discovery" primitives. The authors show that use of these primitives inherently yields inferior route selection, irrespective of the protocol that implements them. This behavior originates due to overhead reduction actions that systematically yield insufficient distribution of routing information, effectively hiding available paths from nodes. To address this problem, they propose a set of "Deter and rescue" routing primitives that enable nodes to discover their hidden paths by exploiting already available historic routing information.

  • Format: PDF
  • Size: 270.5 KB