Académique Documents
Professionnel Documents
Culture Documents
org
Published in IET Wireless Sensor Systems
Received on 25th October 2010
Revised on 7th February 2011
doi: 10.1049/iet-wss.2010.0086
ISSN 2043-6386
Department of Computer Science and Engineering, Siddaganga Institute of Technology, Tumkur, Karnataka, India
Department of Computer Science and Engineering, National Institute of Technology, Warangal, Andhra Pradesh, India
E-mail: aspoornima@sit.ac.in
Abstract: In wireless sensor network (WSN), lifetime of the network is determined by the amount of energy consumption by the
nodes. To improve the lifetime of the network, nodes are organised into clusters, in which the cluster head (CH) collects and
aggregates the data. A special node called mobile data collector (MDC) is used to collect the data from the CH and transfer it
to the base station (BS). So far in the literature secure data collection in distributed WSN is considered. Here we propose and
analyse three protocols for secure data collection in clustered WSN. The protocols use the tree-based key management
scheme. The protocols authenticate the MDC and then transfer the encrypted data to MDC. The theoretical analysis shows
that the protocols are invulnerable to the compromised MDC and replayed messages. The protocols show varying resiliency
to compromised CH. Simulation results show that increased security incurs additional energy consumption in secure data
collection.
Introduction
www.ietdl.org
is explained in Section 9. In Section 10 we provide energy
analysis of the protocols. We conclude in Section 11.
Related work
We classify the related work into two parts. In the rst part,
we discuss the previous work that uses the concept of
mobility for communication in WSN. Then in the second
part, we briey review existing work on secure data
collection using MDC.
2.1
Fig. 1 MDC collecting the aggregated data from CHs in a
clustered sensor network
www.ietdl.org
3.1
Network model
Adversary model
Notations
Notations
CH
CHj
BS
U
n
N
l
CCHK
Pki
IDx
Si
POSSi
CK
ki
ki2j
{x}y
SKi
TSi
Nonce
Ki
TSc
tMDCi
tx
F
f (x)
fi(x)
(xi , yi)
h(x)
cluster head
jth Cluster head
base station
set of all sensor nodes in a cluster
number of nodes in a cluster
number of nodes in the network
Number of CHs in the network
Common cluster head key
secret key shared between ith node and BS
identification information of node x
ith sensor node
position information of node Si
cluster key
secret key shared between ith node and CH
key k shared between the nodes from i to j
encryption of x using key y
session key for the ith round
time stamp for the ith round
random number selected by a node
secret computed by ith node using polynomial shares
current time value
time at which ith round of MDC is started.
time required by an adversary to compromise a node
collision resistant one way function
polynomials of degree d
polynomial of degree t assigned to ith CH
ith Point of a polynomial f (x)
one-way hash function
Cluster formation
www.ietdl.org
join request to CHj
Si CHj : IDSi h(ki )ki N oncejoin
CHj veries the join request using ki and if the node Si is
authorised, accepts it as one of the cluster member. CHj
sends the conrm message to node Si
CHj Si : IDCH h(N once)confirm
Now, CHj retains the information of SN-sensors in its cluster
and erases the rest from its memory.
After cluster formation, the network operates in two
phases. In sensing phase, the SN-sensors within a cluster
sense the data and send it securely to the CH. The CH upon
receiving data from all the SN-sensors in its cluster,
aggregates the data. In data collection phase, the BS
deploys MDCs for data collection. MDCs traverse the entire
monitoring area to collect the data. When an MDC visits
the CH, the CH authenticates the MDC and then the
aggregated data is transferred securely. After collecting the
data the MDC returns to the BS to dump the collected data.
We consider the algorithm proposed in [16] to determine the
number of MDCs to be deployed for maximum coverage and
also the route of MDCs. This algorithm considers a hybrid
sensor network architecture with multiple MDCs. The data
collection by the MDC is formulated as a vehicle routing
problem with time window. The algorithm meets the needs
of using minimal number of MDCs for data collection, with
equitable load distribution on the MDCs and it also uses a
priority-based model for attending the CH with critical data
or limited lifetime.
4.2
www.ietdl.org
www.ietdl.org
MDC and then encrypts the aggregated data using Pki and
transfers to MDC. Authentication of MDC is shown in ow
diagram of Fig. 3. The detailed step-by-step authentication
protocol is explained in Fig. 11 of the Appendix.
Security analysis
Node compromise
www.ietdl.org
Table 2
Communication
Computation
Malicious MDC
deployment
time during tr
TSP
PPSP
1 Msg
1 Msg
tx
tx . ty
SSP
l Msgs
polynomial
evaluation
polynomial
evaluation
tx . tz . ty
Performance analysis
Storage
SN-sensor: In TSP and PPSP, all the keys along the path of
the tree for which the SN-sensor belongs to are stored in SNsensors. The number of keys of the tree each SN-sensor stores
are logm n + 1 for a cluster of size n and degree of the tree m.
In addition to this each SN-sensor stores secret key Pki
used for condential communication with the BS. In SSP
protocol the storage at SN-sensor is same as that of TSP
and PPSP protocols discussed above. In addition to this
IET Wirel. Sens. Syst., 2011, Vol. 1, Iss. 2, pp. 8595
doi: 10.1049/iet-wss.2010.0086
Communication
Computation
www.ietdl.org
Table 3
Storage, communication and computation cost at CH for authentication of MDC and secure data transfer
Storage
TSP
PPSP
SSP
Communication
Computation
SN-sensor
CH
MDC
Send
Receive
ENCa
DECb
Other operations
logm n + 1
Pki
m
n
m1
SKi
1 beacon msg
hash function
logm n + 1
Pki
CCHK
Pk
mi
n
m1
SKi
1 beacon msg
polynomial construction
hash function
logm n + 1
Pki share of fi (x)
CCHK
Pki , d points
m
n
m1
SKi
l beacon msgs
polynomial construction
hash function
CCHK
Pki , Share of fi (x)
a
ENC, encryption
DEC, decryption
here also the computations at MDC are one encryption and one
decryption to authenticate itself.
From the performance analysis we can observe that the TSP
protocol is efcient with respect to storage, communication
and computation compared with PPSP and SSP protocols.
Table 3 summarises the storage, communication and
computation of TSP, PPSP and SSP protocols. We consider
a network of l clusters each of size n. In the table
computation cost is tabulated with respect to CH, because
the computation at MDC is same for all the protocols.
10
Energy analysis
www.ietdl.org
11
Conclusion
12
References
3 Wu, Q., Rao, N., Barhen, J. et al.: On computing mobile agent routes
for data fusion in distributed sensor networks, IEEE Trans. Knowl.
Data Eng., 2004, 16, (6), pp. 740753
4 Jain, S., Shah, R.C., Brunette, W., Borriello, G., Roy, S.: Exploiting
mobility for energy efcient data collection in wireless sensor
networks, Mob. Netw. Appl., 2006, 11, (3), pp. 327 339
5 Shah, R., Roy, S., Jain, S., Brunette, W.: Data MULEs: modeling a
three-tier architecture for sparse sensor networks. Proc. IEEE
Workshop on Sensor Network Protocols and Applications (SNPA),
Anchorage, Alaska, May 2003, pp. 30 41
6 Qi, H., Xu, Y., Wang, X.: Mobile agent based colobarative signal and
information processing in sensor networks, Proc. IEEE, 2003, 91, (8),
pp. 1172 1183
7 Chen, M., Kwon, T., Choi, Y.: Data dissemination based on mobile
agent in wireless sensor networks. Proc. IEEE LCN 2005, 2005,
pp. 527 529
8 Yarvis, M., Kushalnagar, N., Sing, H.: Exploitng heterogeneity
in sensor networks. Proc. IEEE Infocom 2005, Miami, Fl, March
2005
9 Du, X., Xiao, Y.: Energy efcient chessboard clustering and routing in
heterogeneous sensor networks, Int. J. Wirel. Mob. Comput., 2006, 1,
(2), pp. 121 130
10 Duarte-Melo, E., Liu, M.: Analysis of energy consumption and lifetime
of hetrogeneous wireless sensor networks. Proc. IEEE Globecom,
Taipei, Taiwan, November 2002
11 Zhou, L., Ni, J., Ravishankar, C.V.: Supporting secure communication
and data collection in mobile sensor networks. Proc. 25th
IEEE Int. Conf. on Computer Communications (Infocom06), 2006,
pp. 1 12
12 Rasheed, A., Mahapatra, R.: Secure data collection scheme in wireless
sensor networks with mobile sink. Proc. of Seventh IEEE Int. Symp. on
Network Computing Applications, 2008
13 Poornima, A.S., Amberker, B.B.: Agent based secure data collection in
heterogeneous sensor networks. Proc. Second Int. Conf. on Machine
Learning and Computing (ICMLC 2010), Bangalore, India, 9 11
February 2010
14 Poornima, A.S., Amberker, B.B.: Tree-based key management
scheme for heterogeneous sensor networks. Proc. 16th IEEE Int.
Conf. on Networks (ICON 2008), New Delhi, India, 12 14 December
2008
15 Jea, D., Somasundara, A.A., Srivastava, M.B.: Multiple controlled
mobile elements (data mules) for data collection in sensor networks.
IEEE Distributed Computing in Sensor Systems (DCOSS), Marina
Del Ray, CA, July 2005, pp. 244 257
16 Shah, P., Sivalingam, K.M., Agrawal, P.: Efcient data gathering in
distributed hybrid sensor networks using multiple mobile agents.
Proc. Third Int. Conf. on Communication System Software and
Middleware (COMSWARE), Bangalore, India, January 2008
17 Ma, M., Yang, Y.: SenCar: an energy-efcient data gathering
mechanism for large-scale multihop sensor networks, IEEE Trans.
Parallel Distrib. Syst., 2007, 18, (10)
18 Kumar, A.K., Sivalingam, K.M.: Energy-efcient mobile data
collection in wireless sensor networks with delay reduction using
wireless communication. Proc. Second Int. Conf. on Communication
Systems and Networks (COMSNETS), Bangalore, India, 2010,
pp. 1 10
19 Wong, C., Gouda, M., Lam, S.: Secure group communication using key
graphs. Proc. ACM SIGCOMM98, October 1998
20 Lipson, J.D.: Elements of algebra and algebraic computing (AddisonWesly, Reading, HA, 1981)
21 Shamir, A.: How to share a secret, Commun. ACM, 1979, 22, (11),
pp. 612613
22 Shnayder, Hempstead, V.M., Chen, B., Allen, G., Welsh, M.:
Simulating the power consumption of large scale sensor network
applications. Proc. Second ACM Int. Conf. on Embedded Networked
Sensor Systems (SENSYS 2004), 2004, pp. 188200
93
www.ietdl.org
13
Appendix
94
www.ietdl.org
95