This paper considers the problem of the centralized spectrum allocation in wireless sensor networks towards the following goals: (i) maximizing fairness, (ii) maximizing spectrum utilization, (iii) reflecting the priority among sensor data, and (iv) avoiding unnecessary spectrum handoff. We cast this problem into a biobjective mixed integer nonconvex nonlinear programming that is absolutely intractable to solve at least globally without any aid of conversion and approximation. We tackle this intractability with convexification, scalarization, and rounding method that yield good approximate integer solutions.
展开▼
