{"id":9528,"date":"2021-02-20T15:39:11","date_gmt":"2021-02-20T07:39:11","guid":{"rendered":"https:\/\/virtual.math.ntnu.edu.tw\/?p=9528"},"modified":"2021-02-20T15:49:53","modified_gmt":"2021-02-20T07:49:53","slug":"001-10","status":"publish","type":"post","link":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/2021\/02\/20\/001-10\/","title":{"rendered":"<span style=\"color:#3566BD\">[Keynote speech] <\/span>Secrecy Energy Efficiency in Cognitive Radio Networks with Untrusted Secondary Users"},"content":{"rendered":"<p>Presenter\uff1aProf. Chong-Yung Chi<br \/>\nPresenter come from\uff1aInstitute of Communications Engineering &amp; Department of Electrical Engineering<br \/>\nNational Tsing Hua University<br \/>\nTitle\uff1aSecrecy Energy Efficiency in Cognitive Radio Networks with Untrusted Secondary Users<br \/>\nAbstract\uff1aThe information security and energy efficiency in cognitive radio (CR) networks have been<br \/>\nextensively studied. However, the practical scenario involving multiple untrusted secondary users (SUs)<br \/>\nin CR networks under the underlay spectrum sharing mechanism has not been studied so far. This talk<br \/>\nconsiders the downlink secrecy energy efficient coordinated beamforming design for multiple inputs<br \/>\nsingle output CR networks under this scenario. Our goal is to maximize the global secrecy energy<br \/>\nefficiency (GSEE), defined as the ratio of the sum of secrecy rates of all the primary users (PUs) to the<br \/>\ntotal power consumption, under requirements on quality of service of Pus and SUs as well as<br \/>\nconstraints on power budget at the primary transmitter (PTx) and the secondary transmitter (STx). To<br \/>\ntackle the non-convex GSEE maximization (GSEEM) problem, an algorithm is proposed based on<br \/>\nDinkelbach method and successive convex approximation to jointly optimize beamforming vectors of<br \/>\nthe PTx and the STx. The convergence behavior and the computational complexity of the proposed<br \/>\nGSEEM algorithm are analyzed, followed by the connection with the secrecy rate maximization design<br \/>\nand the power minimization (PM) design in terms of GSEE. In view of significantly higher<br \/>\ncomputational complexity of the proposed GSEEM algorithm than that of the PM design, a 2-step<br \/>\nsearching scheme is further designed to efficiently search for an approximate solution to the considered<br \/>\nGSEEM problem based on the PM design and the golden search method. Simulation results<br \/>\ndemonstrate the efficacy of the proposed GSEEM algorithm and the searching scheme, and show that<br \/>\nthe spatial degrees of freedom (primarily determined by the antenna numbers of PTx and STx) is the<br \/>\nkey factor to the performance of the proposed GSEEM algorithm.<\/p>\n<p>Time\uff1a2021-3-3 14:00 (Wed.) \/\u00a0Place\uff1aM212<br \/>\nTea Time\uff1a2021-3-3 13:30 (Wed.) \/ Tea Place\uff1aM104<\/p>\n<p><a href=\"https:\/\/virtual.math.ntnu.edu.tw\/wp-content\/uploads\/2021\/02\/Invited-Talk-Chi-Abstract-and-Bio-NTNU-2021-3-3.pdf\">Speaker profile\uff1aInvited Talk (Chi Abstract and Bio) (NTNU 2021-3-3)<\/a><\/p>\n<p class=\"wpf_wrapper\"><a class=\"print_link\" href=\"\" target=\"_blank\">\u53cb\u5584\u5217\u5370<\/a><\/p><!-- .wpf_wrapper -->","protected":false},"excerpt":{"rendered":"<p>Presenter\uff1aProf. Chong-Yung Chi Presenter come from\uff1aInst [&hellip;]<\/p>\n","protected":false},"author":18,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[94,51,126],"tags":[],"_links":{"self":[{"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/posts\/9528"}],"collection":[{"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/users\/18"}],"replies":[{"embeddable":true,"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/comments?post=9528"}],"version-history":[{"count":3,"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/posts\/9528\/revisions"}],"predecessor-version":[{"id":9537,"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/posts\/9528\/revisions\/9537"}],"wp:attachment":[{"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/media?parent=9528"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/categories?post=9528"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/virtual.math.ntnu.edu.tw\/index.php\/wp-json\/wp\/v2\/tags?post=9528"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}