Significance of DSSD towards Cut Detection in Wireless Sensor Network
G V N LAKSHMI PRIYANKA, TELUGU KAVITHA, B SWATHI, P.SUMAN PRAKASH,
Affiliations Department of IT, GPCET, Kurnool. Andhra Pradesh, India Assistant Professor, Department of IT, GPCET,Kurnool,Andhra Pradesh,India.
WSN of sensor nodes are imagined to be sent in the physical environment to monitor a wide variety of
genuine - world phenomena. A WSN can get differentiated into numerous connected components because of the
disappointment of some of its nodes, which is known as a "cut". A traditional issue created by detachment of system is
apportioning. Foreseeing those situating from where the system get divided into the distinctive allotment could be an
exceptionally helpful peculiarity that can be given to applications in a WSN environment. Anyhow, being mindful of a
future detachment in the system can help to guarantee a superior nature of administration by adjusting the application
behavior. In this paper, problem of detecting cuts by the remaining nodes of a wireless sensor network has been
mentioned. We followed DSSD (Distributed Source Separation Detection) algorithm that allows every node to detect when
the connectivity to a specially designated node has been lost, and one or more nodes to detect the occurrence of the cut.
The algorithm consists of a simple iterative scheme in which every node updates a scalar state by communicating with its
nearest neighbors. When a set of nodes gets separated from a special node, that we call a “source node”, their states
converge to 0 because “current is extracted” from the component but none is injected. These trends are used by every
node to detect if a cut has occurred that has rendered it disconnected from the source.
G V N LAKSHMI PRIYANKA,TELUGU KAVITHA,B SWATHI,P.SUMAN PRAKASH."Significance of DSSD towards Cut Detection in Wireless Sensor Network ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 01,pp.8-12, January- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I12.pdf,
 Kleinberg, “Detecting a network failure,” Proceedings of the41st Annual Symposium on Foundations of Computer Science, p. 231, 2000.
 J. Kleinberg, M. Sandler, and A. Slivkins, “Network failure detection and graph connectivity,” in Proc. of ACM SODA, 2004.
 H. Ritter, R. Winter, and J. Schiller, “A partition detection system for mobile ad-hoc networks,” in Proc. of IEEE SECON, 2004.
 Shuguang Xiong and Jianzhong Li, “ An Efficient Algorithm for Cut Vertex Detection in Wireless Sensor Networks “, in 2010 International Conference on Distributed Computing Systems,pp368-377.
 B. Milic and M. Malek,“Adaptation of the Breadth First Search Algorithm for Cut-edge detection in Wireless Multihop Networks”, in ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM),
T.H.Cormen, C.E. Leiserson, R.LRivest and C.Stein, “Introduction to Algorithms (Second Edition)”, The MIT Press, 2002.
 G.Dini, M.Pelagatti, and I.M.Savino, “An algorithm for reconnecting wireless sensor network partitions”, in European Conference on Wireless Sensor Networks, 2008, pp.253-257.
 M. Hauspie, J. Carle, and D. Simplot, “Partition Detection in Mobile Ad-Hoc Networks,” Proc. Second Mediterranean Workshop Ad-Hoc Networks, pp. 25-27, 2003.
We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.