Optimisation of spatial CSMA using a simple stochastic geometry model for 1D and 2D networks
| Autor: | Nadjib Achir, Oyunchimeg Shagdar, Paul Muhlethaler, Younes Bouchaala |
|---|---|
| Přispěvatelé: | Laboratoire de Traitement et Transport de l'Information (L2TI), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC), Wireless Networking for Evolving & Adaptive Applications (EVA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), VEhicule DEcarboné et COmmuniquant et sa Mobilité (VeDeCom) |
| Rok vydání: | 2016 |
| Předmět: |
Stochastic geometry models of wireless networks
Wireless network Network packet business.industry Computer science Node (networking) ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Transmitter 020206 networking & telecommunications Throughput 02 engineering and technology Topology [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Stochastic geometry Throughput (business) Wireless sensor network Computer network Rayleigh fading |
| Zdroj: | IWCMC IWCMC 2016-12th International Wireless Communications & Mobile Computing Conference IWCMC 2016-12th International Wireless Communications & Mobile Computing Conference, Sep 2016, Paphos, Cyprus. pp.558-563, ⟨10.1109/IWCMC.2016.7577118⟩ |
| DOI: | 10.1109/iwcmc.2016.7577118 |
| Popis: | International audience; In modern wireless networks especially in Machine-to-Machine (M2M) systems and in the Internet of Things (IoT) there is a high densities of users and spatial reuse has become an absolute necessity for telecommunication entities. This paper studies the maximum throughput of Carrier Sense Multiple Access (CSMA) in scenarios with spatial reuse. Instead of running extensive simulation with complex tools which would be somewhat time consuming, we evaluate the spatial throughput of a CSMA network using a simple model which produces closed formulas and give nearly instantaneous values. This simple model allows us to optimize the network easily and study the influence of the main network parameters. The nodes will be deployed as a Poisson Point Process (PPP) of a one or two dimensional space. To model the effect of (CSMA), we give random marks to our nodes and to elect transmitting nodes in the PPP we choose those with the smallest marks in their neighborhood. To describe the signal propagation, we use a signal with power-law decay and we add a random Rayleigh fading. To decide whether or not a transmission is successful, we adopt the Signal-over-Interference Ratio (SIR) model in which a packet is correctly received if its transmission power divided by the interference power is above a capture threshold. We assume that each node in our PPP has a random receiver at a typical distance from the transmitter i.e. the average distance between a node and its closest neighbor. We also assume that all the network nodes always have a pending packet. With all these assumptions, we analytically study the density of throughput of successful transmissions and we show that it can be optimized with regard to the carrier-sense threshold. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|