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