A Source Aware Scheduling Algorithm for Time-Optimal Convergecast
Most applications of industrial wireless sensor networks (IWSNs) should converge process data generated by each node to the central manager. The data collection operation results in an important communication primitive referred to as convergecast. Convergecast is a many-to-one communication paradigm...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2014-06-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/251218 |
| _version_ | 1797763305794699264 |
|---|---|
| author | Jing Zhao Yajuan Qin Dong Yang Ying Rao |
| author_facet | Jing Zhao Yajuan Qin Dong Yang Ying Rao |
| author_sort | Jing Zhao |
| collection | DOAJ |
| description | Most applications of industrial wireless sensor networks (IWSNs) should converge process data generated by each node to the central manager. The data collection operation results in an important communication primitive referred to as convergecast. Convergecast is a many-to-one communication paradigm as a critical functionality deployed for industrial monitoring and control. Delaying of process data may degrade the overall control performance and even lead to the malfunction of industrial applications. Therefore, timeslot and channel resources should be scheduled efficiently for real-time communication. This paper is interested in determining a TDMA schedule that minimizes the number of timeslots and completes convergecast with a limited number of channels. In order to achieve the lower bound derived by theoretical analysis, we proposed a source aware scheduling algorithm for general network. For IWSNs with a fixed number of available channels, we present a source aware scheduling algorithm with constrained channel. According to simulation results, we demonstrate that the performance of our algorithm is close to the lower bound on latency with a limited number of channels. Our algorithm is also scalable for schedules with multiple packets and specific transmission latency of a single packet. |
| first_indexed | 2024-03-12T19:39:43Z |
| format | Article |
| id | doaj.art-bd5d3987318e43799b6496d816aa8eff |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T19:39:43Z |
| publishDate | 2014-06-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-bd5d3987318e43799b6496d816aa8eff2023-08-02T03:57:45ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772014-06-011010.1155/2014/251218251218A Source Aware Scheduling Algorithm for Time-Optimal ConvergecastJing ZhaoYajuan QinDong YangYing RaoMost applications of industrial wireless sensor networks (IWSNs) should converge process data generated by each node to the central manager. The data collection operation results in an important communication primitive referred to as convergecast. Convergecast is a many-to-one communication paradigm as a critical functionality deployed for industrial monitoring and control. Delaying of process data may degrade the overall control performance and even lead to the malfunction of industrial applications. Therefore, timeslot and channel resources should be scheduled efficiently for real-time communication. This paper is interested in determining a TDMA schedule that minimizes the number of timeslots and completes convergecast with a limited number of channels. In order to achieve the lower bound derived by theoretical analysis, we proposed a source aware scheduling algorithm for general network. For IWSNs with a fixed number of available channels, we present a source aware scheduling algorithm with constrained channel. According to simulation results, we demonstrate that the performance of our algorithm is close to the lower bound on latency with a limited number of channels. Our algorithm is also scalable for schedules with multiple packets and specific transmission latency of a single packet.https://doi.org/10.1155/2014/251218 |
| spellingShingle | Jing Zhao Yajuan Qin Dong Yang Ying Rao A Source Aware Scheduling Algorithm for Time-Optimal Convergecast International Journal of Distributed Sensor Networks |
| title | A Source Aware Scheduling Algorithm for Time-Optimal Convergecast |
| title_full | A Source Aware Scheduling Algorithm for Time-Optimal Convergecast |
| title_fullStr | A Source Aware Scheduling Algorithm for Time-Optimal Convergecast |
| title_full_unstemmed | A Source Aware Scheduling Algorithm for Time-Optimal Convergecast |
| title_short | A Source Aware Scheduling Algorithm for Time-Optimal Convergecast |
| title_sort | source aware scheduling algorithm for time optimal convergecast |
| url | https://doi.org/10.1155/2014/251218 |
| work_keys_str_mv | AT jingzhao asourceawareschedulingalgorithmfortimeoptimalconvergecast AT yajuanqin asourceawareschedulingalgorithmfortimeoptimalconvergecast AT dongyang asourceawareschedulingalgorithmfortimeoptimalconvergecast AT yingrao asourceawareschedulingalgorithmfortimeoptimalconvergecast AT jingzhao sourceawareschedulingalgorithmfortimeoptimalconvergecast AT yajuanqin sourceawareschedulingalgorithmfortimeoptimalconvergecast AT dongyang sourceawareschedulingalgorithmfortimeoptimalconvergecast AT yingrao sourceawareschedulingalgorithmfortimeoptimalconvergecast |