Medium access control via nearest-neighbor interactions for regular wireless networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

This paper studies medium access control (MAC) protocols for regular wireless networks, where only nearest-neighbor interactions are involved. Each station chooses a state in the current time slot, which determines whether it transmits or not, based on its own state and the states of all its nearest neighbors in the previous time slot. The dynamics of the network follow that of a Markov Chain of Markov Fields, which is shown to converge to a stationary distribution for certain types of interactions. It is found that this type of protocols can achieve the optimal one-hop broadcast throughput in regular wireless networks. In case each station can only distinguish between transmitting and idle neighbors, the interactions of the network can be described using the Ising model in statistical mechanics. For this case, a MAC protocol is designed that can achieve a throughput close to the optimum.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages1813-1817
Number of pages5
DOIs
StatePublished - Aug 23 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period6/13/106/18/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Medium access control via nearest-neighbor interactions for regular wireless networks'. Together they form a unique fingerprint.

Cite this