A novel routing protocol considering the boundary effects for ad hoc networks

被引:0
作者
Wang, Qingwen [1 ,2 ,3 ]
Yu, Haitao [4 ]
机构
[1] Xian Res Inst High Technol, Xian 710025, Peoples R China
[2] Sci & Technol Commun Networks Lab, Shijiazhuang, Hebei, Peoples R China
[3] Xian Univ Architectural Sci & Technol, Xian, Peoples R China
[4] Guilin Univ Technol, Guilin, Peoples R China
基金
中国国家自然科学基金;
关键词
Ad hoc networks; broadcast storm problem; routing protocol; node degree; static game forwarding; COVERAGE;
D O I
10.1177/1550147720903635
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.
引用
收藏
页数:16
相关论文
共 19 条
[1]  
[Anonymous], 28 INT C INF SYST AS
[2]  
Camilo T, 2006, P 5 INT C ANT COL OP
[3]  
Cartigny J., 2003, 36th Hawaii International Conference on Systems Sciences
[4]   Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks [J].
Hanashi, Abdalla M. ;
Siddique, Aamir ;
Awan, Irfan ;
Woodward, Mike .
SIMULATION MODELLING PRACTICE AND THEORY, 2009, 17 (02) :364-375
[5]  
Johnson D., 2002, DYNAMIC SOURCE ROUTI
[6]  
Lysiuk I.S., 2010, 2010 IEEE WIR COMM N, P1, DOI [10.1109/WCNC.2010.5506346, DOI 10.1109/WCNC.2010.5506346]
[7]  
Marina MaheshK., 2002, ACM SIGMOBILE Mobile Computing and Communications Review, V63, P92
[8]  
Mekki K, INT J DISTRIB SENS N, V15, P1
[9]   Game theoretic approach in routing protocol for wireless ad hoc networks [J].
Naserian, Moliammad ;
Tepe, Kemal .
AD HOC NETWORKS, 2009, 7 (03) :569-578
[10]   Ad-hoc On-Demand Distance Vector Routing [J].
Perkins, CE ;
Royer, EM .
WMCSA '99, SECOND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 1999, :90-100