無線ロボットネットワークにおける干渉電力上界の解析
Interference Power Bound Analysis of a Network of Wireless Robots
CSMA無線通信の性質を用いて送受信機間隔の上界を導出し、SINR要件を満たすために必要なロボット中継機の最小数を明らかにした。さらに直線的なネットワーク構造を利用した上界の改善と、直交コード数の下界の定式化も行った。
著者: Pradipta Ghosh, Bhaskar Krishnamachari
分類: cs.RO, cs.NI
原文アブストラクト
We consider a fundamental problem concerning the deployment of a wireless robotic network: to fulfill various end-to-end performance requirements, a "sufficient" number of robotic relays must be deployed to ensure that links are of acceptable quality. Prior work has not addressed how to find this number. We use the properties of Carrier Sense Multiple Access (CSMA) based wireless communication to derive an upper bound on the spacing between any transmitter-receiver pair, which directly translates to a lower bound on the number of robots to deploy. We focus on SINR-based performance requirements due to their wide applicability. Next, we show that the bound can be improved by exploiting the geometrical structure of a network, such as linearity in the case of flow-based robotic router networks. Furthermore, we also use the bound on robot count to formulate a lower bound on the number of orthogonal codes required for a high probability of interference free communication. We demonstrate and validate our proposed bounds through simulations.
