Monitoring and control of distributed systems
ISCI '90 Proceedings of the first international conference on systems integration on Systems integration '90
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Determination of Time and Order for Event-Based Middleware in Mobile Peer-to-Peer Environments
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
A low latency and energy aware event ordering algorithm for wireless actor and sensor networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Medium access control in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Communication and Coordination in Wireless Sensor and Actor Networks
IEEE Transactions on Mobile Computing
Fault Tolerance by Quartile Method in Wireless Sensor and Actor Networks
CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Temporal event ordering is an important issue in wireless sensor and actuator networks (WSAN) since actuators perform correct actions based on correct ordering among the time-related events. For temporal event ordering algorithms, they ensure that events captured from different sensors should be in the order. However, most of temporal ordering algorithms focus on the delay to transmit packets without considering the delay due to data loss. In the latter condition, the temporal ordering among events may be incorrect since some sensed data are lost due to the fail communication link or sensor. However, there is no literature for addressing the fault tolerance under the temporal event ordering of WSAN. Therefore, we propose a temporal event ordering with fault tolerance (TVOFT) in this paper. Differed from other temporal event ordering algorithms, TVOFT uses the routing table of each node with a acknowledge message once time to ensure the correct ordering of the time-related events. Therefore, the overhead of control packets also could be reduced in TVOFT. The simulations results demonstrate that TVOFT has the better correct event ordering rate and the less overhead of control packets than other temporal ordering algorithms even if the communication link or the sensor is fail.