Local base station assignment with time intervals in mobile computing environments
From MaRDI portal
Recommendations
- A new time-based algorithm for positioning mobile terminals in wireless networks
- Distributed Computing – IWDC 2005
- scientific article; zbMATH DE number 1114012
- Scheduling solution for the IEEE 802.16 base station
- Cellular channel assignment: A new localized and distributed strategy
- Optimum and Equilibrium in Assignment Problems With Congestion: Mobile Terminals Association to Base Stations
- Optimization of Base Stations Positioning in Mobile Networks
Cites work
- scientific article; zbMATH DE number 3906496 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256657 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Matching theory
- On-Line Load Balancing of Temporary Tasks
- Online perfect matching and mobile computing
- Some simplified NP-complete graph problems
- The many facets of linear programming
Cited in
(3)
This page was built for publication: Local base station assignment with time intervals in mobile computing environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877045)