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
멀티홉 네트워크에서 무선 패킷은 소스에서 대상으로 무선 패킷을 전송하기 위해 중간 스테이션(중계기)을 통해 중계되는 경우가 많습니다. 그래프 이론 모델을 사용하여 다중 홉 네트워크의 스케줄링 문제를 고려합니다. 허락하다 D=(V,A) 정점 세트가 있는 이중 그래프가 됩니다. V 그리고 호 세트 A. 허락하다 f 호에 양의 정수를 표시하십시오. A. 의 가치 f(u,v)는 링크에 할당된 주파수 대역을 의미합니다. u 에 v. 우리는 전화 f 역이행적 if 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.
부
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
부
@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},}
부
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 -