Browse > Article

A Cluster Maintenance Scheme to Reduce the Control Overhead in Mobile Ad hoc Networks  

왕기철 (전북대학교 컴퓨터통계정보학과)
방상원 (송원대학 컴퓨터정보)
조기환 (전북대학교 전자정보공학부)
Publication Information
Journal of KIISE:Information Networking / v.31, no.1, 2004 , pp. 62-69 More about this Journal
Abstract
The cluster structure reduces the number of retransmission messages, when a broadcast to all hosts in ad hoc network is needed. A cluster maintenance scheme is employed to preserve this advantage from time to time. However, most of the cluster maintenance schemes require additional control messages for cluster reformation as well as control messages for acquiring neighbor information. This mitigates the advantages of employing cluster structure in ad hoc network. In this paper, a cluster maintenance scheme which forces only clusterheads to broadcast control messages during hello time is proposed. When the cluster reformation is needed, the proposed scheme employs a strategy to reduce the control messages to a minimum. In these processes, the proposed scheme doesn't violate the definition of 2-cluster and produces the clusters in fully distributed method. The simulation results prove that our scheme is better than LCC(1).
Keywords
Ad hoc network; cluster structure; control message overhead; cluster maintenance;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Chiang, H. Wu, W. Liu, M. Gerla, 'Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel(CGSR)', Proc. of IEEE SICON '97, 1997, pp. 192-211
2 M. Gerla and C. Chiang, 'Multicluster, Mobile, Multimedia Radio Network,' ACM-Baltzer Journal of Wireless Networks, Vol. 1, No. 3, pp. 255-265, 1995   DOI
3 D. B. Johnson, D. A. Maltz, 'Dynamic Source Routing for Multihop Wireless Ad Hoc Networks,' Ad Hoc Networking, ed. C. E. Perkins, pp.139-168, Addison-Wesley, 2000
4 C. E. Perkins and E. M. Royer, 'Ad hoc On-Demand Distance Vector Routing,' Proc. of IEEE WMCSA 99, 1999, pp. 90-100   DOI
5 G. Chen, F. Garcia, J. Solano and I. Stojmenovic, 'Connectivity Based k-hop Clustering in Wireless Networks,' CD Proc. of IEEE Hawaii Int. Conf. System Science, 2002, p. 188c   DOI
6 M. Jiang, J. Li, Y. C. Tay, 'Cluster Based Routing Protocol,' IETF draft, Aug. 1999, Work in Progress
7 C. R. Lin, M. Gerla, 'Adaptive Clustering for Mobile Wireless Networks,' IEEE JSAC, 15(3), pp. 1265-1275, 1997   DOI   ScienceOn
8 P. Basu, N. Khan, T. D. C. Little, 'A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks,' Proc. of IEEE ICDCS 2001 Workshop on Wireless Networks and Mobile Computing, 2001, pp. 413-418   DOI
9 T. C. Hou and T. J. Tsai, 'An Access-Based Clustering Protocol for Multihop Wireless Ad Hoc Networks,' IEEE JSAC, 19(7), pp. 1201-1210, 2001   DOI   ScienceOn
10 유준, 김종권, '무선 Ad Hoc 망에서 인접 노드 정보 획득을 위한 제어 부하의 감소방안,' 한국 정보과학회추계 학술대회, 2002년 10월
11 S. Basagni, 'Distributed Clustering for Ad Hoc Networks,' International Symposium on Parallel Architectures, Algorithms and Networks, 1999, pp. 310-315   DOI
12 M. Gerla, T.J. Kwon, G. Pei, 'On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering,' Proc. of IEEE WCNC 2000, Chicago, IL, 2000, pp. 100-105   DOI
13 J. Yoo, H. Gil, C. Kim. 'INK: Implicit Neighbor Knowledge Routing in Ad Hoc Networks,' Proc. IEEE VTC 2003-spring, 2003, pp. 1826-1830
14 K. Liu, Jiandong Li, K. Mukumoto, A. Fukuda, 'Adative Control Protocol in Mobile Wireless Ad Hoc Networks,' APCCAS 2000, 2000, pp. 13-17   DOI
15 P. Krishna, N. H. Vadiya, M. Chatterjee, D. K.Pradhan, 'A Cluster-based Approach for Routing in Dynamic Networks,' ACM SIGCOMM Computer Communication Review, 49, pp. 49-64, 1997   DOI