Referenced Items are not available for this document.
Recently, it has been shown that CSMA-type algorithms can achieve the maximum possible throughput in wireless ad hoc networks. Central to these results is a distributed randomized algorithm which selects schedules according to a product-form distribution. The product-form distribution is achieved by considering a continuous-time Markov model of an idealized CSMA protocol (continuous backoff times, zero propagation/sensing delay, no hidden terminals) under which collisions cannot occur.
Published in:
Information Theory and Applications Workshop, 2009
Date of Conference: 8-13 Feb. 2009
- Page(s):
- 250
- Print ISBN:
- 978-1-4244-3990-4
- INSPEC Accession Number:
- 10702563
- Conference Location :
- San Diego, CA
- Digital Object Identifier :
- 10.1109/ITA.2009.5044953
- Product Type:
- Conference Publications
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.
