Professional Documents
Culture Documents
> +
s +
=
d0 d ,
16
d
mp
lE *
DA
lE
Rx
lE
t
lE
d0 d ,
4
d
fs
lE *
DA
lE
Rx
lE
t
lE
d) (l,
Tx
E
(2)
Where E
t
is the total energy of the network, E
Rx
is the receiver energy, and E
fs
d
4
or E
mp
d
16
is the amplified energy that
depends on the transmitter amplifier model. E
DA
is energy of aggregation, for aggregate all sensed data this energy
multiplies with energy per bit and energy per area depends on the conditions for increase the energy efficiency of the
network. There are two conditions is used to calculate transmitter energy, suppose if the distance less than the initial
distance use energy per bit and distance greater than or equal to the initial distance use energy per area Each non-
International Journal of Application or Innovation in Engineering& Management (IJAIEM)
Web Site: www.ijaiem.org Email: editor@ijaiem.org, editorijaiem@gmail.com
Volume 2, Issue 4, April 2013 ISSN 2319 - 4847
Volume 2, Issue 4, April 2013 Page 129
cluster-head send L bits data to the cluster-hea around. Thus the total energy dissipated in the network during a round
is equal to:
) 2 (
4 16
toCH
fs
toBS
mp DA elec round
d NE d kE NE NE L E + + + = (3)
Where k is the number of clusters, E
DA
is the data aggregation cost in the cluster-heads, d
toBS
is the average distance
between the cluster-head and the base station, and d
toCH
is the average distance between the cluster members and the
cluster-head.
d
toCH
=
[K
M
2
d
toBS
=
2
765 . 0
M
(4) By setting the derivative of E
round
with respect to k to zero, we have the optimal number of clusters as
toBS mp
fs
opt
d
m
E
E N
k
16
2[
= (5)
Substituting Esq. (4) and (5) into Eq. (3), we obtain the energy E
round
dissipated during a round.
2.2. Minimum distance Estimation
This method is used to calculate distance and minimum distance between each node and base station. In order to send
the data from cluster head to base station based on this method evaluate energy efficiency of network and delay
minimization in a heterogeneous network.
)) ( * * ( *
16
d LE LE LE LE E E
mp DA Rx t n
+ = (6)
If the distance less than the initial distance,
)) ( * * ( *
4
d LE LE LE LE E E
fs DA Rx t n
+ =
(7)
Now calculate the minimum distance among the resultant distance.
For cluster minimum distance, Check the cluster minimum distance~=0, if so then,
If the minimum distance greater than the initial distance (d
0
),
)) (min_ * * ( *
16
dis LE LE LE LE E E
mp DA Rx t n
+ = (8)
If the minimum distance less than the initial distance,
)) (min_ * * ( *
4
dis LE LE LE LE E E
fs DA Rx t n
+ = (9)
Otherwise, the cluster minimum distance=0, then
If the minimum distance greater than the initial distance (d
0
),
)) (min_ * * ( *
16
dis LE LE LE LE E E
mp DA Rx t n
+ = (10)
If the minimum distance less than the initial distance
)) (min_ * * ( *
4
dis LE LE LE LE E E
fs DA Rx t n
+ =
(11)
After select, among the minimum distance then send data from the CH to BS through the selected minimum distance.
In DDAEEC algorithm is used to increase the energy efficiency of network and perform time reduction of data
transmission, parameters are described in Table 1.
International Journal of Application or Innovation in Engineering& Management (IJAIEM)
Web Site: www.ijaiem.org Email: editor@ijaiem.org, editorijaiem@gmail.com
Volume 2, Issue 4, April 2013 ISSN 2319 - 4847
Volume 2, Issue 4, April 2013 Page 130
Table 1: Parameters Specification
Parameter Value
E
elec
10 nJ/bit
E
f s
25 pJ/bit/m
2
E
mp
0.0020pJ/bit/m
4
E
0
0.7 J
E
DA
8 nJ/bit/message
d
0 80m
The above parameters are used in the energy calculations and distance between CH and BS. Table 1 refer from [4]. In
our DDAEEC protocol, used to deliver more number of sensing data to base station thereby achieved energy efficiency
and reduce data transmission time.
3. SIMULATION RESULTS
The performance of DDAEEC protocol using MATLAB is evaluated. Consider a sensor network with R =50 rounds,
assume the base station is in the center of the region. The performance of DDAEEC compared with other protocols.
The radio parameters used in our simulations are shown in Table 1.
0 5 10 15 20 25 30 35 40 45 50
0
1000
2000
3000
4000
5000
6000
x(time)
y
(d
a
t
a
)
DDAEEC
DDAEEC
Figure 2: Number of data received in base station for DDAEEC protocol.
Figure 2 shows the detailed performance of DDAEEC algorithm, for time duration 50 Sec, around 5000 number of data
can be transmitted from cluster head to base station..
0 5 10 15 20 25 30 35 40 45 50
0
1000
2000
3000
4000
5000
6000
x(time)
y
(d
a
t
a
)
l each vs DEEC vs DDAEEC
leach
DEEC
DDAEEC
Figure 3: Comparison of LEACH, DEEC, DDAEEC.
Figure 3 shows that detail views of the performance of clustering protocol such as LEACH, DEEC and DDAEEC.
Comparing to DEEC, DDAEEC algorithm can send 5000 messages at time duration 50 Sec whereas DEEC can send
2500 messages at time duration 50 Sec, LEACH can send 1500 messages at time duration 50sec. This means DDAEEC
algorithm performs delay minimization, to reduce time for data transmission over the network. So this algorithm more
efficient than DEEC and LEACH.
4. CONCLUSION
The proposed DDAEEC protocol can take initial energy and residual energy at the same time and also implement the
same procedure for selection of cluster head based on DEEC algorithm. But it compared to DEEC, DDAEEC algorithm
send more message at particular time duration. Performance of the algorithm for heterogeneous networks in terms of
delay Minimization was performed, that means reducing the time duration for data transmission over the network,
thereby increasing the energy efficiency of the network and result was compared with existing protocol LEACH and
DEEC, the comparison result shows that the DDAEEC algorithm has 40% increase in message transmission when
compared to existing protocols.
REFERENCES
International Journal of Application or Innovation in Engineering& Management (IJAIEM)
Web Site: www.ijaiem.org Email: editor@ijaiem.org, editorijaiem@gmail.com
Volume 2, Issue 4, April 2013 ISSN 2319 - 4847
Volume 2, Issue 4, April 2013 Page 131
[1] Ian F. Akyildiz, Weilian Su, Yogesh Sankaraubramaniam, and Erdal Cayirci: A Survey on sensor networks,
IEEE Communications Magazine (2002).
[2]. Rajashree.V.Biradar , V.C .Patil , Dr. S. R. Sawant , Dr. R. R. Mudholkar Classification and comparison of
routing protocols in wireless sensor networks.
[3] W.R. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, An application-specific protocol architecture for
wireless microsensor networks, IEEE Transactions on Wireless Communications ,2002,pp. 660670.
[4] O. Younis, S. Fahmy, HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor
networks, IEEE Transactions on Mobile Computing ,2004,pp. 660669.
[5] L. Qing, Q. Zhu, M. Wang, "Design of a distributed energy efficient clustering algorithm for heterogeneous
wireless sensor networks". ELSEVIER, Computer Communications, pp 2230- 2237, 2006.
[6] PoonamTyagi, RavinderPrakash Gupta, Rakesh Kumar Gill, Comparative Analysis of Cluster Based Routing
Protocols used in Heterogeneous Wireless Sensor Network: International Journal of Soft Computing and
Engineering (IJSCE) ISSN: 2231-2307, Volume-1, Issue-5, And November 2011
[7]. R. Saravanakumar, S.G. Susila, J.Raja, Energy Efficient Homogeneous and Heterogeneous System for
Wireless Sensor Networks: International Journal of Computer Applications (0975 8887)Volume 17 No.4,
March 2011
[8]. Tripti Sharma, Dr.Brijesh Kumar , Dr.Geetam Singh Tomar Performance Comparision of LEACH, SEP
andDEEC Protocol in Wireless Sensor Network
[9]. M. Ye, C. Li, G. Chen, J. Wu, EECS: an energy ecient cluster scheme in wireless sensor networks, in: IEEE
International Workshop on Strategies for Energy Eciency in Ad Hoc and Sensor Networks(IEEE
IWSEEASN2005), Phoenix, Arizona, April 79,2005.
[10].ELBHIRI BRAHIM, SAADANE RACHID, ALBA-PAGS ZAMORA and DRISS ABOUTAJDINE
Stochastic and Balanced Distributed Energy-Efficient Clustering (SBDEEC) for heterogeneous wireless
sensor networks, (Received July 07, 2009 / Accepted September 23, 2009).
[11].Tang Liu, Jian Peng, Jin Yang, and Chunli WangEnergy efficient prediction clustering algorithm
formultilevel heterogeneous wireless sensor networks.
[12] H. Oh and K. Chae, An Energy-Efficient Sensor Routing with Low Latency, Scalability in Wireless Sensor
Networks, IEEE International Conference on Multimedia and Ubiquitous Engineering, Seoul, 26-28 April
2007, pp
[13] Jamal N. Al-Karaki, Ahmed E. Kamal,, Routing Techniques in Wireless Sensor Networks: A Survey, IEEE
Wireless Communications, Volume: 11, Issue: 6 , 26-28, December 2004.
[14]. Manjeswari, A.; Agrawal, D.P. TEEN: A protocol for enhanced efficiency in wireless sensor networks. In
Proceedings of 1st International Workshop on Parallel and Distributed Computing Issues in Wireless
Networks and Mobile Computing, San Francisco, CA, USA, 2001; p. 189.
[15]. Lindsey, S.; Raghavendra, C.S. PEGASIS: Power Efficient gathering in sensor information systems. In
Proceedings of IEEE Aerospace Conference, Big Sky, MT, USA, March 2002.
Author
C.Divya received her M.E degree in Communication systems in the year 2010 from SSN college of
Engineering, Anna University, Chennai. She is currently working as Assistant Professor in Centre for
Information Technology and Engineering, Manonmaniam Sundaranar University, Tirunelveli, India. Her
Research interests are in wireless Sensor Networks and Remote Sensing. She has published several papers
related to wireless sensor Networks and its Security.
Prof.N.Krishnan is working as Prof. & Head , Centre For Information Technology and Engineering,
Manonmaniam Sundaranar University. He did his M.Tech at Cochin University of Science and Technology
and obtained Ph.d from Manonmaniam Sundaranar University. He has operated several extra mural
research projects funded by DRDO, Govt. of India, CDAC,etc. He has published nearly 100 research papers
both in National and International. He has also authored several books on information technology. He has guided
nearly 20 ph.d scholars. He is the chair for IEEE Podhigai Subsection.