Referenced Items are not available for this document.
We consider multi-hop radio networks, also known as packet radio networks, or ad hoc networks. Consider n nodes located in a disk of area A m2., with each node capable of transmitting at W bits/sec over a common channel. If the nodes are randomly located and each node's destination is randomly chosen, then each node can obtain a throughput of Θ(w/√n log n) bit/sec for its destination, under optimal operation. In the best case when the node locations, OD-pair assignments, and traffic patterns can be optimally chosen, then the entire network can transport Θ(W√An) bit-meters/sec. In this case, we say that the network transports 1 bit-meter when 1 bit has been transported over a distance of 1 meter
Published in:
Decision and Control, 1999. Proceedings of the 38th IEEE Conference on
(Volume:4
)
Date of Conference: 1999
- Page(s):
- 3562 - 3563 vol.4
- Meeting Date :
- 07 Dec 1999-10 Dec 1999
- ISSN :
- 0191-2216
- Print ISBN:
- 0-7803-5250-5
- INSPEC Accession Number:
- 6566853
- Conference Location :
- Phoenix, AZ
- Digital Object Identifier :
- 10.1109/CDC.1999.827904
- 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.
