SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks

LeXuan HUNG; Sungyoung LEE; Young-Koo LEE; Heejo LEE

doi:10.1587/transcom.E92.B.131

SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks

LeXuan HUNG, Sungyoung LEE, Young-Koo LEE, Heejo LEE

Full Text Views

0

Cite this

Summary :

For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol -- Secure COodination-based Data dissEmination (SCODE) -- for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.

Publication: IEICE TRANSACTIONS on Communications Vol.E92-B No.1 pp.131-142

Publication Date: 2009/01/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E92.B.131

Type of Manuscript: PAPER

Category: Fundamental Theories for Communications

Cite this

Copy

LeXuan HUNG, Sungyoung LEE, Young-Koo LEE, Heejo LEE, "SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks" in IEICE TRANSACTIONS on Communications, vol. E92-B, no. 1, pp. 131-142, January 2009, doi: 10.1587/transcom.E92.B.131.
Abstract: For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol -- Secure COodination-based Data dissEmination (SCODE) -- for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.131/_p

Copy

@ARTICLE{e92-b_1_131,
author={LeXuan HUNG, Sungyoung LEE, Young-Koo LEE, Heejo LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks},
year={2009},
volume={E92-B},
number={1},
pages={131-142},
abstract={For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol -- Secure COodination-based Data dissEmination (SCODE) -- for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.},
keywords={},
doi={10.1587/transcom.E92.B.131},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 131
EP - 142
AU - LeXuan HUNG
AU - Sungyoung LEE
AU - Young-Koo LEE
AU - Heejo LEE
PY - 2009
DO - 10.1587/transcom.E92.B.131
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2009
AB - For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol -- Secure COodination-based Data dissEmination (SCODE) -- for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.
ER -