Skip to main content

Braess-Type Paradox in Self-optimizing Wireless Networks

  • Conference paper
Multiple Access Communcations (MACOM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8310))

Included in the following conference series:

  • 684 Accesses

Abstract

The Braess’s paradox, also called Braess paradox, in transportation networks states that adding extra capacity to a network, when moving entities with incomplete information selfishly choose their routes, can in some cases reduce the overall network performance. In this paper, we observe a similar phenomenon in wireless networks. More specifically, we consider a single-cell system with two different types of access points, one of them with a fixed rate and one of them with a variable rate, i.e., a rate that depends on the number of users connected to that access point. We observe that, under certain conditions, the intersystem connection between these two types of access points does not necessarily improve the overall system performance. In other words, after the interconnection, the individual rates of users as well as their sum rate might get worse. This is similar to the original Braess paradox where adding a new route does not necessarily improve the overall traffic throughput. We develop a general model that describes under which conditions and for which families of variable rate functions this paradox happens. abstract environment.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Braess, D.: Uber ein paradoxen der werkehrsplannug. Unternehmenforschung 12, 256–268 (1968)

    MathSciNet  Google Scholar 

  2. Mitola III, J.: Cognitive Radio: An Integrated Agent Architecture for Software Defined Radio, Ph.D. dissertation, Royal Institute of Technology (KTH) Stockholm, Sweden, May 8 (2000)

    Google Scholar 

  3. Haykin, S.: Cognitive radio: Brain empowered wireless communication. Journal on Selected Areas in Communications 23(2), 201–220 (2005)

    Article  Google Scholar 

  4. Meshkati, F., Poor, H.V., Schwartz, S.C., Mandayam, N.: An energy-efficient approach to power control and receiver design in wireless data networks. IEEE Trans. on Communications 53(11), 1885–1894 (2005)

    Article  Google Scholar 

  5. Meshkati, F., Poor, H.V., Schwartz, S.C.: Energy-efficient resource allocation in wireless networks: An overview of game theoretic approaches. IEEE Signal Process. Magazine 24(3), 58–68 (2007)

    Article  Google Scholar 

  6. Bonneau, N., Debbah, M., Altman, E., Hjørungnes, A.: Non-atomic games for multi-user systems. IEEE Journal on Selected Areas in Communications 26(7), 1047–1058 (2008)

    Article  Google Scholar 

  7. Altman, E., Kambley, V., Kamedaz, H.: A Braess type paradox in power control over interference channels. In: Proc. 6th Int. Symp. on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT 2008), Berlin, pp. 555–559 (April 2008)

    Google Scholar 

  8. Saraydar, C., Mandayam, N.B., Goodman, D.J.: Efficient power control via pricing in wireless data networks. IEEE Trans. on Communications 50(2), 291–303 (2002)

    Article  Google Scholar 

  9. Korilis, Y.A., Lazar, A.A., Orda, A.: Architecting noncooperative networks. IEEE J. on Selected Areas in Communications 13, 1241–1251 (1995)

    Article  Google Scholar 

  10. Bean, N.: Secrets of network success. Physics World, 30–33 (February 1996)

    Google Scholar 

  11. Maugeri, A.: Variational and quasi-variational inequalities in network flow models: Recent developments in theory and algorithms. In: Giannessi, F., Maugeri, A. (eds.) Variational Inequalities and Network Equilibrium Problems, pp. 195–211. Plenum, New York (1995)

    Google Scholar 

  12. Bean, N.G., Taylor, P.G.: Can Braess’s paradox occur in loss networks? University of Adelaide (November 1994), can be found online at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.639

  13. Calvert, B., Keady, G.: Braess’s paradox and power-law nonlinearities in networks II. In: Lakshmanthan, V. (ed.), Proceedings of the First World Congress of Nonlinear Analysts, WC 528, Florida, August 1992, vol. III, pp. 2223–2230. W. de Gruyter (1996)

    Google Scholar 

  14. Han, Z., Liu, K.J.R.: Resource Allocation for Wireless Networks: Basics, Techniques, and Applications. Cambridge University Press, New York (2008)

    Book  Google Scholar 

  15. Daganzo, C.: Two paradoxes of traffic flow on networks with physical queues. In: Symposium Ingeneria de los Transportes, Madrid, pp. 55–62 (May 1996)

    Google Scholar 

  16. Marinoff, L.: How Braess’ paradox solves Newcomb’s problem: Not! International Studies in the Philosophy of Science 10, 217–237 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Marina, N. (2013). Braess-Type Paradox in Self-optimizing Wireless Networks. In: Jonsson, M., Vinel, A., Bellalta, B., Marina, N., Dimitrova, D., Fiems, D. (eds) Multiple Access Communcations. MACOM 2013. Lecture Notes in Computer Science, vol 8310. Springer, Cham. https://doi.org/10.1007/978-3-319-03871-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03871-1_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03870-4

  • Online ISBN: 978-3-319-03871-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics