An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali

An Energy Efficient An Energy Efficient Routing Protocol for Routing Protocol for

Cluster-Based Wireless Cluster-Based Wireless Sensor Networks Using Sensor Networks Using Ant Colony OptimizationAnt Colony Optimization

Ali-Asghar Salehpour, Babak Ali-Asghar Salehpour, Babak Mirmobin, Ali Afzali-Kusha, Mirmobin, Ali Afzali-Kusha,

Siamak MohammadiSiamak Mohammadi

11

OutlineOutline

IntroductionIntroduction Clustering AlgorithmsClustering Algorithms ACO-Based Routing in WSNACO-Based Routing in WSN Proposed AlgorithmProposed Algorithm Results and DiscussionResults and Discussion ConclusionConclusion

22

IntroductionIntroduction

Intra-cluster, cluster members send data Intra-cluster, cluster members send data directly to their cluster head.directly to their cluster head.

Inter-cluster, the cluster heads use ant colony Inter-cluster, the cluster heads use ant colony optimization (ACO) algorithm to find a route optimization (ACO) algorithm to find a route to the base station.to the base station.

33


Each cluster is managed by a chosen Cluster-Each cluster is managed by a chosen Cluster-Head (CH).Head (CH).

Cluster members send data packets to the Cluster members send data packets to the cluster heads which communicate with each cluster heads which communicate with each other and send the aggregated packet to the other and send the aggregated packet to the Base Station (BS).Base Station (BS).

44


The clustering techniques can considerably The clustering techniques can considerably reduce the energy consumption.reduce the energy consumption.

Use the ant colony optimization (ACO) to find Use the ant colony optimization (ACO) to find the optimal route from the cluster heads to the the optimal route from the cluster heads to the base station.base station.

55

Clustering AlgorithmsClustering Algorithms

In a routing algorithm called LEACH (Low-In a routing algorithm called LEACH (Low-Energy Adaptive Clustering Hierarchy).Energy Adaptive Clustering Hierarchy).

The operation of LEACH is separated into The operation of LEACH is separated into rounds.rounds.

Each round consists of two phases of Each round consists of two phases of clustering and message transmission.clustering and message transmission.

66


Each non cluster head node sends and receives Each non cluster head node sends and receives data only during its allocated transmission slot.data only during its allocated transmission slot.

The cluster head sends the aggregated and The cluster head sends the aggregated and compressed data to the base station.compressed data to the base station.

77


In HEED (Hybrid Energy-Efficient Distributed In HEED (Hybrid Energy-Efficient Distributed Clustering), the clustering process requires a Clustering), the clustering process requires a number of iterations.number of iterations.

A node becomes a cluster head with a certain A node becomes a cluster head with a certain probability which considers a mixture of probability which considers a mixture of energy and communication cost.energy and communication cost.

88


All other nodes, which are not cluster head, All other nodes, which are not cluster head, select the cluster head which has the lowest select the cluster head which has the lowest intra-cluster communication cost and directly intra-cluster communication cost and directly communicate with it.communicate with it.

99

ACO-Based Routing in WSNSACO-Based Routing in WSNS

The most recognized ACO-based routing The most recognized ACO-based routing algorithm, AntNet, uses backward and forward algorithm, AntNet, uses backward and forward agents or “ants” that explore routing agents or “ants” that explore routing possibilities throughout the network.possibilities throughout the network.

1010


At every intermediate node At every intermediate node i, an ant chooses i, an ant chooses its next hop j toward its destination if it has its next hop j toward its destination if it has not not previously visited the next hop.previously visited the next hop.

The next hop is selected based on a The next hop is selected based on a probabilistic decision rule asprobabilistic decision rule as

1111


This enables an ant to make a decision based This enables an ant to make a decision based on the energy level of the neighbor nodes.on the energy level of the neighbor nodes.

When the forward agent arrives at its When the forward agent arrives at its destination node, a backward ant (agent) is destination node, a backward ant (agent) is created and the memory of the forward ant is created and the memory of the forward ant is transferred to the backward ant.transferred to the backward ant.

1212


The backward ant deposits a quantity of The backward ant deposits a quantity of pheromone on each node given bypheromone on each node given by

These pheromone values are saved in the node These pheromone values are saved in the node memory to be used in future decision making memory to be used in future decision making for the next hop by this node.for the next hop by this node.

1313


The operation of pheromone evaporation is The operation of pheromone evaporation is used to avoid unlimited accumulation of the used to avoid unlimited accumulation of the pheromone trails and enables the algorithm to pheromone trails and enables the algorithm to “forget” previously done bad decisions.“forget” previously done bad decisions.

The operation is performed in similar intervals The operation is performed in similar intervals usingusing

1414

Proposed AlgorithmProposed Algorithm

At intervals of definite time (round), first At intervals of definite time (round), first clustering is done using LEACH and then each clustering is done using LEACH and then each cluster member sends its data to its own CH cluster member sends its data to its own CH directly.directly.

After gathering the data of the members, the After gathering the data of the members, the CH sends the gathered data to the BS through CH sends the gathered data to the BS through neighbor nodes using ACO.neighbor nodes using ACO.

1515


The proposed approach has three following The proposed approach has three following steps:steps:1.1. Selection of CH’s and the members of each Selection of CH’s and the members of each

cluster.cluster.

2.2. TDMA scheduling where each CH decides when TDMA scheduling where each CH decides when each node is to send its data, using TDMA.each node is to send its data, using TDMA.

3.3. Route setup where each node finds the optimal Route setup where each node finds the optimal route to base through CH’s. route to base through CH’s.

1616


After gathering the data of its own members, After gathering the data of its own members, each CH adds some parameters to the data for each CH adds some parameters to the data for making a frame (forward ant).making a frame (forward ant).

1717


1818

1919

2020


After receiving the data by BS, it should After receiving the data by BS, it should update the pheromone value of the path nodes.update the pheromone value of the path nodes.

This is performed by the acknowledge frame This is performed by the acknowledge frame transmitted via the backward ants.transmitted via the backward ants.

If the source node does not receive the If the source node does not receive the acknowledge frame, after finishing the time-acknowledge frame, after finishing the time-out, the transferred data is sent through out, the transferred data is sent through another path.another path.

2121

Result and DiscussionResult and Discussion

The reference network used in our simulations The reference network used in our simulations had 500 nodes with a diameter of 1000 meters.had 500 nodes with a diameter of 1000 meters.

Each node had 2 joules of initial energy.Each node had 2 joules of initial energy. The packet size was 2000 bits and five percent The packet size was 2000 bits and five percent

of the nodes were selected as cluster heads.of the nodes were selected as cluster heads. The base station was chosen randomly in the The base station was chosen randomly in the

network.network.

2222


We assume that the energy loss due to the We assume that the energy loss due to the channel transmission is proportional to the channel transmission is proportional to the distance to the power of two.distance to the power of two.

To transmit a k-bit message to a distance of d, To transmit a k-bit message to a distance of d, the dissipated energy is obtainedthe dissipated energy is obtained

2323


Similarly, the dissipated energy to receive a k-Similarly, the dissipated energy to receive a k-bit message is given bybit message is given by

2424

2525

ConclusionConclusion

We proposed a routing algorithm for the We proposed a routing algorithm for the cluster-based large scale wireless sensor cluster-based large scale wireless sensor networks using the ant colony optimization.networks using the ant colony optimization.

The simulation results showed a higher system The simulation results showed a higher system lifetime and load balancing for the proposed lifetime and load balancing for the proposed routing algorithm compared to these routing routing algorithm compared to these routing algorithms.algorithms.

2626

Thank you for your Thank you for your listeninglistening

2727

Documents

An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali