## Abstract

The performance of carrier sense multiple access (CSMA) wireless networks heavily depends on the level of spatial reuse, i.e., how many concurrent transmissions are allowed. Spatial reuse is primarily determined by physical carrier sense, and a key parameter for physical carrier sense is the carrier sense threshold. Our focus is on how to control the carrier sense threshold for improving network performance. We present a noncooperative game-theoretic framework, which leads to a fully distributed algorithm for tuning the carrier sense threshold. We introduce a utility function of each node, which is a nondecreasing concave function of the carrier sense threshold. A pricing function is further introduced to mitigate severe interference among nodes. The cost function is defined as the difference between the pricing and the utility functions. We prove that the noncooperative carrier sense game admits a unique Nash equilibrium (NE) under some technical conditions.We derive sufficient conditions that ensure the convergence of the synchronous and asynchronous update algorithms. Based on the analysis, we propose a fully distributed algorithm, entitled noncooperative carrier sense update algorithm (NCUA). Our simulation study indicates that NCUA outperforms standard CSMA with respect to the per-node throughput by 10-50%.

Original language | English |
---|---|

Article number | 5288962 |

Pages (from-to) | 5280-5289 |

Number of pages | 10 |

Journal | IEEE Transactions on Wireless Communications |

Volume | 8 |

Issue number | 10 |

DOIs | |

Publication status | Published - 2009 Oct |

### Bibliographical note

Funding Information:ACKNOWLEDGEMENT This work was supported in part by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-214-D00102), in part by the Korea Science and Engineering Foundation (KOSEF) Grant funded by the Korean Government (MOST) (No. R01-2007-000-20958-0), and in part by the IT R&D program of MKE/IITA [2008-F015-02, Research on Ubiquitous Mobility Management Methods for Higher Service Availability] APPENDIX The proof follows a line of arguments similar to those in [9], [15]. First, we show the existence of a NE. The∏set of feasible carrier sense thresholds is defined as = =1, where ∈ = [,], ∀ ∈ . Then, is closed and bounded, and thus compact. Also, is convex and has a nonempty interior. Furthermore, the cost function (x) in (4) is convex in under the condition (12), which is to be shown

## Keywords

- CSMA wireless network
- Noncooperative gamel
- Physica carrier sense
- Spatial reuse

## ASJC Scopus subject areas

- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics