Name
Abstract | ||
|---|---|---|
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 amany-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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1155/2014/251218 | INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS |
Field | DocType | Volume |
Computer science,Scheduling (computing),Latency (engineering),Network packet,Computer network,Communication channel,Schedule,Time division multiple access,Wireless sensor network,Distributed computing,Scalability | Journal | 2014 |
ISSN | Citations | PageRank |
1550-1477 | 1 | 0.35 |
References | Authors | |
22 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Zhao | 1 | 7 | 1.13 |
| Yajuan Qin | 2 | 187 | 21.81 |
| Dong Yang | 3 | 211 | 20.38 |
| Ying Rao | 4 | 1 | 0.35 |