Detecting Cut Vertices and Cut Area in Wireless Sensor Network

Authors

  • Mani Sharma  MGM COET, Noida, Uttar Pradesh, India
  • Dr. Sunil. J. Wagh  Principal, Mahatma Gandhi Mission's Engineering College, Noida, Uttar Pradesh, India

Keywords:

Wireless Sensor Network, Harsh Environmental Conditions, Edge Detection

Abstract

Node failure creates cut in wireless sensor network. The main cause of node failure are the limited power consumption and harsh environmental conditions where sensor nodes are being deployed. Cut forms partitions in wireless sensor network and divides it into various regions. In this research paper, we are presenting our algorithm of detecting cut vertices and cut area. The algorithm describes the concept of activation state of each node. The activation state of each node will be examined to check the status of each node. Hence, the value of activation state will determine that whether node is active or not. this algorithm successfully finds the cut vertex as well as cut area in wireless sensor network.

References

  1. N. Shrivastava, S. Suri, and C. Toth, "Detecting cuts in sensor networks," ACM Transactions on Sensor Networks, vol. 4, no. 2, pp. 1–25, 2008.
  2. P. Barooah, H. Chenji, R. Stoleru, and T. Kalmar-Nagy, "Cut detection in wireless sensor networks," IEEE Transactions on Parallel and Distributed Systems, vol. 99, no. PrePrints, 2011.
  3. M. Won and R. Stoleru, "Destination-based cut detection in wireless sensor networks," in Proceedings of IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC), 2011
  4. Shuguang Xiong and Jianzhong, "An Efficient Algorithm for Cut Vertex Detection in Wireless Sensor Network", International Conference on Distributed Computing system, 2010
  5. Izzet F.Senturk, Kemal Akkaya and Sabri Yilmaz, "Distributed Relay Node Positioning for Connectivity Restoration in Partitioned Wireless Sensor Network", 2012
  6. P. Barooah, "Distributed cut detection in sensor networks," in Proceedings of IEEE Conference on Decision and Control and European Control Conference (CDC), 2008.
  7. Ms. Rini Mathew and Mrs. Annadevi. E "Artificial Routing Protocol for Cut Detection of Cut Vertices" vol. 9, 2012
  8. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, "Introduction to Algorithms (Second Edition)", The MIT Press, 2002
  9. D. B. West, "Introduction to Graph Theory (Second Edition)", Prentice Hall, 2001.
  10. 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), 2007.
  11. X. Liu, L. Xiao, A. Kreling and Y. Liu, "Optimizing Overlay Topology by Reducing Cut Vertices", in ACM Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), 2006.
  12. M. Won, M. George, and R. Stoleru, "Towards robustness and energy efficiency of cut detection in wireless sensor networks," Elsevier Ad Hoc Networks, vol. 9, no. 3, pp. 249–264, 2011.

Downloads

Published

2017-08-31

Issue

Section

Research Articles

How to Cite

[1]
Mani Sharma, Dr. Sunil. J. Wagh, " Detecting Cut Vertices and Cut Area in Wireless Sensor Network, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 4, pp.530-533, July-August-2017.