Nature inspired algorithms for routing

The routing problem is defined as the multi-objective optimisation problem with the following objectives: To minimise the transmission distance between two nodes (MDist), hopcount (MHop), message overhead (MMsg) and to find the route with maximum trust (MTrust). Let γ be the set of CH represented by γ =  {CH1CH2,  …,  CHNc},  CHNc + 1 indicates the base station, dmax is the maximum communication range and the distance between two nodes ni and nj is denoted by dis(ni, nj). The message overhead in a network node ni is denoted by Msg(ni). In the data routing phase, the node that is selected as the destination for the next hop on the way to the base station is denoted as NH(CHi). The number of next hops needed to reach the base station from CHi is given by hop count HC(CHi) and is defined as

Objective function for trust-based routing

The choice of the parameters w1, w2, w3 and w4 may be done based on the application. In this work, w1 = 0.3, w2 = 0.3, w3 = 0.2, w4 = 0.2. Military operations and other networks demanding more security can have increased value of w4.

Leave a Reply

Your email address will not be published. Required fields are marked *