Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Cai, Zengyua; d | Chen, Xia; d | Wang, Zhikunc | Zhang, Jianweib; d; *
Affiliations: [a] School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, China | [b] Software Engineering College, Zhengzhou University of Light Industry, Zhengzhou, Henan, China | [c] China Unicom Luoyang Branch, Luoyang, Henan, China | [d] Henan Key Laboratory of Food Safety Data Intelligence, Zhengzhou, Henan, China
Correspondence: [*] Corresponding author: Jianwei Zhang, Software Engineering College, Zhengzhou University of Light Industry, Zhengzhou, Henan 450002, China. E-mail: [email protected].
Abstract: The Ad Hoc networks solves the problem of quickly establishing a temporary Ad Hoc network without the need for fixed facilities. However, problems such as network performance degradation, delay increase, and link interruption are endless. Aiming at the problem of shortening the survival time of Ad Hoc networks nodes, this paper proposes an improved AODV routing algorithm EC-MAODV (Energy Consumption-Modification AODV) based on energy consumption. EC-MAODV takes energy as the starting point, determines the time extension based on the residual energy of the current node, balance the power consumption of each node, and extends the networks lifetime. The effectiveness of EC-MAODV routing algorithm is proved by network simulator NS-3. The simulation results show that compared with the AODV routing protocol, the algorithm in this paper has more than 7% improvement and 19% increase in average delay and node lifetime. It can effectively prolong the life of the network, reduce the number of dead nodes, effectively solve the energy consumption problem of the wireless Ad Hoc network, and improve the overall performance of the network.
Keywords: Ad Hoc networks, AODV, energy consumption, NS-3 simulation, EC-MAODV protocol, routing protocol, routing algorithm
DOI: 10.3233/JCM-226483
Journal: Journal of Computational Methods in Sciences and Engineering, vol. 23, no. 2, pp. 887-898, 2023
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]