دانلود رایگان مقاله برابری انرژی برای برنامه ریزی پخش با حداقل تاخیر در شبکه حسگر چرخه وظیفه پایین

عنوان فارسی
به سمت برابری انرژی برای برنامه ریزی پخش با حداقل تاخیر در شبکه های حسگر چرخه وظیفه پایین
عنوان انگلیسی
Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks
صفحات مقاله فارسی
0
صفحات مقاله انگلیسی
16
سال انتشار
2016
نشریه
الزویر - Elsevier
فرمت مقاله انگلیسی
PDF
کد محصول
E735
رشته های مرتبط با این مقاله
مهندسی کامپیوتر و مهندسی فناوری اطلاعات
گرایش های مرتبط با این مقاله
شبکه های کامپیوتری
مجله
ارتباطات کامپیوتر - Computer Communications
دانشگاه
دانشکده علوم کامپیوتر و فناوری، دانشگاه پست و مخابرات نانجینگ، چین
کلمات کلیدی
شبکه های حسگر بی سیم، چرخه پایین وظیفه، برنامه ریزی پخش تعادل بار، انرژی کارآمد
چکیده

Abstract


Broadcast scheduling for low-duty-cycle wireless sensor networks (WSNs) has been extensively studied recently. However, existing solutions mainly focused on optimizing delay and (or) total energy consumption without considering load distribution among nodes. Due to limited energy supply for sensor nodes, heavily loaded sensors often run out of energy quickly, reducing the lifetime of the whole network. In this paper, we target at minimizing the maximum transmission load of a broadcast schedule for low-duty-cycle WSNs, subject to the constraint that each node should have the minimum end-to-end delay under the broadcast schedule. We prove that it is NP-hard to find the optimal schedule. Then, we devise a Load-Balanced Parents Assignment Algorithm (LBPA-A) that achieves λ-approximation ratio, where λ denotes the maximum number of neighbors that are scheduled to wake up at the same time and is typically a small number in low-duty-cycle WSNs. Further, we introduce how to solve this problem in a distributed manner. Our simulation results reveal that compared with the traditional solutions, our proposed LBPA-A and distributed solution both exhibit much better average performance in terms of energy-fairness, total energy consumption and delivery ratio.

نتیجه گیری

9. Conclusion


In this paper, we mainly focus on the Load-Balanced Minimum Delay Broadcast Scheduling Problem (LB-MDBS) for low-duty-cycle WSNs. We first transform our LB-MDBS problem into the equivalent Load-Balanced Parents Assignment Problem (LBPA), and prove its NP-hardness. Then, we address this problem by proposing the LoadBalanced Parents Assignment Algorithm (LBPA-A) which achieves λ- approximation, where λ denotes the maximum number of neighbors that are scheduled to wake up at the same time and is typically a small number in low-duty-cycle WSNs. Also, we present an efficient distributed solution. Finally, the high-efficiency of our solutions has been evaluated by simulations in terms of energy fairness, total energy consumption and delivery ratio.


بدون دیدگاه