Lower bound of energy-latency tradeoff of opportunistic routing in multihop networks

  • Authors:
  • Ruifeng Zhang;Jean-Marie Gorce;Olivier Berder;Olivier Sentieys

  • Affiliations:
  • Université de Rennes 1, IRISA, INRIA, Lannion, France and School of Communication and Information Engineering, Shanghai University, Shanghai, China;Université de Lyon, INRIA, INSA-Lyon, CITI, France;Université de Rennes 1, IRISA, INRIA, Lannion, France;Université de Rennes 1, IRISA, INRIA, Lannion, France

  • Venue:
  • EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Opportunistic networking aims at exploiting sporadic radio links to improve the connectivity of multihop networks and to foster data transmissions. The broadcast nature of wireless channels is an important feature that can be exploited to improve transmissions by using several potential receivers. Opportunistic relaying is thus the first brick for opportunistic networking. However, the advantage of opportunistic relaying may be degraded due to energy increase related to having multiple active receivers. This paper proposes a thorough analysis of opportunistic relaying efficiency under different realistic radio channel conditions. The study is intended to find the best tradeoff between two objectives: energy and latency minimizations, with a hard reliability constraint. We derive an optimal bound, namely, the Pareto front of the related optimization problem, which offers a good insight into the benefits of opportunistic routings compared with classicalmultihop routing schemes. Meanwhile, the lower bound provides a framework to optimize the parameters at the physical layer, MAC layer, and routing layer from the viewpoint of cross layer during the design or planning phase of a network.