Abstract

Wireless Sensor Networks (WSNs) are an emerging technology that may one day supply real-time information to many services and Internet-based applications. The utility of WSNs relies on the ability to provide valid information, even in the presence of failures or attackers. Current research in the field has identified a large variety of attacks and countermeasures, however, few works address how WSN routing protocols can autonomously react to detected attacks. The works that do provide attack-reactive schemes generally require nodes to coordinate or exchange trust/detection reports. This work aims to maximize data delivery in the presence of selective forwarding attacks with nodes performing detection and reaction operations independently. Via modifications to the Collection Tree Protocol's forwarding path and route update procedure, nodes autonomously evaluate their parent's forwarding reliability and duplicate data to alternative parent nodes when deemed necessary. As shown though a number of simulations, this distributed scheme yields significant data recovery with only modest overheads for attackers dropping data at medium to high rates.

Library of Congress Subject Headings

Wireless sensor networks--Security measures; Routing (Computer network management)

Publication Date

11-4-2011

Document Type

Thesis

Department, Program, or Center

Computer Engineering (KGCOE)

Advisor

Yang, Shanchieh

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: TK7872.D48 S99 2011

Campus

RIT – Main Campus

Download

Share

COinS