Team for Research in
Ubiquitous Secure Technology

The Inherent Security of Routing Protocols in Ad Hoc and Sensor Networks
Tanya Roosta, Sameer Pai, Phoebus Chen, Shankar Sastry, Stephen Wicker

Citation
Tanya Roosta, Sameer Pai, Phoebus Chen, Shankar Sastry, Stephen Wicker. "The Inherent Security of Routing Protocols in Ad Hoc and Sensor Networks". Proceedings of the 50th Annual IEEE Global Communications Conference (IEEE GLOBECOM'07), IEEE, November, 2007.

Abstract
Many of the routing protocols that have been designed for wireless ad-hoc networks focus on energy-efficiency and guaranteeing high throughput in a non-adversarial setting. However, given that ad-hoc and sensor networks are deployed and left unattended for long periods of time, it is crucial to design secure routing protocols for these networks. Over the past few years, attacks on the routing protocols have been studied and a number of secure routing protocols have been designed for wireless sensor networks. However, there has not been a comprehensive study of how these protocols compare in terms of achieving security goals and maintaining high throughput. In this paper, we focus on the problem of analyzing the inherent security of routing protocols with respect to two categories: multi-path and single-path routing. Within each category, we focus on deterministic vs. probabilistic mechanisms for setting up the routes. We consider the scenario in which an adversary has subverted a subset of the nodes, and as a result, the paths going through these nodes are compromised. We present our findings through simulation results.

Electronic downloads


(No downloads are available for this publication.)
Citation formats  
  • HTML
    Tanya Roosta, Sameer Pai, Phoebus Chen, Shankar Sastry,
    Stephen Wicker. <a
    href="http://www.truststc.org/pubs/327.html"
    >The Inherent Security of Routing Protocols in Ad Hoc and
    Sensor Networks</a>, Proceedings of the 50th Annual
    IEEE Global Communications Conference (IEEE GLOBECOM'07),
    IEEE, November, 2007.
  • Plain text
    Tanya Roosta, Sameer Pai, Phoebus Chen, Shankar Sastry,
    Stephen Wicker. "The Inherent Security of Routing
    Protocols in Ad Hoc and Sensor Networks". Proceedings
    of the 50th Annual IEEE Global Communications Conference
    (IEEE GLOBECOM'07), IEEE, November, 2007.
  • BibTeX
    @inproceedings{RoostaPaiChenSastryWicker07_InherentSecurityOfRoutingProtocolsInAdHocSensorNetworks,
        author = {Tanya Roosta and Sameer Pai and Phoebus Chen and
                  Shankar Sastry and Stephen Wicker},
        title = {The Inherent Security of Routing Protocols in Ad
                  Hoc and Sensor Networks},
        booktitle = {Proceedings of the 50th Annual IEEE Global
                  Communications Conference (IEEE GLOBECOM'07)},
        organization = {IEEE},
        month = {November},
        year = {2007},
        abstract = {Many of the routing protocols that have been
                  designed for wireless ad-hoc networks focus on
                  energy-efficiency and guaranteeing high throughput
                  in a non-adversarial setting. However, given that
                  ad-hoc and sensor networks are deployed and left
                  unattended for long periods of time, it is crucial
                  to design secure routing protocols for these
                  networks. Over the past few years, attacks on the
                  routing protocols have been studied and a number
                  of secure routing protocols have been designed for
                  wireless sensor networks. However, there has not
                  been a comprehensive study of how these protocols
                  compare in terms of achieving security goals and
                  maintaining high throughput. In this paper, we
                  focus on the problem of analyzing the inherent
                  security of routing protocols with respect to two
                  categories: multi-path and single-path routing.
                  Within each category, we focus on deterministic
                  vs. probabilistic mechanisms for setting up the
                  routes. We consider the scenario in which an
                  adversary has subverted a subset of the nodes, and
                  as a result, the paths going through these nodes
                  are compromised. We present our findings through
                  simulation results.},
        URL = {http://www.truststc.org/pubs/327.html}
    }
    

Posted by Sameer Pai on 30 Mar 2008.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.