CaltechAUTHORS
  A Caltech Library Service

A Practical Scheme for Wireless Network Operation

Gowaikar, Radhika and Dana, Amir F. and Hassibi, Babak and Effros, Michelle (2007) A Practical Scheme for Wireless Network Operation. IEEE Transactions on Communications, 55 (3). pp. 463-476. ISSN 0090-6778. doi:10.1109/TCOMM.2007.892448. https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07

[img]
Preview
PDF
See Usage Policy.

664kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07

Abstract

In many problems in wireline networks, it is known that achieving capacity on each link or subnetwork is optimal for the entire network operation. In this paper, we present examples of wireless networks in which decoding and achieving capacity on certain links or subnetworks gives us lower rates than other simple schemes, like forwarding. This implies that the separation of channel and network coding that holds for many classes of wireline networks does not, in general, hold for wireless networks. Next, we consider Gaussian and erasure wireless networks where nodes are permitted only two possible operations: nodes can either decode what they receive (and then re-encode and transmit the message) or simply forward it. We present a simple greedy algorithm that returns the optimal scheme from the exponential-sized set of possible schemes. This algorithm will go over each node at most once to determine its operation, and hence, is very efficient. We also present a decentralized algorithm whose performance can approach the optimum arbitrarily closely in an iterative fashion.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TCOMM.2007.892448DOIUNSPECIFIED
Additional Information:© Copyright 2007 IEEE. Reprinted with permission. Paper approved by Y. Fang, the Editor for Wireless Networks of the IEEE Communications Society. Manuscript received July 12, 2004; revised December 12, 2005 and July 10, 2006. [Posted online: 2007-03-19] This work was supported in part by the National Science Foundation under Grant CCR-0133818, in part by the Office of Naval Research under Grant N00014-02-1-0578, and in part by Caltech’s Lee Center for Advanced Networking. This paper was presented in part at the 41st Annual Allerton Conference on Communication, Control, and Computing, 2003, and in part at the Asilomar Conference, 2003.
Subject Keywords:Forward/decode scheme, separation principle, wireless networks
Issue or Number:3
DOI:10.1109/TCOMM.2007.892448
Record Number:CaltechAUTHORS:GOWieeetc07
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7697
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:22 Mar 2007
Last Modified:08 Nov 2021 20:44

Repository Staff Only: item control page