Download now Free registration required
The authors study a fundamental problem called Minimum Length Link Scheduling (ML2S) which is crucial to the efficient operations of wireless networks. Given a set of communication links of arbitrary length spread and assume each link has one unit of traffic demand in wireless networks, the problem ML2S seeks a schedule for all links (to satisfy all demands) of minimum number of time-slots such that the links assigned to the same time-slot do not conflict with each other under the physical interference model. In this paper, they will explore this problem under three important transmission power control settings: linear power control, uniform power control and arbitrary power control.
- Format: PDF
- Size: 167.77 KB