Location Privacy in Wireless Networks

1528 words (6 pages) Essay

27th Mar 2018 Computer Science Reference this

Tags:

Disclaimer: This work has been submitted by a university student. This is not an example of the work produced by our Essay Writing Service. You can view samples of our professional work here.

Any opinions, findings, conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of UKEssays.com.

  • ARUN TEJA KANUKOLU

 

Introduction:

In the past decade we have an enormous development of different wireless technologies a lot of wireless technologies like Wi-Fi, Bluetooth are being implemented. With the development of wireless technologies and the convenience they provide in the aspects of space and time they are being widely used and there comes numerous security issues.

A lot of work has been done in the areas of wireless network security but all of which has done only on securing the content or data that is being transferred between devices. The Location privacy has been ignored from the initial stages of development of wireless networks.

If the location privacy has been ignored, the users of the wireless networks has to face serious problems.

The attacker may not steal data because we use a lot of security techniques like encryption to protect the data but the user and the physical location of the user is always in danger.

The attacker may take advantage of this and may threaten him physically or mentally.

In order to preserve the location privacy of the user, here I propose a transactional based model in which all the send and receive operations performed from an user are not related to each other hence the location privacy is preserved.

TRACKING THE USERS LOCATION:

Many localization algorithms have been implemented and are in use which can be used to trace the approximate location of the user based on the packets sent and received.

A user’s many transmissions will simply be correlated if all the transmissions come from an equivalent supply address, and therefore the aggressor will read the supply addresses from every packet. During this section, we have a tendency to demonstrate another supply of knowledge by assumptive that associate degree aggressor cannot decode a user’s packets, however still needs to be ready to track users around the network. For instance, a user could use sturdy coding, or the aggressor could have insufficient sophistication to create custom

Hardware for packet secret writing, however will live the signal and noise levels at a spread of locations. Existing localization algorithms permit every transmission to be narrowed right down to a specific location. These individual transmissions will then be correlate using a quality model, as we have a tendency to describe below.

Here I discuss some of the existing algorithms.

LOCALIZATION USING RSS (received signal strength):

Received signal strength is the reliable and free of cost way of tracking the user’s location.

  • Where, PT Transmitted power calculated in dB
  • RSS is the received signal strength in dB
  • P(d0) is the Path loss in dBm at a distance of d0
  • N is the Path loss exponent

There are several other ways of tracking the user location.

Many of the previous researchers used the probability functions to find the location of the user.

Although the exact location cannot be found using these probability models an almost approximate location can be easily found.

Suppose we trace a location and there are 10 suspects, we can filter them to find the original wireless user that is being attacked.

Controlling access at base stations:

Since the readying of base stations has an associated price, the network operator should be stipendiary for the employment of the network. One way of achieving this result’s to want every licensed network node to carry a bit of secure hardware with a isosceles key shared by all network users. A network of affordable size cannot utterly believe on this mechanism to stay a determined aggressor from collaborating in the network. As a result, we have a tendency to explore techniques for confirmative that a user is a component of the network.

We use blind signatures in an exceedingly manner that parallels their use in electronic cash: a legitimate user generates variety of public keys, each of that we have a tendency to decision Associate in Nursing identity. The user blinds them (so the network supplier will sign them while not seeing them), and presents them to the network supplier. The network supplier signs these keys and returns them to the user, United Nations agency unblinds them. every key signed in this manner could be a kind of certificate that proves that the identity corresponds to a legitimate user, although the actual user cannot be determined.

Secured routing:

In order to forestall a malicious node from disrupting routing, the ad hoc networking analysis community continues to explore secure routing protocols Any of those protocols might be slightly modied to figure inside our spec. Depending on user necessities, AN anonymous routing protocol, such as ANODR, might give additional fascinating properties.

To show however we’d adapt a secure routing protocol to our design, we must take into account AN on-demand routing protocol. We must allow a base station to reply to any Route Discovery; but, because there are a restricted range of base stations and their keys are easily pre-distributed, they will simply send and demonstrate RREPs.

We should additionally adapt the prevailing protocols to settle on routes which will traverse a base station; in hop-by-hop routing, one technique is to own a node forward the packet to the nearer of the destination node or the nearest base station, unless the packet is distributed by a base station, in which case we tend to ne’er route it to a base station. once a base station receives a packet, it forwards it to the suitable base station supported the destination’s geographical address. the bottom station with that the destination is associated then encapsulates the packet so forwarding nodes apprehend that the packet has already traversed the bottom station. Periodic protocols will use constant forwarding logic.

UNLINKABLE WRELESS COMMUNICATION SYSTEMS:

In this section I propose a transaction based model in which any send and receive functions are not co-related to each other which preserves the location privacy of the user hence our goal is accomplished.

Location can only be tracked if the senders address is the same for a period of time.

We create a phenomena called random silent period for a node. In that time the sender will not send any thing.

The mobile node keep on changing its addresses between different transactions it performs. It can be in synchronization with the base station and mobile station.

When a user starts data exchange between other node, it keep on updating the change of address for every send and receive operation and it also makes aware of the new change in address with the receiver.

For this system implementation, we should make changes in everything like user registration with the base station and addressing and giving the access to the mobile users.

For addressing these nodes we completely change our ip addressing scheme from ipv4 to ipv6. If we use the ipv4 addresses, they are limited in number and hence they may cause collisions. These ipv6 addresses comprised of base station addresses and a reference variable to the users identity.

A legitimate user generates variety of public keys, each of that we have a tendency to decision AN identity. The user blinds them so the network supplier will sign them while not seeing them, and presents them to the network supplier. The network supplier signs these keys and returns them to the user, UN agency unblinds them. Every key signed in this method could be a certificate that proves that the identity corresponds to a legitimate user, although the actual user can’t be determined.

REFERENCES:

http://www.comm.toronto.edu/~kostas/Publications2008/pub/proceed/133.pdf

http://www.seas.ucla.edu/~wouyang/Received%20Signal%20Strength-Based%20Wireless%20Localization%20via%20Semidefinite%20Programming.pdf

http://www.ee.washington.edu/research/nsl/Imote/vanderstoep_thesis.pdf

http://jeroendoggen.files.wordpress.com/2010/05/ecumict2010presentation.pdf

Cite This Work

To export a reference to this article please select a referencing stye below:

Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.

Related Services

View all

DMCA / Removal Request

If you are the original writer of this essay and no longer wish to have your work published on the UKDiss.com website then please:

Related Lectures

Study for free with our range of university lectures!