Abstract

In network communication, Byzantine attacks, i.e., attacks in consequence of the packet dropping and cheating (modified packets), are usually difficult to guard against. Several multi-path packet routing schemes have been recently proposed to recover lost packets on account of the packet dropping (caused by path failures or attacks), but no effective solutions have been proposed to counter cheating attacks. To this end, we propose a novel approach in multi-path routing to improve resilience to Byzantine attacks. In our approach, we present a multipath source routing scheme based on Prüfer number which allows the receiver to identify packet dropping paths. We also propose a multi-path coding scheme based on ReedSolomon error-correcting coding scheme which allows the receiver to identify paths that cheat. If (n, k) RS coding scheme is used, our v(≥ 3) node-disjoint paths routing scheme is resilient to t = (n - k)/2 faulty paths, i.e., up to t faulty paths can be identified and the original message can be recovered. Our scheme does not involve interactive communications between the source and the destination. Additionally, we propose a path selection scheme which enables a node to select the most reliable paths (isolating faulty nodes) to transmit data. Our robustness analysis also discusses the tradeoffs between using the single path routing and multi-path routing.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Military Communications Conference MILCOM
DOIs
StatePublished - 2009
Event2009 IEEE Military Communications Conference, MILCOM 2009 - Boston, MA, United States
Duration: Oct 18 2009Oct 21 2009

Other

Other2009 IEEE Military Communications Conference, MILCOM 2009
CountryUnited States
CityBoston, MA
Period10/18/0910/21/09

Fingerprint

Coding errors
Sensor networks
Telecommunication networks
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Huang, D. (2009). Secure multi-path DATA deliver in sensor networks. In Proceedings - IEEE Military Communications Conference MILCOM [5379954] https://doi.org/10.1109/MILCOM.2009.5379954

Secure multi-path DATA deliver in sensor networks. / Huang, Dijiang.

Proceedings - IEEE Military Communications Conference MILCOM. 2009. 5379954.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Huang, D 2009, Secure multi-path DATA deliver in sensor networks. in Proceedings - IEEE Military Communications Conference MILCOM., 5379954, 2009 IEEE Military Communications Conference, MILCOM 2009, Boston, MA, United States, 10/18/09. https://doi.org/10.1109/MILCOM.2009.5379954
Huang D. Secure multi-path DATA deliver in sensor networks. In Proceedings - IEEE Military Communications Conference MILCOM. 2009. 5379954 https://doi.org/10.1109/MILCOM.2009.5379954
Huang, Dijiang. / Secure multi-path DATA deliver in sensor networks. Proceedings - IEEE Military Communications Conference MILCOM. 2009.
@inproceedings{995765d48eaa409ab218f24572e68c85,
title = "Secure multi-path DATA deliver in sensor networks",
abstract = "In network communication, Byzantine attacks, i.e., attacks in consequence of the packet dropping and cheating (modified packets), are usually difficult to guard against. Several multi-path packet routing schemes have been recently proposed to recover lost packets on account of the packet dropping (caused by path failures or attacks), but no effective solutions have been proposed to counter cheating attacks. To this end, we propose a novel approach in multi-path routing to improve resilience to Byzantine attacks. In our approach, we present a multipath source routing scheme based on Pr{\"u}fer number which allows the receiver to identify packet dropping paths. We also propose a multi-path coding scheme based on ReedSolomon error-correcting coding scheme which allows the receiver to identify paths that cheat. If (n, k) RS coding scheme is used, our v(≥ 3) node-disjoint paths routing scheme is resilient to t = (n - k)/2 faulty paths, i.e., up to t faulty paths can be identified and the original message can be recovered. Our scheme does not involve interactive communications between the source and the destination. Additionally, we propose a path selection scheme which enables a node to select the most reliable paths (isolating faulty nodes) to transmit data. Our robustness analysis also discusses the tradeoffs between using the single path routing and multi-path routing.",
author = "Dijiang Huang",
year = "2009",
doi = "10.1109/MILCOM.2009.5379954",
language = "English (US)",
isbn = "9781424452385",
booktitle = "Proceedings - IEEE Military Communications Conference MILCOM",

}

TY - GEN

T1 - Secure multi-path DATA deliver in sensor networks

AU - Huang, Dijiang

PY - 2009

Y1 - 2009

N2 - In network communication, Byzantine attacks, i.e., attacks in consequence of the packet dropping and cheating (modified packets), are usually difficult to guard against. Several multi-path packet routing schemes have been recently proposed to recover lost packets on account of the packet dropping (caused by path failures or attacks), but no effective solutions have been proposed to counter cheating attacks. To this end, we propose a novel approach in multi-path routing to improve resilience to Byzantine attacks. In our approach, we present a multipath source routing scheme based on Prüfer number which allows the receiver to identify packet dropping paths. We also propose a multi-path coding scheme based on ReedSolomon error-correcting coding scheme which allows the receiver to identify paths that cheat. If (n, k) RS coding scheme is used, our v(≥ 3) node-disjoint paths routing scheme is resilient to t = (n - k)/2 faulty paths, i.e., up to t faulty paths can be identified and the original message can be recovered. Our scheme does not involve interactive communications between the source and the destination. Additionally, we propose a path selection scheme which enables a node to select the most reliable paths (isolating faulty nodes) to transmit data. Our robustness analysis also discusses the tradeoffs between using the single path routing and multi-path routing.

AB - In network communication, Byzantine attacks, i.e., attacks in consequence of the packet dropping and cheating (modified packets), are usually difficult to guard against. Several multi-path packet routing schemes have been recently proposed to recover lost packets on account of the packet dropping (caused by path failures or attacks), but no effective solutions have been proposed to counter cheating attacks. To this end, we propose a novel approach in multi-path routing to improve resilience to Byzantine attacks. In our approach, we present a multipath source routing scheme based on Prüfer number which allows the receiver to identify packet dropping paths. We also propose a multi-path coding scheme based on ReedSolomon error-correcting coding scheme which allows the receiver to identify paths that cheat. If (n, k) RS coding scheme is used, our v(≥ 3) node-disjoint paths routing scheme is resilient to t = (n - k)/2 faulty paths, i.e., up to t faulty paths can be identified and the original message can be recovered. Our scheme does not involve interactive communications between the source and the destination. Additionally, we propose a path selection scheme which enables a node to select the most reliable paths (isolating faulty nodes) to transmit data. Our robustness analysis also discusses the tradeoffs between using the single path routing and multi-path routing.

UR - http://www.scopus.com/inward/record.url?scp=77951440492&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951440492&partnerID=8YFLogxK

U2 - 10.1109/MILCOM.2009.5379954

DO - 10.1109/MILCOM.2009.5379954

M3 - Conference contribution

AN - SCOPUS:77951440492

SN - 9781424452385

BT - Proceedings - IEEE Military Communications Conference MILCOM

ER -