• DocumentCode
    2927358
  • Title

    SECLOUD: Source and Destination Seclusion Using Clouds for wireless ad hoc networks

  • Author

    Doomun, Razvi ; Hayajneh, Thaier ; Krishnamurthy, Prashant ; Tipper, David

  • Author_Institution
    Univ. of Pittsburgh, Pittsburgh, PA, USA
  • fYear
    2009
  • fDate
    5-8 July 2009
  • Firstpage
    361
  • Lastpage
    367
  • Abstract
    The privacy of communicating entities in wireless ad hoc networks is extremely important due to the potential of their being identified and subsequently subjected to attacks (e.g., in military networks). Previously, random walk and fractal propagation schemes have been proposed to address privacy of source and destination nodes in ad hoc or sensor networks. Entropy of packet transmissions has been used as the metric for comparison. In this paper, we show that under a global attacker that can eavesdrop on the overall data transmissions and count them, neither of these approaches provide sufficient privacy when the attacker can visualize the transmissions and infer contextual information. Moreover, we show that the entropy is not a useful metric in such a case. We propose SECLOUD: Source and Destination Seclusion using Clouds to obfuscate the true source/destination nodes and make them indistinguishable among a group of neighbor nodes which works well even under network-wide traffic visualization by a global attacker.
  • Keywords
    ad hoc networks; radio networks; security of data; telecommunication security; SECLOUD; contextual information; destination seclusion; global attacker; network wide traffic visualization; source seclusion; wireless ad hoc networks; Ad hoc networks; Clouds; Entropy; Fractals; Mobile ad hoc networks; Privacy; Protection; Telecommunication traffic; Traffic control; Visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 2009. ISCC 2009. IEEE Symposium on
  • Conference_Location
    Sousse
  • ISSN
    1530-1346
  • Print_ISBN
    978-1-4244-4672-8
  • Electronic_ISBN
    1530-1346
  • Type

    conf

  • DOI
    10.1109/ISCC.2009.5202367
  • Filename
    5202367