The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS'03)
Toward Easily Analyzable Sensor Networks via Structuring of Time-Triggered Tasks
San Juan, Puerto Rico
May 28-May 30
ISBN: 0-7695-1910-5
Software techniques which enable efficient construction of sensor networks that are easily analyzable and can rarely run into a chaotic situation are in high demands. With the motivation for developing such software techniques, a skeleton of a software architecture for sensor networks which uses time-triggered functions (TTFs) extensively has been formulated. The TTF is a fundamental building-block for software which realizes global time based coordination of distributed actions (TCoDA). TDMA communication is adopted and harmonious joining of a sensor node into an existing cooperating group of sensor nodes is facilitated. Approaches for supporting preemptive TTFs by use of a multi-threading OS kernel as well as the approaches for supporting non-preemptive TTFs by use of application-level components are also presented. The latter approaches were devised for the situations where incentives for avoiding the use of a multi-threading OS would exist.
Index Terms:
Sensor, network, real time, timetriggered, TTF, service function, TDMA, TCoDA, wireless, kernel, preemptive, analyzable
Citation:
Kane Kim, Yuqing Li, "Toward Easily Analyzable Sensor Networks via Structuring of Time-Triggered Tasks," ftdcs, pp.344, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS'03), 2003