Securing geographic routing in wireless sensor networks

ABSTRACT We consider the security of geographic routing (GR) that is widely used in ad hoc and wireless sensor networks due to its scalability. In GR, a node greedily forwards a packet to the neighbor that is closest to the destination. Thus, GR only requires a node to maintain the location information of its one hop neighbors. However, very little work has been done to secure GR. In a potential attack, malicious nodes may falsify their location information. Also, a malicious node can send an excessive number of packets to overload the receiving nodes and block legitimate packets from other sources. Alternatively, it can drop or misdirect received packets. To shed light on these problems, we propose an approach for robust GR via rate control, packet scheduling , and trust-based multi-path routing. In a simulation study, we also show that our robust GR can circumvent and route against attacks.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks offer inexpensive solutions in a wide variety of applications ranging from health, home, roads and public area monitoring to industry and aircraft control. As sensors proliferate, scalable communication protocols with low implementation requirements are pursued. Another key issue for the wider deployment of these solutions is security since the wireless sensor networks themselves are prone to security attacks. In this paper, we review geographical routing protocols, which allow for high scalability due to their localised operation while they also support mobility consuming less node and network resources since they operate on very limited overhead. We also investigate their vulnerabilities to security attacks (Sybil and selective forwarding attacks) and report efficient coutermeasures.
    Telecommunications and Multimedia (TEMU), 2012 International Conference on; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The range of applications of wireless sensor networks is so wide that it tends to invade our every day life. In the future, a sensor network will survey our health, our home, the roads we follow, the office or the industry we work in or even the aircrafts we use, in an attempt to enhance our safety. However, the wireless sensor networks themselves are prone to security attacks. The list of security attacks, although already very long, continues to augment impeding the expansion of these networks. The trust management schemes consist of a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them, either for data forwarding, data aggregation or any other cooperative function. A variety of trust models which follow different directions regarding the distribution of measurement functionality, the monitored behaviours and the way measurements are used to calculate/define the node's trustworthiness has been presented in the literature. In this paper, we survey trust models in an attempt to explore the interplay among the implementation requirements, the resource consumption and the achieved security. Our goal is to draw guidelines for the design of deployable trust model designs with respect to the available node and network capabilities and application peculiarities. Copyright © 2010 John Wiley & Sons, Ltd.
    European Transactions on Telecommunications 04/2010; 21(4):386 - 395. · 1.05 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: As the applications of wireless sensor networks proliferate, the efficiency in supporting large sensor networks and offering security guarantees becomes an important requirement in the design of the relevant networking protocols. Geographical routing has been proven to efficiently cope with large network dimensions while trust management schemes have been shown to assist in defending against routing attacks. Once trust information is available for all network nodes, the routing decisions can take it into account, i.e. routing can be based on both location and trust attributes. In this paper, we investigate different ways to incorporate trust in location-based routing schemes and we propose a novel way of balancing trust and location information. Computer simulations show that the proposed routing rule exhibits excellent performance in terms of delivery ratio, latency time and path optimality.
    Wireless Communications and Mobile Computing 01/2010; · 0.86 Impact Factor

Full-text (2 Sources)

Available from
May 20, 2014