Advanced search
1 file | 2.37 MB
Author
Organization
Abstract
The experimental design and subsequent analysis of the data collected from experimentation are tightly coupled. This paper considers techniques for the analysis of data collected from experimentation based on a locating array. Because locating arrays can be highly unbalanced, new analysis techniques are required. In order to cope with noise in the measured performance data, a search is conducted to identify the significant parameters and interactions that impact the data. A novel "heavy hitters" bounded breadth-first search (BFS) tree algorithm is proposed for analysis. It is used to validate data collected from large-scale experimentation with a physical wireless network testbed and a wireless network simulator, varying 24 and 75 parameters, respectively.

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 2.37 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Seidel, Stephen A., Michael Mehari, Charles J. Colbourn, Eli De Poorter, Ingrid Moerman, and Violet R. Syrotiuk. 2018. “Analysis of Large-scale Experimental Data from Wireless Networks.” In IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 535–540. New york: Ieee.
APA
Seidel, S. A., Mehari, M., Colbourn, C. J., De Poorter, E., Moerman, I., & Syrotiuk, V. R. (2018). Analysis of large-scale experimental data from wireless networks. IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS) (pp. 535–540). Presented at the IEEE Conference on Computer Communications (IEEE INFOCOM), New york: Ieee.
Vancouver
1.
Seidel SA, Mehari M, Colbourn CJ, De Poorter E, Moerman I, Syrotiuk VR. Analysis of large-scale experimental data from wireless networks. IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). New york: Ieee; 2018. p. 535–40.
MLA
Seidel, Stephen A., Michael Mehari, Charles J. Colbourn, et al. “Analysis of Large-scale Experimental Data from Wireless Networks.” IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). New york: Ieee, 2018. 535–540. Print.
@inproceedings{8584122,
  abstract     = {The experimental design and subsequent analysis of the data collected from experimentation are tightly coupled. This paper considers techniques for the analysis of data collected from experimentation based on a locating array. Because locating arrays can be highly unbalanced, new analysis techniques are required. In order to cope with noise in the measured performance data, a search is conducted to identify the significant parameters and interactions that impact the data. A novel {\textacutedbl}heavy hitters{\textacutedbl} bounded breadth-first search (BFS) tree algorithm is proposed for analysis. It is used to validate data collected from large-scale experimentation with a physical wireless network testbed and a wireless network simulator, varying 24 and 75 parameters, respectively.},
  author       = {Seidel, Stephen A. and Mehari, Michael and Colbourn, Charles J. and De Poorter, Eli and Moerman, Ingrid and Syrotiuk, Violet R.},
  booktitle    = {IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS)},
  isbn         = {978-1-5386-5979-3},
  issn         = {2159-4228},
  language     = {eng},
  location     = {Honolulu, HI},
  pages        = {535--540},
  publisher    = {Ieee},
  title        = {Analysis of large-scale experimental data from wireless networks},
  year         = {2018},
}

Web of Science
Times cited: