Mobile Ad-hoc Network (MANET) is a self-organizing wireless network that communicates without infrastructure and suffering from low power-battery. The challenges of under-optimization have received a great amount of attention from researchers, and Energy Consumption (EC) is the most important of those challenges for them in this field. Therefore, the main objective in finding a route from source to destination is to minimize node EC. Integer Linear Programming (ILP) and Ant Colony Optimization (ACO) are two algorithms that enhance EC and processing time, which are Quality of Service (QoS) requirements. In our paper, we proposed the two algorithms, which are evaluated regarding two criteria: EC and processing time using an experimental study. The optimal route of the proposed ILP is chosen from all possible routes using the minimum EC as an objective function and a set of constraints. The second algorithm is a proposed ACO version, based on ants' behaviour Looking for a path from their colony to their food source. The two proposed algorithms were implemented and compared according to different criteria (route selection, EC and processing time).
CITATION STYLE
Ashraf, M., Tawfik, B. S., El Diasty, S., & Hassan, M. (2020). MANET’s Energy Consumption using proposed Ant-Colony Optimization and Integer Linear Programming Algorithms. In Journal of Physics: Conference Series (Vol. 1447). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1447/1/012047
Mendeley helps you to discover research relevant for your work.