1 / 6

QoS-aware Security Approaches in Wireless Sensor Networks

Explore tradeoffs between network security and QoS, improve routing protocols, enhance network security, and prolong WSN lifetime. Current work includes the Range of Best Routes and Traffic Classifier. Future work focuses on optimizing routing protocols considering energy consumption, delay, and security. Nodes exchange minimal data for updates, ensuring secure and efficient network operation.

hester
Download Presentation

QoS-aware Security Approaches in Wireless Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. QoS-aware Security Approches(eventual PhD topic)Ana Nieto(1st Year Grant Holder)nieto@lcc.uma.es

  2. Current Work BRB Current Work Future Work TrafficClassifier • Tradeoffs amongst network Security and Quality of Service (QoS) in WSNs • Improving routing protocols taking into account Energy consumption, Delay and Security in the path • Prolonging the Lifetime of WSNs • Choosing the best routes to Critical traffic • Increasing the Security in the network • Flow-based path selection • Different information to be shared… • …requires different paths to be sended • Depends on: • Security • QoS parameters

  3. Range of Best Routes (RBR) Current Work RBR + Constrains Traffic Classifier Future Work • Improving routing protocols taking into account Energy (E) consumption, Delay (D) and Security (S) in the path. • The path (p) used to send data from the source node (s) to the Sink (d) belongs to the set RBR defined as: • Where the function K(p) is defined as: • The k value is internal to each node of the network • The higher the value of k, the higher the cardinal of RBR • The weights (we, wd, ws) in the formulation represents the importance of each parameter • RBR varies taking different wi values in K(p) • Range of Best Routes (RBR) • Ch

  4. Routing by traffic Classifier Current Work RBR Traffic Classifier Future Work • These applications generate different flows • Different resource consumptions • Uncontrolled degradation of the network • Set of states for each node: • Dependent of how the sender understands the network • Independent: Charitable (all traffic), Egoist (low battery)

  5. Routing by traffic Classifier Current Work RBR Traffic Classifier Future Work

  6. Future Work • Actual RBR considersthatnodeshave a global view of thenetwork status • Thesystemshouldchangetheirbehaviourdependingontheobservedsecurityautomaticaly • Data minimizationwithoutloss of accuracy • Nodescouldinterchangeminimalammount of data tobeactualized • Extrapolate the proposed scheme to be used between clusters Current Work Future Work

More Related