کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6884933 | 696260 | 2016 | 46 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On balanced k-coverage in visual sensor networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Given a set of directional visual sensors, the k-coverage problem determines the orientation of minimal directional sensors so that each target is covered at least k times. As the problem is NP-complete, a number of heuristics have been devised to tackle the issue. However, the existing heuristics provide imbalance coverage of the targets-some targets are covered k times while others are left totally uncovered or singly covered. The coverage imbalance is more serious in under-provisioned networks where there do not exist enough sensors to cover all the targets k times. Therefore, we address the problem of covering each target at least k times in a balanced way using minimum number of sensors. We study the existing Integer Linear Programming (ILP) formulation for single coverage and extend the idea for k-coverage. However, the extension does not balance the coverage of the targets. We further propose Integer Quadratic Programming (IQP) and Integer Non-Linear Programming (INLP) formulations that are capable of addressing the coverage balancing. As the proposed formulations are computationally expensive, we devise a faster Centralized Greedy k-Coverage Algorithm (CG kCA) to approximate the formulations. Finally, through rigorous simulation experiments we show the efficacy of the proposed formulations and the CG kCA.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 72, September 2016, Pages 72-86
Journal: Journal of Network and Computer Applications - Volume 72, September 2016, Pages 72-86
نویسندگان
Sakib Md. Bin Malek, Md. Muntakim Sadik, Ashikur Rahman,