Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency

Jong-Hoon Youn, Seungjin Park

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

1 Citation (Scopus)

Abstract

Because of partially connected dynamic network topology and the hidden terminal problems in multihop packet radio network, contention among stations is not homogenous and any scheduling decision made at a station will have impact on its neighbors. In this paper, we discuss how to calculate the channel access probability, p, dynamically in wireless medium using a distributed approach. The goal of the proposed scheduling algorithm is to provide a simple and effective solution for the fairness problem without sacrificing the system throughput. In the proposed scheduling algorithm, link access probabilities can be calculated at each node by monitoring the collisions in the previous frames withoug using a centralized coordinator. Each host estimates traffic intensity for each transmission slot and uses the estimated traffic intensity value and the number of collisions-free slots to calculate the channel access probability. Our simulation results show that the fairness problem can be very severe with the original TSMA algorithm when the load of the channel is high, and our new scheduling algorithm can achieve far better fairness. The proposed algorithm improves not only the fairness but also the system throughput by reducing the number of collisions.

Original languageEnglish (US)
Title of host publicationIEEE Vehicular Technology Conference
Pages1811-1815
Number of pages5
Volume57
Edition3
StatePublished - 2003
Event57th IEEE Semiannual Vehicular Technology Conference (VTC2003) - Jeju, Korea, Republic of
Duration: Apr 22 2003Apr 25 2003

Other

Other57th IEEE Semiannual Vehicular Technology Conference (VTC2003)
CountryKorea, Republic of
CityJeju
Period4/22/034/25/03

Fingerprint

Scheduling algorithms
Throughput
Scheduling
Topology
Monitoring

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Youn, J-H., & Park, S. (2003). Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency. In IEEE Vehicular Technology Conference (3 ed., Vol. 57, pp. 1811-1815)

Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency. / Youn, Jong-Hoon; Park, Seungjin.

IEEE Vehicular Technology Conference. Vol. 57 3. ed. 2003. p. 1811-1815.

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

Youn, J-H & Park, S 2003, Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency. in IEEE Vehicular Technology Conference. 3 edn, vol. 57, pp. 1811-1815, 57th IEEE Semiannual Vehicular Technology Conference (VTC2003), Jeju, Korea, Republic of, 4/22/03.
Youn J-H, Park S. Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency. In IEEE Vehicular Technology Conference. 3 ed. Vol. 57. 2003. p. 1811-1815
Youn, Jong-Hoon ; Park, Seungjin. / Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency. IEEE Vehicular Technology Conference. Vol. 57 3. ed. 2003. pp. 1811-1815
@inproceedings{848c30c970a944a0bdbcc0c3388dad2a,
title = "Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency",
abstract = "Because of partially connected dynamic network topology and the hidden terminal problems in multihop packet radio network, contention among stations is not homogenous and any scheduling decision made at a station will have impact on its neighbors. In this paper, we discuss how to calculate the channel access probability, p, dynamically in wireless medium using a distributed approach. The goal of the proposed scheduling algorithm is to provide a simple and effective solution for the fairness problem without sacrificing the system throughput. In the proposed scheduling algorithm, link access probabilities can be calculated at each node by monitoring the collisions in the previous frames withoug using a centralized coordinator. Each host estimates traffic intensity for each transmission slot and uses the estimated traffic intensity value and the number of collisions-free slots to calculate the channel access probability. Our simulation results show that the fairness problem can be very severe with the original TSMA algorithm when the load of the channel is high, and our new scheduling algorithm can achieve far better fairness. The proposed algorithm improves not only the fairness but also the system throughput by reducing the number of collisions.",
author = "Jong-Hoon Youn and Seungjin Park",
year = "2003",
language = "English (US)",
volume = "57",
pages = "1811--1815",
booktitle = "IEEE Vehicular Technology Conference",
edition = "3",

}

TY - GEN

T1 - Improving the efficiency and fairness of time-spread multiple-access (TSMA) using adaptive p-persistency

AU - Youn, Jong-Hoon

AU - Park, Seungjin

PY - 2003

Y1 - 2003

N2 - Because of partially connected dynamic network topology and the hidden terminal problems in multihop packet radio network, contention among stations is not homogenous and any scheduling decision made at a station will have impact on its neighbors. In this paper, we discuss how to calculate the channel access probability, p, dynamically in wireless medium using a distributed approach. The goal of the proposed scheduling algorithm is to provide a simple and effective solution for the fairness problem without sacrificing the system throughput. In the proposed scheduling algorithm, link access probabilities can be calculated at each node by monitoring the collisions in the previous frames withoug using a centralized coordinator. Each host estimates traffic intensity for each transmission slot and uses the estimated traffic intensity value and the number of collisions-free slots to calculate the channel access probability. Our simulation results show that the fairness problem can be very severe with the original TSMA algorithm when the load of the channel is high, and our new scheduling algorithm can achieve far better fairness. The proposed algorithm improves not only the fairness but also the system throughput by reducing the number of collisions.

AB - Because of partially connected dynamic network topology and the hidden terminal problems in multihop packet radio network, contention among stations is not homogenous and any scheduling decision made at a station will have impact on its neighbors. In this paper, we discuss how to calculate the channel access probability, p, dynamically in wireless medium using a distributed approach. The goal of the proposed scheduling algorithm is to provide a simple and effective solution for the fairness problem without sacrificing the system throughput. In the proposed scheduling algorithm, link access probabilities can be calculated at each node by monitoring the collisions in the previous frames withoug using a centralized coordinator. Each host estimates traffic intensity for each transmission slot and uses the estimated traffic intensity value and the number of collisions-free slots to calculate the channel access probability. Our simulation results show that the fairness problem can be very severe with the original TSMA algorithm when the load of the channel is high, and our new scheduling algorithm can achieve far better fairness. The proposed algorithm improves not only the fairness but also the system throughput by reducing the number of collisions.

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

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

M3 - Conference contribution

AN - SCOPUS:0042971417

VL - 57

SP - 1811

EP - 1815

BT - IEEE Vehicular Technology Conference

ER -