Quality, Reliability, Security and Robustness in Heterogeneous Networks. 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range Communications Workshop, DSRC 2010, Houston, TX, USA, November 17-19, 2010, Revised Selected Papers

Research Article

Empirical Analysis of Local Round Trip Time for Wireless Traffic Differentiation

Download
418 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-29222-4_16,
        author={Guangzhi Qu and Michael Nefcy},
        title={Empirical Analysis of Local Round Trip Time for Wireless Traffic Differentiation},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range Communications Workshop, DSRC 2010, Houston, TX, USA, November 17-19, 2010, Revised Selected Papers},
        proceedings_a={QSHINE},
        year={2012},
        month={10},
        keywords={Wireless Network Temporal Analysis Local Round Trip Time},
        doi={10.1007/978-3-642-29222-4_16}
    }
    
  • Guangzhi Qu
    Michael Nefcy
    Year: 2012
    Empirical Analysis of Local Round Trip Time for Wireless Traffic Differentiation
    QSHINE
    Springer
    DOI: 10.1007/978-3-642-29222-4_16
Guangzhi Qu1,*, Michael Nefcy1,*
  • 1: Oakland University
*Contact email: gqu@oakland.edu, mmnefcy@oakland.edu

Abstract

This paper focuses on how to differentiate wireless traffic from wired peer by using the temporal TCP characteristics of SYN, FIN, and ACK local round trip times (LRTT) found in all TCP sessions. With these session-based temporal characteristics, traffic from wireless and wired nodes can be differentiated by exploiting the fundamental differences between Ethernet and 802.11b/g/n. The effort of this paper is then on analyzing the resulting empirical LRTT data extensively and designing several algorithms for effective wireless host discovery. Most algorithms are light-weight, with little memory overhead, and can be easily implemented on commodity hardware. Ultimately, SYN, FIN, and ACK LRTTs can be compared against each other to discover wireless hosts regardless of network speeds.