Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs

Abstract

Wireless local area network (WLAN) systems are widely implemented today to provide hot spot coverage. Operated typically in an infrastructure mode, each WLAN is managed by an access point (AP). Wireless mesh networks are employed for the purpose of extending the wireless coverage scope of the network. In this paper, we present a scalable and fully distributed algorithm that serves to autonomously elect certain Access Points as Backbone nodes to construct a connected mesh backbone network.We assume that multiple communications bands are used and that some nodal platforms are outfitted with multiple radio modules. The new scheme presented here is thus identified as a Multi-radio Topology Synthesis Algorithm (MR-TSA). Higher capability nodes are assumed to employ two radio modules and to engage in a collaborative manner in the construction of a mesh backbone network. Less capable nodes employ only a single radio module. We prove mathematically that the underlying topology synthesis algorithm induces control overhead and exhibits temporal convergence features that are independent of the number of network nodes. We also mathematically characterize the size of the constructed backbone network, deriving probabilistic bounds on the degree of dynamically elected backbone nodes. Extensive performance evaluations confirm the scalability and delaythroughput efficiency of the underlying multi-radio hierarchical operation. We also provide comparisons with other backbone based (and clustering oriented) operations.

An Improvement in Stability of MANET using Flow Admission Control Algorithm

“…By transmitting routing table updates more frequently such as when any information in the table changes, the algorithm converges more quickly to the correct path (for example, when a link comes up or goes down), but the overhead in CPU time and network bandwidth for transmitting routing updates increases. Examples of distance vector routing protocols include the routing protocol used in the DARPA Packet Radio Network [3]; the original routing protocol for the ARPANET [6]; RIP (used in parts of the Internet [l], in Novell's IPX [13], and in Xerox's XNS [14]; and RTMP (used in AppleTalk) [14].…”

Exploiting use of a new performance metric for construction of robust and efficient wireless backbone network

“…Clusterhead selection criteria fall into three categories: lowest (or highest) ID among all unassigned nodes [24], maximum node degree [23], or some generic weight [18]. Ju et al [15] introduced heuristic approaches to construct the backbone network.…”

“…In this section, we study the backbone performance by comparing our centralized backbone construction algorithm RCRG and distributed backbone construction algorithm DCRG with two other backbone construction algorithms, (MR-)TSA [15] and k-Coverage [17]. (MR-)TSA is a backbone topology synthesis algorithm based on abstract weight to construct and maintain wireless backbone while k-Coverage is an algorithm to construct a wireless backbone which is k-connected and k-dominating.…”

HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields

“…The authors of [16] propose a single-hop mesh network where mobile clients connect directly to the gateways. Compared to our approach, where mobile users also relay packets on behalf of their neighbors, this requires a much higher mesh node density for a comparable wireless coverage.…”