• DocumentCode
    3088265
  • Title

    Combining Source-Location Privacy and Routing Efficiency in Wireless Sensor Networks

  • Author

    Ren, Jian ; Tang, Di

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI, USA
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Wireless sensor networks (WSNs) have been widely used in various applications for continuous event monitoring and detection. The WSNs communication is generally event-driven. While confidentiality of the message content can be ensured through content encryption, it is much more difficult to adequately protect the source-location information of the event. For WSNs, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSNs. On the other hand, exposure of the source-location can jeopardize the successful deployment of WSNs. In this paper, we propose a scheme to provide both source-location privacy and routing efficiency through routing to an intermediate node selected from a hierarchical connected dominating set (CDS) of the network. The CDS represents the backbone of the network and the nodes in the CDS are located in different regions of the network. As a result, choosing nodes from the CDS can ensure the intermediate node to be away from the actual message source node. The selection of the intermediate node can effectively prevent the adversary from performing routing trace back attack to identify the message source node. In addition, this design guarantees a high message delivery ratio and a high message delivery efficiency.
  • Keywords
    data privacy; sensor placement; telecommunication network routing; telecommunication security; wireless sensor networks; content encryption; continuous event monitoring; cryptographic algorithms; hierarchical connected dominating set; high message delivery ratio; intermediate node; large scale broadcasting-based protocols; low-power radio devices; message source node; public-key cryptosystems; routing efficiency; routing trace back attack; sensor nodes; source-location privacy service; wireless sensor networks; Ad hoc networks; Heuristic algorithms; Monitoring; Peer to peer computing; Privacy; Routing; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
  • Conference_Location
    Houston, TX, USA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-9266-4
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2011.6134560
  • Filename
    6134560