LOCATION UPDATE SCHEDULING

摘要

Examples associated with location update scheduling are disclosed. One example includes dividing a physical space into regions. Vertices of the regions correspond to access points spread throughout the physical space. A conflict graph is generated for the regions. Nodes in the conflict graph correspond to the regions, and edges indicate conflicts between the regions. The conflict graph is colored so that adjacent nodes in the conflict graph have different colors while limiting the number of colors in the conflict graph. Sequential location update queries are scheduled across access points. Location update queries are concurrently initiated by access points that correspond to vertices of regions sharing colors in the conflict graph.