Wireless mesh network

About: Wireless mesh network is a research topic. Over the lifetime, 13600 publications have been published within this topic receiving 221035 citations. The topic is also known as: WMN.

Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?

Abstract: There exist two fundamental approaches to multicast routing: shortest path trees (SPTs) and minimum cost trees (MCTs). The SPT algorithms minimize the distance (or cost) from the sender to each receiver, whereas the MCT algorithms minimize the overall cost of the multicast tree. Due to the very large scale and unknown topology of the Internet, computing MCTs for multicast routing in the Internet is a very complex problem. As a result, the SPT approach is the more commonly used method for multicast routing in the Internet, because it is easy to implement and gives minimum delay from the sender to each receiver, a property favored by many real-life applications. Unlike the Internet, a wireless mesh network (WMN) has a much smaller size, and its topology can be made known to all nodes in the network. This makes the MCT approach an equally viable candidate for multicast routing in WMNs. However, it is not clear how the two types of trees compare when used in WMNs. In this article we present a simulation-based performance comparison of SPTs and MCTs in WMNs, using performance metrics, such as packet delivery ratio, end-to-end delay, and traffic impacts on unicast flows in the same network.

Long distance wireless mesh network planning: problem formulation and solution

Abstract: Several research efforts as well as deployments have chosen IEEE802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the important issue of planning such networks to the minimize system cost. This is a non-trivial task since it involves several sets of variables: the network topology, tower heights, antenna types to be used and the irorientations, and radio transmit powers. The task is further complicated due to the presence of network performance constraints, and the inter-dependence among the variables. Our first contribution in this paper is the formulation of this problem in terms of the variables, constraints and the optimization criterion. Our second contribution is in identifying the dependencies among the variables and breaking-down the problem into four tractable sub-parts. In this process, we extensively use domain knowledge to strike a balance between tractability and practicality. We have evaluated the proposed algorithms using random input sets as well as real-life instances with success. We have been able to show detailed planning of network topology, required tower heights, antenna types, and transmit powers for the Ashwini project, a long distance WiFi network under deployment in Andhra Pradesh, India, In this case, we are able to achieve within 2% additional cost of a lower bound estimate.

Gateway Placement for Throughput Optimization in Wireless Mesh Networks

Abstract: In this paper, we address the problem of gateway placement for throughput optimization in multi-hop wireless mesh networks Assume that each mesh node in the mesh network has a traffic demand Given the number of gateways need to be deployed (denoted by k) and the interference model in the network, we study where to place exactly k gateways in the mesh network such that the total throughput is maximized while it also ensures a certain fairness among all mesh nodes We propose a novel grid-based gateway deployment method using a cross-layer throughput optimization Our proposed method can also be extended to work with multi-channel and multi-radio mesh networks Simulation result demonstrates that our method can effectively exploit the resources available and perform much better than random and fixed deployment methods

Medium access control in a network of ad hoc mobile nodes with heterogeneous power capabilities

Abstract: MAC layer protocols for wireless ad hoc networks typically assume that the network is homogeneous with respect to the transmit power capability of individual nodes in the network. The IEEE 802.11 MAC protocol has been popular for use in ad hoc networks. We investigate the performance of this protocol when it is used in a network with nodes that transmit at various power levels. We show that overall throughput is lower than the throughput of a network in which all nodes transmit at identical power levels. In addition, low power nodes have a disadvantage in accessing the medium due to higher levels of interference from the high power nodes. We consider propagating the control messages generated by a node wishing to initiate communication to distant nodes so that they may forbear transmissions for some time, thereby allowing clear access to the initiating node. We find that the overhead incurred due to the additional message transmissions outweighs the potential gain achieved by propagating these messages. This indicates that the signalling mechanism used in the IEEE 802.11 standard or the variants thereof are not sufficient to alleviate the loss in throughput and the lack of fairness engendered by networks that are heterogeneous with regard to the transmit power capabilities of individual nodes.

Configuration of failure and acquire timeouts to facilitate recovery from failures in hierarchical mesh networks

Abstract: Methods, apparatuses and systems directed to providing an efficient failure recovery mechanism in hierarchical wireless mesh networks. In one implementation, the present invention mitigates the effect of synchronization loss between a parent and child node on the hierarchical wireless mesh network. In one implementation, the present invention employs a configuration scheme whereby the parent node failure timeouts are greater than the time to acquire a parent node to mitigate the effect of synchronization loss on downstream nodes in the hierarchical mesh network.