By Topic

Congestion Based Opportunistic Packet Scheduling Algorithm with Variable Size Packets Support in 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
$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)
Hailun Xia ; Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China ; Zhimin Zeng

In wireless multi-hop Ad hoc networks, contending existing at MAC layer could easily results in congestion, and the first-in-first-out queue within the nodes could make the head of the queue blocked, which affects the transmitting of the following packets. In this paper, we present a variable packet size supporting and congestion-based opportunistic packet scheduling (VS-CBOS) algorithm, in which the sender sends multicast RTS frame targeted to several next-hop receivers, the receiver will reply with priority-based CTS by the probability according to its queue congestion level, and reservation subheader is added to DATA frame to support variable packet size. The performance analysis and simulation results show that VS-CBOS can remarkably increase the signaling handshake success ratio, the network end-to-end saturation throughput and the fairness among traffic flows.

Published in:

2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM)

Date of Conference:

23-25 Sept. 2010