دانلود و نمایش مقالات مرتبط با DC programming and DCA::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - DC programming and DCA

تعداد مقالات یافته شده: 1
ردیف عنوان نوع
1 DC programming and DCA for enhancing physical layer security via cooperative jamming
برنامه ریزی DC و DCA برای افزایش امنیت لایه فیزیکی از طریق پارازیت تعاونی-2017
Article history:Received 30 September 2015Revised 10 August 2016Accepted 7 November 2016Available online 18 November 2016Keywords:Physical layer security Cooperative jamming Resource allocationDC programming and DCAThe explosive development of computational tools these days is threatening security of cryptographic algorithms, which are regarded as primary traditional methods for ensuring information security. The physical layer security approach is introduced as a method for both improving confidentiality of the se- cret key distribution in cryptography and enabling the data transmission without relaying on higher-layer encryption. In this paper, the cooperative jamming paradigm - one of the techniques used in the phys- ical layer is studied and the resulting power allocation problem with the aim of maximizing the sum of secrecy rates subject to power constraints is formulated as a nonconvex optimization problem. The objective function is a so-called DC (Difference of Convex functions) function, and some constraints are coupling. We propose a new DC formulation and develop an efficient DCA (DC Algorithm) to deal with this nonconvex program. The DCA introduces the elegant concept of approximating the original non- convex program by a sequence of convex ones: at each iteration of DCA requires solution of a convex subproblem. The main advantage of the proposed approach is that it leads to strongly convex quadratic subproblems with separate variables in the objective function, which can be tackled by both distributed and centralized methods. One of the major contributions of the paper is to develop a highly efficient distributed algorithm to solve the convex subproblem. We adopt the dual decomposition method that results in computing iteratively the projection of points onto a very simple structural set which can be determined by an inexpensive procedure. The numerical results show the efficiency and the superiority of the new DCA based algorithm compared with existing approaches.© 2016 Elsevier Ltd. All rights reserved.
Keywords: Physical layer security | Cooperative jamming | Resource allocation | DC programming and DCA
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 3119 :::::::: بازدید دیروز: 0 :::::::: بازدید کل: 3119 :::::::: افراد آنلاین: 76