抽象的な

Optimized Link State Routing In Wireless Ad Hoc Sensor Networks

Sreekanth Reddy Dandala, B Sowmya

Ad hoc wireless sensor networks are an exciting research in intuiting and Ad Hoc computing. Previous mechanisms in this area are concentrated on the denial of communication and denial of Service at the routing process levels or MAC levels. The resource depletion attacks at the routing protocol layer, in which permanently disable the networks by quickly draining nodes’ battery power. The “Vampire” attacks are not specific to any specific protocol, but rather rely on the properties of many popular classes of routing protocols. All the available protocols (link-state, distance vector, source routing etc.) are susceptible to Vampire attacks, and are easy to carry out as one malicious insider sending only protocol-compliant messages. There are numerous mitigation methods to bind the damage from Vampire attacks. The first protection mechanism is loose source routing, where any forwarding node can reroute the packet if it knows a shorter path to the destination. Unfortunately, this proves to be less efficient. The second method is to modify an existing sensor network routing protocols (Ariadne, SAODV, and SEAD) to provably mitigate the damage from Vampire attacks during packet forwarding.