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, N.

AU - Sugano, A.

AU - Higashino, T.

PY - 2003/1/1

Y1 - 2003/1/1

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

AN - SCOPUS:33645825415

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

SP - 128

EP - 135

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

A2 - Murai, Jun

A2 - Chang, Carl

A2 - Oie, Yuji

A2 - Helal, Sumi

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 27 January 2003 through 31 January 2003

ER -