IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v64y2017i4d10.1007_s11235-016-0193-z.html
   My bibliography  Save this article

Cooperation and coalitional stability in decentralized wireless networks

Author

Listed:
  • Dávid Csercsik

    (Pázmány Péter Catholic University)

  • Sándor Imre

    (Budapest University of Technology and Economics)

Abstract

In this paper we consider a wireless contextualization of the local routing protocol on scale-free networks embedded in a plane and analyze on the one hand how cooperation affects network efficiency, and on the other hand the stability of cooperation structures. Cooperation is interpreted on k-cliques as local exchange of topological information between cooperating agents. Cooperative activity of nodes in the proposed model changes the routing strategy at the level of the coalition group and consequently influences the entire routing process on the network. We show that the proposed cooperation model enhances the network performance in the sense of reduced passage time and jamming. Payoff of a certain node is defined based on its energy consumption during the routing process. We show that if the payoff of the nodes is the energy saving compared to the all-singleton case, basically coalitions are not stable, since increased activity within coalition increases costs. We introduce coalitional load balancing and net reward to enhance coalitional stability and thus the more efficient operation of the network. As in the proposed model cooperation strongly affects routing dynamics of the network, externalities will arise and the game is defined in a partition function form.

Suggested Citation

  • Dávid Csercsik & Sándor Imre, 2017. "Cooperation and coalitional stability in decentralized wireless networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 571-584, April.
    • Handle: RePEc:spr:telsys:v:64:y:2017:i:4:d:10.1007_s11235-016-0193-z
    DOI: 10.1007/s11235-016-0193-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0193-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0193-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Johari, Ramesh & Mannor, Shie & Tsitsiklis, John N., 2006. "A contract-based model for directed network formation," Games and Economic Behavior, Elsevier, vol. 56(2), pages 201-224, August.
    2. Parkash Chander & Henry Tulkens, 2006. "The Core of an Economy with Multilateral Environmental Externalities," Springer Books, in: Parkash Chander & Jacques Drèze & C. Knox Lovell & Jack Mintz (ed.), Public goods, environmental externalities and fiscal competition, chapter 0, pages 153-175, Springer.
    3. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    4. László Kóczy, 2007. "A recursive core for partition function form games," Theory and Decision, Springer, vol. 63(1), pages 41-51, August.
    5. Tadić, Bosiljka & Rodgers, G.J., 2010. "Modelling conflicts with cluster dynamics in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(23), pages 5495-5502.
    6. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    7. Bosiljka Tadić & G. J. Rodgers, 2002. "Packet Transport On Scale-Free Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 5(04), pages 445-456.
    8. C.-Y. Yin & B.-H. Wang & W.-X. Wang & G. Yan & H.-J. Yang, 2006. "Traffic dynamics based on an efficient routing strategy on scale free networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 49(2), pages 205-211, January.
    9. Dávid Csercsik & Balázs Sziklai, 2015. "Traffic routing oligopoly," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 743-762, December.
    10. R. D'Hulst & G. J. Rodgers, 2000. "Exact Solution Of A Model For Crowding And Information Transmission In Financial Markets," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 3(04), pages 609-616.
    11. Tadić, Bosiljka & Thurner, Stefan, 2004. "Information super-diffusion on structured networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 332(C), pages 566-584.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, March.
    2. Dávid Csercsik & László Á. Kóczy, 2017. "Efficiency and Stability in Electrical Power Transmission Networks: a Partition Function Form Approach," Networks and Spatial Economics, Springer, vol. 17(4), pages 1161-1184, December.
    3. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    4. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    5. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    6. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    7. Messan Agbaglah, 2014. "A recursive core for cooperative games with overlapping coalitions," Cahiers de recherche 14-07, Departement d'économique de l'École de gestion à l'Université de Sherbrooke.
    8. Zhang, Zhongzhi & Rong, Lili & Comellas, Francesc, 2006. "High-dimensional random Apollonian networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 610-618.
    9. Rendón de la Torre, Stephanie & Kalda, Jaan & Kitt, Robert & Engelbrecht, Jüri, 2016. "On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 18-27.
    10. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    11. Zheng, Xiaolong & Zeng, Daniel & Li, Huiqian & Wang, Feiyue, 2008. "Analyzing open-source software systems as complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6190-6200.
    12. Matthew O. Jackson & Brian W. Rogers, 2005. "Search in the Formation of Large Networks: How Random are Socially Generated Networks?," Game Theory and Information 0503005, University Library of Munich, Germany.
    13. Pandey, Pradumn Kumar & Adhikari, Bibhas, 2015. "Context dependent preferential attachment model for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 499-508.
    14. Ikeda, N., 2007. "Network formed by traces of random walks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 379(2), pages 701-713.
    15. Çavuşoğlu, Abdullah & Türker, İlker, 2013. "Scientific collaboration network of Turkey," Chaos, Solitons & Fractals, Elsevier, vol. 57(C), pages 9-18.
    16. Stamatopoulos, Giorgos, 2018. "On the gamma-core of asymmetric aggregative games," MPRA Paper 88722, University Library of Munich, Germany.
    17. Rodrigo Huerta-Quintanilla & Efrain Canto-Lugo & Dolores Viga-de Alva, 2013. "Modeling Social Network Topologies in Elementary Schools," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-9, February.
    18. Roland Pongou & Guy Tchuente & Jean-Baptiste Tondji, 2021. "Optimally Targeting Interventions in Networks during a Pandemic: Theory and Evidence from the Networks of Nursing Homes in the United States," Papers 2110.10230, arXiv.org.
    19. László Á. Kóczy & Dávid Csercsik, 2011. "Externalities in the games over electrical power transmission networks," Working Paper Series 1103, Óbuda University, Keleti Faculty of Business and Management.
    20. Lancaster, David, 2014. "Random walks between leaves of random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 511-522.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:64:y:2017:i:4:d:10.1007_s11235-016-0193-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.