讨论组:网络组
标题:Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies
演讲人: 韩安德
时间: 2011-04-19 10:00-2011-04-19 12:00
地点:FIT 1-222

内容:

To date, topology control in wireless ad hoc and sensor networks|the study of how to compute from the given communication network a subgraph with certain bene cial properties|has been considered as a static problem only; the time required to actually schedule the links of a computed topology without message collision was generally ignored. In this paper we analyze topology control in the context of the physical Signal-to-Interference-plus-Noise-Ratio (SINR) model, focusing on the question of how and how fast the links of a resulting topology can actually be realized over time.

For this purpose, we de ne and study a generalized version of the SINR model and obtain theoretical upper bounds on the scheduling complexity of arbitrary topologies in wireless networks. Speci cally, we prove that even in worst-case networks, if the signals are transmitted with correctly assigned transmission power levels, the number of time slots required to successfully schedule all links of an arbitrary topology is proportional to the squared logarithm of the number of network nodes times a previously de ned static interference measure. Interestingly, although originally considered without explicit accounting for signal collision in the SINR model, this static interference measure plays an important role in the analysis of link scheduling with physical link interference. Our result thus bridges the gap between static graph-based interference models and the physical SINR model. Based on these results, we also show that when it comes to scheduling, requiring the communication links to be symmetric may imply signi cantly higher costs as opposed to topologies allowing unidirectional links.