Fire Ecology | |
Analyzing the impacts of node density and speed on routing protocol performance in firefighting applications | |
Original Research | |
Farhad Ali1  Inam Ullah2  Chang Choi2  Aamir Khan3  Iqtidar Ali3  Tariq Hussain4  | |
[1] Department of Accounting and Information Systems, College of Business and Economics, Qatar University, Doha, Qatar;Department of Computer Engineering, Gachon University, 13120, Seongnam, Sujeong-Gu, Republic of Korea;Institute of Computer Science and IT, The University of Agriculture, Peshawar, Pakistan;School of Computer Science and Technology, Zhejiang Gongshang University, Hangzhou, China; | |
关键词: Mobile ad-hoc networks; Ambulance mobility; Firefighters; Fire management; Quality of service; Disaster management; | |
DOI : 10.1186/s42408-023-00220-4 | |
received in 2023-04-12, accepted in 2023-09-13, 发布年份 2023 | |
来源: Springer | |
【 摘 要 】
BackgroundMobile ad hoc networks have piqued researchers’ interest in various applications, including forest fire detection. Because of the massive losses caused by this disaster, forest fires necessitate regular monitoring, good communication, and technology. As a result, disaster response and rescue applications are mobile ad hoc network’s primary applications. However, quality of service becomes a significant and difficult issue, and the capabilities of the basic routing protocol limit mobile ad hoc network’s ability to deliver reasonable quality of service.ResultsThe proposed research is for disaster-related scenarios, with nodes representing firefighters and vehicles (ambulances). Mobile nodes moving at 10 m/s are thought to be firefighters, while nodes moving at 20 m/s are thought to be vehicles (ambulances) delivering emergency healthcare. The NS-2 simulator is used in this research for the performance assessment of the two routing protocols, such as Optimized Link State Routing (OLSR) and Temporally Order Routing Algorithm (TORA), in terms of average latency, average throughput, and average packet drop. The simulation was run with varying node velocities and network densities to examine the impact of scalability on the two mobile ad hoc network routing protocols.ConclusionsThis work presents two main protocols: TORA (for reactive networks) and OLSR (for proactive networks). The proposed methods had no impact on the end-to-end bandwidth delay or the packet delivery delay. The performance is evaluated in terms of varying network density and node speed (firefighter speed), i.e., varying network density and mobility speed. The simulation revealed that in a highly mobile network with varying network densities, OLSR outperforms TORA in terms of overall performance. TORA’s speed may have been enhanced by adding more nodes to the 20 nodes that used a significant amount of transmission control protocol traffic.
【 授权许可】
CC BY
© Association for Fire Ecology 2023
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202311102900328ZK.pdf | 2455KB | download | |
MediaObjects/41408_2023_927_MOESM6_ESM.tif | 3545KB | Other | download |
Fig. 10 | 4904KB | Image | download |
Fig. 1 | 111KB | Image | download |
12951_2017_255_Article_IEq51.gif | 1KB | Image | download |
12951_2016_246_Article_IEq16.gif | 1KB | Image | download |
12888_2023_5292_Article_IEq1.gif | 1KB | Image | download |
12951_2017_255_Article_IEq53.gif | 1KB | Image | download |
12951_2017_255_Article_IEq54.gif | 1KB | Image | download |
MediaObjects/12888_2023_5243_MOESM1_ESM.docx | 106KB | Other | download |
Fig. 3 | 1660KB | Image | download |
Fig. 13 | 670KB | Image | download |
Fig. 3 | 1733KB | Image | download |
Fig. 7 | 148KB | Image | download |
12936_2017_1882_Article_IEq9.gif | 1KB | Image | download |
【 图 表 】
12936_2017_1882_Article_IEq9.gif
Fig. 7
Fig. 3
Fig. 13
Fig. 3
12951_2017_255_Article_IEq54.gif
12951_2017_255_Article_IEq53.gif
12888_2023_5292_Article_IEq1.gif
12951_2016_246_Article_IEq16.gif
12951_2017_255_Article_IEq51.gif
Fig. 1
Fig. 10
【 参考文献 】
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]
- [26]
- [27]
- [28]
- [29]
- [30]
- [31]
- [32]
- [33]
- [34]
- [35]
- [36]
- [37]
- [38]
- [39]
- [40]
- [41]