به سمت انرژی انصاف برای زمان بندی پخش با حداقل تاخیر در شبکه های حسگر کم کار چرخه
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|67538||2016||16 صفحه PDF||سفارش دهید||15656 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Computer Communications, Volume 75, 1 February 2016, Pages 81–96
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.