TY - GEN
T1 - Detecting termination in pervasive sensor networks
AU - Kurian, Habel
AU - Rakshit, Abhishek
AU - Singh, Gurdip
PY - 2009
Y1 - 2009
N2 - With the increased deployment of pervasive systems, there has been an explosive growth in the number of applications being developed for such systems. Distributed applications typically depend on the underlying middleware infrastructure to provide services to perform their tasks. Many applications rely on a service which can detect the termination of a distributed activity being performed by a set of entities. Existing algorithms for termination detection are based on the layering paradigm wherein the algorithm can monitor application level communication. Pervasive applications, however, may not be structured as strictly layered systems. This paper proposes algorithms for termination detection of distributed applications in pervasive systems. We propose two algorithms for this problem, and show that each performs better than the other under certain conditions. Subsequently, we propose an hybrid algorithm which combines the features of the two algorithms and provides performance comparable to the better of the two algorithms under different conditions.
AB - With the increased deployment of pervasive systems, there has been an explosive growth in the number of applications being developed for such systems. Distributed applications typically depend on the underlying middleware infrastructure to provide services to perform their tasks. Many applications rely on a service which can detect the termination of a distributed activity being performed by a set of entities. Existing algorithms for termination detection are based on the layering paradigm wherein the algorithm can monitor application level communication. Pervasive applications, however, may not be structured as strictly layered systems. This paper proposes algorithms for termination detection of distributed applications in pervasive systems. We propose two algorithms for this problem, and show that each performs better than the other under certain conditions. Subsequently, we propose an hybrid algorithm which combines the features of the two algorithms and provides performance comparable to the better of the two algorithms under different conditions.
UR - http://www.scopus.com/inward/record.url?scp=70449623684&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449623684&partnerID=8YFLogxK
U2 - 10.1109/ISADS.2009.5207330
DO - 10.1109/ISADS.2009.5207330
M3 - Conference contribution
AN - SCOPUS:70449623684
SN - 9781424443277
T3 - Proceedings - 2009 International Symposium on Autonomous Decentralized Systems, ISADS 2009
SP - 323
EP - 330
BT - Proceedings - 2009 International Symposium on Autonomous Decentralized Systems, ISADS 2009
T2 - 2009 International Symposium on Autonomous Decentralized Systems, ISADS 2009
Y2 - 23 March 2009 through 25 March 2009
ER -