Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A Fault-Tolerant Distributed Channel Allocation Scheme for Cellular Networks
IEEE Transactions on Computers
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Multicell downlink capacity with coordinated processing
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
Network coordination for spectrally efficient communications in cellular systems
IEEE Wireless Communications
WiMAX fractional frequency reuse for rural environments
IEEE Wireless Communications
Bandwidth partitioning in decentralized wireless networks
IEEE Transactions on Wireless Communications - Part 2
Hi-index | 0.00 |
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.