Abstract
An alternative model of restricted mobility was proposed for the analysis of scaling of wireless networks. In this model nodes were considered confined to overlapping neighborhoods. The succession of neighborhoods that a packet crosses from sender to destination was predetermined by a routing algorithm. The results show that the achievable orders of thoroughput per source-destination pair can be obtained as a function of properties of the node locations and neighborhood dimensions.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 437 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics