Algorithmic Foundations of Wireless Networks
Wireless networks have broad coverage from a personal network such as BlueTooth PAN to a small/medium/large scale network such as WAN/5G. There are a number of technologies for implementing direct/multi-hop communications between two wireless peers. Though the wireless networks may be different in size, application areas, particular requirements, and physical/engineering technologies, they have the common fundamental problems that should be resolved by the proper algorithms under certain contexts. For examples, the applications of scheduling, optimization, flow control, and area coverage algorithms exist in all types of wireless networks for the purposes such as MAC, routing, and topology control. The central theme of this special issue is to investigate novel algorithmic solutions for a broad range of wireless network applications and highlight the algorithmic foundations that could serve for multiple similar applications so that researchers can efficiently learn the state of arts in a field, link similar problems under different contexts, and find effective theoretical tools to build the solutions for the specified applications. This special issue encourages submissions of high-quality unpublished papers both reporting original works in theoretical research and the tutorial articles on summarizing the algorithmic foundations that have been applied/investigated to solve similar problems in different applications.
Edited by: Wei Cheng, Abdallah Khreishah, Ruixuan Li and Hao Wang