Abstract
The throughput scaling problem for wireless communication networks was considered and solved using a deterministic approach. The achievability results used the transmitter-receiver distances, nonempty squarelets and the crowding factor as the parameters and conditions on the node locations. The throughput for a network with a particular squarelet size and a specified crowding factor was determined and proved.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 351 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2002 |
| Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: Jun 30 2002 → Jul 5 2002 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics