By Topic

Design of New Scheduling Algorithm for Ad hoc Networks with Capability of Differential Service

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
$33 $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

2 Author(s)
Seid Hossein Hosseini Nejad Gazani ; Computer Engineeriong department, Islamic Azad University, Ahar Branch, Ahar, Iran. S.HosseiniNejad@gmail.com ; Mahmood Fathy

Wireless networking and multimedia contents are two rapidly emerging technological trends. From among which ad-hoc networks can be mentioned With the development of ad-hoc networks, we can anticipate the extensive of the multimedia application in personal networks or other collaborative scenarios. Ad-hoc network is also mainly constrained the bandwidth. Propose of scheduling in this research is to service the flows by both selecting the fixed or minimally mobile nodes that provide network backbone access and dynamically adopting the contention window size of flows. This model is robust to mobility and variances in channel capacity and imposes no control message overhead on the network, in calculating CW size, attenting to collision rate and flow's current QoS.

Published in:

2006 International Conference on Communication Technology

Date of Conference:

27-30 Nov. 2006