New Trends in Secure Routing Protocols for Wireless Sensor Networks

El-Semary, Aly Mohamed; Abdel-Azim, Mohamed Mostafa
January 2013
International Journal of Distributed Sensor Networks;2013, p1
Academic Journal
Recently, Wireless Sensor Networks (WSNs) have been deployed into a variety of applications including homeland security, military systems, and health care. Sensor nodes deployed in such networks are subject to several attacks such as sinkhole and select forwarding, wormhole, Hello flood, and replication attacks. Therefore, developing secure and energy-efficient routing protocols to protect WSNs against these attacks while efficiently utilizing the energy of the deployed nodes has become imperative. Several routing protocols have been proposed in the literature for WSNs. Most of these protocols assume static nodes and sinks to collect data from network fields. However, they may be highly movable, and recent advances show that mobile sensors in WSNs have a promising performance. Therefore, this paper surveys the state of the art on routing protocols related to WSNs and presents the security issues or problems associated with the current protocols as well as discusses the future trends and open research issues on secure routing protocols of WSNs.


Related Articles

  • Joint optimization of energy allocation and routing problems in wireless sensor networks. Chu-Fu Wang; Jen-Wen Ding; Chun-Chia Lee // Wireless Communications & Mobile Computing;Feb2010, Vol. 10 Issue 2, p171 

    Energy allocation problems and routing problems are both important research issues in the wireless sensor network (WSN) field. The former usually aims at considering how to allocate a certain number of sensor devices in a sensing region to form a WSN so that the objective function value (e.g.,...

  • A routing strategy for non-cooperation wireless multi-hop ad hoc networks. Tran, Dung T.; Truong, Trang T.M.; Le, Thanh G. // Mobile Information Systems;2012, Vol. 8 Issue 4, p333 

    Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we...

  • EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS. SHANKER, O.; HOGG, TAD // Modern Physics Letters B;4/20/2009, Vol. 23 Issue 10, p1249 

    We show that the behavior of an epidemiology model depends sensitively on the shortcut density in the shortcut network. This is consistent with an earlier work on other processes on the shortcut network. We analytically study the reason for the sensitivity. The shortcut network is similar to the...

  • TinyNET—a tiny network framework for TinyOS: description, implementation, and experimentation. Castellani, Angelo Paolo; Casari, Paolo; Zorzi, Michele // Wireless Communications & Mobile Computing;Jan2010, Vol. 10 Issue 1, p101 

    In this paper we present TinyNET, a modular framework allowing development and quick integration of protocols and applications for Wireless Sensor Networks (WSNs) in TinyOS. The motivation behind TinyNET is two-fold: on one hand it allows to adopt a divide-and-conquer approach in the development...

  • Achieving capacity fairness for wireless mesh networks. Guo, Wenxuan; Huang, Xinming // Wireless Communications & Mobile Computing;May2011, Vol. 11 Issue 5, p632 

    This paper addresses a joint problem of power control and channel assignment within a wireless mesh network. A wireless mesh network is made up of two kinds of nodes: mesh routers (MRs) and user nodes (UNs). The MRs form a backbone network, while UNs receive data from the backbone network by...

  • A Cross Layer for Detection and Ignoring Black Hole Attack in MANET. Mohammed, Azza; Sofiane, Boukli Hacene; Mohamed, Faraoun kamel // International Journal of Computer Network & Information Security;Sep2015, Vol. 7 Issue 10, p42 

    MANET Mobile Ad hoc Network are evolved through various characteristics such as shared media, this property make a routing protocols vulnerable. AODV is a reactive routing where each intermediate node cooperates in the process of route discovery. In this case, the node that behaves as malicious...

  • An energy-efficient and security aware route selection protocol for wireless sensor networks. Hayajneh, Thaier; Doomun, Razvi; Al-Mashaqbeh, Ghada; Mohd, Bassam J // Security & Communication Networks;Nov2014, Vol. 7 Issue 11, p2015 

    ABSTRACT In wireless sensor networks (WSNs), sensor devices have limited supply of energy. The sensor death due to dissipating battery energy is one of the fundamental design issues in WSNs. Hence, energy efficiency is argued to be the most important requirement for any protocol designed for...

  • QoS Enabled Probabilistic Routing for Heterogeneous Wireless Sensor Networks. Kumar, Sanjay; Dave, Mayank; Dahiya, Surender // International Journal of Computer Network & Information Security;Apr2013, Vol. 5 Issue 4, p31 

    There is an increasing research interest in solving routing problems in Wireless Sensor Networks (WSN) and most of the existing routing protocols for WSN consider homogeneous nodes wherein, all sensor nodes have the same capabilities in terms of sensing, communication and computation...

  • Geographic Load Balanced Routing in Wireless Sensor Networks. Guleria, Robin; Jain, Ankit Kumar // International Journal of Computer Network & Information Security;Jun2013, Vol. 5 Issue 8, p62 

    Recently the application domains of wireless sensor networks have grown exponentially. Traditional routing algorithm generates traffic related to route discovery to destination. Geographic routing algorithms exploit location information well but the problem of congestion and collision throttle...

  • GRATA: gradient-based traffic-aware routing for wireless sensor networks. Do Duy Tan; Nguyen Quoc Dinh; Dong-Seong Kim // IET Wireless Sensor Systems;Jun2013, Vol. 3 Issue 2, p104 

    In this study, a distributed traffic-aware routing scheme is proposed for a wireless sensor network with multiple sinks. In multi-sink networks, traffic moving towards one sink may congest that moving towards others. The algorithm proposed here considers the traffic of surrounding neighbours...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics