Ant Colony System for Energy Consumption Optimization in Mobile IoT Networks

2019 ◽  
Vol 29 (09) ◽  
pp. 2050150
Author(s):  
Hong-Yan Zhao ◽  
Jia-Chen Wang ◽  
Xin Guan ◽  
Zhi-Hong Wang ◽  
Yong-Hui He ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Ant Colony System ◽  
Dijkstra Algorithm ◽  
User Cooperation ◽  
Multiple Sources ◽  
Energy Efficient Routing ◽  
Energy Consumption Optimization

In this paper, a new algorithm is proposed for computing the node-disjoint optimal transmission energy consumption route for coded cooperative mobile IoT networks. Inspired by the potential benefits user cooperation can provide, we incorporate user cooperation to the mobile ad-hoc multi-hop IoT networks. Our results include a novel ant colony system-based node-disjoint energy-efficient routing algorithm. Ant colony system can approximate the optimal route by local information and is thus very suitable for mobile IoT network environment. In particular, ant algorithm makes history-sensitive choice and thus can significantly outperform the greedy algorithm. In addition, it can efficiently handle the case of multiple sources and multiple destinations. For a large IoT network, we investigate the multi-scale ant colony system and when compared to Dijkstra algorithm, such an algorithm usually shortens the runtime by a factor of several hundred.

scholarly journals Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3657 ◽  
Author(s):  
Dong Yang ◽  
Hongxing Xia ◽  
Erfei Xu ◽  
Dongliang Jing ◽  
Hailin Zhang
Keyword(s):  
Energy Consumption ◽  
Ant Colony Optimization ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Transition Probability ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Route Discovery ◽  
Mobile Ad Hoc ◽  
Offset Coefficient

The mobile ad hoc network (MANET) is a multi-hop, non-central network composed of mobile terminals with self-organizing features. Aiming at the problem of extra energy consumption caused by node motion in MANETs, this paper proposes an improved energy and mobility ant colony optimization (IEMACO) routing algorithm. Firstly, the algorithm accelerates the convergence speed of the routing algorithm and reduces the number of route discovery packets by introducing an offset coefficient of the transition probability. Then, based on the energy consumption rate, the remaining lifetime of nodes (RLTn) is considered. The position and velocity information predicts the remaining lifetime of the link (RLTl). The algorithm combines RLTn and RLTl to design the pheromone generation method, which selects the better quality path according to the transition probability to ensure continuous data transmission. As a result, the energy consumption in the network is balanced. The simulation results show that compared to the Ad Hoc on-demand multipath distance vector (AOMDV) algorithm with multipath routing and the Ant Hoc Max-Min-Path (AntHocMMP) algorithm in consideration of node energy consumption and mobility, the IEMACO algorithm can reduce the frequency of route discovery and has lower end-to-end delay as well as packet loss rate especially when nodes move, and can extend the network lifetime.

scholarly journals An Improved Ant Colony Routing Algorithm for WSNs

2015 ◽  
Vol 2015 ◽  
pp. 1-4 ◽  
Author(s):  
Tan Zhi ◽  
Zhang Hui
Keyword(s):  
Energy Consumption ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Dijkstra Algorithm ◽  
Self Organized ◽  
Ant Colony Algorithms ◽  
Balance Energy ◽  
Improved Ant Colony Algorithm ◽  
Improved Algorithm

Ant colony algorithm is a classical routing algorithm. And it are used in a variety of application because it is economic and self-organized. However, the routing algorithm will expend huge amounts of energy at the beginning. In the paper, based on the idea of Dijkstra algorithm, the improved ant colony algorithm was proposed to balance the energy consumption of networks. Through simulation and comparison with basic ant colony algorithms, it is obvious that improved algorithm can effectively balance energy consumption and extend the lifetime of WSNs.

scholarly journals PARAMETER ADAPTATION FOR ANT COLONY SYSTEM IN WIRELESS SENSOR NETWORK

2019 ◽  
Author(s):  
Husna Jamal Abdul Nasir ◽  
Ku Ruhana Ku-Mahamud ◽  
Eiji Kamioka
Keyword(s):  
Energy Consumption ◽  
Routing Algorithm ◽  
Optimal Performance ◽  
Ant Colony ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Ant Colony System ◽  
Packet Routing ◽  
Parameter Adaptation ◽  
Set Up

The Ant Colony System (ACS) algorithm has been applied in solving packet routing problems in Wireless Sensor Networks (WSNs). Solving these problems is complicated as packets need to be submitted through sensor nodes which are spatially distributed and heterogeneous by nature. Without an effective packet routing algorithm, energy consumption will be increased while network lifetime will be reduced. Most researches are focused on optimizing the routing process by using predefined parameters within a certain range. However, this approach will not guarantee optimal performance. This paper presents the parameter adaptation values for ACS experimental set-up in validating its performance. Possible values of each parameter within a defined range were employed. Experiments were conducted to obtain the best value of each parameter to be used for throughput, energy consumption, and latency. Results of this study can be adopted to achieve optimal performance for the packet routing process.  

Research on MANET Routing Algorithm Based on Ant Colony Algorithm

2011 ◽  
Vol 135-136 ◽  
pp. 781-787
Author(s):  
Yong Feng Ju ◽  
Hui Chen
Keyword(s):  
Network Lifetime ◽  
Ant Colony Algorithm ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Packet Transmission ◽  
Ant Colony ◽  
Dynamic Allocation ◽  
Routing Table ◽  
Manet Routing ◽  
Rate Dynamic

This paper proposed a new Ad Hoc dynamic routing algorithm, which based on ant-colony algorithm in order to reasonably extend the dynamic allocation of network traffic and network lifetime. The Algorithm choose path according transmission latency, path of the energy rate, congestion rate, dynamic rate. The Algorithm update the routing table by dynamic collection of path information after path established. The analyse shows that algorithm increases the network throughput, reduces the average end-to-end packet transmission latency, and extends the network lifetime, achieves an improving performance.

scholarly journals Mathematical formulation of energy efficient routing with constraint in mobile ad hoc network

2018 ◽  
Vol 7 (2) ◽  
pp. 674
Author(s):  
Rakesh Sahu ◽  
Narendra Chaudhari
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mathematical Formulation ◽  
Energy Efficient Routing ◽  
Optimization Function ◽  
Mobile Ad Hoc ◽  
The Mathematical Model

Energy consumption of nodes during the transmission is an important factor for the efficiency and lifetime of a mobile ad hoc network. The reduction in consumption of energy can be achieved, only when its consumption at each step is known. The purpose of this paper is to formulate the mathematical model of energy consumption of network on the basis on links and available nodes in order to formulate the energy optimization function. The probability of link failure in route and innetwork have been taken into consideration as constraints while formulating the objective function of estimated energy consumption, as the low connectivity is one of the challenges due to mobility in ad hoc network.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

Sign in / Sign up

Export Citation Format

Share Document