Throughput Upper Bound for Random Wireless Network

In this paper we investigate the throughput of an ad-hoc wireless network with independent identically distributed nodes. This scenario have been studied before and achievable throughput have been calculated as O(1/√nlogn). Here, by using the Voronoi tessellation and modifying the cell area, we could decrease the area of cells and consequently decline the transmission power. Smaller transmission power results in lower interference and higher throughput. Then, not only we compute new upper bound for throughput as o(1/√n log...log (n)) but we also obtain range of throughput as o(1/√n log n ) ≤ o(n) ≤ o(1/√n) which is variable according to the area of cells so that with the condition of scenario, it can be changed.