Network navigation is a promising paradigm for providing location awareness in wireless environments, where nodes estimate their locations based on sensor measurements and prior knowledge. In the presence of limited w...
详细信息
Network navigation is a promising paradigm for providing location awareness in wireless environments, where nodes estimate their locations based on sensor measurements and prior knowledge. In the presence of limited wireless resources, only a subset rather than all of the node pairs can perform inter node measurements. The procedure of selecting node pairs at different times for inter-node measurements, referred to as network scheduling, affects the evolution of the localizationerrors. Thus, it is crucial to design efficient scheduling strategies for network navigation. This paper introduces situation-aware scheduling that exploits network states to select measurement pairs, and develops a framework to characterize the effects of scheduling strategies and of network settings on the errorevolution. In particular, both sufficient and necessary conditions for the boundedness of the errorevolution are provided. Furthermore, opportunistic and random situation-aware scheduling strategies are proposed, and bounds on the corresponding time-averaged network localizationerrors are derived. These strategies are shown to be optimal in terms of the error scaling with the number of agents. Finally, the reduction of the error scaling by increasing the number of simultaneous measurement pairs is quantified.
Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter-and intra-node measurements. In the presence of...
详细信息
ISBN:
(纸本)9781509013289
Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter-and intra-node measurements. In the presence of limited wireless resources, only a subset rather than all of the node pairs can perform inter-node measurements. Therefore, it is crucial to design efficient scheduling algorithms for selecting node pairs at different times for inter-node measurements. This paper develops a framework for the design of scheduling algorithms based on random access for network navigation. The proposed algorithms are suitable for practical operation of wireless navigation networks due to their distributed nature, and the optimized access probabilities of the agents lead to significant performance improvement.
Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter- and intra-node measurements. In the presence o...
详细信息
ISBN:
(纸本)9781509013296
Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter- and intra-node measurements. In the presence of limited wireless resources, only a subset rather than all of the node pairs can perform inter-node measurements. Therefore, it is crucial to design efficient scheduling algorithms for selecting node pairs at different times for inter-node measurements. This paper develops a framework for the design of scheduling algorithms based on random access for network navigation. The proposed algorithms are suitable for practical operation of wireless navigation networks due to their distributed nature, and the optimized access probabilities of the agents lead to significant performance improvement.
暂无评论