Optimal Privacy-Preserving Probabilistic Routing for Wireless Networks

Koh, Jing Yang; Leong, Derek; Peters, Gareth W.; Nevat, Ido; Wong, W.C.

doi:10.1109/tifs.2017.2698424

Cited by 23 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Flooding [2] all nodes participate in transmission consume too much energy can be applied to smallscale transmission Two-phase routing [3] searching area of the adversary is increased locations of virtual sources must be carefully designed can be adopted in a cluster structure Intermediate nodes [4] searching area of the adversary is increased there is too much randomness can be simulated into a random relay node Proxy node routing [5] multiple routing paths are created transmission delay may increase can be simulated into a random relay node Three-level security protection [6] can provide a high privacy protection consume too much energy of nodes can be applicable in underwater environment Machine learning [7] monitoring range of the adversary is estimated global information is needed not easy to implement in underwater environment Message mapping [8] can cope with global adversary global information is needed not easy to implement in underwater environment Fake source scheduling [9] searching area of the adversary is increased prior knowledge of the adversary location is needed this can be applicable in underwater environment Scheme decision procedure [10] with a variety of options nodes need to deploy multiple transmission schemes in advance cannot be used in underwater environment and continued. This has similar mechanism to the leaderfollower AUVs.…”

Section: Methods Advantage Disadvantage Underwater Extension Capabilitymentioning

confidence: 99%

“…Recently, a lot of attention for SLP protection has been paid to resist the adversary's attack [7,8,9]. Koh et al used machine learning, viz.…”

Section: A Location Privacy Schemes In Wsnsmentioning

confidence: 99%

“…Koh et al used machine learning, viz. maximum a-posteriori, to estimate the probability of capturing communication among the nodes of the adversary, and a mutual information minimization framework for decision-making [7]. Wang et al considered the adversary with both global and local properties, where a message mapping method was proposed to cope with the adversary.…”

Section: A Location Privacy Schemes In Wsnsmentioning

confidence: 99%

See 2 more Smart Citations

A Push-Based Probabilistic Method for Source Location Privacy Protection in Underwater Acoustic Sensor Networks

Wang

Han

Zhang

et al. 2022

IEEE Internet Things J.

View full text Add to dashboard Cite

Section: Methods Advantage Disadvantage Underwater Extension Capabilitymentioning

confidence: 99%

“…Recently, a lot of attention for SLP protection has been paid to resist the adversary's attack [7,8,9]. Koh et al used machine learning, viz.…”

Section: A Location Privacy Schemes In Wsnsmentioning

confidence: 99%

Section: A Location Privacy Schemes In Wsnsmentioning

confidence: 99%

See 1 more Smart Citation

A Push-Based Probabilistic Method for Source Location Privacy Protection in Underwater Acoustic Sensor Networks

Wang

Han

Zhang

et al. 2022

IEEE Internet Things J.

View full text Add to dashboard Cite

“…Typically, multi-path routing without careful deployment suffers from high energy consumption during the transmission. Thus, several flavors of this category focusing on reduced energy consumption in multi-path routing are proposed in [ 20 , 21 , 22 ]. Network Encoded Routing: In this routing, packets are re-encoded, split into multiple small packets, or integrated into one big packet during the transmission.…”

Section: Wsn Routing and Attack Mechanismmentioning

confidence: 99%

Tactile Routing for Location Privacy Preservation in Wireless Sensor Networks: A Game Theoretic Approach

Syed

Baroudi

2022

Sensors

View full text Add to dashboard Cite

Location Privacy Preservation (LPP) in Wireless Sensor Networks (WSNs) during the era of the Internet of things and smart systems is a critical element in the success of WSNs. LPP in WSN can be stated as: given a WSN with an adversary aiming to unravel the location of critical nodes of a WSN, the goal of the WSN manager is to enshroud the location of the critical nodes via routing and/or encryption mechanisms. Typical research in the LPP of WSN routing involves developing and/or estimating the performance of a fixed routing protocol under a given attack mechanism. Motivated by advancements in network softwarization, in this work, we propose an approach where the WSN manager as well as the WSN adversary can deploy multiple routing and attack mechanisms, respectively. Initially, the proposed approach is formulated as a repeated two-player zero-sum game. The formulation is further extended to handle multiple objectives and incomplete information in the game matrix. In this work, the multiple objectives are handled via the epsilon constraint method. The presence of incomplete information in the formulation is modeled as interval based uncertainty. To sum, the proposed formulation ultimately boils down to linear programming problems, which can be efficiently solved. Numerical case studies to showcase the applicability of the proposed approach are illustrated in this work. Finally, discussion on obtaining the required data from any given WSN, discussion and interpretation of the formulation’s results, and future research direction of the current work is presented.

show abstract

“…In this work, the dynamical adjustment of node emission radius is complex. Koh et al [28] have proposed multipath routing named optimal privacy-enhancing routing algorithm (OPERA). The authors have considered global adversary for both lossy and lossless observations that used Bayesian Maximum Posteriori (MAP) estimation scheme.…”

Section: State Of the Artmentioning

confidence: 99%

C²S²‐LOOP: Circular Chessboard‐Based Secure Source Location Privacy Model Using ECC‐ALO in WSN

Jan¹,

Khan

Al-Bayatti

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Source location privacy (SLP) is a serious issue in wireless sensor networks (WSN) since Eavesdroppers tries to determine the source location. Hunting Animals in Forest is considered as an example for SLP. Many conventional schemes have been proposed for SLP in WSN, namely, Random Walk Routing, and Fake Messages Transmission, which cause critical issues (less safety period, packet delivery latency, and high energy consumption). Furthermore, the security analysis is not properly investigated in any previous work. In this paper, we propose a new model called the circular chessboard-based secure source location privacy model (C2S2-LOOP) with the following tasks: key generation, network topology management (clustering), intercluster routing (travel plan), and data packets encryption. All sensor nodes are deployed in a circular chessboard (Circular Field) and the key generation ( P U K , S E K ) is invoked using elliptic curve cryptography (ECC) with Ant Lion Optimization algorithm, which mitigate the issues of conventional ECC. Then, the network topology is managed using clustering where residual energy of the nodes is used for Cluster Head (CH) selection. Intercluster routing is implemented using packet traversing using clockwise and anticlockwise directions, which are mainly concerned with establishing a secure route between the source to the destination node. To ensure data security, we present the Chaotic Artificial Neural Network (C-ANN) in which encryption is executed. Assume that CH near to the source node has a high trust value, then it traverses (clock-wise) real packets towards sink node and similarly in the left side region (anticlockwise), fake packets are transmitted. Network simulations (OMNeT++) are evaluated and compared with the previous approaches, and finally, our proposed scheme concludes that it maintains not only source node location privacy (large safety period) and also reduces energy consumption by more than 40% and latency by more than 35%.

show abstract

Optimal Privacy-Preserving Probabilistic Routing for Wireless Networks

Cited by 23 publications

References 24 publications

A Push-Based Probabilistic Method for Source Location Privacy Protection in Underwater Acoustic Sensor Networks

A Push-Based Probabilistic Method for Source Location Privacy Protection in Underwater Acoustic Sensor Networks

Tactile Routing for Location Privacy Preservation in Wireless Sensor Networks: A Game Theoretic Approach

C²S²‐LOOP: Circular Chessboard‐Based Secure Source Location Privacy Model Using ECC‐ALO in WSN

Contact Info

Product

Resources

About

Optimal Privacy-Preserving Probabilistic Routing for Wireless Networks

Cited by 23 publications

References 24 publications

A Push-Based Probabilistic Method for Source Location Privacy Protection in Underwater Acoustic Sensor Networks

A Push-Based Probabilistic Method for Source Location Privacy Protection in Underwater Acoustic Sensor Networks

Tactile Routing for Location Privacy Preservation in Wireless Sensor Networks: A Game Theoretic Approach

C2S2‐LOOP: Circular Chessboard‐Based Secure Source Location Privacy Model Using ECC‐ALO in WSN

Contact Info

Product

Resources

About

C²S²‐LOOP: Circular Chessboard‐Based Secure Source Location Privacy Model Using ECC‐ALO in WSN