Title
On the stability of scheduling algorithms for network navigation
Abstract
Wireless navigation networks enable location-awareness in GPS-challenged environments. For such networks, scheduling algorithms are needed to improve the navigation accuracy through measurement pair selections under limited communication resource. In this paper, we develop an analytical framework to determine the location error evolution for different scheduling algorithms and network settings. Under this framework, we provide sufficient conditions for the stability of the location error evolution, and we quantify the time-averaged network location errors (NLEs) for scheduling algorithms with and without exploiting the network states. Furthermore, we show the optimality of the proposed scheduling algorithms in terms of the error scaling with respect to the agent density. These results provide fundamental insights into the effects of scheduling algorithms and network settings on the location error evolution, leading to efficient scheduling algorithms for navigation networks.
Year
DOI
Venue
2013
10.1109/GLOCOM.2013.6831600
GLOBECOM
Keywords
Field
DocType
global positioning system,error scaling,location-awareness,scheduling,location error evolution,time-averaged network location error,scheduling algorithm stability,navigation process,stability,mobile computing,wireless navigation networks,gps-challenged environments,stability analysis,time measurement,measurement uncertainty,vectors,accuracy,navigation,scheduling algorithms
Wireless,Fair-share scheduling,Computer science,Scheduling (computing),Measurement uncertainty,Real-time computing,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISSN
Citations 
PageRank 
2334-0983
1
0.38
References 
Authors
8
3
Name
Order
Citations
PageRank
Tianheng Wang1252.75
Yuan Shen21151111.52
Moe Z. Win32225196.12