2011
DOI: 10.5120/1914-2552
|View full text |Cite
|
Sign up to set email alerts
|

Review of Packet Scheduling Algorithms in Mobile Ad Hoc Networks

Abstract: Scheduling algorithms are important components in the provision of guaranteed quality of service parameters. The design of scheduling algorithms for mobile ad hoc networks is challenging one because of highly variable link error rates and dynamic nature of the network. This paper provides a survey of scheduling techniques in wireless Ad hoc networks. Desirable features and classifications of schedulers for the different scheduling algorithms are discussed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 24 publications
0
11
0
Order By: Relevance
“…Also, theoretically grounded ways of improving effectiveness of software testing are offered in a number of studies. For example, features of software for mobile communication networks are taken into account in [6]. Issues of testing quality evaluation for boundedly nondeterministic systems are considered in [7].…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…Also, theoretically grounded ways of improving effectiveness of software testing are offered in a number of studies. For example, features of software for mobile communication networks are taken into account in [6]. Issues of testing quality evaluation for boundedly nondeterministic systems are considered in [7].…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…when the server has no more packet in the queue, the algorithm reinitialized by setting all the vc ,vc i and packet counts in each session f i to zero. Note that when a session becomes backlogged after an idle period, (3) indicates that ‫ܨ‬ may be less than ‫ܿݒ‬ሺܽ ሻ. Therefore, it is possible that ‫ܨ‬ ௨௧ will be less than the finishing time of the last served packet .…”
Section: Burst-service Self-clock Fair Queuementioning
confidence: 99%
“…During ON intervals a constant packet rate is used with inter arrival time equal to 0.1 sec, while no packet is generated during OFF intervals. ON and OFF intervals are constant but their periods are different in f 2 and f 3 . We assume that the ON interval is 0.7 sec with a 28 sec period in f 2 while it is 0.3 sec with 12 sec period in f 3 .…”
Section: Simulation Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…The packet scheduling algorithm determines the order of packet delivery based on the nature of the packet. Hence, the delay sensitive real time applications will be processed faster than the non-real time applications (Annadurai, 2011).…”
Section: Introductionmentioning
confidence: 99%