Home // ICWMC 2012, The Eighth International Conference on Wireless and Mobile Communications // View article

Scalable Democratic Routing in Wireless Mesh Networks

Authors:
Ronit Nossenson

Keywords: Wireless mesh network; scalable routing algorithms; connectivity models.

Abstract:
We propose a new method for scalable routing in large wireless mesh network: the democratic routing scheme. In this new schema, the nodes are divided into components according to their connectivity classes. As oppose to hierarchical routing, here, all nodes in the component are equal. The routing decisions are performed according to nodes connectivity structure together with a proper routing performance metric. Every node holds a view including its neighbor set and a dynamic connectivity model of the network. The node uses the view to understand which of its topology changes should be announced and to identify the set of nodes that should get this specific update. In this way, the routing overhead is significantly reduced, and, yet, the necessary routing information is available.

Pages: 173 to 177

Copyright: Copyright (c) IARIA, 2012

Publication date: June 24, 2012

Published in: conference

ISSN: 2308-4219

ISBN: 978-1-61208-203-5

Location: Venice, Italy

Dates: from June 24, 2012 to June 29, 2012