Presentation 2001/7/11
A New Distributed TDMA Algorithm Assigning Slots Transmitting in Parallel
Makoto KOBARA, Hiroshi MATSUNO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Hidden terminal problem is recognized as one of the most difficult problems which makes the performance of packet radio networks(PRN)degraded when we use a media access control protocol based on the contention method. On the other hand, TDMA is known as the media access control protocol which is not originally reflected by hidden terminals. This paper proposes a new distributed algorithm based on TDMA which assigns slots transmitting in parallel in a PRN. This algorithm can schedule the frame consisting of fewer slots than the number of slots scheduled by the algorithm formerly proposed by Ephremides and Truong(1990). Furthermore, this algorithm makes the number of slots scheduled to the nodes more equal than the one scheduled by the algorithm of Epheremides and Troung(1990).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Packet radio network / Hidden terminal problem / TDMA / Distributed algorithm
Paper # NS2001-65,RCS2001-66
Date of Issue

Conference Information
Committee NS
Conference Date 2001/7/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A New Distributed TDMA Algorithm Assigning Slots Transmitting in Parallel
Sub Title (in English)
Keyword(1) Packet radio network
Keyword(2) Hidden terminal problem
Keyword(3) TDMA
Keyword(4) Distributed algorithm
1st Author's Name Makoto KOBARA
1st Author's Affiliation Graduate School of Science and Engineering, Yamaguchi University()
2nd Author's Name Hiroshi MATSUNO
2nd Author's Affiliation Faculty of Science, Yamaguchi University
Date 2001/7/11
Paper # NS2001-65,RCS2001-66
Volume (vol) vol.101
Number (no) 194
Page pp.pp.-
#Pages 6
Date of Issue