2002
DOI: 10.21236/ada461756
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid Channel Access Scheduling in Ad Hoc Networks

Abstract: We present the hybrid activation multiple access (HAMA)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(22 citation statements)
references
References 12 publications
(24 reference statements)
0
22
0
Order By: Relevance
“…It highly depends on the idle duty cycle defined as the effective duty cycle when networks are idle. k f ix determines the idle duty cycle of the fixed scheme, and the idle duty cycle is 100ms/1.5s × 100 = 6.6%, 13.3%, 20% when k f ix is 100ms, 200ms, and 300ms, respectively, while the idle duty cycle of the adaptive scheme is the same as the SDF overhead (3.3%) defined by (4). Hence, the adaptive scheme is highly superior than the fixed scheme.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…It highly depends on the idle duty cycle defined as the effective duty cycle when networks are idle. k f ix determines the idle duty cycle of the fixed scheme, and the idle duty cycle is 100ms/1.5s × 100 = 6.6%, 13.3%, 20% when k f ix is 100ms, 200ms, and 300ms, respectively, while the idle duty cycle of the adaptive scheme is the same as the SDF overhead (3.3%) defined by (4). Hence, the adaptive scheme is highly superior than the fixed scheme.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The scheduling-based MAC is proposed to achieve contention-free communication [8], [9], [26]. However, it assumes that contenders have consistent knowledge of their two-hop neighborhood and traffic distribution, which may be prohibitively expensive to maintain with a single shared channel.…”
Section: Mitigating the Hidden/exposed-terminal Problemmentioning
confidence: 99%
“…For example, when the threshold is set to SR threshd i ¼ ð1 À p rss i Þ þ ð1 À p rss iþ1 Þ À Á =2, we would lose the throughput at the RSSs whose SRs are less than SR threshdi . Therefore, the cost (in terms of throughput) can be calculated with (9). However, the time (T 0 i ¼ P 1Àp rss j <SR threshd i T rssj or P j i T rssj ) saved by not contending for the channel at the RSSs whose SRs are less than SR threshdi could be utilized for packet transmissions at the RSSs with higher SRs.…”
Section: Optimal Threshold For Channel Access Srmentioning
confidence: 99%
“…Schedule-based solutions to the medium access problemsuch as those presented in [4], [3], [14] -eliminate collisions, improving channel efficiency substantially. Furthermore, using time slots to arbitrate medium access makes it possible to do more effective sleep-scheduling [14] and thus considerably improve energy efficiency.…”
Section: Introductionmentioning
confidence: 99%