Low Bound of Energy-Latency Trade-off of Opportunistic Routing in Multi-hop Networks

Ruifeng Zhang 1 Jean-Marie Gorce 1
1 SWING - Smart Wireless Networking
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes to cooperate, thus using spatial diversity to increase the capacity of the system. However, this approach introduces an overhead in terms of information exchange, increasing the complexity of the receivers. A simpler way of exploiting spatial diversity is referred to as opportunistic routing. In this scheme, a cluster of nodes still serves as relay candidates but only a single node in the cluster forwards the packet. This paper proposes a thorough analysis of opportunistic routing efficiency under different realistic radio channel conditions. The study aims at finding the best trade-off between two objectives: energy and latency minimizations, under 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 routing compared with classical multihop routing.
Type de document :
Communication dans un congrès
COST 2100 6th management committee meeting, Oct 2008, Lille, France. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00412558
Contributeur : Jean-Marie Gorce <>
Soumis le : mercredi 2 septembre 2009 - 09:56:41
Dernière modification le : vendredi 22 décembre 2017 - 11:22:11

Identifiants

  • HAL Id : inria-00412558, version 1

Collections

Citation

Ruifeng Zhang, Jean-Marie Gorce. Low Bound of Energy-Latency Trade-off of Opportunistic Routing in Multi-hop Networks. COST 2100 6th management committee meeting, Oct 2008, Lille, France. 2009. 〈inria-00412558〉

Partager

Métriques

Consultations de la notice

285