Close category search window
 

Properties of a transmission assignment algorithm for multiple-hop packet radio 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)
Hammond, J.L. ; Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA ; Russell, H.B.

We study an algorithm, originally defined by Lyui (1991), for assigning collision-free broadcast transmissions for packet radio networks. The method has a number of advantages - it is distributed, fair, permits each terminal to calculate a different frame size, requires only a limited exchange of information, and does not require a contention-based channel-access protocol. These properties make the assignment algorithm particularly useful for dynamic ad hoc networks because the transmission assignments can be easily and quickly adapted to local changes in the topology. An improved description of Lyui's algorithm is given and new simulation results are presented to demonstrate the properties of the transmission assignments for a variety of large networks.

Published in:
Wireless Communications, IEEE Transactions on  (Volume:3 ,  Issue: 4 )

Date of Publication: July 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.