##plugins.themes.academic_pro.article.main##
Abstract
Wireless sensor networks consist of multiple connected components, Due to multiple connected components, wireless sensor network gets break , which is called a cut. In this article we can detect this potential cuts, by consideration of remaining nodes ,We have implemented an algorithm which allows
(i) Every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut.
The algorithm used is distributed and asynchronous: every node communicates with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious “electrical potential†of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. We demonstrate the effectiveness of the proposed algorithm through simulations and a real hardware implementation.##plugins.themes.academic_pro.article.details##
How to Cite
Kothapelli, K., & Jadhav, V. (2014). Distributed and Asynchronously Detection of Cut in Wireless Sensor Networks. International Journal of Emerging Trends in Science and Technology, 1(07). Retrieved from http://igmpublication.org/ijetst.in/index.php/ijetst/article/view/343
References
1. Cut Detection in Wireless Sensor Networks Ieee Transactions On Parallel And Distributed Systems, Vol 23 No.3 Year 2012
2. N. Shrivastava, S. Suri, and C. D. T ´oth, “Detecting cuts in sensor networks,†ACM Trans. Sen. Netw., 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,†in First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Net-works (IEEE SECON 2004), Oct. 2004, pp. 489–497.
4. M. Hauspie, J. Carle, and D. Simplot, “Partition detection in mobile ad-hoc networks,†in 2nd Mediterranean Workshop on Ad-Hoc Networks, 2003, pp. 25–27.
5. P. Barooah, “Distributed cut detection in sensor networks,†in 47th IEEE Conference on Decision and Control, December 2008, pp. 1097– 1102.
6. D. Wood, J. A. Stankovic, and S. H. Son, “Jam: A jammed-area mapping service for sensor networks,†in IEEE Real Time System Symposium, 2003.
7. http://www.xbow.com/Products/Product pdf files/Wireless pdf/ MICAZ Datasheet.pdf.
8. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pis-ter, “System architecture directions for networked sensors,†in Proceedings of international conference on Architectural support for programming languages and operating systems (ASPLOS), 2000.
9. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D.Thomas, and A. Zhu, “Achieving Anonymity via Clustering,â€Proc. 25th ACM SIGMOD-SIGACT-SIGART Symp. Principles ofDatabase Systems (PODS), pp. 153-162, 2006.
2. N. Shrivastava, S. Suri, and C. D. T ´oth, “Detecting cuts in sensor networks,†ACM Trans. Sen. Netw., 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,†in First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Net-works (IEEE SECON 2004), Oct. 2004, pp. 489–497.
4. M. Hauspie, J. Carle, and D. Simplot, “Partition detection in mobile ad-hoc networks,†in 2nd Mediterranean Workshop on Ad-Hoc Networks, 2003, pp. 25–27.
5. P. Barooah, “Distributed cut detection in sensor networks,†in 47th IEEE Conference on Decision and Control, December 2008, pp. 1097– 1102.
6. D. Wood, J. A. Stankovic, and S. H. Son, “Jam: A jammed-area mapping service for sensor networks,†in IEEE Real Time System Symposium, 2003.
7. http://www.xbow.com/Products/Product pdf files/Wireless pdf/ MICAZ Datasheet.pdf.
8. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pis-ter, “System architecture directions for networked sensors,†in Proceedings of international conference on Architectural support for programming languages and operating systems (ASPLOS), 2000.
9. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D.Thomas, and A. Zhu, “Achieving Anonymity via Clustering,â€Proc. 25th ACM SIGMOD-SIGACT-SIGART Symp. Principles ofDatabase Systems (PODS), pp. 153-162, 2006.