On the spatial reuse on large random wireless networks

Speaker : Paola Bermolen and Federico Larroca
Universidad de la Republica, Montevideo
Date: 29/10/2014
Time: 2:00 pm - 2:30 pm
Location: LINCS Meeting Room 40


In this work we analyze the estimation of the spatial reuse of a wirelessnetwork equiped witha Medium Access Control (MAC) mechanism based on 802.11’s DistributedCoordination Function (DCF). Moreover we assume that the RTS/CTS handshakeis enabled in order to avoid the hidden node problem.Our analysis is based on the definition of Parking Process over a randomgraph (the interference graph of the network) for which only mildassumptions over the distribution of the nodes’s degree are assumed. Then alarge graph limit when the number of nodes goes to infinity is proved whichresults in a system of differential equations representing the evolutionof the nodes’degree. From the solution of this system we can calculate thespatial reuse (or equivalently the jamming constant associated to theparking process).Joint work of Paola Bermolen, Matthieu Jonckheere, Federico Larroca andPascal Moyal