Initially, a systematic characterisation of all the possible ways in which two communicating pairs of nodes can interfere with each other is made. Using this as a building block and assuming independence of the stations, an estimate for the network throughput can be derived. The latter proves to be quite accurate for symmetric networks and manages to follow the performance trends in an arbitrary network. Following this, a more detailed Markovian-based mathematical model is proposed for the analysis of the hidden node case. This approach does not rely on common assumptions, such as renewal theory and node synchronisation, and is highly accurate, independently of the system parameters, unlike prior methods. Moreover, the usual decoupling approximation is not adopted; on the contrary, a joint view of the competing stations is taken into consideration. The model is firstly developed based on the assumption that the network stations employ a constant contention window for their backoff process. However, later in the thesis this assumption is relaxed, and performance curves are derived for the case when the stations employ the Binary Exponential Backoff Scheme, as is the case in practice. The Markovian state space is kept relatively small by employing an iterative technique that computes the unknown distributions. The adoption of this technique makes the analysis computationally efficient.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:663071 |
| Date | January 2006 |
| Creators | Tsertou, Athanasia |
| Publisher | University of Edinburgh |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://hdl.handle.net/1842/14589 |
Page generated in 0.002 seconds