access icon free Optimal spectrum assignment for cognitive radio sensor networks under coverage constraint

Cognitive radios emerged as a solution to spectrum scarcity problem. The integration of cognitive radios and wireless sensor networks enables a new paradigm of communication, in which the sensor nodes can avoid heavily-crowded transmission bands by tuning their transmission parameters to less-crowded bands. The authors consider the problem of spectrum assignment for cognitive radio sensor network (CRSN) under coverage, interference, minimum data rate and power budget constraints. A mixed-integer non-linear programming problem formulation that addresses optimal power allocation, channel selection and node scheduling is presented. Following a practical assumption, that any CRSN node can only access one channel for its transmission with the CRSN base station, the problem is transformed to a binary linear programming (BLP) problem. Using the relaxation techniques, the problem is transformed to a linear programming problem that is solvable in polynomial time, and has the same optimal solution of the BLP problem. Hence, the minimum power algorithm that achieves the optimal solution of our problem is proposed. To further reduce the complexity of the solution, three heuristic lower-complexity algorithms are proposed to solve the problem: random, greedy and two-stage (decoupled) algorithms.

Inspec keywords: scheduling; polynomials; integer programming; linear programming; greedy algorithms; wireless channels; nonlinear programming; radio networks; radiofrequency interference; cognitive radio; random processes; radio spectrum management; wireless sensor networks

Other keywords: polynomial time; BLP problem; interference; greedy algorithm; mixed-integer nonlinear programming problem; heuristic lower-complexity algorithm; optimal spectrum assignment; spectrum scarcity problem; relaxation technique; minimum data rate constraint; power budget constraint; node scheduling; wireless sensor network; cognitive radio sensor network; CRSN; two-stage algorithm; random algorithm; channel selection; optimal power allocation; binary linear programming problem; minimum power algorithm; decoupled algorithm; heavily-crowded transmission band avoidance; base station

Subjects: Legislation, frequency allocation and spectrum pollution; Electromagnetic compatibility and interference; Wireless sensor networks; Optimisation techniques; Algebra; Other topics in statistics

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • 19. Li, S., Luan, T., Shen, X.: ‘Channel allocation for smooth video delivery over cognitive radio networks’. IEEE Global Telecommunications Conf. (GLOBECOM), December 2010, pp. 15.
    5. 5)
    6. 6)
      • 11. Yu, L., Liu, C., Hu, W.: ‘Spectrum allocation algorithm in cognitive ad-hoc networks with high energy efficiency’. 2010 Int. Conf. Green Circuits and Systems (ICGCS), June 2010, pp. 349354.
    7. 7)
    8. 8)
    9. 9)
      • 16. Chen, S., Huang, Y., Namuduri, K.: ‘A factor graph based dynamic spectrum allocation approach for cognitive network’. IEEE Wireless Communications and Networking Conf. (WCNC), March 2011, pp. 850855.
    10. 10)
      • 7. Chamam, A., Pierre, S.: ‘Power-efficient clustering in wireless sensor networks under coverage constraint’. IEEE Int. Conf. Wireless and Mobile Computing (WIMOB), October 2008, pp. 460465.
    11. 11)
    12. 12)
      • 13. Chen, L., Iellamo, S., Coupechoux, M., Godlewski, P.: ‘An auction framework for spectrum allocation with interference constraint in cognitive radio networks’. IEEE INFOCOM, March 2010, pp. 19.
    13. 13)
      • 1. Kolodzy, P., Avoidance, I.: ‘Spectrum policy task force’, Federal Commun. Comm., Washington, DC, Rep. ET Docket, no. 02-135, 2002.
    14. 14)
    15. 15)
    16. 16)
      • 23. Karmarkar, N.: ‘A new polynomial-time algorithm for linear programming’. Proc. 16th Annual ACM Symp. on Theory of Computing, STOC ‘84, New York, NY, USA, 1984, pp. 302311.
    17. 17)
    18. 18)
      • 3. Goldsmith, A., Jafar, S., Maric, I., Srinivasa, S.: ‘Breaking spectrum gridlock with cognitive radios: an information theoretic perspective’. Proc. IEEE, 2009, vol. 97, no. 5, pp. 894914.
    19. 19)
      • 12. Li, X., Wang, D., McNair, J., Chen, J.: ‘Residual energy aware channel assignment in cognitive radio sensor networks’. IEEE Wireless Communications and Networking Conf. (WCNC), March 2011, pp. 398403.
    20. 20)
      • 22. Heller, I., Tompkins, C.: ‘An extension of a theorem of Dantzig's’, in Kuhn, H.W., Tucker, A.W. (Eds.): ‘Linear inequalities and related systems, annals of mathematics studies’ (Princeton University Press, 1956), vol. 38, no. 11, pp. 247254.
    21. 21)
    22. 22)
      • 20. Wang, W., Kasiri, B., Cai, J., Alfa, A.: ‘Channel assignment of cooperative spectrum sensing in multi-channel cognitive radio networks’. IEEE Int. Conf. Communications (ICC), 2011, June 2011, pp. 15.
    23. 23)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2014.0423
Loading

Related content

content/journals/10.1049/iet-com.2014.0423
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading