RELAY NODE PLACEMENT ALGORITHM FOR COVERAGE

OPTIMIZATION USING TWO-PHASE APPROACH

Abstract:
Coverage optimization has become one of the important aspects in the
field of sensor networks (WSN). In this work, a two phase algorithm for the
placement of relay nodes in the network to surpass the network traffic has been
modified to decrease the complexity of the algorithm. The first phase of deployment
involves the addition of relay nodes that assist the sensor nodes to transmit data to
the base station. The second phase of the algorithm involves the deployment of
second phase relay nodes which assist the first phase relay nodes to carry multi hop
transmission due to the limited energy capability of the relay nodes.
THE TWO-PHASE ALGORITHM:
The Placement of first phase relay nodes:
1. Set covering algorithm: The objective of FPRN placement is to ensure the
connectivity of SNs as they have limited transmission range. Due to the power
limitation on RNs, the amount of traffic that an RN can handle is limited. As
such, some densest regions may not be energy feasible in the sense that the
total traffic volume of SNs associated with a region is greater than the capacity
of an RN. We enhance the criteria of candidate FPRN placement locations
with an energy constraint. After finding the eligible candidate locations by
applying the enhanced criteria, the minimum set covering model is applicable
to the FPRN placement problem. The new candidate locations are called
densest energy-feasible regions. The algorithm for set cover is given below.

An example of set cover is given below:

2. Monkey Algorithm for replacement of set cover algorithm: A fitness

function has been designed to utilize the monkey algorithm for the placement
of first phase relay nodes. This algorithm achieves an order of n*log(k) where
k is the number of relay nodes that are possible to be placed whereas in the
case of set cover it is n*log(n). The results after the simulation of seven nodes
has been given below: + indicates the presence of sensor nodes and *
indicates the presence of relay nodes.

Second phase relay node placement algorithm: Three algorithms have been
proposed for the placement of second phase relay nodes which helps in
relaying the traffic to the base station.
1. Nearest-To-BS-First algorithm
2. Max-Residual-Capacity-First algorithm (MRCF)
3. Best-Effort-Relaying algorithm (BER)
Future Course work: In future we try to simulate the aforementioned three
algorithms and then propose a new model which can replace the existing
algorithms using optimization algorithm.