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.

Quality of service challenges for wireless mobile ad hoc networks

Abstract: Wireless mobile ad hoc networks consist of mobile nodes interconnected by wireless multi-hop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. The topology of such networks changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. Supporting appropriate quality of service for mobile ad hoc networks is a complex and difficult issue because of the dynamic nature of the network topology and generally imprecise network state information, and has become an intensely active area of research in the last few years. This paper1 presents the basic concepts of quality of service support in ad hoc networks for unicast communication, reviews the major areas of current research and results, and addresses some new issues. The principal focus is on routing and security issues associated with quality of service support. The paper concludes with some observations on the open areas for further investigation. Copyright © 2004 John Wiley & Sons, Ltd.

Interference-aware Multipath Selection for Reliable Routing in Wireless Mesh Networks

Abstract: This paper investigates the problem of selecting multiple routing paths to provide better reliability in multi-radio, multi-channel mesh networks with stationary nodes. Providing reliability is difficult in wireless networks because of unreliable transmissions. Previous work has investigated the use of additional data redundancy to improve the packet delivery rate, but requires node-disjoint paths to be used. In this paper we investigate multipath routing with packet duplication and non-disjoint paths for achieving better reliability and low delay. We propose a path weight function based on the ETT metric and interference minimisation. Our solution provides higher packet delivery ratio and lower end-to-end delay when compared to the single path WCETT metric, a maximally disjoint path selection metric, and the CAM metric.

Design of WDM mesh networks with sparse grooming capability

Abstract: In a WDM optical network, the bandwidth requirement of a customer's connection can vary over a wide range, and many of these connections could have a capacity that is much lower than the capacity of a wavelength channel. Efficiently grooming low-speed connections onto high-capacity wavelength channels can significantly improve the bandwidth utilization and minimize the network cost. Our research shows that it is not necessary to have traffic-grooming capability at every network node. We call a network which has only a few grooming nodes to be a sparse-grooming network. Through proper network design and traffic engineering, it is possible for a sparse-grooming network to achieve similar network performance as a network which has grooming capability at every node. We investigate the problem of designing such a sparse-grooming WDM mesh network. The problem is mathematically formulated and several design schemes are proposed. Illustrative numerical results from the mathematical formulation as well as heuristics show that, by properly choosing the grooming nodes, a network with sparse-grooming capability can achieve good network performance and the network cost can be significantly reduced.

INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding

Abstract: Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called network coding. In a wireless mesh network using network coding, selfish nodes may deviate from the protocol when they are supposed to forward packets. This fundamental problem of packet forwarding incentives is closely related to the incentive compatible routing problem in wireless mesh networks using network coding, and to the incentive compatible packet forwarding problem in conventional wireless networks, but different from both of them. In this paper, we propose INPAC, the first incentive scheme for this fundamental problem, which uses a combination of game theoretic and cryptographic techniques to solve it. We formally prove that, if INPAC is used, then following the protocol faithfully is a subgame perfect equilibrium. To make INPAC more practical, we also provide an extension that achieves two improvements: (a) an online authority is no longer needed; (b) the computation and communication overheads are reduced. We have implemented and evaluated INPAC on the Orbit Lab testbed. Our evaluation results verify the incentive compatibility of INPAC and demonstrate that it is efficient.