1986
DOI: 10.1016/0169-7552(86)90082-6
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of channel access schemes in multihop packet radio networks with regular structure by simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

1989
1989
2016
2016

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…[1]), communication or broadcast protocols such as slotted ALOHA, CSMA, BTMA and CDMA have obtained considerable attention with typical applications in computer performance evaluation, radio packet switching, satellite communication and data processing (cf. [3], [4], [11], [14], [17], [21], [22]).…”
Section: Introductionmentioning
confidence: 99%
“…[1]), communication or broadcast protocols such as slotted ALOHA, CSMA, BTMA and CDMA have obtained considerable attention with typical applications in computer performance evaluation, radio packet switching, satellite communication and data processing (cf. [3], [4], [11], [14], [17], [21], [22]).…”
Section: Introductionmentioning
confidence: 99%
“…An iterative method results in product form solution and decides whether the given input data rate is feasible to transmit on a network or not. Same model was extended by [7,8] replacing links by stations. But [5] was not able to capture the comprehensive access mechanism behavior specifically did not model packet loss due to MAC behavior and also lacked binary exponential backoff mechanism.…”
Section: Related Workmentioning
confidence: 99%
“…This inherent coordination discrepancy was first modeled in [1] and is largely due to information asymmetry between contending flows. Some of the literature is unable to model behavior of comprehensive MAC protocol like 802.11 [5][6][7][8]. Analysis of 802.11 protocols is mostly done for backlogged stations [3,9,10]; only model in [1] predicts per-flow throughput for any given flow rates in the WMN.…”
Section: Introductionmentioning
confidence: 99%
“…These 3.1 CSMA-protocols (cf. [2], [4], [5], [6], [8], [13], [20], [21], [22]) (i) CSMA Let the sources correspond to transmitters that can be graphically represented such that adjacent sources (neighbors) cannot be busy messages. This is known as the "bidden terminal problem".…”
Section: Proof Of the Theoremmentioning
confidence: 99%
“…Since the introduction of the ALOHA-system in the early seventies, a large variety of random access protocols for (tele)communication networks has been proposed and implemented over the last decade (cf. [4], [19], [20], [21]). Particularizing to CSMA-protocols and variants as BTMA (cf.…”
Section: Introductionmentioning
confidence: 99%