The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Em uma rede multihop, os pacotes de rádio são frequentemente retransmitidos através de estações intermediárias (repetidoras) para transferir um pacote de rádio de uma origem para seu destino. Consideramos um problema de escalonamento em uma rede multihop usando um modelo grafoteórico. Deixar D=(V,A) seja o dígrafo com um conjunto de vértices V e um conjunto de arco A. Deixei f ser uma rotulagem de inteiros positivos nos arcos de A. O valor de f(u,v) significa uma faixa de frequência atribuída no link de u para v. Nós chamamos f antitransitivo se f(u,v)
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Kaoru WATANABE, Masakazu SENGOKU, Hiroshi TAMURA, Keisuke NAKANO, Shoji SHINODA, "A Scheduling Problem in Multihop Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 6, pp. 1222-1227, June 2000, doi: .
Abstract: In a multihop network, radio packets are often relayed through inter-mediate stations (repeaters) in order to transfer a radio packet from a source to its destination. We consider a scheduling problem in a multihop network using a graphtheoretical model. Let D=(V,A) be the digraph with a vertex set V and an arc set A. Let f be a labeling of positive integers on the arcs of A. The value of f(u,v) means a frequency band assigned on the link from u to v. We call f antitransitive if f(u,v)
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_6_1222/_p
Copiar
@ARTICLE{e83-a_6_1222,
author={Kaoru WATANABE, Masakazu SENGOKU, Hiroshi TAMURA, Keisuke NAKANO, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Scheduling Problem in Multihop Networks},
year={2000},
volume={E83-A},
number={6},
pages={1222-1227},
abstract={In a multihop network, radio packets are often relayed through inter-mediate stations (repeaters) in order to transfer a radio packet from a source to its destination. We consider a scheduling problem in a multihop network using a graphtheoretical model. Let D=(V,A) be the digraph with a vertex set V and an arc set A. Let f be a labeling of positive integers on the arcs of A. The value of f(u,v) means a frequency band assigned on the link from u to v. We call f antitransitive if f(u,v)
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
TY - JOUR
TI - A Scheduling Problem in Multihop Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1222
EP - 1227
AU - Kaoru WATANABE
AU - Masakazu SENGOKU
AU - Hiroshi TAMURA
AU - Keisuke NAKANO
AU - Shoji SHINODA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2000
AB - In a multihop network, radio packets are often relayed through inter-mediate stations (repeaters) in order to transfer a radio packet from a source to its destination. We consider a scheduling problem in a multihop network using a graphtheoretical model. Let D=(V,A) be the digraph with a vertex set V and an arc set A. Let f be a labeling of positive integers on the arcs of A. The value of f(u,v) means a frequency band assigned on the link from u to v. We call f antitransitive if f(u,v)
ER -