Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Significance of DSSD towards Cut Detection in Wireless Sensor Network

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 :,

Keywords : Cut Detection,DSSD(Distributed Source Separation Detection), COS.

[1]  Kleinberg, “Detecting a network failure,” Proceedings of the41st Annual Symposium on Foundations of Computer Science, p. 231, 2000. 
[2] J. Kleinberg, M. Sandler, and A. Slivkins, “Network failure detection and graph connectivity,” in Proc. of ACM SODA, 2004. 
[3]  H. Ritter, R. Winter, and J. Schiller, “A partition detection system for mobile ad-hoc networks,” in Proc. of IEEE SECON, 2004. 
[4] 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. 
[5]  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), 
[6]T.H.Cormen, C.E. Leiserson, R.LRivest and C.Stein, “Introduction to Algorithms (Second Edition)”, The MIT Press, 2002. 
[7] 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. 
[8] 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.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal