We show an improved throughput scaling law for an ultrawide band (UWB) ad hoc network by using a modified hierarchical cooperation (HC) strategy; the n wireless nodes are assumed to be randomly sited. In a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent α for certain operating regimes due to the power-limited characteristics. It also turns out that the use of HC is helpful in improving the throughput scaling of our UWB network in some conditions. More specifically, assuming that the bandwidth scales faster than n α+1 (log n) α/2 , it is shown that the HC protocol outperforms nearest multi-hop routing for 2 < α < 3 while using nearest multi-hop routing leads to higher throughput for α ≥ 3.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering