Throughput equalization in mean-field hard-core models for CSMA-based wireless networks

In this paper we consider the problem of equalizing throughput of nodes in CSMA-based wireless networks. We model interference in a network using conflict graph, where edges represent hard-core interaction, meaning that the two nodes an edge connects cannot be simultaneously active, or transmitting. In practice, the degrees of nodes in a conflict graph are not constant. In such cases, using CSMA leads to lack of fairness since nodes with larger degree have the potential of getting hold of the medium for smaller fraction of time than the nodes with smaller degree. We present a distributed strategy for throughput equalization. The proposed strategy is based on a mean-field hard-core model of interference, and it equalizes the throughput of the nodes with different degrees. We also show that the mean-field hard-core model exhibits a certain phase transition. We present results of Monte-Carlo simulations to evaluate the the proposed strategy in square grid networks and Poisson networks, in addition to mean-field networks.

[1]  Martin Haenggi,et al.  Stochastic Geometry for Wireless Networks , 2012 .

[2]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[3]  Kevin E. Bassler,et al.  Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence , 2010, PloS one.

[4]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[5]  T. Mattfeldt.  Stochastic Geometry and Its Applications , 1996 .

[6]  Florent Krzakala,et al.  The hard-core model on random graphs revisited , 2013, ArXiv.

[7]  Antal Iványi,et al.  On Erdős-Gallai and Havel-Hakimi algorithms , 2011, ArXiv.

[8]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[9]  Ekram Hossain,et al.  A Modified Hard Core Point Process for Analysis of Random CSMA Wireless Networks in General Fading Environments , 2013, IEEE Transactions on Communications.

[10]  Béla Bollobás,et al.  Handbook of large-scale random networks , 2008 .

[11]  Gustavo de Veciana,et al.  Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols , 2014, IEEE Transactions on Information Theory.

[12]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[13]  Riku Jäntti,et al.  Bounding the Mean Interference in Mat\'ern Type II Hard-Core Wireless Networks , 2013, IEEE Wireless Communications Letters.

[14]  西森 秀稔.  Statistical physics of spin glasses and information processing : an introduction , 2001 .

[15]  Sem C. Borst,et al.  Equalizing throughputs in random-access networks , 2010, PERV.

[16]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[17]  Sem C. Borst,et al.  Achieving target throughputs in random-access networks , 2011, Perform. Evaluation.

[18]  Sem C. Borst,et al.  Insensitivity and stability of random-access networks , 2010, Perform. Evaluation.

[19]  Martin Haenggi,et al.  Mean Interference in Hard-Core Wireless Networks , 2011, IEEE Communications Letters.

[20]  J. Zanuncio,et al.  Immunity of an Alternative Host Can Be Overcome by Higher Densities of Its Parasitoids Palmistichus elaeisis and Trichospilus diatraeae , 2010, PloS one.

[21]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

[22]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[23]  Jeffrey G. Andrews,et al.  A primer on spatial modeling and analysis in wireless networks , 2010, IEEE Communications Magazine.

[24]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[25]  H. Nishimori.  Statistical Physics of Spin Glasses and Information Processing , 2001 .

[26]  S. Kak.  Information, physics, and computation , 1996 .