A distributed throughput-optimal CSMA with data packet collisions

Tae Hyun Kim, Jian Ni, Nitin H Vaidya

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

Abstract

This paper addresses a distributed throughput-optimal CSMA for wireless networks, which is called the preemptive CSMA. Distinguished from other throughput-optimal CSMAs in the literature, it achieves the optimality even with the throughput loss caused by discrete backoff time, non-zerocarrier sense delay and data packet collisions. Moreover, the analysis on the preemptive CSMA provides the understanding on the relationship among the throughput-optimal CSMAs.

Original languageEnglish (US)
Title of host publication2010 5th IEEE Workshop on Wireless Mesh Networks, WiMesh 2010
Pages55-60
Number of pages6
DOIs
StatePublished - Aug 5 2010
Event5th Annual IEEE Workshop on Wireless Mesh Networks, WiMesh 2010 - Boston, MA, United States
Duration: Jun 21 2010Jun 21 2010

Publication series

Name2010 5th IEEE Workshop on Wireless Mesh Networks, WiMesh 2010

Other

Other5th Annual IEEE Workshop on Wireless Mesh Networks, WiMesh 2010
Country/TerritoryUnited States
CityBoston, MA
Period6/21/106/21/10

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A distributed throughput-optimal CSMA with data packet collisions'. Together they form a unique fingerprint.

Cite this