Protecting the sink location privacy in wireless sensor networks

Yao, Lin; Kang, Lin; Shang, Pengfei; Wu, Guowei

doi:10.1007/s00779-012-0539-9

Cited by 42 publications

(29 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Conjointly this can be an associate key that is tough for associate entrant to search out the key. (13) At this, we arranged a cipher which is focused on sparse product of matrix U m and based on this matrix, sparse product will be calculate. The technique comprises encryption of a typical content into cipher content Xn over a onetime key called T0.…”

Section: Extended Euclidean Algorithmmentioning

confidence: 99%

Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

Meena¹,

Sharma²

2017

IJIES

View full text Add to dashboard Cite

Abstract:Wireless sensor networks (WSNs) are susceptible to various issues such as privacy and security. To overcome these issues, our worka first validates the location privacy issues and security protection. So that introduce a novel method known as Adequate Sparse Secure and Minkowski distance based Location Privacy (ASSMLP), in this first phase concentrates on location privacy which is improved by presenting a technique known as Fake Source and Fake Sink (FSFS). In this the location of fake node is separated by Modified Pillar k means based Minkowski distance. Second phase deliberate on security and here confidentiality of message can be ensured through sparse matrix. Thus the result shows throughput, energy consumption, energy efficiency, delay and packet delivery ratio and it achieves 2%, 7%, 36%, 8% and 8% better performance than existing work. Clustering accuracy is showed by means of minimum silhouette coefficient. Since real node cannot identify with an intruder.

show abstract

Section: Extended Euclidean Algorithmmentioning

confidence: 99%

Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

Meena¹,

Sharma²

2017

IJIES

View full text Add to dashboard Cite

show abstract

“…Some authors also propose using intrusion detection to handle the wormhole attack, but intrusion detection is difficult to isolate the attacker in a software-only approach. In [28] presented a general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks in wireless networks. They presented two types of packet leashes: geographic leashes and temporal leashes.…”

Section: Related Work and Backgroundmentioning

confidence: 99%

GRPW-MuS-s: A Secure Enhanced Trust Aware Routing against Wormhole Attacks in Wireless Sensor Networks

Sabri¹,

El²

2016

CAE

View full text Add to dashboard Cite

GRPW-MuS (Geographic Routing to Multiple Sinks in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks . GRPW-MuS, a geographical routing protocol for wireless sensor networks , is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. As introduced in Reference [9,17], the wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in GRPW-MuS is provided called GRPW-MuS-s . Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW-MuS). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node , which is suitable for the sensor network.

show abstract

“…One important implied assumption behind the data collection mechanisms using mobile sinks is that the collected data must be delay-tolerant as the collection delay is bounded by the physical distances and the speed of the mobile sinks. Clearly, this whole approach would not be appropriate when we need to collect real-time data, for which new approaches need to be developed as we are currently investigating in a related work [26,29]. For monitoring applications that are able to perform their expected functionalities as long as the data transmission is done within hours or minutes, then we can consider mobile sinks.…”

Section: Related Work and Backgroundmentioning

confidence: 99%

Geographic Routing in Wireless Sensor Networks based on a Partitioned Architecture

Sabri¹,

Kamoun²

2016

IJCA

View full text Add to dashboard Cite

Multiple sinks routing is envisioned as a possible solution to the bottleneck research problem in Wireless Sensor Networks (WSN). In addition to focusing on minimizing the energy consumption in a WSN, it is also equally important to design routing protocols that fairly and evenly distribute the network traffic; in order to prolong the network life time and improve its scalability. In this paper we present an enhancement to the GRPW algorithm for wireless sensor networks. Performance of GRPW algorithm algorithm depends heavily on single sink position , we propose a protocol called GRPW-MuS( Geographic Routing to Multiple Sinks in connected wireless sensor networks) based on Multiple Static Sinks, we modified the existing sink location privacy protection scheme by dividing nodes in the network containing multiple sink into different levels in which real packets are forwarded to sink belong to corresponding logical levels and the intermediate node generating fake packets and sending it to fake sinks. Using OMNET++ simulation and the MiXiM framework, it is shown that proposed protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

show abstract

Protecting the sink location privacy in wireless sensor networks

Cited by 42 publications

References 23 publications

Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

GRPW-MuS-s: A Secure Enhanced Trust Aware Routing against Wormhole Attacks in Wireless Sensor Networks

Geographic Routing in Wireless Sensor Networks based on a Partitioned Architecture

Contact Info

Product

Resources

About