DOI QR코드

DOI QR Code

A Cluster Group Head Selection using Trajectory Clustering Technique

궤적 클러스터링 기법을 이용한 클러스터 그룹 헤드 선정

  • Received : 2011.11.14
  • Accepted : 2011.12.13
  • Published : 2011.12.31

Abstract

Multi-hop communication in clustering system is the technique that forms the cluster to aggregate the sensing data and transmit them to base station through midway cluster head. Cluster head around base station send more packet than that of far from base station. Because of this hot spot problem occurs and cluster head around base station increases energy consumption. In this paper, I propose a cluster group head selection using trajectory clustering technique(CHST). CHST select cluster head and group head using trajectory clustering technique and fitness function and it increases the energy efficiency. Hot spot problem can be solved by selection of cluster group with multi layer and balanced energy consumption using it's fitness function. I also show that proposed CHST is better than previous clustering method at the point of network energy efficiency.

Keywords

Multi-hop communication;Trajectory clustering;Fitness function;Cluster group head selection;Hot spot problem

References

  1. Ji-Haeng Baek, Jung-Im Won, Sang-Wook Kim, "Performance Evaluation of Trajectory Clustering in Road Network Environment," Proceedings of KSIS Spring Conference 2008, pp. 97-100, 2008. 6.
  2. M. Dhanaraj and C. Siva Ram Murthy, "On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks," IEEE Communications Society, ICC 2007 proceedings.
  3. Hazarath Munaga, J. V. R. Murthy, and N. B. Venkateswarlu, "A Novel Trajectory Clustering technique for selecting cluster heads in Wireless sensor Networks," International Journal of Recent Trends in Engineering, Vol. 1, No. 1, May 2009.
  4. R. Shah and J. Rabaey, "Energy aware routing for low energy adhoc sensor networks," in WCNC 2002: Wireless Communications and Networking Conference, vol. 1. Washington, DC, USA: IEEE Computer Society, pp. 350-355, March 2002.
  5. J. H. Chang and L. Tassiulas, "Maximum lifetime routing in wireless sensor networks," IEEE/ACM Trans. Netw., Vol. 12, No. 4, pp. 609-619, Aug. 2004. https://doi.org/10.1109/TNET.2004.833122
  6. W. B. Heinzelman, "Application-Specific Protocol Architectures for Wireless Networks," IEEE Transactions on Wireless Communications, Vol. 1, No. 4, pp. 660-670, Oct, 2002. https://doi.org/10.1109/TWC.2002.804190
  7. T. Rappaport, "Wireless Communications: Principles & Practice," Englewood Cliffs, NJ: Prentice-Hall, 1996.
  8. D. P. Huttenlocher and K. Kedem, "Computing the minimum hausdorff distance for point sets under translation," in SCG '90: sixth annual symposium on Comp. geo. New York, USA: ACM, pp. 340-349, 1990.
  9. Normand Gregoire, Mikael Bouillot, "Hausdorff distance between convex polygons," http://www-cgrl.cs.mcgill. ca/-godfried/teaching/cg-projects/98/normand
  10. R. Tyrrell Rockafellar, Roger J-B Wets, "Variational Analysis," Springer-Verlag, 2005, p. 117.
  11. Jin-Su Kim, "An Efficient Energy Consumption Method using Trajectory Clustering in Wireless Sensor Networks," KCS 2011 Conference, 2011.
  12. Jin-Su Kim, Seung-Soo Shin, "An Energy Consumption Model using Hierarchical Unequal Clustering Method," Journal of KAIS, Vol. 12, No. 6, 2011. https://doi.org/10.5762/KAIS.2011.12.6.2815
  13. S. Soro and W. Heinzelman, "Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering," Proceedings of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IEEE WMAN '05), April 2005.