A New Algorithm of Self Organization in Wireless Sensor Network

DOI: 10.4236/wsn.2010.21006   PDF   HTML     7,384 Downloads   15,130 Views   Citations


Self organization is one of the most important characteristics in an Ad-hoc Sensor Network. Thousands of Sensors are deployed in a geographical area randomly without considering the location factor. After deployment, sensors are to self organize themselves to form a network of their own. How well the network is formed determines the life of the whole network as well as the quality of data transmission. Self organization based on clustering has proven to be very useful in this regard. Since hierarchical clustering reduces energy consumption by routing data from one node to another. In this paper, we discuss a new algorithm for self organization of sensors deployed in a geographical area. The algorithm forms clusters of sensors by ordering them using a unique triangulation method. This algorithm not only considers all sensors but also groups them so that their inherent clustering property is preserved.

Share and Cite:

H. KALITA and A. KAR, "A New Algorithm of Self Organization in Wireless Sensor Network," Wireless Sensor Network, Vol. 2 No. 1, 2010, pp. 43-47. doi: 10.4236/wsn.2010.21006.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] M. B. Srivastava and C. Schurgers, “Energy efficient routing in wireless sensor networks,” 2000. D. Ganeshan, A. Cerpa, W. Ye, Y. Yu, J. Zhao, and D. Estrin, “Networking issues in wireless sensor network,” 2003.
[2] H. Kumar and K. R. Gurung, “Routing issues in wireless sensor network,” Network, Data Mining & AI, Narosa Pub, ISBN 81-7319-755-5, 2006..
[3] J. Ibriq and I. Mahgoub, “Cluster based routing in wireless sensor networks: issues and challenges,” SPECTS’04, No. 759, pp. 1, 2004..
[4] K. V. Laerhoven, E. Catterall, and M. Strohbach, “Self-organization in ad hoc sensor networks: An empirical study,” in Artificial Life VIII, Standish, Abbass, Bedau (eds) (MIT Press), pp. 260–263, 2002.
[5] R. Batta, R. Nagi, A. Joshi, and N. Mishra, “Ad hoc sensor network topology design for distributed fusion: A mathematical programming approach, ” 2003.
[6] R. Wattenhofer, “Algorithms for ad hoc and sensor networks,” 2005.
[7] A. Abraham, K. Shin, and S. Y. Han, “Self organizing sensors by minimization of cluster heads using intelligent clustering,” 2004.
[8] A. Spiridon, F. Nekoogar, and F. Dowla, “Self organization of wireless sensor networks using ultra-wideband radios,” UCRL-CONF-205469, 2004.
[9] G. Fuchs, R. German, F. Dressler, and B. Krger, “Self-organization in sensor networks using bio-inspired mechanisms,” 2005.
[10] E. David, A. Rogers, and N. R. Jennings, “Self-organized routing for wireless micro-sensor networks,” 2004.
[11] V. Ailawadhi, K. Sohrabi, J. Gao, and G. J. Pottie, UCLA, “Protocols for self-organization of a wireless sensor network,” IEEE Personal Communications, 2000.
[12] D. Starobinski and R. Krishnan, “Message-efficient self- organization of wireless sensor networks,” 2001.
[13] H. K. Kalita, “Securing wireless sensor network,” NCS- 2005, Allied Pub, ISBN 81-7764-931-0, 2005.
[14] M. Ankerst, M. M. Breunig, H. P. Kriegel, and J. Sander, “Optics: Ordering points to identify the clustering structure,” In Proceedings of ACM SIGMOD’99, Institute of Computer Science, University of Munich, Germany, 1999.
[15] J. Han and M. Kamber, “Data mining: Concepts and techniques,” Morgan Kaufmann, San Francisco, CA, USA, 2003.
[16] Z. Huang, “Clustering large data sets with mixed numeric and categorical values.”
[17] E. Kolatch, “Clustering algorithms for spatial databases: A survey,” 2001.
[18] H. Kalita, “A new algorithm for ordering of points to identify clustering structure based on perimeter of triangle: Optics(bopt),” Master’s thesis, Department of Computer Sc & IT, Tezpur University, Assam(India), 2004.
[19] C. Eldershaw and M. Hegland, “Cluster anaysis using triangulation,” Computational Techniques and Applications World Scientific, 1997.
[20] D. Estrin, Y. Yu, and R. Govindan, “Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks,” 2001.
[21] G. Gupta and M. Younis, “Load-balanced clustering in wireless sensor networks,” 2003.
[22] J. F. Roddick, K. Hornsby, and D. d Vries, “A unifying semantic distance model for determining the similarity of attribute values,” 2003.
[23] W. S. Shi, J. P. Walters, Z. Q. Liang, and V. Chaudhary, “Wireless sensor network security: A survey,”
[24] Security in Distributed, Grid, and Pervasive Computing, Yang Xiao, Auerbach Publications, CRC Press, 2006.
[25] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” Ad Hoc Networks 1 (2003) 293315, 2003.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.