TY - GEN
T1 - Event ordering in pervasive sensor networks
AU - Kaveti, Lakshman
AU - Pulluri, Sandeep
AU - Singh, Gurdip
PY - 2009
Y1 - 2009
N2 - In a pervasive sensor system, application entities may use the available infrastructure resources such as sensing devices, actuators, wireless modules and gateways to accomplish various tasks. For example, a group of humans/robots may use the infrastructure to track the current location of the group members. Many such tasks require a service which keeps track of the order of occurrence of events in the application. Existing algorithms for this problem have been designed for traditional distributed systems using the layering paradigm where the algorithm is able to observe and intercept application messages. Pervasive applications, however, may not be structured as strictly layered systems. In this paper, we study the problem of event ordering in pervasive systems, and propose algorithms for (Ictecting event ordering. Our first algorithm treats the entire network as a single graph, whereas the second algorithm operates in a hierarchical manner by subdividing the network into smaller groups. We present experimental evaluation of our algorithms using both simulation and deployment oil a sensor testbed.
AB - In a pervasive sensor system, application entities may use the available infrastructure resources such as sensing devices, actuators, wireless modules and gateways to accomplish various tasks. For example, a group of humans/robots may use the infrastructure to track the current location of the group members. Many such tasks require a service which keeps track of the order of occurrence of events in the application. Existing algorithms for this problem have been designed for traditional distributed systems using the layering paradigm where the algorithm is able to observe and intercept application messages. Pervasive applications, however, may not be structured as strictly layered systems. In this paper, we study the problem of event ordering in pervasive systems, and propose algorithms for (Ictecting event ordering. Our first algorithm treats the entire network as a single graph, whereas the second algorithm operates in a hierarchical manner by subdividing the network into smaller groups. We present experimental evaluation of our algorithms using both simulation and deployment oil a sensor testbed.
UR - http://www.scopus.com/inward/record.url?scp=70349306964&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349306964&partnerID=8YFLogxK
U2 - 10.1109/PERCOM.2009.4912861
DO - 10.1109/PERCOM.2009.4912861
M3 - Conference contribution
AN - SCOPUS:70349306964
SN - 9781424433049
T3 - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
BT - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
T2 - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
Y2 - 9 March 2009 through 13 March 2009
ER -