By Topic

A history-based scheduling protocol for 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

3 Author(s)
Y. Du ; Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA ; Y. Bao ; J. J. Garcia-Luna-Aceves

This paper presents the history-based scheduling (HBS) protocol for collision-free channel access in ad hoc networks. In HBS, the channel is scheduled based on the history of activity of each node in order to attain higher channel utilization than traditional distributed scheduling schemes based on node activation. Conflict-free access to the channel is determined at each node based on a priority list of the nodes within two hops of each node that takes into account the activity history of each node. To keep the activity history of each node synchronized, a node that is assigned the channel and has no data packet to transmit simply transmits a "nothing-to-transmit" (NT) packet in that time slot. In this way, the exchange of the signal packet should be reduced. The throughput and delay characteristics of HBS are compared analytically and by simulation with those of CSMA/CA and the node activation multiple access (NAMA) protocol.

Published in:

Computer Communications and Networks, 2003. ICCCN 2003. Proceedings. The 12th International Conference on

Date of Conference:

20-22 Oct. 2003