2019
DOI: 10.1155/2019/5064109
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks

Abstract: Broadcasting is a fundamental function for disseminating messages in multihop wireless networks. Minimum-Transmission Broadcasting (MTB) problem aims to find a broadcast schedule with minimum number of transmissions. Previous works on MTB in duty-cycled networks exploit a rigid assumption that nodes have only active time slot per working cycle. In this paper, we investigated the MTB problem in duty-cycled networks where nodes are allowed arbitrary active time slots per working cycle (MTBDCA problem). Firstly, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 29 publications
(53 reference statements)
0
1
0
Order By: Relevance
“…A multi objective optimization model was presented in [5] in which the scheduling is done in such a way that the blind area is covered. Similarly, in literature [6], an Energy-Efficient Broadcast Scheduling (EEBS) Algorithm was presented which integrates different time slots to cover the maximum network area.…”
Section: Related Workmentioning
confidence: 99%
“…A multi objective optimization model was presented in [5] in which the scheduling is done in such a way that the blind area is covered. Similarly, in literature [6], an Energy-Efficient Broadcast Scheduling (EEBS) Algorithm was presented which integrates different time slots to cover the maximum network area.…”
Section: Related Workmentioning
confidence: 99%
“…However, this solution failed to optimize the scheduling process. Chen et al [22] proposed an energy-proficient broadcast scheduling scheme that incorporates each node's time slots when it is active. This method relied on an auxiliary graph and capable of exploiting the sensor node's active time slots to plan for access scheduling.…”
Section: Review Of Existing Solutions Against Scheduling Of Sensor No...mentioning
confidence: 99%