Article

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
    • "Past work done by researchers, such as proves that algorithms exist that also find more than one disjoint paths. The disadvantages of these algorithms are that an increased number of control messages are created and they assume no topology changes may occur during the path finding procedure [10]. "

    Full-text · Article · Oct 2015
  • Source
    • "We also believe that the defense against flooding attacks should be charged to a set of (selected) more powerful nodes in the network, to avoid exhausting the scarce sensor resources. Table 2: The security features of trust-aware location-based routing solutions Trusted Routing Approach Forwarding attack detection Integrity attacks detection Trust model attacks detection Lifetime consideration Location verification Detection of flooding attack Trusted GPSR (Pirzada, [16]) √ √ Resilient GR (Kang, [17] "
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks are vulnerable to a wide set of security attacks, including those targeting the routing protocol functionality. The applicability of legacy security solutions is disputable (if not infeasible), due to severe restrictions in node and network resources. Although confidentiality, integrity and authentication measures assist in preventing specific types of attacks, they come at high cost and, in most cases, cannot shield against routing attacks. To face this problem, we propose a secure routing protocol which adopts the geographical routing principle to cope with the network dimensions, and relies on a distributed trust model for the detection and avoidance of malicious neighbours. A novel function which adaptively weights location, trust and energy information drives the routing decisions, allowing for shifting emphasis from security to path optimality. The proposed trust model relies on both direct and indirect observations to derive the trustworthiness of each neighboring node, while it is capable of defending against an increased set of routing attacks including attacks targeting the indirect trust management scheme. Extensive simulation results reveal the advantages of the proposed model.
    Full-text · Article · Mar 2013 · Wireless Personal Communications
  • Source
    • "Based on the observation that different security requirements may exist, it has been proposed (e.g. [2], [3]) to set a trust value threshold expressing the desired security level and have packets routed through nodes exceeding this threshold only, thus, prohibiting routing through nodes with low trust. This could be useful for applications with high security requirements, i.e. when security is more important and vital than the operation itself. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Security is currently a weak point of wireless sensor networks (WSN) impeding their proliferation although they offer flexible and low cost solutions for many every-day life applications. In WNSs, routing of data from the sensor nodes towards the destination/base station relies on the cooperation among neighbouring nodes. The realization of a trust management system which allows each node to define a trust value for each neighbour has been proposed as a powerful tool towards defending against the routing attacks. In this paper, we investigate how the trust information can be incorporated in the routing protocol and we compare based on simulation results three different trust-aware geographical routing algorithms.
    Full-text · Conference Paper · Sep 2009
Show more