Browsing by Subject "Packet transmissions"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Open Access Enhanced position estimation via node cooperation(IEEE, 2010) Sahinoglu, Z.; Gezici, SinanTwo-way time-of-arrival (TW-ToA) is a widely used ranging protocol that can provide the distance between two devices without time synchronization. One drawback of the TW-ToA is poor positioning accuracy in the absence of a sufficient number of reference ranging devices. Also, for a self-positioning system with a limited battery life, it might be necessary to limit the number of transmissions while satisfying accuracy constraints. In this paper, a cooperative positioning protocol [1] is studied, which can improve positioning accuracy compared to the conventional TW-ToA based positioning systems and also facilitate positioning with fewer packet transmissions; hence, it can prolong battery life on average. The maximum likelihood estimator is obtained for the cooperative technique and the limits on the positioning accuracy are quantified in terms of the Cramer-Rao lower bound (CRLB). Simulation results are provided in order to show performance improvements. ©2010 IEEE.Item 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.Item Open Access Throughput modeling of single hop CSMA networks with non-negligible propagation delay(IEEE, 2013) Koseoglu, M.; Karasan, E.We analyze the performance of the CSMA protocol under propagation delays that are comparable with packet transmission times. We propose a semi-Markov model for the 2-node CSMA channel. For the 2-node case, the capacity reduces to 40% of the zero-delay capacity when the one-way propagation delay is 10% of the packet transmission time. We then extend this model and obtain the optimum symmetric probing rate that achieves the maximum network throughput as a function of the average propagation delay, d, and the number of nodes sharing the channel, N. The proposed model predicts that the total capacity decreases with d-1 as N goes to infinity when all nodes probe the channel at the optimum rate. The optimum probing rate for each node decreases with 1/N and the total optimum probing rate decreases faster than d-1 as N goes to infinity. We investigate how the short-term unfairness problem in CSMA worsens as the propagation delay increases and propose a back-off mechanism to mitigate this issue. The theoretical results presented in this paper can be used as a benchmark for the performance improvements provided by algorithms that have already been developed.