Multi-Hop Energy Efficient Routing Protocol Based

on Data Controlling for Wireless Sensor Networks

Slaheddine Chelbi, Majed Abdouli and Rafik Bouaziz

Claude Duvallet

MIRACL Laboratory University of Sfax, Tunisia

Email: slaheddine.chelbi@gmail.com
majed.abdouli@gmail.com
raf.bouaziz@fsegs.rnu.tn

LITIS University of Le Havre

25 rue Philippe Lebon, CS 80540
76058 Le Havre Cedex, FRANCE.
Email: Claude.Duvallet@univ-lehavre.fr

AbstractWireless Sensor Networks (WSN) differ from

traditional wireless communication networks in several
characteristics. One of them is the power awareness since the
batteries of sensor nodes have a restricted lifetime and are
difficult to be replaced. Therefore, all protocols must be designed
to minimize energy consumption and to preserve the longevity of
the network. Routing protocols in WSN aim at accomplishing
power conservation. Most of researches have focused on energy
efficient solutions regardless of the communication between
Cluster Heads (CH) and Base Station (BS). When the sensor field
is far away from the BS, the CH are burdened with heavier relay
traffic and tend to die much faster. To solve this problem, a
Multi-hop Energy Efficient routing protocol based on Data
Controlling (MEEDC) is proposed in this paper. Our work
focuses on (i) a heterogeneous network and (ii) a sensitive data
controlling. The role of super nodes in the proposed
heterogeneous network is to connect the CH and the BS. They are
responsible for transmitting packets received from the CH to the
BS, thus the CH can preserve some energy in data forwarding.
The control of data transmission tries to reduce the number of
transmissions and thus considerable energy conservation is
achieved. Simulation results show that the MEEDC protocol
significantly prolongs the network survival time.

Routing protocols for WSN currently exist in the literature

[4] [5]. One class of them concerns the hierarchical routing
protocols. The main idea in this class of protocols is that every
sensor node within a WSN is grouped along with some other of
its neighboring nodes in order to constitute a specific cluster.
Data collected by the sensor nodes belonging to a same cluster
are not directly transmitted to the BS. Instead, a node of the
cluster, called CH, collects these data and forwards them to the
BS after possibly having performed appropriate data
aggregations. In this way, the number of transmitted messages
to the BS is reduced and considerable power conservation is
achieved.

KeywordsWireless Sensor Networks; Multi-Hop; Maximum

Data Error; Routing Protocol; Energy Saving.

I.

Clustering provides an effective method for prolonging the

lifetime of a WSN. Notice that the BS is usually located far
away from the sensing area. Previous researches [6] [7] have
shown that multi-hop inter-cluster communication mode is
usually more energy efficient because of the characteristics of
wireless channel. Thus, it is better to let CH cooperate with
each other to forward their data to the BS. However, they rarely
consider the problem in multi-hop sensor networks. As shown
in Fig. 1, when CH cooperate with each other to forward their
data to the BS, the CH closer to the BS are burdened with
heavier relay traffic and tend to die much faster, leaving areas
of the network uncovered [8].

INTRODUCTION

In recent years, with the development and advancement of

sensor technology, WSN has been widely deployed for military
applications, area surveillance systems, industrial applications,
and environmental monitoring [1].
A WSN consists of some hundreds to some thousands of
sensor nodes, which have the ability to communicate among
themselves using radio antenna. These nodes are usually small
in size with limited processing power, limited memory and
limited energy source [2] [3].
Due to their limited and non-rechargeable energy provision,
the energy resources of WSN should be managed wisely to
extend the lifetime of sensors. We consider a network of
energy-constrained sensors that are deployed over a geographic
area for monitoring the environment. The basic operation in
such a network is the systematic gathering and transmission of
sensed data to a BS.

978-1-4799-0792-2/13/$31.00 2013 IEEE

Fig. 1. Multi-hop cluster hierarchy in WSN.

Clustering is useful for improving energy eciency, and it

can be done in two kinds of networks: homogenous [9] [10]
and heterogeneous [11] [12] [13] [14].

There are three common types of resource heterogeneity in

sensor nodes: computational heterogeneity, link heterogeneity,
and energy heterogeneity. Energy heterogeneity means that the
heterogeneous nodes are line powered, or their batteries are
replaceable. This is the most important heterogeneity because
both computational heterogeneity and link heterogeneity will
consume more energy resource [15].
Our system model is based on a WSN which consists of a
BS and a set of heterogeneous sensor nodes. Placing few
heterogeneous nodes in WSN is an effective way to increase
network lifetime [15].
Another important issue considered in this paper is the
sensitive data controlling [16] [17]. Since power conservation
is an important concern in prolonging the lifetime of the system
and since the major source of power consumption is the
communication, the goal of our protocol is to minimize
unnecessary data transmissions and to reduce the consumed
energy. To achieve this goal, a Maximum Data Error (MDE) is
used to reduce the number of transmissions and thus
considerable energy conservation is achieved. MDE indicates
the maximum deviation tolerated between the current value and
the updated value.
In this paper, we propose a clustering routing protocol
which controls the sensitive data and mitigates the problem of
multi-hop in WSN. We evaluate the performance of our
protocol and we observe that the protocol outperforms existing
protocols in terms of energy consumption and longevity of the
network.
The rest of this paper is structured as follows. Section 2 lists
several classical WSN routing protocols proposed before.
Section 3 introduces our proposed protocol called MEEDC.
Section 4 shows the analysis and experiment results. Finally,
section 5 concludes our paper.
II.

RELATED WORK

The routing techniques are classified into three categories

depending on the network structure: flat, hierarchical, and
location-based routing [18] [19]. Hierarchical clustering
techniques can aid in reducing useful energy consumption.
Hierarchical or cluster-based routing are well-known
techniques with special advantages related to scalability and
efficient communications [20] [21]. Data aggregation in WSN
is a data transfer technique by which several packets from
sensor nodes are combined into one. This technique is essential
because the reduction of data packets may reduce energy
consumption, increase network lifetime, and therefore increase
successful data transmission ratio [22]. There are many
clustering algorithms used in WSN. Clustering is an effective
approach to hierarchically organizing network topology and to
prolong the lifetime of WSN. LEACH (Low Energy Adaptive
Clustering Hierarchy) is one of the first hierarchical routing
protocols proposed for sensor networks [23]. It is also the first
clustering protocol that was proposed for reducing power
consumption. LEACH randomly selects a few sensor nodes as
CH and rotates this role to evenly distribute the energy load
among the sensors in the network. The idea is to form clusters
of the sensor nodes based on the received signal strength and
use local CH as routers to the BS. The LEACH operations are
done in two phases, (i) the setup phase and (ii) the steady state

phase. In the first phase, the clusters are organized and CH are
selected. CH change randomly over time in order to balance the
energy dissipation of nodes. In the steady state phase, the actual
data transfer to the BS takes place. Despite the fact that CH
rotation is performed at each round to achieve load balancing,
LEACH cannot ensure real load balancing because the CH are
elected in terms of probability without energy consideration.
LEACH is a CH single-hop protocol. In single-hop sensor
networks, CH use direct communication to reach the BS, and
the problem of unbalanced energy consumption among the CH
arises. CH, farther away from the BS, have heavier energy
burden due to the long-haul communication links.
Consequently, they will die earlier.
TEEN [16] is a threshold sensitive hierarchical routing
protocol. In TEEN, the authors propose the concept of Hard
Threshold (HT) and Soft Threshold (ST). The transmission of
the current sensed data depends on two conditions. The current
sensed data must be greater than HT and the difference
between the current sensed data and the previous one is greater
than ST. By this mechanism, the network can control the data
transmission. Only, the sensitive data can be transmitted to
reduce the energy transmission consumption and improve the
effectiveness and usefulness of the receiving data.
In [6], an Energy-efficient Multi-hop hierarchical Routing
protocol (EMHR) is proposed, which optimizes clustering
process based on the energy strategy, and effectively avoids the
low-energy nodes as the CH. In data transmission, the data in
CH can be transmitted by multi-hop. According to the weight
function determining the next-hop CH, this method balances
the load of network topology and reduces the CH energy
dissipation in WSN. However, when CH cooperate with each
other to forward their data to the BS, the CH closer to the BS
are burdened with heavier relay traffic and tend to die much
faster, leaving areas of the network uncovered and causing
network partitions.
III.

THE PROPOSED PROTOCOL

Our protocol has three main features. The first one is that it
performs selecting CH with more residual energy and rotating
CH periodically to distribute the energy consumption among
nodes in each cluster, and so extends the network lifetime.
The second feature is that our protocol tries to reduce the
number of transmissions. In [24], data is allowed to deviate,
with a certain degree, from their corresponding values in the
external environment. To measure data imprecision, the notion
of data error, denoted DE, which is used, gives an indication of
how much the value of data stored deviates from the
corresponding real-world value. This deviation has a threshold
named MDE (Maximum Data Error). The transmission of data
is discarded if the deviation between the current data value and
the stored value is less or equal to MDE (if DE MDE).
The third feature is concerned with the communication cost.
In single hop sensor networks, CH use direct communication to
reach the BS, and the problem of unbalanced energy
consumption among CH arises. CH farther away from the BS
have heavier energy burden due to the long-haul
communication links. Consequently, they will die earlier.

In WSN, short distance multi-hop communication strategy

is suitable for energy efficiency. The multi-hop routing is more
energy efficient than direct transmission routing under large
scale network. Nevertheless, when CH cooperate with each
other to forward their data to the BS, the CH closer to the BS
are burdened with heavier relay traffic and tend to die much
faster, leaving areas of the network uncovered and causing
network partitions. Our goal is how to mitigate the problem of
multi-hops problem in WSN.
Our protocol model is based on a WSN which consists of a
BS and a set of heterogeneous sensor nodes which are
randomly distributed over a bounded area of interest.
In our system model, there are two types of sensor nodes,
i.e., the super nodes and normal nodes. The super nodes have
more energy than the normal ones. Both the BS and the sensor
nodes are considered to be stationary.
The end user can access to data from the sensor network
through the BS. Only the BS is considered to have an unlimited
power supply. The network nodes are energy constrained.
A. Election of Cluster Head
The main idea of our protocol consists in using super CH to
reduce the data transmission ranges of CH nodes. When a CH
collects data from all its cluster member nodes, it forwards the
data to a super node, and then the data would be transmitted to
the BS by this super node.
The BS creates a TDMA (Time Division Multiple Access)
schedule according to which the nodes are requested to
advertise themselves. We assume that the initial number of
nodes is known by the BS. The size of this schedule is equal to
the number of existing nodes.
As soon as the TDMA schedule is broadcast, all nodes,
during their allocated time slots, transmit their advertisements
(the id node and its location). We assume that each node is
GPS-enabled and each node is aware of its geographic location.
When the node advertisement procedure is completed, the BS
randomly elects some nodes as CH. The BS broadcasts the id
and the locations of super nodes and the selected CH. The total
number of nodes, which are assigned to be super nodes and
CH, is supposed to be predefined.
B. Clustering

After the selection of the CH, each node decides which

cluster it belongs to and informs its CH that it will be a member
of its cluster. This node must choose the closest one as the CH.
Each node transmits this information back to the CH using a
CSMA (Carrier-Sense Multiple Access) MAC protocol.
After a certain time determined a priori, each CH receives
all the messages from the nodes that want to be included in its
cluster and according to their number, creates a TDMA
schedule of corresponding size. Next, it informs each one of its
cluster nodes when it can transmit, according to the TDMA
schedule which is broadcasted back to the nodes in the cluster.
The radio of each cluster node can be turned off until the
nodes allocated transmission time comes, in the goal to
minimize energy dissipation in these nodes. Thus, the first level
of clustering is terminated.

Since the id and the locations of super nodes are

broadcasted, each CH must choose the closest as the super CH
and informs it. The super CH do not engage in clustering. The
role of super CH is to connect the CH to BS. They are
responsible for transmitting packets received from the CH to
the BS, thus the CH can preserve some energy in data
forwarding.
A fundamental issue in WSN is to maximize the network
lifetime subject to a given energy constraint. To achieve this
goal, energy consumption must be well-balanced among nodes.
In homogeneous networks, the CH role can be periodically
rotated among nodes to balance the energy dissipation. The
main objective of the rotation is to balance the energy
consumption among the sensor nodes in each cluster, and it
could hardly balance the energy consumption among CH. We
argue that using nodes residual energy is the criterion when
selecting new CH. The strategy is electing the largest surplus
energy node by comparing the energy of nodes in each cluster
members, and then the selected node becomes the new CH.
The strategy guarantees the balance energy distribution of all
cluster members in WSN.
In the first round of networks, the BS randomly selects
the CH. At the end of each round, each current CH makes a
request for its clusters members, asking them to transmit
information about the residual energy of each node. Then, it
selects the largest energy node as new CH during the next
round.
C. Data transmission

Each node, during its allocated transmission time, sends to

the CH quantitative data concerning the sensed events. Data are
transmitted by a node to its CH only when this value changes
by an amount equal to or greater than the MDE (if DE MDE)
[24]. In our protocol, only parts of nodes passing data
verification need to transmit data to CH. This reduces the
transmission energy consumption.
The data transmission consists of three phases. At first, in
each cluster, none CH nodes transmit sensed data to CH. Then,
in second phase, the CH transmit aggregated data to their super
CH. Finally, each super CH transmits aggregated data to the
BS.
In the first phase, every non-CH node waits for their
TMDA slot to transmit data. When the time slot arrives, the
node transmits the data to CH.
In the second phase, each CH receives the data from its
cluster nodes. When all the data have been received, each CH
aggregates the data it has received along with its own data into
a single composite message (intra-cluster aggregation). After a
CH has created its aggregate message, it forwards the data to its
super CH and then, the data would be transmitted to the BS by
this super CH. As shown in Fig. 2, the CH can preserve some
energy in data forwarding since their data transmission ranges
are reduced.
The super nodes do not engage in clustering. Their role is
uniquely to connect the CH to the BS. They are responsible for
transmitting packets received from the CH to the BS.

Power control, therefore, is used to invert this loss by

setting the power amplier Ea at the transmitter properly to
ensure a certain power level at the receiver.
Thus, to transmit a b-bit message over a distance d, the
energy consumption by the transmitter is:
E tx (b, d ) Eetx (b) Eatx (b, d ) b Ee Ea (b, d )

(1)

b E friss amp d if d dc
Ea (b, d )
4

b Etwo rayamp d if d dc

(2)

And the energy for receiving a b-bit message is:

(3)

E rx (b) E erx (b) b E e

The simulation parameters are given in Table I.
Fig. 2. Network topology of MEEDC.

IV.

TABLE I

SIMULATIONS AND RESULTS

We implement two types of schemes: the Multi-hop Energy

Efficient routing protocol (MEE) and the Multi-hop Energy
Efficient routing protocol based on Data Controlling
(MEEDC).
In MEE, each node, during its allocated transmission time,
sends to the CH quantitative data without data controlling
consideration. However, in MEEDC, MDE tries to reduce the
number of transmissions.
In this paper, we evaluate the heterogeneous MEEDC
protocol performance in comparison with the LEACH protocol
and the EMHR protocol. As for the LEACH and EMHR
protocols, we assume that 100 normal nodes are randomly
distributed in a field, while in the MEEDC and MEE protocols
there are other super nodes apart from the 100 normal ones.
The comparison between the protocols in both energy
consumption and network lifetime will focus only on the
functioning of the normal nodes.
We adopt the same radio energy model with [25]. The
transmitter dissipates energy to power up its electrical circuit,
as well as the power amplier for transmission, i.e.,
E tx Eetx E atx whereas the receiver only needs energy to
power the radio electronics, i.e., E rx E erx [26]. Energy in
electrical circuit, Ee, is determined by the built-in parameters of
the sensors, including factors such as the coding, modulation
and ltering of the signal before it is sent to the transmit
amplier, while the communication-related power consumption
depends mainly on the environment.
Electrical signals are subject to attenuation once they are
sent out by the transmitter. The propagation of electromagnetic
waves can be modeled by a decreasing power law function of
the distance between the transmitter and the receiver, d. If d is
smaller than a crossover threshold dc, the propagation loss is
proportional to d2; it is proportional to d4 otherwise. dc is
determined by system parameters such as the height of antenna,
the wave length of carrier signal, etc. d2 attenuation and d4
attenuation correspond respectively to Friss free space model
and two-ray ground propagation model. EFriss-amp and Etworayamp depend on the required receiver sensitivity.

SIMULATION PARAMETERS

Parameters

Values

Network field

100 x 100

BS location

(200, 200)

Ee

50 nJ/bit

Efriss-amp

10 pJ/bit/m2

Etwo-ray-amp

0,0013 pJ/bit/m4

dC

87

Data packet size b

500 bytes

Initial Energy of normal sensor E0

5J

Number of normal sensors

100

Initial Energy of super node

30 J

Number of super nodes

MDE

In order to simulate the proposed protocol and evaluate its

efficiency, we use an open source Java library: GraphStream
[27]. GraphStream is a graph handling java library that focuses
on the dynamic aspects of graphs. Its main focus is on the
modeling of dynamic interaction networks of various sizes. The
goal of the library is to provide a way to represent graph and
work on it. GraphStream allows storing any kind of data
attribute on the graph elements: numbers, strings, or any
objects. Moreover, GraphStream provides a way to handle the
graph evolution in time. This means handling the way nodes
and edges are added and removed, and the way data attributes
may appear, disappear and evolve.
The basic assumptions of this scheme are:
Nodes are GPS-enabled and each node is aware of its
geographic location.

 Each node is assigned a unique id to help us to identify

one node from other neighboring nodes.
Sensors can use power control to modify the amount of
transmission power according to the distance to the
desired recipient.
It is assumed that the value of MDE is chosen by the
BS.
D. Energy consumption
We have chosen to compare the energy consumed in the
period where there is no node depletes its energy, i.e., we have
the same number of alive nodes. Table II shows the change in
energy consumption in the sensor network based on the number
of messages received by the BS until the first node in the
network depletes its energy.
The CH used in the LEACH will consume a large amount
of energy since they are located farther away from the sink. In
EMHR, MEE and MEEDC protocols, the CH sent the collected
data to BS by multi-hop manner, which saves the energy
consumption of CH since BS is very far in WSN.
In LEACH and EMHR protocols, since sensor area is far
away from the BS, CH has heavier energy burden due to the
long-haul communication links than the cluster members, as
the energy dissipation is directly proportional to the exponent
of transmission distance. In our scheme, only the super nodes
bear the responsibility of transmitting to the distant BS, the rest
of the nodes are used for short range communication.

TABLE III

VARIANCE OF NUMBER OF SENT MESSAGES

Iteration

MEE

MEEDC

100

84

50

5000

4420

100

10000

8850

150

15000

13422

200

20000

17854

F. Network lifetime
The most common definition of network lifetime is the time
when the last node in the network depletes its energy. In this
experiment, a node is considered dead if its remaining energy
is less than the value for the transmission task. Fig. 3 shows the
variation in the number of all alive nodes based on the number
of messages received by the BS. As shown in the figure, the
number of dead nodes in the proposed protocol is always less
than that of LEACH, EMHR an MEE protocol.
The MEEDC protocol outperforms the others protocols and
prolongs the lifetime of the whole network.

As shown in Table II, the energy consumption of the

MEEDC protocol is less than that of LEACH, EMHR and
MEE. Less energy consumption means longer lifetime for the
network.
TABLE II

Iteration
1

VARIANCE OF ENERGY CONSUMPTION (J)

LEACH

EMHR

MEE

MEEDC

0.53

0.46

0.41

0.36

100

52.16

45.75

41.15

36.80

200

105.42

89.96

82.16

72.82

300

155.20

135.26

123.26

109.84

400

205.93

180.56

164.74

145.67

500

255.45

225.34

205.12

184.56

E. Number of messages
As mentioned in the previous section, we have chosen to
compare the number of sent messages in the period where there
is no node depletes its energy, i.e., we have the same number of
alive nodes.
Table III shows the change in the number of messages
received by the BS until the first node in the network depletes
its energy. In the LEACH, EMHR and MEE protocol, every
non-CH node must transmit its sensed data to CH at every
iteration. In MEEDC protocol, only parts of nodes passing data
verification need transmit data to CH. This obviously reduces
the transmission energy consumption.

Fig. 3. Number of alive nodes.

Simulations show that MEEDC reduces the energy

dissipation and thus extends the overall network lifetime. The
lifetime of the network is improved by heterogeneity and
sensitive data controlling.
V.

CONCLUSION

This paper is concerned with hierarchical routing in WSN.

A new protocol, named MEEDC, is proposed. The MEEDC
protocol has three main features. First, our protocol uses two
techniques: selecting CH with more residual energy, and
rotating CH periodically to distribute the energy consumption
among nodes in each cluster. The next feature consists in
mitigating the multi-hops problem by using two types of
nodes. Finally, our protocol takes into account the sensitive
data controlling in order to reduce the number of transmission.
Thus, MEEDC achieves longer lifetime. In the future, our
protocol will be improved taking into account new QoS
requirements such as real-time and reliable communication.

REFERENCES
[1] Abdoulaye Diop, Yue Qi, Qin Wang and Shariq Hussain, An Advanced
Survey on Secure Energy-Efficient Hierarchical Routing Protocols in
Wireless Sensor Networks, IJCSI International Journal of Computer
Science Issues, Vol. 10, Issue 1, No. 2, pp. 490-500, January 2013.
[2] J. Zhang, V. Varadharajan, Wireless sensor network key management
survey and taxonomy, Journal of Network and Computer Applications,
Vol. 33, No. 2, pp. 63-75, 2010.
[3] Arvind Kumar, Ravi Kant Sahu, Siddhartha Chauhan, Energy-Efficient
and Reliable Routing Protocol for Wireless Sensor Networks,
International Journal of Computer Applications, Vol. 43, No.11, pp. 3337, April 2012.
[4] S. K. Singh, M. P. Singh, and D. K. Singh, Routing Protocols in
Wireless Sensor NetworksA Survey, International Journal of
Computer Science & Engineering Survey (IJCSES), Vol. 1, No. 2, pp.
63-83, November 2010.
[5] Samina Ehsan, Bechir Hamdaoui, A Survey on Energy-Efficient
Routing Techniques with QoS Assurances for Wireless Multimedia
Sensor Networks, IEEE Communications Surveys and Tutorials, Vol.
14, No. 2, pp. 265-278, 2012.
[6] W. W. Huang, Y. L. Peng, J. Wen, M. Yu, Energy-Efficient Multi-hop
Hierarchical Routing Protocol for WSN, International Conference on
Networks Security, Wireless Communications and Trusted Computing
(NSWCTC '09), pp. 469 472, Wuhan, Hubei, 2009.
[7] Chunghui Lee, Eunju Kim, Junho Park, Dongook Seong, and Jaesoo
Yoo, An Efficient Hierarchical Multi-Hop Clustering Scheme in Nonuniform Large Wireless Sensor Networks, Computer Science and its
Applications, Vol. 203, pp. 757-765, 2012.
[8] G. Chen, C. Li, M. Ye and J. Wu, An unequal cluster-based routing
protocol in wireless sensor networks, Wireless Network, Vol. 15, Issue
2, pp. 193-207, 2007.
[9] S. K. Singh, M. P. Singh and D. K. Singh, Energy efficient
Homogeneous Clustering Algorithm for Wireless Sensor Network,
International Journal of Wireless & Mobile Networks (IJWMN), Vol. 2,
No. 3, pp. 49-61, 2010.
[10] Gaurav Bathla and Gulista Khan, Energy- efficient Routing Protocol
for Homogeneous Wireless Sensor Networks, International Journal on
Cloud Computing: Services and Architecture (IJCCSA), Vol. 1, No. 1,
pp. 12-20, May 2011.
[11] Nadeem Javaid, T. N. Qureshi, A. H. Khan, A. Iqbal, E. Akhtar, M.
Ishfaq, EDDEEC: Enhanced Developed Distributed Energy-Efficient
Clustering for Heterogeneous Wireless Sensor Networks, Procedia
Computer Science, pp.1-6, 2013.
[12] Brahim Elbhiri, Rachid Saadane, Driss Aboutajdine, Stochastic and
Equitable Distributed Energy-Efficient Clustering (SEDEEC) for
heterogeneous wireless sensor networks, International Journal of Ad
Hoc and Ubiquitous Computing (IJAHUC), Vol. 7, No. 1, pp. 4-11,
2011.
[13] Said Ben Alla, Abdellah Ezzati, Abderrahim Beni Hssane And Moulay
Lahcen Hasnaoui, Hierarchical Adaptive Balanced energy efficient
Routing Protocol (HABRP) for heterogeneous wireless sensor
networks, International Conference on Multimedia Computing and
Systems (ICMCS), pp. 16, 2011.

[14] Li Han, LEACH-HPR: An Energy Efficient Routing Algorithm for

Heterogeneous WSN, International Conference on Intelligent
Computing and Intelligent System (ICIS), vol. 2, pp. 507-511, 2010.
[15] Dilip Kumar, Trilok C. Aseri, R.B. Patel, EECDA: Energy Ecient
Clustering and Data Aggregation Protocol for Heterogeneous Wireless
Sensor Networks, Int. J. of Computers, Communications & Control,
Vol. 4, No. 1, pp. 113-124, 2011.
[16] A. Manjeshwar and D.P. Agrawal, TEEN: A routing protocol for
enhanced efficiency in wireless sensor networks, Proceeding of the 15th
International Parallel and Distributed Processing Symposium, pp. 20092015, 2001.
[17] N. Sun, N. Su and S. Lee, A Lifetime Extended Routing Protocol Based
on Data Threshold in Wireless Sensor Networks, Proceedings of the
10th IEEE International Conference on Computer and Information
Technology (CIT 2010), pp. 743-748, 2010.
[18] J. N. Al-Karaki, A. E. Kamal, Routing Techniques in Wireless Sensor
Networks: A survey, IEEE Wireless Communications, Vol. 11, pp. 628, 2004.
[19] G. Nivetha and K. Venkatalakshmi, Comparative Analysis on Routing
Techniques in Wireless Sensor Networks, International Journal of
Advanced Research in Electronics and Communication Engineering
(IJARECE),Vol. 1, Issue 3, pp. 61-67, September 2012.
[20] N. Eshghi and A. T. Haghighat, Energy Conservation Strategy in
Cluster based Wireless Sensor Network, International Conference on
Advanced Computer Theory and Engineering (ICACTE '08), pp. 10151019, Phuket, 2008.
[21] S. Waware, N. Sarwade and P. Gangurde, A Review of Power Efficient
Hierarchical Routing Protocols in Wireless Sensor Networks,
International Journal of Engineering Research and Applications
(IJERA), Vol. 2, Issue 2, pp. 1096-1102, 2012.
[22] M. Watfa, W. Daher and H. Al Azar, A Sensor Network Data
Aggregation Technique, International Journal of Computer Theory and
Engineering, Vol. 1, No. 1, pp. 19-26, April 2009.
[23] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, A survey
on sensor networks, IEEE Communications Magazine, Vol. 40, No. 8,
pp. 102-114, August 2002.
[24] M. Amirijoo, J. Hansson, and S. Son, Specification and Management of
QoS in Real-Time Databases Supporting Imprecise Computations,
IEEE Transactions on Computers, Vol. 55, No. 3, pp. 304-319, 2006.
[25] W. R.Heinzelman, A. Chandrakasan, H. Balakrishnan, An Application
Specific Protocol Architecture for Wireless Microsensor Networks,
IEEE Transactions on Wireless Communications,Vol.1, No.4, pp. 660670, 2002.
[26] S. Sheng, L. Lynn, J. Peroulas, K. Stone, I. ODonnell, and R.
Brodersen, A low power CMOS chipset for spread spectrum
communications, in Proceedings of IEEE International Solid-State
Circuits Conference, pp. 346347, 1996.
[27] GraphStream. http://graphstream-project.org. 2013.