Browse > Article

Clustering Algorithm for a Traffic Control of Wireless Ad Hoc Networks multi-hop  

이동철 (한국정보통신기술협회 표준지원부 책임연구원)
김기문 (한국해양대학교 정보통신공학과)
김동일 (동의대학교 정보통신공학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.7, no.6, 2003 , pp. 1161-1167 More about this Journal
Abstract
The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.
Keywords
Ad hoc; Clustering; Highest connection algorithm; Lowest connection algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. M. Royer and C. K. Toh, 'A Review of Current Routing Protocol for Ad Hoc Mobile Wireless Networks,'IEEE Personal Communications, pp. 46-55, April 1999
2 Z.J. Haas and S. Tabrizi, 'On Some Challenges and Design Choices in Ad-hoc Communications.' Proceedings of IEEE MI-LCOM'98, pp. 1-6, 1998
3 Charles E. Perkins, 'AD HOC NETWORKING', Addison Wesley, 2001
4 Josh Broch, David B, Johnson, and David A. Maltz, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks.' Internet-Draft, draft-ieft-manet-dsr-00.txt, 1998
5 V.D. Park and M. S. Corson, 'A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Network' 1995
6 Theodore S. Rappaport. 'Wireless Communication, Principles and Practice, 1996
7 M. Scott Corson and Anthony Ephremides. ' A distributed routing algorithm for mobile wireless networks. Wireless Networks, 1995
8 C.K Toh, ToH, PH.D. 'Ad Hoc Mobile Wireless Networks' 2002 by Prentice Hall, Inc.
9 R.E. Bellman, Dynamic Programming, Princeton University Press, Princeton, NJ, 1957