Top-k Query Result Completeness Verification in Tiered Sensor Networks

Top-k Query Result Completeness Verification in Tiered Sensor Networks

ABSTRACT:

Storage nodes are expected to be placed as an intermediate tier of large scale sensor networks for caching the collected sensor readings and responding to queries with benefits of power and storage saving for ordinary sensors. Nevertheless, an important issue is that the compromised storage node may not only cause the privacy problem, but also return fake/incomplete query results. We propose a simple yet effective dummy reading based anonymization framework, under which the query result integrity can be guaranteed by our proposed verifiable top-k query (VQ) schemes. Compared with existing works, the VQ schemes have a fundamentally different design philosophy and achieve the lower communication complexity at the cost of slight detection capability degradation. Analytical studies, numerical simulations, and prototype implementations are conducted to demonstrate the practicality of our proposed methods

EXISTING SYSTEM:

Two schemes, additional evidence and crosscheck, were proposed in as solutions for securing top-k query in tiered sensor networks. While the former generates hashes for each consecutive pair of sensed data for verification purpose, the latter performs network-wide broadcast such that the information about the readings is distributed over the entire network and therefore the query result cannot be manipulated. In particular, the idea behind additional evidence is that if each consecutive pair of sensed data is associated with a hash, once an unqualified sensor reading is used to replace the genuine query result, the authority may know because it can find that there are some missing sensor readings for hash verification. On the other hand, the idea behind crosscheck is that the genuine top-k results are distributed to several sensor nodes. With certain probability, the authority will find query result incompleteness by checking the other sensor nodes’ sensor readings. Hybrid method is a combined use of additional evidence and crosscheck, attempting to balance the communication cost and the query result incompleteness detection capability.

DISADVANTAGES OF EXISTING SYSTEM:

1. There is no trusted central authority like proxy node in for such responsibility.

2. In real world deployment, these requirements are difficult to meet.

3. The methods  do not handle the data privacy  issue.

PROPOSED SYSTEM:

The Verifiable top-k Query (VQ) schemes based on the novel dummy reading-based anonymization framework are proposed for privacy preserving top-k query result integrity verification in tiered sensor networks. A randomized and distributed version of Order Preserving Encryption, rdOPE, is proposed to be the privacy foundation of our methods.AD-VQ-static achieves the lower communication complexity at the cost of slight detection capability degradation, which could be of both theoretical and practical interests. Analytical studies, numerical simulations, and prototype implementation are conducted to demonstrate the practicality of our proposed methods. A cell is a connected multihop network composed of a storage node and a number of ordinary sensors. Storage nodes are storage-abundant, can communicate with the authority via direct or multi-hop communications, and are assumed to know their affiliated cells. Time on the nodes has been synchronized and is divided into epochs. Note that time synchronization among nodes can be achieved by using algorithms.

ADVANTAGES OF PROPOSED SYSTEM:

1. The message m to be communicated is associated with H M ACK , the use of HMAC naturally guarantees the data authenticity and integrity.

2. Hybrid Crosscheck incurs tremendous communication cost because it involves the data broadcast over the cell.

3. SMQ achieves the data confidentiality through the use of bucket index

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

Ø System                          :         Pentium IV 2.4 GHz.

Ø Hard Disk                      :         40 GB.

Ø Floppy Drive                 :         1.44 Mb.

Ø Monitor                         :         15 VGA Colour.

Ø Mouse                            :         Logitech.

Ø Ram                               :         512 Mb.

SOFTWARE REQUIREMENTS:

Ø Operating system           :         Windows XP/7.

Ø Coding Language :         JAVA/J2EE

Ø IDE                      :         Netbeans 7.4

Ø Database              :         MYSQL

REFERENCE:

Chia-Mu Yu, Guo-Kai Ni, Ing-Yi Chen, Erol Gelenbe, and Sy-Yen Kuo, “Top-k Query Result Completeness Verification in Tiered Sensor Networks” IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 9, NO. 1, JANUARY 2014