On Capacity Achieving Property of Rotational Coding for Acyclic Deterministic Wireless Network

Abstract : It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and forwarding overhead of random coding scheme prohibits its application in practice. Recently, a practical low complexity alternative, rotational coding scheme, was proposed in [1] where it was proved that the rotational coding can achieve the capacity of the layered deterministic wireless networks. In this paper, we extend the result and prove that the rotational coding is in fact capacity achieving for a general acyclic network. Our result adds to the practical property of rotational coding scheme and makes it desirable for communication networks with arbitrary topology as long as there is no directional cycle in the network.
Type de document :
Communication dans un congrès
WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.21-25, 2010
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00498362
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 7 juillet 2010 - 12:15:42
Dernière modification le : lundi 20 novembre 2017 - 14:04:03
Document(s) archivé(s) le : vendredi 8 octobre 2010 - 09:26:33

Fichier

p21-khojastepour.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00498362, version 1

Collections

Citation

Mohammad A. Khojastepour, Alireza Keshavarz-Haddad, Alireza Salehi Golsefidy. On Capacity Achieving Property of Rotational Coding for Acyclic Deterministic Wireless Network. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.21-25, 2010. 〈inria-00498362〉

Partager

Métriques

Consultations de la notice

490

Téléchargements de fichiers

609