Distributed situation-aware scheduling algorithm for network navigation

Network navigation is a promising paradigm enabling location-awareness in wireless networks. In a wireless navigation network, agents estimate their locations based on inter- and intra-node measurements. Due to the scarcity of wireless resources, it is critical to design scheduling algorithms that adaptively determine with whom and when an agent should perform inter-node measurements, in order to achieve both high navigation accuracy and efficient channel usage. This paper develops a framework for the design of distributed scheduling algorithms for asynchronous wireless navigation networks, in which the algorithm parameters are optimized based on the time evolution of agents' localization errors. The results lead to high-accuracy, efficient, and flexible network navigation.