Issue No. 08 - Aug. (2012 vol. 61)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.215
Anahit Martirosyan , University of Ottawa, Ottawa
Azzedine Boukerche , University of Ottawa, Ottawa
In this paper, we present the performance evaluation of an algorithm for preserving temporal relationships of events in Wireless Sensor Actor Networks (WSANs). The algorithm consists of two modules, which deal with the problems of temporal event ordering and time synchronization. These two problems are approached as a whole as they complement each other: in order to temporally order the events, the nodes must be synchronized. The goal of the proposed event ordering algorithm for WSANs is to reduce the overhead in terms of energy dissipation and delay. We also propose a tunable time synchronization algorithm employing a hybrid synchronization scheme suited for clustered topology. The proposed algorithm utilizes the message exchange necessary for event ordering and routing for synchronization purposes by piggybacking messages with synchronization pulses and replies to reduce the communication cost of synchronization. Simulation experiments showed that the event ordering algorithm is capable of reducing the overhead when compared to previously proposed algorithms. The synchronization algorithm demonstrated that the combination of synchronization techniques was well suited for the communication mode utilized in a clustered topology. The approach of piggybacking synchronization pulses and replies resulted in a considerable gain, which we demonstrated in the number of messages that were piggybacked for synchronization purposes.
Wireless sensor actor networks, time synchronization, temporal event ordering.
A. Boukerche and A. Martirosyan, "Preserving Temporal Relationships of Events for Wireless Sensor Actor Networks," in IEEE Transactions on Computers, vol. 61, no. , pp. 1203-1216, 2011.