Proceedings of the 3rd International Conference on Smart City Applications 2018
DOI: 10.1145/3286606.3286791
|View full text |Cite
|
Sign up to set email alerts
|

Traffic Lights Control using Wireless Sensors Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…TSC systems based on Wireless Sensor Network (WSN) have also been used at isolated intersections in [28,29]. Rida et al [28] proposed a time-fragment based control mechanism that splits the time and calculates the percentage of green ratio.…”
Section: Sensor-based Traffic Control Methodsmentioning
confidence: 99%
“…TSC systems based on Wireless Sensor Network (WSN) have also been used at isolated intersections in [28,29]. Rida et al [28] proposed a time-fragment based control mechanism that splits the time and calculates the percentage of green ratio.…”
Section: Sensor-based Traffic Control Methodsmentioning
confidence: 99%
“…The method proposed in (Zhou et al, 2010) selects the sequence of phases composing a cycle according to several criteria which are the presence of priority vehicles, the duration of the periods without detection of new arrivals, the causes of famine, the total time of waiting and the length of the queues. In (Rida & Hasbi, 2018a) and (Rida & Hasbi, 2018b), we inspired by the "Smallest job first" method of scheduling tasks to run them by a computer processor. We proposed the "Smallest phase first" algorithm which gives priority to phases with the smallest queues.…”
Section: Related Workmentioning
confidence: 99%
“…The method proposed in [19] selects the sequence of phases composing a cycle, according to several criteria: the presence of priority vehicles, the duration of the periods without detection of new arrivals, the total waiting time and the length of the queues. In [22] and [23], we have inspired the smallest job first method of task scheduling to be execute by a computer processor. We proposed the smallest phase first algorithm, which gives priority to phases with the smallest waiting line.…”
Section: Related Workmentioning
confidence: 99%
“…We proposed the smallest phase first algorithm, which gives priority to phases with the smallest waiting line. Subsequently in [19] we introduced the waiting time in the algorithm proposed in [22].…”
Section: Related Workmentioning
confidence: 99%