Wireless Sensor Networks (WSNs)
A Wireless sensor network can be defined as a network of
devices that can communicate the information gathered from a
monitored field through wireless links. The data is forwarded
through multiple nodes, and with a gateway, the data is
connected to other networks like wireless Ethernet.
WSN is a wireless network that consists of base stations and
numbers of nodes (wireless sensors).These networks are used to
monitor physical or environmental conditions like sound,
pressure, temperature and co-operatively pass data through the
network to a main location as shown in the figure.
Types of WSNs (Wireless Sensor Networks)
Depending on the environment, the types of networks are decided
so that those can be deployed underwater, underground, on land,
and so on. Different types of WSNs include:
1. Terrestrial WSNs
2. Underground WSNs
3. Underwater WSNs
4. Multimedia WSNs
5. Mobile WSNs
1. Terrestrial WSNs
Terrestrial WSNs are capable of communicating base stations
efficiently, and consist of hundreds to thousands of wireless
sensor nodes deployed either in unstructured (ad hoc) or
structured (Preplanned) manner. In an unstructured mode, the
sensor nodes are randomly distributed within the target area that
is dropped from a fixed plane. The preplanned or structured
mode considers optimal placement, grid placement, and 2D, 3D
placement models.
In this WSN, the battery power is limited; however, the battery is
equipped with solar cells as a secondary power source. The
Energy conservation of these WSNs is achieved by using low
duty cycle operations, minimizing delays, and optimal routing,
and so on.
2. Underground WSNs
The underground wireless sensor networks are more expensive
than the terrestrial WSNs in terms of deployment, maintenance,
and equipment cost considerations and careful planning. The
WSNs networks consist of a number of sensor nodes that are
hidden in the ground to monitor underground conditions. To relay
information from the sensor nodes to the base station, additional
sink nodes are located above the ground.
Underground WSNs
The underground wireless sensor networks deployed into the
ground are difficult to recharge. The sensor battery nodes
equipped with a limited battery power are difficult to recharge. In
addition to this, the underground environment makes wireless
communication a challenge due to high level of attenuation and
signal loss.
3. Under Water WSNs
More than 70% of the earth is occupied with water. These
networks consist of a number of sensor nodes and vehicles
deployed under water. Autonomous underwater vehicles are
used for gathering data from these sensor nodes. A challenge of
underwater communication is a long propagation delay, and
bandwidth and sensor failures.
Under Water WSNs
Under water WSNs are equipped with a limited battery that
cannot be recharged or replaced. The issue of energy
conservation for under water WSNs involves the development of
underwater communication and networking techniques.
4. Multimedia WSNs
Muttimedia wireless sensor networks have been proposed to
enable tracking and monitoring of events in the form of
multimedia, such as imaging, video, and audio. These networks
consist of low-cost sensor nodes equipped with micrpphones and
cameras.These nodes are interconnected with each other over a
wireless connection for data compression, data retrieval and
correlation.
Multimedia WSNs
The challenges with the multimedia WSN include high energy
consumption, high bandwidth requirements, data processing and
compressing techniques. In addition to this, multimedia contents
require high bandwidth for the contents to be delivered properly
and easily.
5. Mobile WSNs
These networks consist of a collection of sensor nodes that can
be moved on their own and can be interacted with the physical
environment. The mobile nodes have the ability to compute
sense and communicate.
The mobile wireless sensor networks are much more versatile
than the static sensor networks. The advantages of MWSN over
the static wireless sensor networks include better and improved
coverage, better energy efficiency, superior channel capacity,
and so on.
Wireless Sensor Networks Applications
These networks are used in environmental tracking, such as
forest detection, animal tracking, flood detection, forecasting
and weather prediction, and also in commercial applications
like seismic activities prediction and monitoring.
Military applications, such as tracking and environment
monitoring surveillance applications use these networks. The
sensor nodes from sensor networks are dropped to the field of
interest and are remotely controlled by a user. Enemy tracking,
security detections are also performed by using these
networks.
Health applications, such as Tracking and monitoring of
patients and doctors use these networks.
The most frequently used wireless sensor networks
applications in the field of Transport systems such as
monitoring of traffic, dynamic routing management and
monitoring of parking lots, etc., use these networks.
Rapid emergency response, industrial process monitoring,
automated building climate control, ecosystem and habitat
monitoring, civil structural health monitoring, etc., use these
networks.
Limitations of Wireless Sensor Networks
1. Possess very little storage capacity – a few hundred
kilobytes
2. Possess modest processing power-8MHz
3. Works in short communication range – consumes a
lot of power
4. Requires minimal energy – constrains protocols
5. Have batteries with a finite life time
6. Passive devices provide little energy
Fixed Routing –
A route is selected for each source and destination pair of
node in the network.
The route are fixed ; changes only if topology of the network
changes.
Fixed Routing : Example (1)
Figure – A simple packet switching network with six nodes
(routers)
Figure – Central routing table based on least cost path algorithm
A Central routing matrix is created based on the least-cost
path which is stored in the network control center
The matrix, shows for each source-destination of the route ,
the identity of the next node on the route.
Drawback: If the network control center fails, then everything
will collapse. Hence it is not reliable.
Fixed Routing : Example (2)
‘
Figure –
Routing table stored in different nodes of the network
Routing Table is created for each node. This is called as
distributed routing algorithm
Routing table can be created using least-min path or min-
hop reach method. Two famous path algorithms
1. Dijkstra Algorithm
2. Bellman Ford Algorithm
Advantages –
Simple
Works well in reliable network with stable load in reliable
network
Same for virtual circuit and datagram
Disadvantages –
Lack of flexibility
Doesn’t react to failure or network congestion
Flooding –
Requires no network information like topology, load
condition ,cost of diff. paths
Every incoming packet to a node is sent out on every
outgoing like except the one it arrived on.
For Example in above figure
A incoming packet to (1) is sent out to (2),(3)
from (2) is sent to (6),(4) and from (3) it is sent to (4),(5)
from (4) it is sent to (6),(5),(3) , from (6) it is sent to
(2),(4),(5),from (5) it is sent to (4),(3)
Characteristics –
All possible routes between Source and Destination is tried.
A packet will always get through if path exists
As all routes are tried, the will be atleast one route which is
the shortes
All nodes directly or indirectly connected are visited
Limitations –
Flooding generates vast number of duplicate pakects
Suitable damping mechanism must be used
Advantages of Flooding :
Highly Robust, emergency or immediate messages can be
sent (eg military applications)
Set up route in virtual circuit
Flooding always chooses the shortest path
Broadcast messages to all the nodes
Distance Vector Routing –
It is a dynamic routing algorithm in which each router
computes distance between itself and each possible
destination i.e. its immediate neighbors.
The router share its knowledge about the whole network to
its neighbors and accordingly updates table based on its
neighbors.
The sharing of information with the neighbors takes place at
regular intervals.
It makes use of Bellman Ford Algorithm for making routing
tables.
Problems – Count to infinity problem which can be solved
by splitting horizon.
– Good news spread fast and bad news spread slowly.
– Persistent looping problem i.e. loop will be there forever.
Link State Routing –
It is a dynamic routing algorithm in which each router shares
knowledge of its neighbors with every other router in the
network.
A router sends its information about its neighbors only to all
the routers through flooding.
Information sharing takes place only whenever there is a
change.
It makes use of Dijkastra’s Algorithm for making routing
tables.
Problems – Heavy traffic due to flooding of packets.
– Flooding can result in infinite looping which can be solved
by using Time to leave (TTL) field.
