Abstract
The 60 GHz millimeter wave (mmWave) has become a promising technology for outdoor mmWave mesh networks. Different from mmWave enabled indoor wireless applications, outdoor mmWave mesh networks have orders of magnitude longer range and smaller transmitter density, which leads to the pseudo-wired feature. To exploit spatial reuse under the pseudo-wired abstraction, we study a frame-based scheduling algorithm for mmWave outdoor mesh networks to minimize the transmission time. By transforming this problem into a minimum weight matching decomposition problem, we propose a graph matching based decomposition algorithm, which not only provides provable performance guarantee but also comes with a lower time complexity than that of previous algorithms. Theoretic proofs for the performance are given and simulations results further validate the superiority of our proposed algorithm.
Original language | English |
---|---|
Title of host publication | 2017 International Conference on Computing, Networking and Communications, ICNC 2017 |
Publisher | IEEE |
Pages | 224-229 |
Number of pages | 6 |
ISBN (Electronic) | 9781509045884 |
DOIs | |
Publication status | Published - 10 Mar 2017 |
Event | 2017 International Conference on Computing, Networking and Communications, ICNC 2017 - Silicon Valley, United States Duration: 26 Jan 2017 → 29 Jan 2017 |
Conference
Conference | 2017 International Conference on Computing, Networking and Communications, ICNC 2017 |
---|---|
Country/Territory | United States |
City | Silicon Valley |
Period | 26/01/17 → 29/01/17 |
Keywords
- approximate algorithms
- graph matching
- outdoor mmWave mesh networks
- transmission scheduling
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering