Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network

被引:50
作者
Tseng, YC [1 ]
Ni, SY [1 ]
Shih, EY [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Comp Sci & Informat Engn, Hsinchu 30050, Taiwan
来源
21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS | 2001年
关键词
D O I
10.1109/ICDSC.2001.918978
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In a multihop mobile ad hoc network, broadcasting is an elementary operation to support many applications. In [15], it is shown that naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. Several threshold-based schemes are shown to perform better than flooding in [15]. However, how to choose thresholds also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose several adaptive schemes, which can dynamically adjust thresholds based on local connectivity information. Simulation results show that these adaptive schemes can offer better reachability as well as efficiency as compared the results in [15].
引用
收藏
页码:481 / 488
页数:8
相关论文
共 18 条
[1]  
Alagar S, 1995, MILCOM 95 - CONFERENCE RECORD, VOLS 1-3, P236, DOI 10.1109/MILCOM.1995.483305
[2]  
[Anonymous], 802111997 IEEE
[3]  
Broch J., 1998, MobiCom'98. Proceedings of Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, P85, DOI 10.1145/288235.288256
[4]  
BROCH J, 1998, UNPUB DYNAMIC SOURCE
[5]  
CHIANG CC, 1998, ACM BALTZER J CLUSTE, V1
[6]  
Corson S, 1999, MOBILE AD HOC NETWOR
[7]  
DUBE R, 1997, IEEE PERSONAL CO FEB
[8]  
GERLA M, 1998, ACM BALTZER MOBILE N, V4, P193
[9]  
HAAS ZJ, 1998, UNPUB ZONE ROUTING P
[10]  
JAQUET P, 2000, UNPUB OPTIMIZED LINK