A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Measurement driven deployment of a two-tier urban mesh access network
Proceedings of the 4th international conference on Mobile systems, applications and services
HOVER: hybrid on-demand distance vector routing for wireless mesh networks
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Routing stability in static wireless mesh networks
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
The IEEE 802.11s Extended Service Set Mesh Networking Standard
IEEE Communications Magazine
TFA: a large scale urban mesh network for social and network research
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
A process algebra for wireless mesh networks
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Automated analysis of AODV using UPPAAL
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A rigorous analysis of AODV and its variants
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Hi-index | 0.00 |
In this paper, we consider routing in multi-hop wireless mesh networks. We analyze three standardized and commonly deployed routing mechanisms that we term "node-pair discovery" primitives. We 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, we propose a set of "deter and rescue" routing primitives that enable nodes to discover their hidden paths by exploiting already available historic routing information. We use extensive measurements on a large operational wireless mesh network to show that with node-pair discovery primitives, inferior route selections occur regularly and cause long-term throughput degradations for network users. In contrast, the deter and rescue primitives largely identify and prevent selection of inferior paths. Moreover, even when inferior paths are selected, the new primitives reduce their duration by several orders of magnitude, often to sub-second time scales.