Analysis of large-scale experimental data from wireless networks

Stephen A. Seidel; Michael T. Mehari; Charles Colbourn; Eli De Poorter; Ingrid Moerman; Violet Syrotiuk

doi:10.1109/INFCOMW.2018.8407023

Analysis of large-scale experimental data from wireless networks

Stephen A. Seidel, Michael T. Mehari, Charles Colbourn, Eli De Poorter, Ingrid Moerman, Violet Syrotiuk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

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.

Original language	English (US)
Title of host publication	INFOCOM 2018 - IEEE Conference on Computer Communications Workshops
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	535-540
Number of pages	6
ISBN (Electronic)	9781538659793
DOIs	https://doi.org/10.1109/INFCOMW.2018.8407023
State	Published - Jul 6 2018
Event	2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018 - Honolulu, United States Duration: Apr 15 2018 → Apr 19 2018

Other

Other	2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018
Country	United States
City	Honolulu
Period	4/15/18 → 4/19/18

ASJC Scopus subject areas

Control and Optimization
Artificial Intelligence
Computer Networks and Communications

Access to Document

10.1109/INFCOMW.2018.8407023

Fingerprint Dive into the research topics of 'Analysis of large-scale experimental data from wireless networks'. Together they form a unique fingerprint.

Cite this

Seidel, S. A., Mehari, M. T., Colbourn, C., De Poorter, E., Moerman, I., & Syrotiuk, V. (2018). Analysis of large-scale experimental data from wireless networks. In INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (pp. 535-540). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFCOMW.2018.8407023

Analysis of large-scale experimental data from wireless networks. / Seidel, Stephen A.; Mehari, Michael T.; Colbourn, Charles; De Poorter, Eli; Moerman, Ingrid; Syrotiuk, Violet.

INFOCOM 2018 - IEEE Conference on Computer Communications Workshops. Institute of Electrical and Electronics Engineers Inc., 2018. p. 535-540.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Seidel, SA, Mehari, MT, Colbourn, C, De Poorter, E, Moerman, I & Syrotiuk, V 2018, Analysis of large-scale experimental data from wireless networks. in INFOCOM 2018 - IEEE Conference on Computer Communications Workshops. Institute of Electrical and Electronics Engineers Inc., pp. 535-540, 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, Honolulu, United States, 4/15/18. https://doi.org/10.1109/INFCOMW.2018.8407023

@inproceedings{4d23a2cdf7ee40a5ae1701d7269e6d0b,

title = "Analysis of large-scale experimental data from wireless networks",

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.",

author = "Seidel, {Stephen A.} and Mehari, {Michael T.} and Charles Colbourn and {De Poorter}, Eli and Ingrid Moerman and Violet Syrotiuk",

year = "2018",

month = jul,

day = "6",

doi = "10.1109/INFCOMW.2018.8407023",

language = "English (US)",

pages = "535--540",

booktitle = "INFOCOM 2018 - IEEE Conference on Computer Communications Workshops",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018 ; Conference date: 15-04-2018 Through 19-04-2018",

}

TY - GEN

T1 - Analysis of large-scale experimental data from wireless networks

AU - Seidel, Stephen A.

AU - Mehari, Michael T.

AU - Colbourn, Charles

AU - De Poorter, Eli

AU - Moerman, Ingrid

AU - Syrotiuk, Violet

PY - 2018/7/6

Y1 - 2018/7/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85049895959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85049895959&partnerID=8YFLogxK

U2 - 10.1109/INFCOMW.2018.8407023

DO - 10.1109/INFCOMW.2018.8407023

M3 - Conference contribution

AN - SCOPUS:85049895959

SP - 535

EP - 540

BT - INFOCOM 2018 - IEEE Conference on Computer Communications Workshops

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018

Y2 - 15 April 2018 through 19 April 2018

ER -