Complexity Results for Wireless Sensor Network Scheduling

• 作者: Fethi Jarray
• 来源期刊: 无线传感网络(英文)
• 学科: 数学
• 关键词: DISCRETE TOMOGRAPHY SENSOR SCHEDULING Combinatorial OPTIMIZATION
• 年，卷（期）: 2010,（5）
• 页码范围: 343-346
• 页数: 4页
• 分类号: O1

摘要

We study the problem of scheduling multi sensors to visit and observe a group of sites at discrete time points over a planning horizon of given length. We show that scheduling under a given number of visits for each site and in each period is an NP-complete problem by providing equivalence with a problem in discrete tomography. We also give a polynomial time algorithm to schedule the sensors under a given number of visits in each period.