Browsing by Subject "Single-hop"

Now showing 1 - 2 of 2

Open Access
Goodput and throughput comparison of single-hop and multi-hop routing for IEEE 802.11 DCF-based wireless networks under hidden terminal existence
(John Wiley and Sons Ltd, 2016) Aydogdu, C.; Karasan, E.
We investigate how multi-hop routing affects the goodput and throughput performances of IEEE 802.11 distributed coordination function-based wireless networks compared with direct transmission (single hopping), when medium access control dynamics such as carrier sensing, collisions, retransmissions, and exponential backoff are taken into account under hidden terminal presence. We propose a semi-Markov chain-based goodput and throughput model for IEEE 802.11-based wireless networks, which works accurately with both multi-hopping and single hopping for different network topologies and over a large range of traffic loads. Results show that, under light traffic, there is little benefit of parallel transmissions and both single-hop and multi-hop routing achieve the same end-to-end goodput. Under moderate traffic, concurrent transmissions are favorable as multi-hopping improves the goodput up to 730% with respect to single hopping for dense networks. At heavy traffic, multi-hopping becomes unstable because of increased packet collisions and network congestion, and single-hopping achieves higher network layer goodput compared with multi-hop routing. As for the link layer throughput is concerned, multi-hopping increases throughput 75 times for large networks, whereas single hopping may become advantageous for small networks. The results point out that the end-to-end goodput can be improved by adaptively switching between single hopping and multi-hopping according to the traffic load and topology. Copyright © 2015 John Wiley & Sons, Ltd.
Open Access
Spatio-temporal analysis of throughput for single-hop CSMA networks
(Institute of Electrical and Electronics Engineers Inc., 2014) Koseoglu, M.; Karasan, E.
Throughput model for non-persistent CSMA networks which was proposed by Kleinrock and Tobagi has been widely used, although it provides a loose lower bound when nodes are distributed in a large area because the analysis assumes that the propagation delay between each pair of users equals to the largest propagation delay in the network. We present a throughput analysis which considers the spatial distribution of nodes. We obtain a simple throughput expression which predicts throughput with an 8% maximum error whereas the earlier model results in a 44% error when the maximum propagation delay equals to the packet transmission time. © 2014 IEEE.