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.
Throughput Upper Bound for Random Wireless Network
01.12.2012
138346 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Upper and Lower Bound Estimation of Runway Throughput in the Presence of Uncertainty
British Library Conference Proceedings | 2013
|A Sliding Mode Controller with Upper Bound Identifier Using RBF Network
British Library Online Contents | 2001
|Upper-Bound SEU Rates In Anisotropic Fluxes
NTRS | 1993
|Upper-Bound Estimates Of SEU in CMOS
NTRS | 1990
|