Skip to main content
SpringerLink
Log in

Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints

  • Conference paper
  • First Online:
Information Processing in Sensor Networks (IPSN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2634))

Included in the following conference series:

Abstract

We consider the problem of communication in a general multi-terminal network where each node of the network is a potential sender or receiver (or both) but it cannot do both functions together. The motivation for this assumption comes from the fact that current radios in sensor nodes operate in TDD mode when the transmitting and receiving frequencies are the same. We label such a radio as a cheap radio and the corresponding node of the network as a cheap node.

We derive bounds on the achievable rates in a general multi-terminal network with finite number of states. The derived bounds coincide with the known cut-set bound [11] of network information theory if the network has just one state. Also, the bounds trivially hold in the network with cheap nodes because such a network operates in a finite number of states when the number of nodes is finite. As an example, application of these bounds in the multi-hop network and the relay channel with cheap nodes is presented. In both of these cases, the bounds are tight enough to provide converses for the coding theorems [16], and thus their respective capacities are derived.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ahlswede: Multi-way communication channels. in Proc. 2nd Int. Symp. information Theory, Tsahkadsor, Armenian S.S.R., pp. 23–52,, (1971)

    Google Scholar 

  2. R. Ahlswede, N. Cai, R.W. Yeung: Network Information Flow Theory, In: Proc. IEEE ISIT 1998, pp. 186, (1998)

    Google Scholar 

  3. R. Ahlswede, N. Cai, S.-Y. R. Li, R.W. Yeung: Network Information Flow, IEEE Trans. on Information Theory, Vol. 46, No. 4, pp. 1204–1216, (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. S.P. Borade: Network Information Flow: Limits and Acheivability, In: Proc. IEEE ISIT 2002, pp. 139, (2002)

    Google Scholar 

  5. G. Caire, S. Shamai: On the Achievable Throughput in Multiple Antenna Gaussian Broadcast Channel, submitted to IEEE Transactions on Information Theory, July (2001)

    Google Scholar 

  6. A. B. Carleial: A case where interference does not reduce capacity, IEEE Trans. Inform. Theory, vol. IT-21, pp. 569–570, Sept. (1975)

    Google Scholar 

  7. A.B. Carleial: Interference Channels, IEEE Trans. on Information Theory, Vol. IT-24, No. 1, January, pp. 60–70 (1978)

    Article  MathSciNet  Google Scholar 

  8. M. H. M. Costa: Writing on dirty paper, IEEE Transactions on Information Theory, pp. 439–441, May (1983)

    Google Scholar 

  9. T. M. Cover: Broadcast channels, IEEE Trans. Inform. Theory, vol. IT-18, pp. 2–14, Jan. (1972)

    Google Scholar 

  10. Thomas M Cover, Abbas S. El Gammal: Capacity Thorems for the Relay Channel. IEEE Transactions on Information Theory, Vol-25, No. 5, pp. 572–584, September. (1979)

    Article  MATH  Google Scholar 

  11. Thomas M Cover, Joy A Thomas: Elements of Information Theory. John Wiley and Sons, Inc., New York (1991)

    MATH  Google Scholar 

  12. Michael Gastpar, Martin Vetterli: On the Capacity of Wireless Networks: The Relay Case. (2002)

    Google Scholar 

  13. A. J. Goldsmith, P. Varaiya: Capacity of fading channels with channel side information, IEEE Transactions on Information Theory. November (1997)

    Google Scholar 

  14. Piyush Gupta and P. R. Kumar: The Capacity of Wireless Networks, IEEE Transactions on Information Theory, pp. 388–404, vol. IT-46, no. 2, March (2000)

    Article  MathSciNet  Google Scholar 

  15. P. Gupta, P.R. Kumar: Towards an Information Theory of Large Networks: An Achievable Rate Region, Submitted to the IEEE Trans. on Information Theory, September (2001), Revised November (2002)

    Google Scholar 

  16. Mohammad A. Khojastepour, Ashutosh Sabharwal, Behnaam Aazhang: On the Capacity of ‘Cheap’ Relay Networks. to be submitted to the 37th Annual Conference on Information Sciences and Systems, Baltimore, Maryland, March 12–14 (2003)

    Google Scholar 

  17. S.-Y. R. Li, R.W. Yeung: Linear Codes for Network Information Flow, In: Proc. IEEE ISIT 1999, pp. 25, (1999)

    Google Scholar 

  18. K. Marton: A coding theorem for the discrete memoryless broadcast channel, IEEE Transactions on Information Theory, pp. 306–311, May (1979)

    Google Scholar 

  19. E. C. van der Meulen: Three-terminal communication channels, In: Adv. Appl. Prob., vol. 3, pp. 120–154, (1971)

    Article  MATH  Google Scholar 

  20. A. Reznik, S.R. Kulkarni, S. Verdu: Capacity and Optimal Resource Allocation in the Degraded Gaussian Relay Channel with Multiple Relays, In: 40th Allerton Conference on Communication, Control, and Computing, September (2002)

    Google Scholar 

  21. H. Sato: An outer bound to the capacity region of broadcast channels, IEEE Trans. on Information Theory, Vol. 24, No. 3, pp. 374–377, May (1978)

    Article  MATH  Google Scholar 

  22. C. E. Shannon: Two-way communication channels, In: Proc. 4th Berkelev Svm. Math. Statist. and Prob. vol. 1. VD. 611–644. (1961). Reprinted in: Key Papers in the Development-of Information Theory, (D. Slepian, Ed.) New York: IEEE Press, pp. 339–372, (1974)

    MathSciNet  Google Scholar 

  23. S. Vishwanath, N. Jindal, and A. Goldsmith: On the Capacity of Multiple Input Multiple Output Broadcast Channels, International Conference on Communications, (2002)

    Google Scholar 

  24. Pramod Viswanath, David Tse: Sum Capacity of the Multiple Antenna Gaussian Broadcast Channel and Uplink-Downlink Duality, submitted to IEEE Transactions on Information Theory, July (2002)

    Google Scholar 

  25. Jacob Wolfowitz: Coding Theorems of Information Theory. 3rd edn. Springer-Verlog, Berlin Heidelberg New York (1978)

    MATH  Google Scholar 

  26. L. Xie, P.R. Kumar: A network information Theory for Wireless Communication: Scaling Laws and Optimal Operation, Submitted to the IEEE Trans. on Information Theory, April (2002)

    Google Scholar 

  27. W. Yu, and J. Cioffi: Sum Capacity of Gaussian Vector Broadcast Channels, submitted to IEEE Transactions on Information Theory, Nov., (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Rice University, 6100 Main St. MS-366, Houston, TX, 77005

    Mohammad Ali Khojastepour, Ashutosh Sabharwal & Behnaam Aazhang

Authors
  1. Mohammad Ali Khojastepour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashutosh Sabharwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Behnaam Aazhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Palo Alto Research Center (PARC), 3333 Coyote Hill Road, Palo Alto, CA, 94304, USA

    Feng Zhao

  2. Computer Science Department, Stanford University, Gates Building 374, Stanford, CA, 94305, USA

    Leonidas Guibas

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khojastepour, M.A., Sabharwal, A., Aazhang, B. (2003). Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints. In: Zhao, F., Guibas, L. (eds) Information Processing in Sensor Networks. IPSN 2003. Lecture Notes in Computer Science, vol 2634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36978-3_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36978-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-02111-7

  • Online ISBN: 978-3-540-36978-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation