کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395050 | 665926 | 2012 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In wireless environments, data broadcast can offer unlimited mobile users up-to-date and shareable information in the meantime. Traditional schemes favor popular queries and thus sacrifice unpopular queries. This paper considers a broadcast scheduling problem, minimizing the worst access time for both popular and unpopular queries. Five useful heuristics and one anomaly are discovered, by which we can deal with this NP-hard problem properly. In our findings, the problem can be solved optimally if mobile users’ access patterns present in some particular forms. Three algorithms are proposed and their near-optimality is shown in the experimental results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 199, 15 September 2012, Pages 93–108
Journal: Information Sciences - Volume 199, 15 September 2012, Pages 93–108
نویسندگان
Jen-Ya Wang,