Low complexity scheduling algorithms for wireless networks with full duplex state exchange

Weihe Wang, Vijay Subramanian, Dongning Guo

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

In a peer-to-peer wireless network, efficient distributed scheduling algorithms generally require all active nodes to acquire the state information of their respective neighbors, e.g., their queue lengths. However, information exchange between nodes is challenging in the absence of a collision-free schedule, mainly due to the half duplex design of today's radios. This paper studies medium access control (MAC) with the help of a physical layer technique that allows all nodes to efficiently exchange state messages with one-hop neighbors at the same time. Low-complexity distributed scheduling algorithms using simultaneous message exchange are proposed for two interference models. One of the algorithms is shown to produce schedules realizable by the greedy maximal scheduling algorithm under the node-exclusive interference model. Simulations demonstrate that both algorithms outperform some popular distributed random access schemes.

Original languageEnglish (US)
DOIs
StatePublished - Jan 1 2014
Event2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States
Duration: Mar 19 2014Mar 21 2014

Other

Other2014 48th Annual Conference on Information Sciences and Systems, CISS 2014
CountryUnited States
CityPrinceton, NJ
Period3/19/143/21/14

Keywords

  • Distributed algorithms
  • full duplex
  • scheduling algorithms
  • wireless networks

ASJC Scopus subject areas

  • Information Systems

Fingerprint Dive into the research topics of 'Low complexity scheduling algorithms for wireless networks with full duplex state exchange'. Together they form a unique fingerprint.

Cite this