Conference Paper

Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks.

Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL
DOI: 10.1109/INFCOM.2009.5061905 Conference: INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil
Source: DBLP

ABSTRACT This paper studies how to select a path with the minimum cost in terms of expected end-to-end delay (EED) in a multi-radio wireless mesh network. Different from the previous efforts, the new EED metric takes the queuing delay into account, since the end-to-end delay consists of not only the transmission delay over the wireless links but also the queuing delay in the buffer. In addition to minimizing the end-to-end delay, the EED metric implies the concept of load balancing. We develop EED- based routing protocols for both single-channel and multi-channel wireless mesh networks. In particular for the multi-radio multichannel case, we develop a generic iterative approach to calculate a multi-radio achievable bandwidth (MRAB) for a path, taking the impacts of inter/intra-flow interference and space/channel diversity into account. The MRAB is then integrated with EED to form the metric of weighted end-to-end delay (WEED). As a byproduct of MRAB, a channel diversity coefficient can be defined to quantitatively represent the channel diversity along a given path. Both numerical analysis and simulation studies are presented to validate the performance of the routing protocol based on the EED/WEED metric, with comparison to some well- known routing metrics.

0 Bookmarks
 · 
106 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can playan important role in achieving these goals. In thispaper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN. We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.
    Journal of Communications and Networks 01/2012; 14(6):640-652. · 0.75 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Network coding plays an important role in improving capacity in wireless networks. With network coding, a node can transmit to several receivers concurrently. Never-theless, it is not clear how much bandwidth a path can obtain after applying network coding. In this paper, we analyze the maximum bandwidth available on a multi-hop path. We develop a polynomial-time method to estimate the path bandwidth. Our work faciliates routing protocols to identify bandwidth-guaranteed paths and support Quality-of-Service in wireless networks.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Real-time routing is a basic element of closed-loop, real-time sensing and control, but it is very challenging due to dynamic, uncertain link/path delay. A basis of real-time routing is determining probabilistically guaranteed path delays, but this problem is NP-hard and it may well have to be solved by resource-constrained devices in a distributed manner; the highly varying nature of link/path delay makes it necessary to adapt to in-situ delay conditions in real-time routing, but it has been observed that delay-based routing can lead to instability and low data delivery performance in general. To address these challenges, we propose the minimum-delay (MD) algorithm that computes probabilistic path delay bounds in pseudo-polynomial time via dynamic programming, and the algorithm is amenable to lightweight, distributed implementation. For enabling adaptivity while addressing instability in real-time routing, we propose a multi-timescale-adaptation (MTA) framework that ensures long-term optimality while addressing short-term dynamics at the same time. We evaluate the performance of MD-and MTA-based real-time routing through a testbed of 130 TelosB motes, and we find it outperform existing real-time routing protocols by a significant margin, for instance, improving the packet delivery ratio and deadline catching ratio by a factor up to 6.04 and 6.67 respectively.

Full-text (2 Sources)

Download
4 Downloads
Available from
Sep 2, 2014