A Robust Mechanism For Detection Of Loss Of Community In WSN

International Journal of Computer Trends and Technology (IJCTT)          
© - October Issue 2013 by IJCTT Journal
Volume-4 Issue-10                           
Year of Publication : 2013
Authors :V N Harsha Vardhan Reddy , T. Chandra Sekhara Reddy


V N Harsha Vardhan Reddy , T. Chandra Sekhara Reddy"A Robust Mechanism For Detection Of Loss Of Community In WSN "International Journal of Computer Trends and Technology (IJCTT),V4(10):3473-3475 October Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract:- Wireless sensor networks are widely used in real world applications as they can sense surroundings and send valuable data to sink. However, the nodes in the WSN are resource constrained. For this reason some of the nodes may fail over a period of time. The failure of some nodes causes the network to be a set of connected components. This is known as “cut”. Detecting such cuts is an important activity in WSNs. Recently Barooah et al. proposed a distributed algorithm for cut detection in WSN. The algorithm enables every node in the network to detect when connectivity to a designated node is lost. It also allows one or more nodes to detect the cut. In such network a node communicates with only other nodes which are in communication range. In this paper we built a custom simulator which demonstrates the proof of concept with respect to cut detection in WSN proposed by Barooah et al. The experiments reveal that the proposed cut detection mechanism is efficient and can be used in the real world applications.


References -
[1] G. Dini, M. Pelagatti, and I.M. Savino, “An Algorithm for Reconnecting Wireless Sensor Network Partitions,” Proc. European Conf. Wireless Sensor Networks, pp. 253-267, 2008.
[2] N. Shrivastava, S. Suri, and C.D. To´ th, “Detecting Cuts in Sensor Networks,” ACM Trans. Sensor Networks, vol. 4, no. 2, pp. 1-25, 2008.
[3] H. Ritter, R. Winter, and J. Schiller, “A Partition Detection System for Mobile Ad-hoc Networks,” Proc. First Ann. IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (IEEE SECON ’04), pp. 489-497, Oct. 2004.
[4] 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.
[5] P. Barooah, “Distributed Cut Detection in Sensor Networks,” Proc. 47th IEEE Conf. Decision and Control, pp. 1097-1102, Dec. 2008.
[6] A.D. Wood, J.A. Stankovic, and S.H. Son, “Jam: A Jammed-Area Mapping Service for Sensor Networks,” Proc. IEEE Real Time Systems Symp.,2003.
[7] http://www.xbow.com/Products/Product_pdf_files/Wireless_pdf/MICAZ_Datasheet.pdf, 2011.
[8] J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister, “System Architecture Directions for Networked Sensors,” Proc. Int’l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2000.
[9] Prabir Barooah, Harshavardhan Chenji, Radu Stoleru, and Tama´s Kalma´r-Nagy, “Cut Detection in Wireless Sensor Networks”. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 23, NO. 3, MARCH 2012.

Keywords :— Wireless sensor network, cut, cut detection, connected components