Design Goals of WSN

WSN contain hundreds or thousands of nodes that can be deployed in remote areas, can make
network maintenance and organization unacceptable. To make reliable WSN design, the
design challenge is necessary to understand the parameters. There are some challenges:

 Deployment: From many perspectives, deploying is related to WSN design. It defines the
minimum number of essential sensor nodes for network construction. This sensor can also
define the quality of platform that meets the needs of pre-defined life and coverage.
Alternative design explains that the sensor network can find a sensor network for the
expected life expectancy network and the expected life. Deployment answers a question:
What is the maximum network life cycle and what is the scene of deployment for a
number of nodes and coverage areas.

 Security: For many applications the security sensor is important for the network approval
and use. The resource-related wireless sensor makes the nodes network very dangerous
for various types of attacks; passive and functional. Some important attacks include
service refusal, transferring data attacks, black holes, and Sybil attacks. Therefore
protection network should consider availability, integrity, integrity and privacy.
 Coverage: One of the challenges is that the surveillance area is completely covered. It can
be seen as a type of quality measurement (QoS) measurement that can be provided
through a specific network. Coverage specifies the detection of events on a fixed time
frame. In addition, due to weaknesses in some sensor sectors, coverage of deployment in
coverage is included.

 Quality of Service: Successful QoS solution has been developed for the traditional
network. However, WSN architecture and functionality are different from the traditional
network. It makes it exceptional to implement the traditional QoS solution of the WSNs.
The requirements of the WSN QoS are primarily determined by the application. The
general QoS requirements for wireless sensor networks are data accuracy, data collection,
coverage, error tolerance, and network life acquisition. The basic contraction of QoS for
WSN is limited sensor limited resource and network dynamics. During maintaining
network energy, it is a huge challenge to implement an effective focus solution. There is a
need to do so many investigations yet.
 Energy and Lifetime: Network deployment is an important element of life expectancy.
Wireless sensor networks WSN need to work for months or years. The main limited
element in the sensor network life is to supply energy. Each sensor is equipped with a
limited battery. Because the node is posted in a harsh area, it may not be possible to
change or recharge the node's battery. Some network actions use some sensor battery
capabilities. The network is known for a specific life. Then network life should be
considered to maximize the network life and maximize energy consumption.

Types of WSNs (Wireless Sensor Networks)

Wireless Sensor Networks (WSNs) are self-contained devices that monitor physical or
environmental conditions. These networks can monitor the site off. Early (Terrestrial
Wireless sensor networks (TWSNs), (Body Area Network (BAN), in water (Underwater
Wireless Sensor Network (UWSNs), etc. can be used for wireless sensor networks.
Depending on the environment, the type of network is set to be posted underwater,
underground, land, and so on. Various WSNs include:
1. Terrestrial WSNs
2. Underground WSNs
3. Underwater WSNs
4. Multimedia WSNs
5. Mobile WSNs

CLUSTER CREATION AND FORMATION

Cluster-based architectures make more efficient use of resources, and cluster creation
includes cluster members (CM), cluster heads, and non-cluster heads. A structured head node
manages this grouping of nodes known as CH, which manages the cluster, collects data from
cluster members, and sends data to the base station. A Cluster Head is chosen by weight that
may correlate to the capacity of a node to conduct additional responsibilities such as near BS,
no. of neighbors. It can calculate by considering factors like node residual energy with
parameters cluster member (ID), Neighbor node (neighbor ID, cluster head IP), and neighbor
cluster (NCHIP, cluster gateway-IP). Based on the Base Station site, we calculated the
distance through BS to other node numbers, using distance values, and determined the
neighboring list. To determine the k-optimal clusters in mathematical representation, we
consider the multi-object function of a network.

1) Each sensor node has the same ability to operate either in the sensing mode to perceive
environmental parameters, or in the communication mode to send data among one another or
directly to the BS, and each node can gather data packets from the cluster members when
acting as the CH;

2) Each node has a data link capable of handling all data traffic;

3) Each node is assigned an index according to its location;

4) The sensor nodes and the BS are stationary after deployment, which is typical for sensor
network applications;

5) Initial energy is fair for each sensor node, and the network is considered homogeneous;

6) All the nodes are left unattended after deployment. That is, it is impossible to recharge
battery;

7) All the nodes measure the environmental parameters at a fixed rate and send data
periodically to the target nodes;

8) Each node has a fixed number of transmission power levels. The nodes are capable of
adjusting their transmission power in accordance with the distance to the desired recipient;

9) The links between nodes are symmetric. A node can estimate the distance to another node
only based on the received signal power;

10) The sensed information is highly correlated, so the cluster head aggregate the data
gathered from its cluster into a fixed-length packet; and

11) The BS is externally powered.

RELAY NODE

Relay nodes can be used to balance the heavy consumption of the cluster heads. In SEECH
[33], some nodes with higher residual energy are selected as the relay nodes, and the CH
chooses the closest relay node as its next hop. Thus, the CH collect and aggregates data from
all the cluster members, and then transfers the data to the relay node, which relays the data to
the BS. In this way, the relay node can share the CH’s data transmission, and thus helps
offload the CH’s energy consumption. However, two or more CHs may choose the same
relay nodes, which will expedite the energy depletion of the selected relay nodes. In addition,
extra energy consumption is required when a CH chooses its relay node. Moreover, the
location of nodes is not taken into consideration in the selection of relay nodes.

Firstly, we use relay nodes to offload the energy consumption of the CHs. Different from
these protocols, in our paper, every cluster head has a corresponding relay node in our
protocol, which has two benefits: 1) the cluster heads do not need to consume additional
energy to choose their next-hop node; 2) channel contention which arises when choosing
relay nodes by the cluster heads can be avoided. In addition, the selection of the relay nodes
is based on not only the residual energy, but also the distance to the corresponding cluster
head and the BS. Then, two fitness functions are generated which determine whether a node
is selected as a cluster head or a relay node, in consideration of both their location and
residual energy. The selection of the cluster heads and relay nodes as is formulated an NP-
hard problem. And an improved PSO algorithm is proposed to achieve the optimum solution.

RELAY NODES’ SELECTION

To reduce the excessive energy consumption of the cluster heads, relay nodes are used in our
protocol to share data transmission task with the CHs. A sensor node ought to be selected as a
relay node if it meets the following two criteria. Firstly, the relay nodes and cluster head must
have a higher energy level, since they consume much more energy compared with common
nodes. Second, the node should have a superior location between the cluster node and the BS
so as to minimize the transmission energy, which is the most dominant energy consumption
in the WSN. Different from other protocols, the selection of relay nodes in our protocol is
related to the cluster heads, each of which has a corresponding relay node. As a result, the
communications costs between the cluster heads and relay nodes can be reduced.

Particle Swarm Optimization (PSO)

Particle Swarm optimization (PSO) is a population based stroke optimization technique

developed by Dr. Eberhart and Dr. Kennedy in 1995, this inspired by social behavior of bird
flocking or fish school education.
PSO evolution has many similarities with computing techniques like genetic algorithm (GA).
This system updates algorithms with random settings and searches for best value. However,
unlike GA, no evolution operators in PSO such as crossovers and mutations. In PSO, fly the
problem by following the possible solutions called particles following the current best
particles.
Particle Swarm Optimization (PSO) is a population-based optimization scheme. The random
solutions of the system are initialized with a population and search optimal solutions in each
generation [20]. The potential solutions in each generation are called particles. Each particle
in PSO keeps the stored record for all its coordinates which are related to obtaining the better
solution by following the current best particles.

Fitness function of every particle is executed and the fitness value (best solution) is calculated
and stored. The fitness value of the current optimum particle is called “pbest.” PSO optimizes
the best population value that is obtained so far by any particle in the neighbors and its
location is called lbest.

When all the generated populations are considered as topological neighbors by a particular
particle, then the best value is chosen among the generated population and that

particular best value is the best solution and it is known as gbest

The PSO always try to change the velocity of every particle towards its pbest and lbest. The
velocity is determined by random terminologies, which is having randomly generated
numbers for velocity towards pbest and lbest localities.

From the large deposit of generated solutions, the best one is selected to resolve the problem.
The PSO algorithm always stores and maintains a record of results for three global variables
such as target value or condition, gbest, and stopping value.

Every obtained particle of PSO contains the following details.(i)A data which can represent a
global solution.(ii)Value for velocity which will indicate the amount of data to be changed.
(iii)lbest value.