Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network

Wireless ad hoc network is widely used nowadays, in particular the mobile type, known as the mobile ad hoc network (MANET). This type of network consists of sets of mobile nodes that do not require a fixed infrastructure such as an access point or base station. The common use of MANET is to enable n...

Full description

Saved in:
Bibliographic Details
Main Authors: Tareq, M., Abed, S.A., Sundararajan, E.A.
Format: Article
Published: Springer Verlag 2019
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069451190&doi=10.1007%2f978-3-319-69889-2_2&partnerID=40&md5=14cf7aa623ef606d66bf3008ed8895b1
http://eprints.utp.edu.my/23487/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.23487
record_format eprints
spelling my.utp.eprints.234872021-08-19T07:39:25Z Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network Tareq, M. Abed, S.A. Sundararajan, E.A. Wireless ad hoc network is widely used nowadays, in particular the mobile type, known as the mobile ad hoc network (MANET). This type of network consists of sets of mobile nodes that do not require a fixed infrastructure such as an access point or base station. The common use of MANET is to enable nodes contacting in the absence of the typical communications infrastructure. Constantly changing topology and having no fixed infrastructures are some of the challenges confronted through a MANET designing. Hence, emphasizing the need to establish an efficient connection inside the network we use for a routing protocol to explore paths among nodes. The guarantee of finding optimum path formation among the nodes is the primary goal of the routing protocol, in order to ensure that messages would be delivered timely. The aim of this paper is to find the best possible route from the source to the destination based on a method inspired by the searching behaviour of bee colonies, i.e. artificial bee colony (ABC) algorithm. This algorithm works on minimizing the average energy consumption of the selected route. For evaluation purposes, the proposed model has been applied on two protocols, i.e. the Destination-Sequenced Distance-Vector Routing (DSDV) and Ad hoc On-demand Distance-Vector (AODV). The evaluation is based on node speed and packet size topology parameters. The results show that the network nodes can save more energy in AODV as compared to DSDV. As such, it can be concluded that optimizing the path from the source to the destination has a significant impact on the quality of the network performance. © 2019, Springer Nature Switzerland AG. Springer Verlag 2019 Article NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069451190&doi=10.1007%2f978-3-319-69889-2_2&partnerID=40&md5=14cf7aa623ef606d66bf3008ed8895b1 Tareq, M. and Abed, S.A. and Sundararajan, E.A. (2019) Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network. Green Energy and Technology . pp. 21-38. http://eprints.utp.edu.my/23487/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
description Wireless ad hoc network is widely used nowadays, in particular the mobile type, known as the mobile ad hoc network (MANET). This type of network consists of sets of mobile nodes that do not require a fixed infrastructure such as an access point or base station. The common use of MANET is to enable nodes contacting in the absence of the typical communications infrastructure. Constantly changing topology and having no fixed infrastructures are some of the challenges confronted through a MANET designing. Hence, emphasizing the need to establish an efficient connection inside the network we use for a routing protocol to explore paths among nodes. The guarantee of finding optimum path formation among the nodes is the primary goal of the routing protocol, in order to ensure that messages would be delivered timely. The aim of this paper is to find the best possible route from the source to the destination based on a method inspired by the searching behaviour of bee colonies, i.e. artificial bee colony (ABC) algorithm. This algorithm works on minimizing the average energy consumption of the selected route. For evaluation purposes, the proposed model has been applied on two protocols, i.e. the Destination-Sequenced Distance-Vector Routing (DSDV) and Ad hoc On-demand Distance-Vector (AODV). The evaluation is based on node speed and packet size topology parameters. The results show that the network nodes can save more energy in AODV as compared to DSDV. As such, it can be concluded that optimizing the path from the source to the destination has a significant impact on the quality of the network performance. © 2019, Springer Nature Switzerland AG.
format Article
author Tareq, M.
Abed, S.A.
Sundararajan, E.A.
spellingShingle Tareq, M.
Abed, S.A.
Sundararajan, E.A.
Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network
author_facet Tareq, M.
Abed, S.A.
Sundararajan, E.A.
author_sort Tareq, M.
title Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network
title_short Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network
title_full Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network
title_fullStr Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network
title_full_unstemmed Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network
title_sort artificial bee colony for minimizing the energy consumption in mobile ad hoc network
publisher Springer Verlag
publishDate 2019
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069451190&doi=10.1007%2f978-3-319-69889-2_2&partnerID=40&md5=14cf7aa623ef606d66bf3008ed8895b1
http://eprints.utp.edu.my/23487/
_version_ 1738656479043387392
score 13.188404