Proceedings of the 2013 International Conference on

Pattern Recognition, Informatics and Mobile Engineering (PRIME) February 21-22

978-1-4673-5845-3/13/$31.002013 IEEE

Enhanced Cluster Based Routing Protocol for Mobile
Nodes in Wireless Sensor Network

R.U.Anitha
Department of MCA
Muthayammal Engineering College
Rasipuram-637408, India
Kamal_karthi95@yahoo.co.in

Dr. P. Kamalakkannan
Department of Computer Science
Government Arts College
Salem-636007, India
ruanithamca@gmail.com

AbstractMobile Wireless Sensor Networks (MWSNs) are a
current encouraged technology which is used to help many
civilian, military and industrial services. Energy saving is the
critical issue while designing the wireless sensor networks. In
order to enhance the network life time there are many routing
protocols have been developed. One of these is clustering based in
which network is partitioned into small clusters and each cluster
is examined and controlled by a single node called Cluster Head
(CH).In this paper, we propose an enhanced algorithm for Low
Energy Adaptive Clustering HierarchyMobile (LEACH-M)
protocol called ECBR-MWSN which is Enhanced Cluster Based
Routing Protocol for Mobile Nodes in Wireless Sensor Network.
ECBR-MWSN protocol selects the CHs using the parameters of
highest residual energy, lowest Mobility and least Distance from
the Base Station. The BS periodically runs the proposed
algorithm to select new CHs after a certain period of time. It is
aimed to prolonging the lifetime of the sensor networks by
balancing the energy consumption of the nodes. Then compare
the performance of our proposed algorithm with the cluster
based protocols using ns2 simulator. The simulation result
indicates that the proposed algorithm gives better performance in
terms of higher packet delivery ratio, throughput, energy
consumption, routing overhead, and delay.
Keywords- Wireless sensor Networks; Cluster; Energy efficient;
Mobility; Throughput
I. INTRODUCTION
Wireless sensor networks consist of individual nodes which
are capable to interact with the environment by sensing or
controlling physical parameters [1].These nodes are interlinked
together using wireless links and can able to communicate and
collaborate with each other.
The general ideas about the wireless sensor network (WSN)
nodes are static in nature and also permanent in its location. It
has been carried out for a lengthy period of time [3]. It
produces many researches mainly focus on energy
consumption in WSN sensor nodes considered as fixed node.
Conversely, some applications like habitat monitoring, animals
tracking, search and rescue, Tracking Vehicles, RoboMote,
parasitic-mobility, medical care, and disaster response
applications are focusing the mobility in WSN[4] [5].
Mobile Sensor nodes can able to change their position after
deployment of the node due to the influences of wind, water,
area, surveillance, physical security, personnel physical assets
over large areas, machinery, platform health and status
monitoring [2]. In Mobile sensor network, one of the main
constraints is limited battery power. So it reduced the lifetime
and the quality of the network [6]. To avoid the energy
consuming, the researchers have considered cluster based
approach for data transmission. For example LEACH [8],
LEACH-M [9], LEACH-ME [10] and CBR-Mobile [11] etc
are called cluster based energy efficient protocols. In this
clustering technique, many parameters are used to select the
energy efficient cluster head (CH) in Mobile WSN [7].
The proposed protocol as an enhanced algorithm of Low
Energy Adaptive Clustering HierarchyMobile (LEACH-M)
protocol called ECBR-MWSN which is Enhanced Cluster
Based Routing Protocol for Mobile Wireless Sensor network. It
is aimed to prolonging the lifetime of the sensor networks by
balancing the energy consumption of the nodes.
ECBR-MWSN protocol selects the CHs using the highest
residual energy, lowest Mobility and least Distance from the
BS. The BS periodically runs the proposed algorithm to select
new CHs after a certain period of time. Simulation result shows
that the proposed protocol has better performance than
LEACH-M [9] and LEACH-ME [10].
This paper is organized as follows: Section II discusses
related work in introducing the Enhancement of Leach protocol
in Mobile WSN. Section III describes the network model
which consist of assumptions and radio energy model. Section
IV illustrates the proposed algorithm. Section V discusses
simulation environment and analysis of the results. Section VI
provides the conclusion and future of the proposed algorithm.
II. RELATED WORKS
This section presents the existing works relating to our
scheme. Many kinds of cluster based routing protocols have
been proposed for wireless sensor networks. These can be
categorized into two types of nodes called Static and Mobile
Nodes.
LEACH [8] is well known clustering protocol for wireless
sensor networks. In LEACH [8], the nodes are organized
themselves into local clusters. Each node has the same initial
energy because of homogeneous networks. The operation is
divided into rounds.
In the set-up phase, the CH is selected from the organized
clusters if a random number between 0 and 1 chosen by CH is
less than threshold value. In the steady-state phase each non
2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) 188

CH node sends data and the time slot allocated to CH .The CH
aggregates the data and sends it to the BS. But the cluster
formation is initiated in each round is not energy efficient and
also it does not support mobility.
The LEACH-Mobile [9] protocol is supports sensor nodes
mobility in WSN by adding membership declaration to the
existing LEACH protocol. The LEACH-Mobile outperforms
LEACH in terms of packet loss in mobility environment. But it
needs membership declaration. Cluster head election in
LEACH-Mobile has been improved by LEACH-Mobile
Enhanced [10] (LEACH-ME) as proposed whereby the sensor
node with minimum mobility factor is elected as cluster head.
But minimum mobility factor is elected as cluster head.
CBR-Mobile [11] supports the sensor nodes mobility by
adaptively reassigning the timeslots according to sensor nodes
mobility and traffic. Two owners are created for each timeslot
that is original owner and alternative owner, such that CBR-
Mobile can work adaptively to sensor nodes mobility and
traffic. It is significantly increases the packet delivery ratio in
comparison with the LEACH-Mobile protocol.
Fault Tolerant Clustering Protocol for Mobile WSN [12]
(FTCP-MWSN) protocol is not only energy efficient but also
reliable. It does not require any extra timeslot for calculating
the mobility of sensor node. So that it provide faster data
delivery to BS.
Cluster-based Energy-efficient Scheme [13] (CES) for
Mobile Wireless Sensor Networks (MWSNs) which relies on
weighing k-density, residual energy and mobility parameters
for cluster-head election. The CES scheme carries out a
periodical cluster-head election process after each round.
Moreover, CES enables the creation of balanced 2-hop
clusters whose size ranges between two thresholds called
upper and lower thresholds.
III. NETWORK MODEL
A. Assumptions of Network Model
In our protocol architecture, we assume that N number of
Sensor Nodes are scattered randomly over the network. A
Figure 1 shows that the 100 nodes are deployed in WSN. These
nodes are Mobility and homogeneous in nature and the Base
station is far away from the network and is fixed.

Figure 1. 100 Nodes in WSN
Moreover, a few reasonable assumptions of the network
model based on [14][15] for our proposed model as follows:
1. Every sensor node is capable of communicating with every
other sensor node and to the Base Station if needed.
2. The links are symmetric i.e. two nodes can communicate
with the same power level.
3. Sensor nodes are deployed densely and randomly in sensor
field.
4. All the nodes of the sensor network are equipped with same
amount of energy level in the beginning.
5. There is mobility in sensor nodes.
B. Radio Energy Dissipation Model
In the proposed model, the first order radio model is used
for energy dissipation in communication [16], where radio
dissipates Eelec = 50 nano Joule / bit to drive the transmitter
and the transmit-amplifier dissipates elec =100 pico Joule/
bit/m2. Figure 2 shows that the radio energy model for transmit
and receive the packets. To save energy, when required the
radio can be turned on or off. Also the radio spends the
minimum energy required to reach the destination. The energy
consumed for data transmission of k bits packet is calculated
from the Eq. (1).
E
Tx

elec
* k +
elec
* k * d
2
(1)
and to receive this message, the radio expends energy is
shown in Eq. (2):
E
Rx
(k) = E
RX-elec
(k) (2)

Figure 2. Radio Energy Model
IV. PROPOSED PROTOCOL
In this section, we describe our protocol in detail. First, we
define the parameters used in the clustering process. Second,
we present the protocol design and pseudo-code. Finally, we
prove that the protocol meets its requirements.
A. Clustering Parameters
The main goal of our approach is to extend network
lifetime of the network. For this reason, cluster head selection
is mainly based on the residual energy of each node. But
residual energy measurement is not only necessary to increase
energy efficiency and further prolong network lifetime. So we
consider node mobility and distance between from the node to
Base station as a secondary clustering parameter.
The primary parameter is used to select an initial set of
cluster heads, and the secondary parameter is used to find the
cluster head if it becomes a tie. A tie means that a node falls
within the range of more than one cluster head and two
2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) 189

tentative cluster heads fall within the same range. The
explanations of primary and secondary parameters are used in
the proposed model is as follows:

1) Remaining battery power: The highest energy node that is
if the remaining battery power is high then that node will
become CH.
2) Degree of mobility: The mobility of the node has great
impact on the network lifetime. The topology of the network
will be change very frequently due to the high mobility of
nodes, which leads to reselection of CHs rapidly. The least
mobility node will become a CH.
Distance of a node from the cluster centroid: The BS
calculates the distance of each node to its cluster centroid. The
lesser distance node from the BS to itself will have the higher
probability to become a CH.
B. Proposed Model
In this section, we introduce and describe the Enhanced
cluster based multipath routing protocol in Mobile Wireless
sensor Network (ECBR-MWSN). It is a reactive type
protocol, in which all the routes are computed when they
really needed. When sensor nodes are mobile in nature, it is
preferable to have reactive protocol rather than using proactive
protocol [18].
ECBR-MWSN mainly consists of five phases. They are
Initialization Phase, Cluster formation phase, Cluster head
selection phase, data transmission and re-clustering and re-
routing. In the following section we describe each and every
phase of the protocol in detail.
1) Initialization Phase

The network initialization phase starts after the sensor
nodes are randomly distributed in the application area. When
the new round begins, the base station broadcasts a HELLO
message to the base station using single hop transmission. The
HELLO message contains the following details.
Node
ID
Residual
Energy
Mobility
Factor
Distance
to BS
Destination
ID
Figure 3. Hello Message Packet
If the node does not convey the HELLO message to the BS
then it does not participate the data transmission. After the
information is delivered to the base station, it starts the cluster
formation phase.

2) Cluster Formation Phase

After the initialization phase is complete, each node
decides the cluster which it will belong for this round. In this
paper, Density Based Spatial Clustering of Applications with
Noise (DBSCAN) [19] algorithm is used to form a cluster. It
is a density based algorithm which discovers clusters with
arbitrary shape.
The DBSCAN algorithm starts with randomly selects a
starting node that has not been visited and it retrieves all
neighbor nodes which is density reachable from starting node
with respect to Eps and MinPts. Here Eps is a radius of the
cluster and MinPts is a minimum nodes required inside the
cluster. If the number of neighbors is greater than or equal to
MinPts then the cluster is formed.
DBSCAN could merge two clusters into one cluster, if two
clusters of different density are close to each other. Let the
distance between two sets of nodes S1 and S2 be defined as
dist (S1, S2) = min {dist (p,q) | p S1, q S2}. Consequently,
a recursive call of DBSCAN may be necessary for the
detected clusters with a higher value for MinPts. The
following explains the pseudo code of the cluster formation.
a) CLUSTER FORMATION
c=0
for each unvisited node p in database D
{
N = getNeighbors (p, Eps)
if (sizeof (N) < MinPts)
Mark p as NOISE
else
++ c
Mark p as visited
Add p to cluster c
recurse (N)
}

b) CLUSTER EXPANSION
k - Number of clusters to be found

If m>k
{
# Join two or more as follows
Select two clusters based on density and number of nodes
satisfying the application criteria.
Joint them and find the new cluster center and repeat it until
achieving k clusters.
Finally we will have Ck centers
}
End if
3) Cluster Head Selection Phase

After the clusters are formed, the Base station should
decide whether or not the node becomes a cluster head for the
current round. To find that, residual energy of each node and
mobility are consider as a primary parameter and distance
between the node to Base station as a secondary parameter.
Because the cluster Head node should be powerful, closer to
the cluster-centroid, less vulnerable and has low mobility.
The primary parameter of residual energy of the node is
calculated with the help of first order radio model. The mobile
sensor nodes can evaluate themselves to find the remaining
energy of their nodes within the cluster. If some nodes are
having the residual energy is less than minimum energy then
those nodes are deleted from the network.
The Mobility is calculated based on the number of times a
node changes from one cluster to another or on the basis of
remoteness. After that the secondary parameter of distance of
node is calculated from the difference between the base
2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) 190

stations and node itself. These things make sure that whether
the node, to be selected as CH, the residual energy and
mobility of the node within the cluster is on average at the
same time the distance of the node.
After each node has decided to which cluster it belongs, it
must inform the Cluster head node that it will be a member of
the cluster. Each node transmits this information back to the
cluster head again using a CSMA MAC protocol.The cluster-
head node should receive all the messages from the nodes that
would like to be joining in the cluster. Based on the number of
nodes in the cluster, the cluster head node creates a TDMA
schedule and broadcast it to the each node in a cluster.
4) Data Transmission Phase

Once the clusters are created and the TDMA schedule is
fixed, data transmission can begin. In this phase, single-hop
method is used within the cluster for communication and multi
hop method is used for communication between clusters.
Transmission in one cluster will affect communication in a
nearby cluster. To decrease this kind of intervention, each
cluster can communicates using different CDMA codes.
5)Re-clustering and Re-routing Phase

As state earlier, DBSCAN algorithm is used to form a
cluster in the network. After the certain period of time, the
network follows the same procedure formation to compose a
re-clusters, as described earlier. The computation of threshold
value should depend upon the application. Once re-clustering
is completed, Base Station constantly observes the residual
energy and Mobility of the existing CH. If it is below the
threshold value then it select another CH based on same
conditions, described earlier. Finally the CH should be
checked out the routing path. If the routing path residual
energy goes below the threshold or any node fails, BS selects
another path and sends the routing path to the respective CH.
V. SIMULATION EXPERIMENTS
This section describes the simulation scenario that is tool
which is used to simulate the proposed algorithms and
investigation of the performance evaluation of ECBR-MWSN
through an extensive set of simulation experiments.
A. Simulation Scenario
The simulation was run on a computer system, and the tool
that is used to evaluate the Proposed protocol is NS2 [17]. It
provides a widespread perfection environment for modeling
and performance evaluation of communication networks and
distributed systems.
As shown in Figure 1, 100 mobile sensor nodes were
arranged randomly in the field of 100m x 100m in the sensor
fields. The size of each packet was set to 512 Bytes. The time
for transmitting such a packet is considered as 1 unit of delay.

Simulation time for each scenario was set to 500 seconds
and repetitive simulations for each scenario were performed to
verify the reliability of our results.


TABLE I. SIMULATION PARAMETERS AND THEIR VALUES

Parameter Value
Sensing Area 100m x 100m
Location of BS 50,175
Network size 100m x 100m
Initial Energy 2 Joule
Expected Number of cluster head per round 5%
Data Packet size 512 Bytes
Eelec 50 nano Joule / bit
elec 100 pico Joule/ bit/m2
Nodes Movement Mobility
Simulation time 500 seconds
Mobility Model Random Way Point

The energy consumption due to communication will be
calculated using the first order energy model. The initial energy
of a sensor node is 2 Joule and the energy of a sink node is
infinite. The settings of other parameters of the network
environment were displayed in Table 1.
B. Selected Performance Metrics for Evaluation
To evaluate the performance of this proposed algorithm,
performance metrics like Average Energy Consumption,
Packet deliver ratio, Throughput, Routing Overhead and delay
are assumed with respect to the different frame and rounds are
taken for the assessment. The computation of the above metrics
is as follows.
1) Average Energy Consumption ( Ea )
The average energy consumption is calculated across the
entire topology. It measures the average difference between
the initial level of energy and the final level of energy that is
left in each node. Let Ei = the initial energy level of a node, Ef
= the final energy level of a node and N = number of nodes in
the simulation. Then

E
a
=
(E
Ik
E
fk
n
k=1
)
N


This metric is an important because the energy level of the
network uses is proportional to the networks lifetime. The
lower the energy consumption the longer is the networks
lifespan.
2) Packet Delivery Ratio

This represents the ratio between the number of data
packets that are sent by the source and the number of data
packets that are received by the sink.
Packet Beliveiy Ratio =
Successfully Beliveieu Packets
Reqiieu Packets


This metric indicates both the loss ratio and the effort
required to receive data of the routing protocol. If both the data
are equal then the ratio should be equal to 1 which is called as
ideal ratio. If the ratio falls below the ideal ratio, then it could
be an indication of some faults in the protocol.
2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) 191

Conversely, if the ratio is higher than the ideal ratio, then it
is an indication that the sink receives a more than number data
packet which is called as redundant packets. It is not
advantageous because receiving repeated packets will consume
more energy.
3) Throughput

The ratio of total data received by a receiver from a sender
for a time the last packet received by receiver measures in
bit/sec and byte/sec. It can be expressed mathematically as
Thioughput (bitsec)
=
Numbei of Beliveieu Packet Packet size 8
Total uuiation of simulation

4) Routing Overhead (packets)

It is the total number of transmitted packets in a simulation.
In a multi hop route, bytes transmitted at each hop count as a
single transmission [20]
5) Average End-to-End Delay of Data Packets
It is the average delay between the sending of the data
packet by the source and its receipt at the corresponding
receiver including the delays due to route acquisition, buffering
and processing at intermediate nodes, and retransmission
delays at the MAC layer, etc. if the value of End-to-end delay
is high then it means the protocol performance is not good due
to the network congestion. [20].
Aveiage Belay
=
Time Packet Receiveu
I
Time Packet sent
I
n
I=0
Total Numbei of Packets Receiveu

C. Evaluation of ECBR-MWSN
In this section we present the performance of the proposed
algorithm ECBR-MWSN is obtained by simulation using NS2
[17].The Average energy consumption for fixed number of
frames in LEACH-M, LEACH-ME and ECBR-MWSN is
shown in Fig 4a and 4b. If the frames are fixed for transmitting
one round then new cluster head is dynamically selected after
transmitting the exact frames. Figure 4a shows that the number
of frames transmitting is 50 for all the three protocols. Figure
4b shows that the number of frames transmitting is100.Both
figures shows that it increases the energy consumption in
LEACH-M and LEACH-ME protocol. But ECBR-MWSN
contains less energy consumption while number of frames per
round is also increases.








Figure 4a. Energy consumption variation with Rounds where f =50


Figure 4b. Energy consumption variation with Rounds where f =100
The packet delivery Ratio for various frame sizes 50 and
100 with respect to number of rounds is shown in figure 5a and
5b. While delivers a packets, Small frame size packets
delivered quickly when compared to the larger frame size
packets. Clearly it is noted that the packet delivery ratio has
vary in every algorithm during the rounds is shown in a Figure
5a and 5b. It is also proves that the proposed ECBR-MWSN
algorithm has high packet deliver ratio than other two protocol.

Figure 5b Packet Delivery Ratio variation with Rounds where f =100
A figure 6a and 6b shows the throughput of ECBR-MWSN,
LEACH-M and LEACH-ME for various frame sizes 50 and
2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) 192

100 with respect to number of rounds for all scenarios. The
throughput depends on the simulation parameters regarding
data generation and request for delivery. It can be observed that
the three protocols have the same throughput, but when the
traffic load is increased we can show that ECBR-MWSN leads
to more throughput than LEACH-M and LEACH-ME.


Figure 6a Throughput variation with Rounds where f =50

Figure 6b Throughput variation with Rounds where f =100
Routing overheads of the LEACH-Mobile, LEACH-Mobile
Enhanced protocol and the ECBR-MWSN are measured by
gathered the created control packets and comparing the number
of the gathered packets. Control packets are generally created
for routing purpose, for example, to deliver and maintain
topology information of mobile sensor nodes. Figure 7a and 7b
shows that the Routing overhead variation with rounds when
the number of frames is transmitting as 50 and 100.Here the
proposed protocol increases the number of created control
packets as compared to the conventional LEACH protocols.
This is because the proposed protocol requires more control
packets in order to form and maintain the topology of moving
sensor nodes reactively.

Figure 7a Routing Overhead variation with Rounds where f =50

Figure 7b Routing Overhead variation with Rounds where f =100
Figure 8a and 8b presents the delay taken by the three
routing protocols during the simulation period 50 and 100
number of frames for all scenarios. It is clear from figures that
LEACH-M gains the highest delay, especially on large size of
nodes. LEACH-M exhibits large packet delay because its
routes discovery takes more time. Every intermediate node
tries to extract and record information before forwarding a
reply. The same thing happens when a data packet is routed
from node to node. Hence, LEACH-M yield more information
for delivery, packet transmission slows down. LEACH-ME
gives the lowest delay as compared to LEACH-M. But ECBR-
MWSN gives up very low delay as compared to other two
protocols.

Figure 8a Delay variation with Rounds with f =50
2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) 193



Figure 8b Delay variation with Rounds where f = 100

VI. CONCLUSIONS & FUTURE WORK
In this paper, an enhanced algorithm of Low Energy
Adaptive Clustering HierarchyMobile (LEACH-M) protocol
called ECBR-MWSN which is Enhanced Cluster Based
Routing Protocol was proposed. It is aimed to prolonging the
lifetime of the sensor networks by balancing the energy
consumption of the nodes. It selects the CHs using the
parameters of highest residual energy, lowest Mobility and
least Distance from the BS. The experiments have been
performed to evaluate the performance of the proposed
protocol in terms of four factors like Average Energy
Consumption, Packet Delivery Ratio, Throughput, Routing
Overhead and Average end to end Delay. The simulations
results indicates that the proposed clustering approach is more
energy efficient and hence effective in prolonging the network
life time compared to LEACH-M and LEACH-ME.
For future work, the algorithms and techniques
implemented in the proposed protocol will be optimized in
order to minimize energy and routing related packets, which in
turn lead to reduced routing overhead. Then to find the energy
consumption while delivery of packets under non-uniform
transmission situations. And also the proposed protocol will
improve the performance to decrease the delay. Particularly for
reaching the optimal solution for mobile sensor networks is an
open issue.
REFERENCES
[1] Al-Karaki, and A. Kamal, Routing Techniques in Wireless Sensor
Networks: A Survey, IEEE Wireless Communications, vol.11, no.6, pp.
6-28, December 2004.
[2] A. Jamalipour, and J. Zheng. Wireless Sensor Networks: A Networking
Perspective, Wiley-IEEE Press, 2009.
[3] Akkaya, K.; Younis, M. A Survey on routing protocols for wireless
sensor networks, Elsevier Ad Hoc Network Journal, 2003,vol. 3, no. 3,
pp. 325 - 349.
[4] Samera. B. Awwad, cheekyunng and Nor K. Noordin Cluster Based
Routing (CBR) Protocol with Adaptive Scheduling for Mobility and
Energy Awareness in Wireless Sensor Network, Proceedings of the
Asia Pacific Advanced Network.
[5] The 29 Palms Experiment: Tracking vehicles with a UAV-delivered
sensor network, tinyos.millennium.berkeley.edu/29Palms.htm.
[6] Razieh Sheikhpour, Sam Jabbehdari and Ahmad Khadem-Zadeh
Comparison of Energy Efficient Clustering Protocols in Heterogeneous
Wireless Sensor Network,zs, International Journal of Advanced
Science and Technology Vol. 36, November, 2011
[7] Rabia Noor Enam , Mumtazul Imam and Rehan Inam Qureshi Energy
Consumption in Random Cluster Head selection Phase of WSN, 2012
IACSIT Hong Kong Conferences IPCSIT vol. 30 (2012) (2012)
IACSIT Press, Singapore
[8] Wendi B.Heinzelman,Anantha P.Chandrakasan and Hari Balakrishnan
An Application-Specific Protocol Architecture for Wireless
Microsensor networks,IEEE Transactions on wireless communications
vol.1 NO.4 2002.
[9] Do-Seong Kim and Yeong-Jee Chung, Self-Organization Routing
Protocol Supporting Mobile Nodes for Wireless Sensor Network,
Proceedings of the First International Multi-Symposiums on Computer
and Computational Sciences (IMSCCS'06), 2006
[10] G. S. Kumar, M. V. Vinu Paul, G. Athithan and K. P. Jacob, "Routing
Protocol enhancement for handling node mobility in wireless sensor
networks," TENCON 2008 - 2008 IEEE Region 10 Conf, 2008, pp. 1-6.
[11] S. A. B. Awwad, C. K. Ng, N. K. Noordin and M. F. A. Rasid, "Cluster
Based routing protocol for mobile nodes in wireless sensor network," in
Collaborative Technologies and Systems, 2009. CTS '09. International
Symposium on, 2009, pp. 233-241.
[12] Lutful Karim and Nidal Nasser Energy efficient and Fault Tolerant
Rouing protocol for mobile Sensor Network, IEEE ICC
2011processdings.
[13] Lehsaini M., Guyennet H. and Feham, M. Wireless Sensor and Actor
Networks II, 2008, in IFIP International Federation for Information
Processing, Volume 264; (Boston: Springer), pp. 1324.
[14] Md. Golam Rashed, M. Hasnat Kabir and S. E. Ullah, WEP: An energy
efficient protocol for cluster based heterogeneous wireless sensor
network, International Journal of Distributed and Parallel Systems
(IJDPS) Vol.2, No.2, March 2011, pp. 54-60.
[15] P.Saini and A. K. Sharma, Energy Efficient Scheme for Clustering
Protocol Prolonging the Lifetime of Heterogeneous Wireless Sensor
Networks, International Journal of Computer Applications (0975
8887)Vol. 6 No.2, September 2010, pp.30-36.
[16] K. Pahlavan and A. Levesque, Wireless Information Networks, New
York: Wiley, 1995
[17] Network Simulator , http://www.isi.edu/nsnam/ns.
[18] J. N. Al-karaki and A. E. Kamal. Routing techniques in wireless sensor
networks: A survey, IEEE Wireless Communications, 11(6):628,
December 2004.
[19] Jiawei Han, Micheline Kamber, "Data Mining: Concepts and
Techniques," Morgan Kaufmann Publishers, 2002.
[20] G. Gelet, Performance Evaluation of Wireless Sensor Network Routing
Protocols for Critical Condition Monitoring Application, M.A. thesis.
Addis Ababa University, Oct 2007.