Monday, November 10, 2014 — 10:00 AM EST

Candidate

Alireza Mortezaei

Title

Exploring the Tight Asymptotic Bounds of the Trade-off Between Query Anonymity & Communication Cost in Wireless Sensor Network

Supervisors

Mahesh Tripunitara and Gordon Agnew

Abstract

In this talk, I will discuss my contributions to work on the analysis of the trade-off between query-anonymity and communication-cost in wireless sensor networks. Prior work has observed that such a trade-off exists. In my work, starting with an unconditional notion of query-anonymity, I generalize a prior result for sourcerouted networks with square-grid topologies to source-routed networks in which the topology is a connected undirected graph. Specifically, I establish that the necessary and sufficient communication-cost to achieve query-anonymity asymptotically smaller than the diameter of the network, d, is a function of d only. And that the necessary and sufficient communication-cost to achieve query-anonymity asymptotically larger than d is a function of the desired query-anonymity only. I will discuss also an empirical validation I have done via simulations in TOSSIM, a de facto standard for wireless sensor networks.

Location 
EIT building
Room 3142

,

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
  1. 2019 (217)
    1. December (1)
    2. November (1)
    3. October (4)
    4. September (21)
    5. August (26)
    6. July (40)
    7. June (24)
    8. May (23)
    9. April (35)
    10. March (25)
    11. February (9)
    12. January (10)
  2. 2018 (150)
    1. December (13)
    2. November (25)
    3. October (12)
    4. September (13)
    5. August (7)
    6. July (23)
    7. June (9)
    8. May (6)
    9. April (9)
    10. March (16)
    11. February (10)
    12. January (7)
  3. 2017 (212)
  4. 2016 (242)
  5. 2015 (242)
  6. 2014 (268)
  7. 2013 (192)
  8. 2012 (31)