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

S. Tajima, N. 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
EditorsJun Murai, Carl Chang, Yuji Oie, Sumi Helal
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages128-135
Number of pages8
ISBN (Electronic)0769518729, 9780769518725
DOIs
Publication statusPublished - Jan 1 2003
Event2003 Symposium on Applications and the Internet, SAINT 2003 - Orlando, United States
Duration: Jan 27 2003Jan 31 2003

Publication series

NameProceedings - 2003 Symposium on Applications and the Internet, SAINT 2003

Other

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

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

Fingerprint Dive into the research topics of 'A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks'. Together they form a unique fingerprint.

  • 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 J. Murai, C. Chang, Y. Oie, & S. Helal (Eds.), Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003 (pp. 128-135). [1183041] (Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SAINT.2003.1183041