Proceedings of ICC '93 - IEEE International Conference on Communications
DOI: 10.1109/icc.1993.397600
|View full text |Cite
|
Sign up to set email alerts
|

Making transmission schedules immune to topology changes in multi-hop packet radio networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
121
0
1

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 37 publications
(122 citation statements)
references
References 9 publications
0
121
0
1
Order By: Relevance
“…This number of possible collisions depends on the degree of their difference polynomial. In order to guarantee that every node can transmit data to any neighbor in at least one slot during one frame, the non-covering condition can be expressed as [8] …”
Section: A Tsma and T-tsmamentioning
confidence: 99%
See 1 more Smart Citation
“…This number of possible collisions depends on the degree of their difference polynomial. In order to guarantee that every node can transmit data to any neighbor in at least one slot during one frame, the non-covering condition can be expressed as [8] …”
Section: A Tsma and T-tsmamentioning
confidence: 99%
“…To address the topology-dependent problem, Chlamtac and Farago [8] have proposed a schedule-based topology unaware protocol so-called time spread multiple access (TSMA) protocol. Though independent of the detailed topology of the network, TSMA depends on the maximum nodal degree of the network.…”
Section: ⅰ Introductionmentioning
confidence: 99%
“…This may be an issue for time sensitive applications that have stringent packet delivery deadlines. Deterministic allocation protocols, such as TDMA and TSMA, assign each node a transmission schedule indicating in which of the synchronized slots a node has the right to access the wireless medium [l], [2]. These protocols were primarily designed to support reliable unicast transmissions by guaranteeing that each node is assigned at least one collision-free slot to each of its neighbors.…”
Section: Introductionmentioning
confidence: 99%
“…Also, the optimal scheduling algorithms mostly require complete topology information. Recently, an interesting scheduling algorithm which does not require any topology information has been proposed in [1]. This algorithm is topology transparent, and guarantees that each node has at least one collision-free slot in each frame.…”
Section: Introductionmentioning
confidence: 99%
“…Some variations of this scheduling scheme are introduced in [2] [3][8] [10]. Our algorithm is based on the algorithm given in [1].…”
Section: Introductionmentioning
confidence: 99%