Position-based topology-independent scheduling algorithms for mobile ad hoc networks

Jong-Hoon Youn, Bella Bose, Seungjin Park

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

Abstract

Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce a Position-Based Topology-Independent Scheduling (PB-TIS) algorithm. Since the topology-transparent scheduling algorithms in the literature assign a globally unique Transmission Scheduling Vector (TSV) to each host, the length of scheduling vectors depends on the number of nodes. Therefore we propose a new scheduling algorithm that assigns a locally unique TSV to each host. The proposed scheme improves system throughput considerably by assigning collision-free TSVs to neighboring nodes using their position information. The proposed algorithm delivers higher system throughput and low delay bound while preserving other desired properties of topology-transparent scheduling, such as topology independence, guaranteed minimum throughput and bounded maximum delay.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Wireless Networks, ICWN'04
EditorsH.R. Arabnia, L.T. Yang, C.-H. Yeh
Pages165-171
Number of pages7
Volume1
StatePublished - 2004
EventProceedings of the International Conference on Wireless Networks, ICWN'04 - Las Vegas, NV
Duration: Jun 21 2004Jun 24 2004

Other

OtherProceedings of the International Conference on Wireless Networks, ICWN'04
CityLas Vegas, NV
Period6/21/046/24/04

Fingerprint

Mobile ad hoc networks
Scheduling algorithms
Scheduling
Topology
Throughput
Ad hoc networks
Scalability
Network protocols

Keywords

  • Mobile ad hoc network
  • Position-based scheduling
  • Topology-transparent

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Youn, J-H., Bose, B., & Park, S. (2004). Position-based topology-independent scheduling algorithms for mobile ad hoc networks. In H. R. Arabnia, L. T. Yang, & C-H. Yeh (Eds.), Proceedings of the International Conference on Wireless Networks, ICWN'04 (Vol. 1, pp. 165-171)

Position-based topology-independent scheduling algorithms for mobile ad hoc networks. / Youn, Jong-Hoon; Bose, Bella; Park, Seungjin.

Proceedings of the International Conference on Wireless Networks, ICWN'04. ed. / H.R. Arabnia; L.T. Yang; C.-H. Yeh. Vol. 1 2004. p. 165-171.

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

Youn, J-H, Bose, B & Park, S 2004, Position-based topology-independent scheduling algorithms for mobile ad hoc networks. in HR Arabnia, LT Yang & C-H Yeh (eds), Proceedings of the International Conference on Wireless Networks, ICWN'04. vol. 1, pp. 165-171, Proceedings of the International Conference on Wireless Networks, ICWN'04, Las Vegas, NV, 6/21/04.
Youn J-H, Bose B, Park S. Position-based topology-independent scheduling algorithms for mobile ad hoc networks. In Arabnia HR, Yang LT, Yeh C-H, editors, Proceedings of the International Conference on Wireless Networks, ICWN'04. Vol. 1. 2004. p. 165-171
Youn, Jong-Hoon ; Bose, Bella ; Park, Seungjin. / Position-based topology-independent scheduling algorithms for mobile ad hoc networks. Proceedings of the International Conference on Wireless Networks, ICWN'04. editor / H.R. Arabnia ; L.T. Yang ; C.-H. Yeh. Vol. 1 2004. pp. 165-171
@inproceedings{84c39e355b0c4dcba55d82de5f73511d,
title = "Position-based topology-independent scheduling algorithms for mobile ad hoc networks",
abstract = "Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce a Position-Based Topology-Independent Scheduling (PB-TIS) algorithm. Since the topology-transparent scheduling algorithms in the literature assign a globally unique Transmission Scheduling Vector (TSV) to each host, the length of scheduling vectors depends on the number of nodes. Therefore we propose a new scheduling algorithm that assigns a locally unique TSV to each host. The proposed scheme improves system throughput considerably by assigning collision-free TSVs to neighboring nodes using their position information. The proposed algorithm delivers higher system throughput and low delay bound while preserving other desired properties of topology-transparent scheduling, such as topology independence, guaranteed minimum throughput and bounded maximum delay.",
keywords = "Mobile ad hoc network, Position-based scheduling, Topology-transparent",
author = "Jong-Hoon Youn and Bella Bose and Seungjin Park",
year = "2004",
language = "English (US)",
volume = "1",
pages = "165--171",
editor = "H.R. Arabnia and L.T. Yang and C.-H. Yeh",
booktitle = "Proceedings of the International Conference on Wireless Networks, ICWN'04",

}

TY - GEN

T1 - Position-based topology-independent scheduling algorithms for mobile ad hoc networks

AU - Youn, Jong-Hoon

AU - Bose, Bella

AU - Park, Seungjin

PY - 2004

Y1 - 2004

N2 - Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce a Position-Based Topology-Independent Scheduling (PB-TIS) algorithm. Since the topology-transparent scheduling algorithms in the literature assign a globally unique Transmission Scheduling Vector (TSV) to each host, the length of scheduling vectors depends on the number of nodes. Therefore we propose a new scheduling algorithm that assigns a locally unique TSV to each host. The proposed scheme improves system throughput considerably by assigning collision-free TSVs to neighboring nodes using their position information. The proposed algorithm delivers higher system throughput and low delay bound while preserving other desired properties of topology-transparent scheduling, such as topology independence, guaranteed minimum throughput and bounded maximum delay.

AB - Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce a Position-Based Topology-Independent Scheduling (PB-TIS) algorithm. Since the topology-transparent scheduling algorithms in the literature assign a globally unique Transmission Scheduling Vector (TSV) to each host, the length of scheduling vectors depends on the number of nodes. Therefore we propose a new scheduling algorithm that assigns a locally unique TSV to each host. The proposed scheme improves system throughput considerably by assigning collision-free TSVs to neighboring nodes using their position information. The proposed algorithm delivers higher system throughput and low delay bound while preserving other desired properties of topology-transparent scheduling, such as topology independence, guaranteed minimum throughput and bounded maximum delay.

KW - Mobile ad hoc network

KW - Position-based scheduling

KW - Topology-transparent

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

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

M3 - Conference contribution

AN - SCOPUS:12744269044

VL - 1

SP - 165

EP - 171

BT - Proceedings of the International Conference on Wireless Networks, ICWN'04

A2 - Arabnia, H.R.

A2 - Yang, L.T.

A2 - Yeh, C.-H.

ER -