Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 1, 2007 | public
Journal Article Open

A Practical Scheme for Wireless Network Operation

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.

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.

Files

GOWieeetc07.pdf
Files (664.9 kB)
Name Size Download all
md5:a8d1b870a8494906e2aec416140e8687
664.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
March 5, 2024