A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks

S. Tajima, Nobuo Funabiki, A. Sugano, T. Higashino

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

1 Citation (Scopus)

Abstract

In a large scale communication network, packets are transmitted from source nodes to destinations by going through several nodes on routes connecting them, because each node usually does not have a direct link to every node in the network. To maximize the usability in the network, the problems of selecting a transmission route for each connection request and of scheduling the link activations such that the total transmission time is minimized. This paper presents a four-stage approximation algorithm for the link scheduling problem (LSP) in a packet radio network, called MIPS-LSP, a MInimal-state Processing Search algorithm for LSP It is assumed that every link activation in the network is synchronously controlled by a single clock with a fixed time interval called a time slot. The first stage of MIPS-LSP computes the lower bound on the number of time slots for a given LSP instance. The second stage generates a link compatibility graph to represent the conflicts between links to be activated simultaneously. The third stage gives the initial state for search by a greedy method. The last stage iteratively searches a solution by a minimal-state evolution method The performance of the algorithm is verified through extensive simulations using benchmarks in literature.

Original languageEnglish
Title of host publicationProceedings - 2003 Symposium on Applications and the Internet, SAINT 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages128-135
Number of pages8
ISBN (Print)0769518729, 9780769518725
DOIs
Publication statusPublished - 2003
Event2003 Symposium on Applications and the Internet, SAINT 2003 - Orlando, United States
Duration: Jan 27 2003Jan 31 2003

Other

Other2003 Symposium on Applications and the Internet, SAINT 2003
CountryUnited States
CityOrlando
Period1/27/031/31/03

Fingerprint

Telecommunication links
Scheduling
Processing
Chemical activation
Approximation algorithms
Telecommunication networks
Clocks

Keywords

  • Approximation algorithms
  • Communication networks
  • Joining processes
  • Large-scale systems
  • Packet radio networks
  • Processor scheduling
  • Proposals
  • Radio control
  • Scheduling algorithm
  • Usability

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture

Cite this

Tajima, S., Funabiki, N., Sugano, A., & Higashino, T. (2003). A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks. In Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003 (pp. 128-135). [1183041] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SAINT.2003.1183041

A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks. / Tajima, S.; Funabiki, Nobuo; Sugano, A.; Higashino, T.

Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 128-135 1183041.

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

Tajima, S, Funabiki, N, Sugano, A & Higashino, T 2003, A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks. in Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003., 1183041, Institute of Electrical and Electronics Engineers Inc., pp. 128-135, 2003 Symposium on Applications and the Internet, SAINT 2003, Orlando, United States, 1/27/03. https://doi.org/10.1109/SAINT.2003.1183041
Tajima S, Funabiki N, Sugano A, Higashino T. A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks. In Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 128-135. 1183041 https://doi.org/10.1109/SAINT.2003.1183041
Tajima, S. ; Funabiki, Nobuo ; Sugano, A. ; Higashino, T. / A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks. Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 128-135
@inproceedings{055bad761f3c45d3be147b3c4e2538fb,
title = "A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks",
abstract = "In a large scale communication network, packets are transmitted from source nodes to destinations by going through several nodes on routes connecting them, because each node usually does not have a direct link to every node in the network. To maximize the usability in the network, the problems of selecting a transmission route for each connection request and of scheduling the link activations such that the total transmission time is minimized. This paper presents a four-stage approximation algorithm for the link scheduling problem (LSP) in a packet radio network, called MIPS-LSP, a MInimal-state Processing Search algorithm for LSP It is assumed that every link activation in the network is synchronously controlled by a single clock with a fixed time interval called a time slot. The first stage of MIPS-LSP computes the lower bound on the number of time slots for a given LSP instance. The second stage generates a link compatibility graph to represent the conflicts between links to be activated simultaneously. The third stage gives the initial state for search by a greedy method. The last stage iteratively searches a solution by a minimal-state evolution method The performance of the algorithm is verified through extensive simulations using benchmarks in literature.",
keywords = "Approximation algorithms, Communication networks, Joining processes, Large-scale systems, Packet radio networks, Processor scheduling, Proposals, Radio control, Scheduling algorithm, Usability",
author = "S. Tajima and Nobuo Funabiki and A. Sugano and T. Higashino",
year = "2003",
doi = "10.1109/SAINT.2003.1183041",
language = "English",
isbn = "0769518729",
pages = "128--135",
booktitle = "Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks

AU - Tajima, S.

AU - Funabiki, Nobuo

AU - Sugano, A.

AU - Higashino, T.

PY - 2003

Y1 - 2003

N2 - In a large scale communication network, packets are transmitted from source nodes to destinations by going through several nodes on routes connecting them, because each node usually does not have a direct link to every node in the network. To maximize the usability in the network, the problems of selecting a transmission route for each connection request and of scheduling the link activations such that the total transmission time is minimized. This paper presents a four-stage approximation algorithm for the link scheduling problem (LSP) in a packet radio network, called MIPS-LSP, a MInimal-state Processing Search algorithm for LSP It is assumed that every link activation in the network is synchronously controlled by a single clock with a fixed time interval called a time slot. The first stage of MIPS-LSP computes the lower bound on the number of time slots for a given LSP instance. The second stage generates a link compatibility graph to represent the conflicts between links to be activated simultaneously. The third stage gives the initial state for search by a greedy method. The last stage iteratively searches a solution by a minimal-state evolution method The performance of the algorithm is verified through extensive simulations using benchmarks in literature.

AB - In a large scale communication network, packets are transmitted from source nodes to destinations by going through several nodes on routes connecting them, because each node usually does not have a direct link to every node in the network. To maximize the usability in the network, the problems of selecting a transmission route for each connection request and of scheduling the link activations such that the total transmission time is minimized. This paper presents a four-stage approximation algorithm for the link scheduling problem (LSP) in a packet radio network, called MIPS-LSP, a MInimal-state Processing Search algorithm for LSP It is assumed that every link activation in the network is synchronously controlled by a single clock with a fixed time interval called a time slot. The first stage of MIPS-LSP computes the lower bound on the number of time slots for a given LSP instance. The second stage generates a link compatibility graph to represent the conflicts between links to be activated simultaneously. The third stage gives the initial state for search by a greedy method. The last stage iteratively searches a solution by a minimal-state evolution method The performance of the algorithm is verified through extensive simulations using benchmarks in literature.

KW - Approximation algorithms

KW - Communication networks

KW - Joining processes

KW - Large-scale systems

KW - Packet radio networks

KW - Processor scheduling

KW - Proposals

KW - Radio control

KW - Scheduling algorithm

KW - Usability

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

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

U2 - 10.1109/SAINT.2003.1183041

DO - 10.1109/SAINT.2003.1183041

M3 - Conference contribution

SN - 0769518729

SN - 9780769518725

SP - 128

EP - 135

BT - Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003

PB - Institute of Electrical and Electronics Engineers Inc.

ER -