An overview of scheduling algorithms in mobile ad-hoc networks
Scheduling algorithms are essential in guaranteeing Quality of Service (QoS) provisioning. Through QoS guarantee, a network application could obtain services which fulfil its specific requirements such as less delay, reduction in loss rate and higher throughput. However, due to dynamic nature of mob...
Saved in:
Published in: | 2010 International Conference on Computer Applications and Industrial Electronics pp. 120 - 124 |
---|---|
Main Authors: | , , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
01-12-2010
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Scheduling algorithms are essential in guaranteeing Quality of Service (QoS) provisioning. Through QoS guarantee, a network application could obtain services which fulfil its specific requirements such as less delay, reduction in loss rate and higher throughput. However, due to dynamic nature of mobile ad-hoc networks (MANETs) which results to frequently changing topology and link breaks, the design of scheduling algorithms becomes more difficult. This paper presents a survey of scheduling techniques specifically developed for ad-hoc wireless networks with regards to their strengths and shortcomings. This is followed by a summary of their simulation parameters. |
---|---|
ISBN: | 1424490545 9781424490547 |
DOI: | 10.1109/ICCAIE.2010.5735059 |