By Topic

NOMAD: Deterministic collision-free channel access with channel reuse in wireless 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

2 Author(s)
Garcia-Luna-Aceves, J.J. ; Comput. Eng. Dept., Univ. of California, Santa Cruz, CA, USA ; Masilamani, A.N.

The Neighborhood Ordering for Medium Access with Determinism (NOMAD) protocol is introduced. NOMAD defines collision-free transmission schedules dynamically and with no need for a predefined number of time slots per transmission frame by coordinating circular permutations of the identifier of nodes in the neighborhoods shared among nodes. NOMAD is shown to attain feasible transmission schedules within a short finite time and to provide channel access intervals of negligible variance. The performance of the NOMAD is compared with the performance of 802.11 DCF and the node activation multiple access (NAMA) protocol, which is representative of distributed transmission scheduling based on probabilistic elections. NOMAD is shown to attain higher throughput than 802.11 and NAMA in static and dynamic ad hoc networks, and to eliminate the large variances in channel access times present in contention-based schemes and prior transmission-scheduling schemes that do not use reservations.

Published in:

Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2011 8th Annual IEEE Communications Society Conference on

Date of Conference:

27-30 June 2011