A novel scheduling algorithm for densely-deployed wireless stations in urban areas

  • Authors:
  • Hirozumi Yamaguchi;Akihito Hiromori;Teruo Higashino;Shigeki Umehara;Hirofumi Urayama;Masaya Yamada;Taka Maeno;Shigeru Kaneda;Mineo Takai

  • Affiliations:
  • Osaka University, Suita, Japan;Osaka University, Suita, Japan;Osaka University, Suita, Japan;Sumitomo Electric Industries, LTD., Osaka, Japan;Sumitomo Electric Industries, LTD., Osaka, Japan;Sumitomo Electric Industries, LTD., Osaka, Japan;Space-Time Engineering Japan, Inc., Tokyo, Japan;Space-Time Engineering, LLC., Los Angeles, CA, USA;University of California, Los Angeles, Los Angeles, CA, USA

  • Venue:
  • Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a scheduling algorithm for a set of wireless stations such as road-side access points for vehicular networks and outdoor WiFi stations, which are deployed in wide urban areas and may compete with each other for limited wireless resources. Different from a number of conventional approaches most of which consider detailed information on individual stations and signal interference among them, we focus more on geography of the areas of interest, and provide a novel algorithm that pursues the best balance among (i) optimality of resource utilization, (ii) robustness to new station installation and traffic demand changes, and (iii) scalability to the population of stations and area size. We have confirmed the performance by experimental simulations with several scenarios, and the applicability of approach has been testified by a case study on a scheduling problem for roadside access points of vehicular networks in cooperation with a manufacturing corporation.