The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Bagi kebanyakan aplikasi rangkaian sensor seperti ketenteraan, keselamatan tanah air, pengguna (sink) perlu mengakses rangkaian sensor semasa mereka bergerak. Walau bagaimanapun, mobiliti tenggelam membawa cabaran baharu untuk menjamin penghalaan dalam rangkaian penderia berskala besar. Sinki mudah alih perlu sentiasa menyebarkan lokasi semasanya ke semua nod, dan nod ini perlu bertukar-tukar mesej antara satu sama lain supaya rangkaian penderia boleh mewujudkan dan mengekalkan laluan multi-hop yang selamat antara nod sumber dan sinki mudah alih. Ini menyebabkan pengiraan yang ketara dan overhed komunikasi untuk nod sensor. Kajian terdahulu mengenai mobiliti sinki tertumpu terutamanya pada kecekapan dan keberkesanan penyebaran data tanpa pertimbangan keselamatan. Dalam kertas ini, kami mencadangkan protokol penyebaran data yang selamat dan cekap tenaga -- Penyebaran Data berasaskan KOordinasi Selamat (SCODE) -- untuk sinki mudah alih dalam rangkaian penderia. Kami memanfaatkan rangkaian penyelarasan (struktur grid) berdasarkan Kesetiaan Penyesuaian Geografi (GAF) untuk membina laluan penghalaan yang selamat dan cekap antara sumber dan singki. Analisis keselamatan kami menunjukkan bahawa protokol yang dicadangkan boleh bertahan daripada serangan biasa dalam penghalaan rangkaian sensor seperti serangan ulang tayang, serangan pemajuan terpilih, lubang benam dan lubang cacing, Sybil serangan, HELLO serangan banjir. Penilaian prestasi kami dalam kedua-dua analisis matematik dan simulasi menunjukkan bahawa SCODE mengurangkan penggunaan overhed dan tenaga komunikasi dengan ketara manakala kependaman adalah serupa berbanding dengan protokol penghalaan sedia ada, dan ia sentiasa menghantar lebih daripada 90 peratusan paket dengan jayanya.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
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
Salinan
@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},}
Salinan
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 -