By Topic

An overview of scheduling algorithms in mobile ad-hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Enzai, N. ; Fac. of Electr. Eng., Univ. Teknol. MARA (UiTM), Dungun, Malaysia ; Rais, S.S. ; Darus, R.

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.

Published in:

Computer Applications and Industrial Electronics (ICCAIE), 2010 International Conference on

Date of Conference:

5-8 Dec. 2010