St Joseph Engineering College

Vamanjoor, Mangalore
Department of Electronics and Communication Engineering
UG Program Accredited By
National Accreditation Board New Delhi

Optimal Position Of Base Station

In Wireless Sensor Network
Guided by
Ms Nandini Maninarayana
Ashlin Janifer Lobo
USN:4S014LDS01
5/9/15

Department of ECE, SJEC,

Vamanjoor

Outline
Abstract
Introduction
Energy in WSN
Base station location
Algorithm for Base station location
Conclusion
5/9/15

Department of ECE, SJEC,

Vamanjoor

Abstract
Lifetime maximization and overall energy
consumption

minimization

are

two

different problems in a WSN.

Sensor nodes dissipates energy during
sensing

and

transmission

,but

transmission energy dominates

Therefore the optimal location of the base
station is required.
5/9/15

Department of ECE, SJEC,

Vamanjoor

Introduction

5/9/15

Department of ECE, SJEC,

Vamanjoor

Introduction (contd)
Wireless sensor networks consists of
a. Sensor node
b. Base station
Sensor
a. consumes energy for event
sensing,

coding,

transmission,

modulation,

reception

and

aggregation of data.
5/9/15

Department of ECE, SJEC,

Vamanjoor

Introduction (contd)
b. limited Energy, Computation,
Storage

,Transmission

range,

Bandwidth.

Base station
a. data gathering, processing
entity

and

communication

link

to

larger network.
5/9/15

Department of ECE, SJEC,

Vamanjoor

Introduction (contd)
Minimizing average energy consumption

Minimizing maximum energy

consumption

Minimizing relative energy consumption

5/9/15

Department of ECE, SJEC,

Vamanjoor

Energy in WSN

Fig.1 An energy model [4]

5/9/15

Department of ECE, SJEC,

Vamanjoor

Energy in WSN (contd)

In the transmission amplifier
a. n = 2 free space los
b. n = 4 multi-path loss
Consumed amplifier energy
(1)

5/9/15

Department of ECE, SJEC,

Vamanjoor

Energy in WSN (contd)

Threshold distance

is calculated

(2)

5/9/15

= free space loss constant J/bit/m^2

= multi-path loss constant J/bit/m^4

Department of ECE, SJEC,

Vamanjoor

10

Energy in WSN (contd)

L=number of bits, the energy used in
transmission will be

(3)

To receive L message bits, the radio spends

(4)

5/9/15

= the energy in J/bit

Department of ECE, SJEC,

Vamanjoor

11

 WSN topology

5/9/15

Department of ECE, SJEC,

Vamanjoor

12

Energy in WSN (contd)

n nodes uniformly distributed in an M
M area
k number of clusters in the topology.
An average of (n/k) nodes per cluster.
a. one cluster head node
b.(

5/9/15

) non-cluster head nodes.

Department of ECE, SJEC,

Vamanjoor

13

Energy in WSN (contd)

The energy consumption

for a

single non-cluster head node.

(5)

(6)

5/9/15

Department of ECE, SJEC,

Vamanjoor

14

Energy in WSN (contd)

= sum of the energy consumed in

a. reception of data
b. data aggregation
c. transmission of the aggregated
data
(7)

EDA = energy for data aggregation

5/9/15

Department of ECE, SJEC,

Vamanjoor

15

Energy in WSN (contd)

The energy consumption in a cluster
for one round of transmission
(8)
The

energy

consumption

in

the

network for one round

(9)
5/9/15

Department of ECE, SJEC,

Vamanjoor

16

Energy in WSN (contd)

Case 1: When all the nodes in a sensor

network are near the base station,

(10)
dj = distance between the cluster head

and the base station.

5/9/15

Department of ECE, SJEC,

Vamanjoor

17

Energy in WSN (contd)

.

After (n/k) rounds, when every node

has become a cluster head once, the
total energy spent is

(11)
.

5/9/15

Department of ECE, SJEC,

Vamanjoor

18

Energy in WSN (contd)

Case 2: When the base station is far
away from all the nodes,
(12)

5/9/15

Department of ECE, SJEC,

Vamanjoor

19

Energy in WSN (contd)

Case 3: When some nodes are near and

some nodes are far away from the base

station then
(14)

node i and node j are from different sets

P = nearer nodes and q=farther nodes

5/9/15

Department of ECE, SJEC,

Vamanjoor

20

Energy in WSN (contd)

case 1
(15)
case 2
(16)

case 3
(17)

5/9/15

Department of ECE, SJEC,

Vamanjoor

21

Base station location

Let n sensor nodes be uniformly

distributed in a rectangular field

Fig 2. Rectangular field [1]

5/9/15

Department of ECE, SJEC,

Vamanjoor

22

Base station location (contd..)

The Euclidean distances between the
base station and the nodes are d1,
d2, d3, . . . , and dn
(18)

Case 1(

; i):
(19)

5/9/15

Department of ECE, SJEC,

Vamanjoor

23

Base station location (contd)

Case 2 (

; i): When all the nodes

are far away from the base station

(20)
Case 3 (Some nodes with
remaining nodes with

and
):
(21)

where p + q = n and p, q 1.
5/9/15

Department of ECE, SJEC,

Vamanjoor

24

Base station location (contd)

Minimizing

acoording to the

domination in the energy expenditure

a, p q, then the centroid of p
nodes will be the optimal position.
b. If q p, then the farther nodes
will decide the optimal location for the
base station
5/9/15

Department of ECE, SJEC,

Vamanjoor

25

Base station location (contd..)

When both types of nodes are equally
dominating

5/9/15

Department of ECE, SJEC,

Vamanjoor

26

Algorithm for base station location

Step 1: Find centroid (Cx, Cy) of the nodes

distributed in the field This is the point,

where

is minimized
(22)
(23)

Step 2:Find nodes less than

distance from

the centroid.
5/9/15

Department of ECE, SJEC,

Vamanjoor

27

Algorithm (contd..)
Step 3: Weights are calculated using
centroid for all the nodes as

(24)

= distance between the ith node

and the centroid.

5/9/15

Department of ECE, SJEC,

Vamanjoor

28

Algorithm (contd..)

Fig.3 Square field [1]

5/9/15

Department of ECE, SJEC,

Vamanjoor

29

Algorithm (contd..)
Let us consider a square field with
length of side a. Let
Only free space loss will be suffered
by the transmission from all the nodes
inside the field
two nodes at

are taken

in the field
5/9/15

Department of ECE, SJEC,

Vamanjoor

30

by

Algorithm (contd..)
(25)

(26)
When
Let nodes

suffer free space loss

and
suffer multi-path loss.
If the weight to
5/9/15

Department of ECE, SJEC,

Vamanjoor

is w
31

Algorithm (contd..)
P(Px, Py) is given by
(27)
(28)

w = , then Px = x2 and Py = y2.

w = 0, then Px = x1 and Py = y1

5/9/15

Department of ECE, SJEC,

Vamanjoor

32

Algorithm (contd..)
w=

(29)
weighted average of node positions to
the optimal position (xp, yp) for the
base station
(30)
5/9/15

Department of ECE, SJEC,

Vamanjoor

33

Algorithm (contd..)

(31)

5/9/15

Department of ECE, SJEC,

Vamanjoor

34

Conclusion
The optimal location of the base
station can be obtained by using the
algorithm and energy consumption of
the nodes can be minimized

5/9/15

Department of ECE, SJEC,

Vamanjoor

35

References
[1]Two-tiered wireless sensor networks base station optimal
positioning case study,R.K. Tripathi Y.N.

Singh N.K. Verma,

Department of Electrical Engineering, Indian Institute of

Technology, Kanpur, Kanpur 208 016, India
[2] Positioning of base stations in wireless sensor networks,
Akkaya, K., Younis, M., Youssef, W, IEEE Commun. Mag.,
2007, 45, (4), pp. 96102.
[3] Optimal base-station locations in two-tiered wireless
sensor networks, Pan, J., Cai, L., Hou, T., Shi, Y., Shen, S.X,
IEEE Trans. Mob. Comput., 2005, 4, (5), pp. 458473.
.
5/9/15

Department of ECE, SJEC,

Vamanjoor

36

[4] An application specific protocol architecture for

wireless microsensor networks, Heinzelman,W.R.,
Chandrakasan, A., Balakrishnan, H, IEEE Trans. Wirel.
Commun., 2002, 1, (4), pp. 660670.
[5]

Energy

efficient

communication

protocol

for

wireless microsensor networks, Heinzelman, W.R.,

Chandrakasan, A., Balakrishnan, H, Proc. Int. Conf. on
System Sciences, , pp. 30053014.
[6] Wireless communications: principles practice
,Rappaport, T, Prentice- Hall, Englewood Cliffs, NJ,
1996.
5/9/15

Department of ECE, SJEC,

Vamanjoor

37

Wireless sensor networks are enabled by three

trends
Cheaper computation (Moores Law)
Compact sensing (MEMS sensors)
Wireless networking (low-power radios)
Applications
Environmental sensing
Habitat monitoring
Precision agriculture
Military operations
Condition-based maintenance
Health care

5/9/15

Department of ECE, SJEC,

Vamanjoor

38

Range of Sensor Nodes

Large
Medium
Small
Tiny
Computation/memory
Microprocessor
8-bit microcontrollers
Xscale processors
Digital signal processors
Memory
Flash for non-volatile logging of sensor data
Store and forward data from other nodes

5/9/15

Department of ECE, SJEC,

Vamanjoor

39

Communication

Radio communication (some infrared)

Power tradeoff with bandwidth
More power, more range, more interference
Less power, less range, may disconnect

Protocol stack

Reliability
Routing
Naming
Broadcast, multicast, unicast

5/9/15

Department of ECE, SJEC,

Vamanjoor

40

Battery

Rechargeable Li-ion, fuel cell, etc.

Harvest from environment
Solar, piezo (vibration), RF energy, etc.

5/9/15

Department of ECE, SJEC,

Vamanjoor

41

Leach

p = desired percentage of cluster heads,

r = current round and
G =number, which decides eligibility to
become cluster head and form a set of
nodes that have not been cluster heads.
A node becomes a cluster head for the
current round if the chosen random number
is less than the following threshold.
5/9/15

Department of ECE, SJEC,

Vamanjoor

42

Sensors
Enabled by recent
advances in MEMS
Technology
Integrated
Wireless
Transceiver
Limited in
Energy
Computation
Storage
Transmission
range
Bandwidth
5/9/15

Department of ECE, SJEC,

Vamanjoor

43

Wireless sensor networks may be considered a subset

of Mobile Ad-hoc NETworks (MANET).
Sensor networks are mainly used to collect information
while MANETS are designed for distributed computing
rather than information gathering. Sensor nodes mainly
use broadcast communication paradigm whereas most
MANETS are based on point-to-point communications.
The number of nodes in sensor networks can be several
orders of magnitude higher than that in MANETS .
Sensor nodes may not have global identification (ID)
because of the large amount of overhead and large number
of sensors.
5/9/15

Department of ECE, SJEC,

Vamanjoor

44

 Sensor nodes are much cheaper than nodes in a

MANET and are usually deployed in thousands.

Sensor nodes are limited in power, computational
capacities, and memory where as nodes in a
MANET can be recharged somehow. Usually,
sensors are deployed once in their lifetime, while
nodes in MANET move really in an Ad-hoc manner.
Sensor nodes are much more limited in their
computation and communication capabilities than
their MANET counterparts due to their low cost.

5/9/15

Department of ECE, SJEC,

Vamanjoor

45

5/9/15

Heuristic Search
Aheuristicis a method that might not always
find the best solution
butis guaranteed to find a good solution in
reasonable time.
By sacrificing completeness it increases
efficiency.
Useful in solving tough problems which
could not be solved any other way.
solutions take an infinite time or very long
time to compute.

Department of ECE, SJEC,

Vamanjoor

46

Layered structure

5/9/15

Department of ECE, SJEC,

Vamanjoor

47

Pegasis

Greedy Chain Algorithm

Start with node furthest away from BS
Add to chain closest neighbor to this node that
has not been visited
Repeat until all nodes have been added to chain
Constructed before 1st round of communication
and then reconstructed when nodes di
Data fusion at each node (except end nodes)
Only one message is passed at every node
Delay calculation: N units for an N-node network
Sequential transmission is assumed

5/9/15

Department of ECE, SJEC,

Vamanjoor

48

5/9/15

Department of ECE, SJEC,

Vamanjoor

49

 reflection, diffraction, and scattering.

Due to multiple reflections from various
objects, the electromagnetic waves travel
along different paths of varying lengths. The
interaction between these waves causes
multipath fading at a specific location, and
the strengths of the waves decrease as the
distance between the transmitter and
receiver increases.
Propagation models have traditionally
focused on predicting the average received
signal strength at a given distance from the
transmitter, as well as the variability of the
signal strength in close spatial proximity to a
particular loca
5/9/15

Department of ECE, SJEC,

Vamanjoor

50

 phases are random, the sum of the

contributions varies widely; for example,
obeys a Rayleigh fading distribution.
The free space propagation model is
used to predict received signal strength
when the transmitter and receiver have a
clear, unobstructed line-of-sight path
between them
the free space model predicts that received
power decays as a function of the T-R
separation distance raised to some power (i.e.
a power law function). The free space power
received by a receiver antenna which is
separated from a radiating transmitter
antenna by a distance d, is given by the
Friis free space equation.
5/9/15

Department of ECE, SJEC,

Vamanjoor

51

The Friis free space equation of shows that the received power
falls off
as the square of the T-R separation distance. This implies that
the received
power decays with distance at a rate of 20 dB/decade.
An isotropic radiator is an ideal antenna which radiates power
with unit
gain uniformly in all directions, and is often used to reference
antenna gains in
wireless systems.

5/9/15

Department of ECE, SJEC,

Vamanjoor

52

 SPIN : Sensor Protocols for

Information via Negotiation.
DD: Directed Diffusion
RR.: Rumor Routing
GBR : Gradient Based Routing.
CADR : Constrained Anisotropic
Diffusion Routing

5/9/15

Department of ECE, SJEC,

Vamanjoor

53