On state maintenance in cluster-based mobile ad-hoc networks

被引:8
作者
Banerjee, Amit [1 ]
King, Chung-Ta [2 ]
Hsiao, Hung-Chang [3 ]
机构
[1] South Asian Univ, Dept Comp Sci, New Delhi, India
[2] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu, Taiwan
[3] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan, Taiwan
关键词
Mobile ad hoc network; State maintenance; Clustering; PROTOCOL;
D O I
10.1016/j.adhoc.2017.08.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Clustering is an effective strategy for tackling the dynamics and scalability in a large-scale mobile ad hoc networks (MANETs). However, the mobility of the nodes makes it very difficult to maintain the states of the clusters, such as connectivity between clusters, available bandwidth, and node membership. A good maintenance scheme should balance the workload and power consumption of the nodes, incur little overhead, and track the changes timely and accurately. For this, we consider the implementation of a maintenance sublayer to handle the dynamic state of the clusters. The idea is to hide the dynamics of the underlying clusters, to improve the performance of applications in MANET. In this paper, we examine the design space of the state maintenance problem in cluster-based MANETs. At one end, we study a fully distributed approach, called Cluster-Based WithOut Head Overlay (CWOHO). At the other end, we consider the strategy that uses cluster heads to handle the maintenance operations, called Cluster-Based With Head Overlay (CWHO). In-between two extremes, we investigate a third possibility, called Clusters with Neighbor Information (CNI). We provide an in-depth and comprehensive study of these strategies under various network conditions and mobility models. Our experimental evaluation shows that the data delivery ratio of CWOHO is at least 7% more than CWHO, under increasing node mobility and number of clusters. However, the reverse is true for the control overhead. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:95 / 109
页数:15
相关论文
共 38 条
[1]   Energy constraint clustering algorithms for wireless sensor networks [J].
Albath, Julia ;
Thakur, Mayur ;
Madria, Sanjay .
AD HOC NETWORKS, 2013, 11 (08) :2512-2525
[2]  
[Anonymous], 1999, P 3 INT WORKSHOP DIS, DOI DOI 10.1145/313239.33261
[3]  
[Anonymous], MOBILE AD HOC NETWOR
[4]   A survey of mobility models for ad hoc network research [J].
Camp, T ;
Boleng, J ;
Davies, V .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2002, 2 (05) :483-502
[5]  
CHEN Y., 2002, J GEOSPATIAL ENG, V2, P3, DOI DOI 10.1145/513800.513821
[6]  
Das B, 1997, ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, P376, DOI 10.1109/ICC.1997.605303
[7]  
Dubhashi D, 2003, SIAM PROC S, P717
[8]  
ETSI, 1998, 30 UMTS ETSI
[9]  
Fang Q, 2005, IEEE INFOCOM SER, P339
[10]  
GERLA M, 2000, P IEEE WIR COMM NETW