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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Throughput Upper Bound for Random Wireless Network


    Contributors:


    Publication date :

    2012-12-01


    Size :

    138346 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Upper and Lower Bound Estimation of Runway Throughput in the Presence of Uncertainty

    Bae, S.W. / Clarke, J.-P. | British Library Conference Proceedings | 2013


    A Sliding Mode Controller with Upper Bound Identifier Using RBF Network

    Liu, Y.-m. / Wu, C.-p. | British Library Online Contents | 2001


    Increasing the Throughput of an Unlicensed Wireless Network through Retransmissions

    Ramezanipour, Iran / Nardelli, Pedro H. J. / Alves, Hirley et al. | IEEE | 2018


    Study on ironing using upper-bound approach

    Wu, J. / Meng, X. | British Library Online Contents | 1995


    Upper-Bound SEU Rates In Anisotropic Fluxes

    Edmonds, Larry D. | NTRS | 1993