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

Weihe Wang, Vijay Subramanian, Dongning Guo

Research output: Contribution to conferencePaper

1 Citation (Scopus)

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

Fingerprint

Scheduling algorithms
Wireless networks
Parallel algorithms
Peer to peer networks
Radio receivers
Medium access control

Keywords

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

ASJC Scopus subject areas

  • Information Systems

Cite this

Wang, W., Subramanian, V., & Guo, D. (2014). Low complexity scheduling algorithms for wireless networks with full duplex state exchange. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States. https://doi.org/10.1109/CISS.2014.6814178
Wang, Weihe ; Subramanian, Vijay ; Guo, Dongning. / Low complexity scheduling algorithms for wireless networks with full duplex state exchange. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States.
@conference{15bcedac06b24c73b96a05f077f2b47b,
title = "Low complexity scheduling algorithms for wireless networks with full duplex state exchange",
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.",
keywords = "Distributed algorithms, full duplex, scheduling algorithms, wireless networks",
author = "Weihe Wang and Vijay Subramanian and Dongning Guo",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/CISS.2014.6814178",
language = "English (US)",
note = "2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 ; Conference date: 19-03-2014 Through 21-03-2014",

}

Wang, W, Subramanian, V & Guo, D 2014, 'Low complexity scheduling algorithms for wireless networks with full duplex state exchange' Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States, 3/19/14 - 3/21/14, . https://doi.org/10.1109/CISS.2014.6814178

Low complexity scheduling algorithms for wireless networks with full duplex state exchange. / Wang, Weihe; Subramanian, Vijay; Guo, Dongning.

2014. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States.

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Wang, Weihe

AU - Subramanian, Vijay

AU - Guo, Dongning

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

KW - Distributed algorithms

KW - full duplex

KW - scheduling algorithms

KW - wireless networks

UR - http://www.scopus.com/inward/record.url?scp=84901475211&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901475211&partnerID=8YFLogxK

U2 - 10.1109/CISS.2014.6814178

DO - 10.1109/CISS.2014.6814178

M3 - Paper

ER -

Wang W, Subramanian V, Guo D. Low complexity scheduling algorithms for wireless networks with full duplex state exchange. 2014. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States. https://doi.org/10.1109/CISS.2014.6814178