A distance-aware counter-based broadcast scheme for wireless ad hoc networks

被引:0
作者
Chen, Chien [1 ]
Hsu, Chin-Kai [1 ]
Wang, Hsien-Kang [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Comp Informat Sci, Hsinchu, Taiwan
来源
MILCOM 2005 - 2005 IEEE MILITARY COMMUNICATIONS CONFERENCE, VOLS 1-5 | 2005年
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In mobile ad hoc networks (MANETs), broadcasting is a common operation for providing network functions, such as route discovery and source paging. However, an uncontrolled broadcast, which is also called blind flooding, is inefficient and may lead to heavy redundancies, contentions and collisions, and is commonly referred to as a "broadcast storm" problem [1]. Although this problem has been addressed extensively, most studies suffer with respect to balance between coverage performance and rebroadcasting efficiency. This investigation proposes an efficient algorithm called "DIS_RAD", which introduces the concept of distance into the counter-based broadcast scheme. The proposed approach gives nodes closer to the border a higher rebroadcast probability since they create better Expected Additional Coverage (EAC) [1]. Here, a distance threshold is adopted to distinguish between interior and border nodes. Two distinct Random Assessment Delays (RADs) are applied to the border and interior nodes, with the border nodes having shorter RADs than the interior nodes. The analytical results indicate that the proposed scheme indeed provides a higher rebroadcast probability for border nodes and a lower rebroadcast probability for interior nodes. The simulation results demonstrate that the proposed "DIS_RAD" scheme works much better than other schemes. The probability analysis model also confirms the validity of the simulation results. Most important, the proposed scheme can keep, good balance between reachability and rebroadcast efficiency in various network densities. Therefore, the dynamic adjust counter threshold according to network densities is not necessary.
引用
收藏
页码:1052 / 1058
页数:7
相关论文
共 50 条
[41]   Trust-Based Probabilistic Broadcast Scheme for Mobile Ad Hoc Networks [J].
Xu, Huaqiang ;
Si, Haipeng ;
Zhang, Hang ;
Zhang, Liren ;
Leng, Yan ;
Wang, Jingjing ;
Li, Dengwang .
IEEE ACCESS, 2020, 8 :21380-21392
[42]   Traffic Density-Based Broadcast Scheme for Vehicular Ad Hoc Networks [J].
Kum, Dong-Won ;
Khan, Ajmal ;
Cho, You-Ze .
IEICE TRANSACTIONS ON COMMUNICATIONS, 2012, E95B (12) :3875-3878
[43]   A power-aware adaptive dynamic routing scheme for wireless ad hoc networks [J].
Li, Zhang ;
Zhen-Wei, Yu ;
Yang, Zhang ;
Chun-Kai, Zhang .
PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, :966-+
[44]   A Novel QoS-Aware Resource Allocation Scheme for Wireless Ad Hoc Networks [J].
Han, Bing-Qing ;
Feng, Guo-Fu .
2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 3, 2009, :358-+
[45]   A Constrained Coding-Aware Routing Scheme in Wireless Ad-Hoc Networks [J].
Zhao, Yimin ;
Xiao, Song ;
Gan, Hongping ;
Li, Lizhao ;
Xiao, Lina .
SENSORS, 2019, 19 (10)
[46]   Tree based broadcast in ad hoc networks [J].
Jüttner, A ;
Magi, A .
MOBILE NETWORKS & APPLICATIONS, 2005, 10 (05) :753-762
[47]   Location-aided broadcast in wireless ad hoc networks [J].
Yang, Junmo ;
Kim, Bonam ;
Sun, Min-Te ;
Lai, Ten-Hwang .
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2007, 23 (03) :869-884
[48]   Tree Based Broadcast in Ad Hoc Networks [J].
Alpär Jüttner ;
Ádám Magi .
Mobile Networks and Applications, 2005, 10 :753-762
[49]   An adaptive probabilistic broadcast scheme for ad-hoc networks [J].
Ryu, JP ;
Kim, MS ;
Hwang, SH ;
Han, KJ .
HIGH SPEED NETWORKS AND MULTIMEDIA COMMUNICATIONS, PROCEEDINGS, 2004, 3079 :646-654
[50]   Reliable broadcast scheme initiated by receiver in ad hoc networks [J].
Cho, SY ;
Sin, JH ;
Mun, BI .
LCN 2003: 28TH CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2003, :281-282