TY - JOUR
T1 - Barrier Penetration Routing Against Wireless Spy Sensors
AU - Sakai, Kazuya
AU - Sun, Min Te
AU - Ku, Wei Shinn
AU - Wu, Jie
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2024/5/1
Y1 - 2024/5/1
N2 - We consider a potential communication problem in national security, where wireless spy sensors with eavesdropping capability are strategically deployed around an area of interest. For counterintelligence, achieving secure communication by penetrating such a spy barrier is of great importance. In this paper, we first formulate the problem of barrier penetration routing against spy barriers consisting of strategically deployed wireless sensors. We point out that existing multi-path avoidance routing protocols cannot efficiently counteract collusion attacks, where connected adversaries collaborate with each other to compromise data packets. We propose a barrier penetration routing (BPR) protocol to securely penetrate the barrier of adversaries. In the protocol, a set of physically distanced paths are identified based on distance vectors as well as network-wide flooding. Then, each data packet encoded by xor coding is routed via a different path. Unlike existing avoidance routing, the proposed scheme does not rely on the assumption that the adversary's locations are known. The simulation results demonstrate that the proposed BPR outperforms the baseline protocol as well as existing routing protocols in terms of secure delivery rate.
AB - We consider a potential communication problem in national security, where wireless spy sensors with eavesdropping capability are strategically deployed around an area of interest. For counterintelligence, achieving secure communication by penetrating such a spy barrier is of great importance. In this paper, we first formulate the problem of barrier penetration routing against spy barriers consisting of strategically deployed wireless sensors. We point out that existing multi-path avoidance routing protocols cannot efficiently counteract collusion attacks, where connected adversaries collaborate with each other to compromise data packets. We propose a barrier penetration routing (BPR) protocol to securely penetrate the barrier of adversaries. In the protocol, a set of physically distanced paths are identified based on distance vectors as well as network-wide flooding. Then, each data packet encoded by xor coding is routed via a different path. Unlike existing avoidance routing, the proposed scheme does not rely on the assumption that the adversary's locations are known. The simulation results demonstrate that the proposed BPR outperforms the baseline protocol as well as existing routing protocols in terms of secure delivery rate.
KW - Barrier penetration routing
KW - avoidance routing
KW - wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85164713147&partnerID=8YFLogxK
U2 - 10.1109/TMC.2023.3294415
DO - 10.1109/TMC.2023.3294415
M3 - 期刊論文
AN - SCOPUS:85164713147
SN - 1536-1233
VL - 23
SP - 4634
EP - 4647
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 5
ER -