SHERP

Combined Scheduling and Routing for Deterministic Guarantee of End-to-End Deadline in Cell Structured Sensor Network

Cited 0 time in webofscience Cited 4 time in scopus
Authors
Ryu, Jiho; Lee, Chang-Gun; Kwon, Taekyoung; Han, Junghee
Issue Date
2009
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
IEEE Sensors J., vol. 9, no. 10, pp. 1291-1301
Keywords
End-to-end deadlinereal-time systemsschedulingsensor networks
Abstract
Wireless sensor networks have great potentials to be applied to mission critical real-time applications such as target tracking, emergency detection, and disaster management. For such real-time applications, sensory data should be delivered within the end-to-end deadlines; otherwise, the data may become useless or misleading. In order to provide such deterministic guarantee
of end-to-end deadlines, not only packet scheduling within a single hop but also routing across multiple hops have to be jointly considered. In this paper, we propose a combined scheduling and routing mechanism that provides a eterministic guarantee of end-to-end deadlines leveraging real-time scheduling and analysis techniques. Our experimental study shows that the proposed mechanism can accommodate a larger workload meeting all the end-to-end deadlines than a pretty comprehensive set of other possible solutions of scheduling and routing that are known to deterministically guarantee end-to-end deadlines.
ISSN
1530-437X
Language
English
URI
http://hdl.handle.net/10371/21271
DOI
https://doi.org/10.1109/JSEN.2009.2027412
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Computer Science and Engineering (컴퓨터공학부)Journal Papers (저널논문_컴퓨터공학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse