Multi-base station based Energy- Aware Multi-hop

Routing Protocol for WSNs

ABSTRACT
Recent advances in wireless sensor networks have led to many new protocols specially designed
for sensor networks where energy awareness is an essential consideration. Most of the attention
however has been given to the routing protocols since they might differ depending on the
application and network architecture. WSNs are used in critical monitoring and tracking
applications therefore, routing protocols for such networks should take into consideration the
trustworthiness of and the energy available on sensor nodes. The paper described location base
routing protocol that uses different metric for making routing decision. Multi-base station based
Energy- Aware Multi-hop Routing Protocol is location based routing protocol for wireless
sensor networks. The protocol uses distance remaining energy and probability and clustering as
metrics when chose best path toward destination..
KEYWORDS: wireless sensor networks; clustering; Multiple Base station.
1) INTRODUCTION
In WSNs technology a key alarm is to reduce the energy consumption of nodes and to enhance
the network lifetime. Wireless sensor nodes are deployed in sensing area to observe habitant
monitoring, industrial environment, battlefields, earthquake, physical atmosphere and agriculture
field. Nodes intellects the environments collect data and send it to BS. Because of development
in sensor technology it is possible now to set up thousand and millions of nodes. It is difficult to
replace or recharge a battery of sensor after deployment therefore a key concern for WSNs is
energy consumption and lifetime of network. There are many clustering base algorithm proposes
for reducing energy consumption. Clustering is a process to reduce the energy consumption of
nodes by minimizing there transmission range. In this method CH manage the group of
communication with BS. CH receives the whole message of group, aggregate and forwards it to
BS. In cluster all nodes transmit their data to corresponding CH cluster. To avoid collision CH
generate time division multiple Access (TDMA) for its associated nodes. Each associated sensor
node send their data to CH in a predefine time slot otherwise sensor node will turn off their
transceivers. Energy of sensor nodes should be save and these nodes stay alive because of
TDMA scheduling .sensor nodes require minimum energy for data transmission as by rule each
member nodes send its data to nearby CH. Reducing the redundant bits and filter out the data by
CH it reduces the amount of data that has to followed to BS. The desire behind this work is to
trim down the energy consumption of sensor nodes by dividing the network into two regions. We
use different communication hierarchy in these two regions. Nodes which are in access of BS

will communicate directly to BS while nodes which are far way from BS will perform
Clustering. The rest of the paper is planned as follows: section 2 review the related work. In
section 3 we illustrate motivation for this work. In Section 4 describes the network model. In
section 5 proposed algorithms is explained. , we classify the performance parameters and show
the performance of our proposed protocol by simulations in section 6.
2) RELATED WORK Energy limitation always remains In WSNs. To utilize the energy of
sensor much technique has been proposed Concept of clustering gain a great acceptance for
optimizing energy for both heterogeneous and homogenous networks s. In clustering some of the
nodes are selected as CH in clustering and had to exhausted more energy than rest of nodes for a
precise phase of time. Because of long range transmission and data aggregation the energy
utilization is high. Many clustering algorithm has been proposed for the competent usage of
energy in networks such as LEACH [1] PEGASIS [2] and HEED [3].CHs collects data from its
member nodes or slave nodes, and forward to faraway located BS. This process overloads the
CH and it consumes lot of energy. In LEACH, The CHs are selected periodically and consume
uniform energy by selecting a new CH in each round. A node become CH in current round on
the basis of probability p. LEACH performs well in homogenous network however this protocol
is not considered for heterogeneous network as shown in [4]. In [5] author presented another
clustering protocol (TL-LEACH).This protocol describes two level clustering scheme which
performs well in term minimum energy consumption of network. In PEGASIS [6] nodes from a
chain to transfer data from source to sink. In chain formation process each node connects with
next node.The chain formation process require global knowledge of sensor nodes, hence it is
very difficult to implement this topology. A PEGASIS based mobile sink scheme is proposed in
[7].The sink moves along its trajectory and stays for a sojourn time at sojourn location to
guarantee complete data collection. A similar sink mobile based technique is proposed in [8].Sep
protocol is designed for heterogeneous nodes. Nodes in Sep are heterogeneous in terms of their
initial energy called normal nodes and advance nodes. The probability to become CH depends on
the initial energy of the node. Performance of SEP in multi level heterogeneous network is not
good. On adaptive energy-efficient scheme for transmission (EAST) is proposed in [9]. This
scheme use open-looping feedback process for temperature-aware link quality estimation where
as a closed-loop feedback process divides network into three logical regions to minimize
overhead of control packets. In [10] Quadrature-LEACH (Q-LEACH) for homogenous networks
is proposed. This scheme maximize the throughput, lifetime of network and stability of the
network. Latif et al. [11] presented Divide-and rule scheme DR technique used for static
clustering also for the selection of CH. This scheme avoids probalistics selection of CH instead it
elects fixed number of CH. Away cluster Head protocol for WSN is proposed in [12]. This
protocol efficiently maximize the stability period and throughput J.Kulik et al. [13] proposed
sensor Protocols for Information via Negotiation (SPIN). In SPIN, a node advertises its sensed
data to its neighbors about the kind of the data is sensed an interested neighboring node will send
a request for a copy of data to originating node. In this way, the entire nodes in the network
acquire this data A hybrid protocol Hybrid Energy Efficient Reactive protocol for WSN is

proposed in[14]. In this protocol, CH is selected based on the residual energy of node and
average energy of network .we use first order radio model as used in [15] and [16]. This model
represents the energy dissipation of sensor nodes for transmitting, receiving and aggregating
data.

COMPARISON TABLE FOR DIFFERENT ROUTING PROTOOCL

PROTOCOLS

LATENCY

SCALIBILITY

LEECH

Low when the

network is small

High

PEGASSIS

High if network
density is high

High

MGEAR

Moderates check
for drained
nodes

Moderate

SPIN

Moderate if
network is large

Moderate

CONENCTIVITY
ADAPTATION
Cluster head
leads the
transmission
Single node of
the chain is
responsible in
transmission
Calculate the
least cost path to
reach the sink
Data shared with
interested nodes
to reach the sink

ENERGY
AWARENESS
High using
clustering
technique to
save energy
High it forms
chain using node
to reach the
base station
Moderate same
path is used until
the new path is
calculated
Moderate the
nodes which
have energy
resources only
take part in
transmission

3) MOTIVATION
This is the fact that clustering protocols gain wide acceptance in many application due to
consuming less energy. CH is selected on the base of probability in most cluster based protocol.
CHs are dispersed uniformly throughout the sensor field. Therefore, it is pretty probable that the
chosen CHs focus on one region of the network. Therefore a number of nodes will not get any
CHs in their surroundings .In this article; our goal is to design a Multi-base station based EnergyAware Multi-hop Routing Protocol for WSNs. This approach meets the following points.
Network is divided into two regions and aid of two base stations in the field reduces the
average transmission distance and providing fast data transfer rate. Hence, it saves network
energy and prolong network lifetime.
CH selection in each region is independent of other Regions so, there is definitely a CH exists
in each region.

Classification of protocols

Hierarchical Routing

Data centric Routing

Location Based Routing

Role

Role

Role

Hierarchical routing is used to

perform energy efficient
routing, i.e., higher energy
nodes can be used to perform
the sensing in the area of
interest

Data centric protocols are

query base and they depend
on the remaining amount of
desired data thus it eliminates
much redundant
retransmission

Location based routing

protocols need some local
information of the sensor
nodes. Location information
can be obtained from GPS
(GLOBAL POSITIONOING
SYSTEM)

.Advantages

Advantages
Advantages

More scalability
Data aggregation
Less load
Less energy
More robustness

Disadvantages

Not query based

Time consumption is
high

Energy saving
Less transmission
Limited power usage
Limited scalability

Location accuracy
Increase network
lifetime
Good scalability

Disadvantages
Disadvantages

Complex queries
used

Not query based

Not data aggregation

Examples
Examples

Examples

PEGASSIS

SPIN

HEED
TEEN

DD, RR, CADR

GEAR
GEOGRAPHIC ADAPTIVE
FIDELITY (GAF)

4) NETWORK MODEL
In this article we assume sensor nodes which are deployed randomly in field to monitor
environment. We assume sensors nodes which are deployed randomly in 100 x 100 fields to
monitor environment. We assume the network model shown in fig 1.

SENSOR NODES

Figure 1: NETWORK MODEL

BASE STATION

Base Station (A)

Senor Nodes
Region 1

Clusters

Region 2
Sensor Nodes

Base Station (B)

IN this network model we install the Multiple BS outside of the field.

BS and sensor nodes are stationary after deployment.
We use uniform sensor nodes with same computational and sensing capabilities.
All sensor nodes are assigned with distinct identifier (ID).

We use first order radio model as used in [5] and [18]. This model represents the energy
dissipation of sensor nodes for transmitting, receiving and aggregating data. The transmitter
dissipates more energy than receiver as it requires more energy for the transmitter electronics
and amplifier. On the other hand in receiver, only electronic circuit dissipates energy, as
shown in fig 2.
()
(, )
K bit packet

K bit packet
Transmit
Electronics

TX
Amplifier

Receive
Electronics

Fig.2: Radio Model

The energy required to transmit a data packet of k bits to distance d and to receive a data packet
of k bits, is given as:
(, ) = () + (, )
(, ) = + 2

EQ (1)
EQ (2)

5) THE M-GEAR PROTOCOL

A. Initial Phase
IN our protocol we use homogenous sensor nodes that are deployed randomly into 100 x 100
fields. The BS broadcast its information to all the nodes in the field. Every node calculates its
distance from the BS by using distance formula and sends its information to BS. BS saves all the
information of sensor nodes into node data table .The node data table contains location of node
and its distance; distinct id of node and residual energy of node.

B. Setup phase
In this sector BS divides the network field into two equal regions. BS equally divides the nodes
into two regions. On the basis of distance each node makes a selection of BS for sending its
information. Nodes which are in access of BS use direct communication and send their data
directly to BS as the distance of these nodes from BS is short. All the nodes away from the BS
will perform clustering .In each clustered region sensor nodes organize themselves into small
group known as cluster.
C. CH selection
Initially BS divides the network into two regions. CHs are selected in each region separately. In
clustered area CH is elected on the base of distance of node from BS; probability and on residual
energy of nodes .At the start all the nodes in both regions have same energy and have equal
chance to become a CH.. After that CH is selected on the base of distance of nodes, probability
and remaining energy of nodes. A node generate a random number between 0 to 1 if the
generated number is less than the predefined threshold value and node have higher residual
energy and have less distance from BS then the node become CH .
T(S) =

1(1)

if S

C otherwise

EQ(3)

Where P is the desired percentage of CHs and r is the current round and C is set of nodes not
elected as CH in current round .After the selection of cluster head in each region CG inform their
role to neighbor nodes. Using CSMA MAC protocol CH broadcast a control packet. After
receiving control packet from CH each node send acknowledge packet. Node who find nearest
CH, becomes member of that CH.
D. Scheduling
When all the nodes are structured into cluster each CH creates TDMA based time based time
slots for its member. All the neighbor nodes broadcast their sensed data to CH in its own
scheduled time slot otherwise nodes witch to idle mode. Nodes turn on their transmitters at
time of broadcast. Hence, energy dissipation of individual sensor node decreases
E) Steady-State Phase
In this phase all sensor nodes send their sensed data to CH. The CH collects data from member
nodes, aggregates and forwards to BS.

6) FLOW DIAGRAM

Set number of
nodes randomly
in the field &
installed two BS

BS Broadcast its
information to
all the nodes

On the basis of
distance each
node makes a
selection of BS
for sending its
information

Nodes near the

BS send data
directly to BS
while the nodes
faraway the Bs
perform process
of clustering

Cluster Head
selection
(CHS)

CH is elected on
the base of
Residual
energy,
Distance of
nodes from Bs

Each Node
calculates its
distance from
the BS

All sensor nodes

transmit their
sensed data to
CH. The CH
aggregates and
forwards to BS

7) ALGORITHM

Initial Phase
I.
II.

NA = randomly dispersed HSN.

BS Broadcast its info to all nodes in the field.

III.

For each node calculates its Distance from BS by using distance formula

IV.

On the basis of distance each node makes a selection of BS for sending its information

Setup Phase
I.
II.

BS Divide Network field into two regions by taking half of the field.
Each area Based on the node near and far away from BS.

III.

Nodes near BS = direct communicate

IV.

Nodes faraway from BS = perform clustering.

CH Selection
I.

In clustered area CH is elected on the base of Residual energy, Distance of nodes from Bs
and on probability.

II.

Each node elects itself as a CH = once every 1/p rounds

III.

A node generates a random number between [0-1]

IV.

If the generated random number is < than a predefined threshold T(s) value, then the
node becomes CH

Scheduling
I.
II.
III.

sensor nodes = cluster

each CH= create TDMA for Sensor nodes
Sensor nodes send data in TDMA

Otherwise
IV.
V.

Nodes= idle state

SN= turn on transmitter at time of transmission

Steady phase (SN, CH, GW, BS)

I.
II.

Sensor nodes transmit data to CH

CH= collect, aggregate, and forward to BS

8) FLOW CHART
Network creation

Set number of nodes in

the field & installed two
BS outside of the field

CH Selection

CH is elected on the
basis of residual
energy, distance of
nodes from BS and on
probability

Bs broadcast its
information to all nodes

Each node calculate

its distance from BS

On the basis of distance each

node makes a selection of BS
for sending its information

After elected cluster

head creates TDMA for
associated nodes

All sensor nodes transmit their

sensed data to CH. The CH collects
data from member nodes, aggregates
and forward to Bs

Nodes near the BS send data directly

to BS while the nodes far away from
the Bs perform clustering

9) PERFORMANCE EVALUATION
We judge the performance of our proposed protocol and compare it with LEACH protocol in
WSN.
A) Simulation Setting
To evaluate the performance of our proposed protocol, we simulated our protocol with
MATLAB. We believe wireless sensor networks with 100 nodes randomly dispersed in the area
of 100 meters x 100 meters. Two base stations deployed outside the BS field moves after
deployment. We consider that the 4000-bit packet size. We compare our protocol with other

protocols available. To evaluate the performance of our protocol with other protocols, we neglect
the impact caused by the collision of signals and the interference in the wireless channel
B) Performance Parameters
In this section we present the performance indicators .In this work we evaluate three parameter
given below.
i.
ii.
iii.

Network lifetime: It is the period of time from the start of operation of the network down
to the last node die.
Throughput: Processing performance in each round by the number of packets sent by a
node to evaluate the number of packets received by BS.
Residual Energy: Networking remaining battery energy is considered in order to look at
the energy utilization of each round node. The residual energy network allows graceful
degradation of life.

10) Simulation result and analysis: A verse, we describe simulation results. We evaluate the
results of extensive simulations and Leach. After that subsection, giving each metric aspect
A) Network Lifetime: we can show the result of network life time in fig 3. After consuming 0.5
joule energy nodes are considered dead. Because the energy consumption is well circulated
among the nodes our protocol got a longest network lifetime. Our protocol topology balance
energy consumption among sensor. On the other hand nodes die quickly in Leach as the
reliability period of the network ends. It is not clear in LEACH that predestined CHs are
distributed uniformly throughout the network field. Therefore there is a option that in one region
of the network selected CHs will be strong. So therefore some nodes will not have any CHs in
their environment.
600
500

Rounds

400
M-gear

300

Leach

200

Pegasis

100
0
0

20

40
60
Percent of alive nodes

80

100

Fig. 3: Interval plot-Analysis of network lifetime

B) Throughput: Ordinary packets sent to BS are assessing throughout wide simulations. M-Gear
protocol demonstrate improved throughput through simulation. M-GEAR and LEACH in fig 4

clearly depicts performance of both protocols .we assume that CHs can communicate freely with
BS to determine throughput. Simulation results show an increase in throughput of 5 time then
LEACH. Sensor nodes near the BS transmit there data directly to BS. In both regions sensor
nodes consume less transmission energy there for nodes stay alive for longer period. More alive
nodes donate to transmit more packets to BS.
600

Rounds

500
400
300

M-gear

200

Leach

100

Pegasis

0
0

20

40

60

80

100

Througput

Fig.4: Interval plot- analysis of Throughput

C) Residual Energy
Average residual energy per lap shown in Figure 5. We assume that a node 0.5 joule of energy.
The total energy of 100 node network is 50 joule's-GEAR protocol provides minimal energy
consumption than LEACH. Figure 5 clearly shows that our protocol outperforms LEACH
routing protocol in terms of energy per lap.
400
350

Rounds

300
250
200

M-gear

150

Leach

100

Pegasis

50
0
0

20

40

60

80

100

Remaining Energy

Fig. 5: Interval plot Analysis of remaining energy

Parameter
0

Message size

value
0.5j
5nj/bit
10pj/bit/m2
0.0013pj/bit/m4
5pj/bit
4000bits

Table 1: Network parameter

11) Conclusion and future work
We illustrate energy efficient multi-hop routing protocol using multi based station for fast
Processing and to reduce consumption energy of sensor nodes. We divide the network into two
regions. Nodes near the BS will directly transmit data to BS while the nodes faraway from Bs
perform process of clustering. Nodes which are in access of BS communicate directly while
Nodes which are not in access of BS perform clustering. Each node in the region is free to
choose her as CH other region. This technique facilitates better distribution of CHS in the
network. Simulation end result shows that our proposed protocol is better than other protocol.
By simulation we got major development in all these parameter when compared it with some
existing routing protocol e.g., PEGASSIS SPIN, LEACH. In This, we will study three
performance metrics: Lifetime Network, Residual energy and throughput. In future, we are
striving to get much better protocol which is less costly and save more energy and do fast
communication.

COMPARISON TABLE FOR DIFFERENT ROUTING PROTOOCL

12) REFERENCES
1. Heinzelman, Wendi Rabiner, Anantha Chandrakasan, and Hari Balakr-ishnan. Energyefficient communication protocol for wireless micro sensor networks. System Sciences,
2000. Proceedings of the 33rd Annual Hawaii International Conference on. IEEE, 2000.
2. Lindsey, Stephanie, and Cauligi S. Raghavendra. PEGASIS: Power-efficient gathering
in sensor information systems. Aerospace conference proceedings, 2002. IEEE. Vol. 3.
IEEE, 2002
3. Younis, Ossama, and Sonia Fahmy. HEED: a hybrid, energy-efficient, distributed
clustering approach for ad hoc sensor networks. Mobile Computing, IEEE Transactions
on 3.4 (2004): 366-379.

4. Smaragdakis, Georgios, Ibrahim Matta, and Azer Bestavros. SEP: Astable election
protocol for clustered heterogeneous wireless sensor networks. Boston University
Computer Science Department, 2004.
5. Loscri, V., G. Morabito, and S. Marano. A two-level hierarchy for low-energy adaptive
clustering hierarchy (TL-LEACH). IEEE Vehicular Technology Conference. Vol. 62.
No. 3. IEEE; 1999, 2005
6. Lindsey, Stephanie, and Cauligi S. Raghavendra. PEGASIS: Power-efficient
gatheringin sensor information systems. Aerospace conference proceedings, 2002.
IEEE. Vol. 3. IEEE, 2002
7. Jafri, Mohsin Raza, Nadeem Javaid, Akmal Javaid, and Zahoor AliKhan. Maximizing
the Lifetime of Multi-Chain PEGASIS Using Sink Mobility. World Applied Sciences
Journal 21, no. 9 (2013): 1283-1289
8. M. Akbar, N. Javaid, A. A. Khan, Z. A. Khan, U. Qasim, On Modeling Geometric Joint
Sink Mobility with Delay-tolerant Cluster-less Wireless Sensor Networks, 4th IEEE
Technically Co-Sponsored International Conference on Smart Communications in
Network Technologies (SaCoNet13) 2013, Paris, France
9. Tahir, M., et al. On Adaptive Energy-Efficient Transmission in WSNs.International
Journal of Distributed Sensor Networks 2013 (2013).
10. B. Manzoor, N. Javaid, O. Rehman, M. Akbar, Q. Nadeem, A. Iqbal, M.Ishfaq, QLEACH: A New Routing Protocol for WSN, International Workshop on Body Area
Sensor Networks (BASNet-2013) in conjunction with 4th International Conference
Ambient Systems, Networks and Technologies (ANT 2013), 2013, Halifax, Nova
Scotia, Canada, Procedia Computer Science, Volume 19, 2013, Pages 926-931,
ISSN1877-0509,
11. M. Akbar, N. Javaid, A. A. Khan, Z. A. Khan, U. Qasim, On Modeling Geometric Joint
Sink Mobility with Delay-tolerant Clusterless Wireless Sensor Networks, 4th IEEE
Technically Co-Sponsored International Conference on Smart Communications in
Network Technologies (SaCoNet13) 2013, Paris, France
12. N. Javaid, M. Waseem, Z. A. Khan, U. Qasim, K. Latif and A. Javaid,ACH: Away
Cluster Heads Scheme for Energy Efficient Clustering Protocols in WSNs, 2nd IEEE
Saudi International Electronics, Communications and Photonics Conference (SIECPC
13), 2013, Riyadh, Saudi Arabia
13. Heinzelman, Wendi Rabiner, Joanna Kulik, and Hari Balakrishnan.Adaptive protocols
Proceedings of the 5th annual ACM/IEEE international conference on Mobile
computing and networking. ACM, 1999
14. N. Javaid, S. N. Mohammad, K. Latif, U. Qasim and Z. A. Khan,M. A. Khan, HEER:
Hybrid Energy Efficient Reactive Protocol for Wireless Sensor Networks, 2nd IEEE
Saudi International Electronics, Communications and Photonics Conference (SIECPC
13), 2013, Riyadh,Saudi Arabia
15. Heinzelman, Wendi Rabiner, Anantha Chandrakasan, and Hari Balakr-ishnan. Energyefficient communication protocol for wireless micro sensor networks. System Sciences,
2000. Proceedings of the 33rd Annual Hawaii International Conference on. IEEE, 2000

16. Heinzelman, Wendi B., Anantha P. Chandrakasan, and Hari Balakr-ishnan. An

application-specific protocol architecture for wireless mi-crosensor networks. Wireless
Communications, IEEE Transactions on 1.4 (2002): 660-670