Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang.

Slides:



Advertisements
Similar presentations
Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection Presented by: Vijay Kumar.
Advertisements

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY Presented By: Abbas Kazerouni EE 360 paper presentation, winter 2014, EE Department, Stanford.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Introduction to Wireless Sensor Networks
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
1 Security and Privacy in Sensor Networks: Research Challenges Radha Poovendran University of Washington
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Wireless Video Sensor Networks Vijaya S Malla Harish Reddy Kottam Kirankumar Srilanka.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
Trust Management in Mobile Ad Hoc Networks Using a Scalable Maturity-Based Model Authors: Pedro B. Velloso, Rafael P. Laufer, Daniel de O. Cunha, Otto.
Integrated Social and Quality of Service Trust Management of Mobile Groups in Ad Hoc Networks Ing-Ray Chen, Jia Guo, Fenye Bao, Jin-Hee Cho Communications.
Hierarchical Trust Management for Wireless Sensor Networks and Its Application to Trust-Based Routing Fenye Bao, Ing-Ray Chen, Moonjeong Chang Presented.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
Energy-Aware Routing Paper #1: “Wireless sensor networks: a survey” Paper #2: “Online Power-aware Routing in Wireless Ad-hoc Networks” Robert Murawski.
Trust-based Multi-Objective Optimization for Node-to-Task Assignment in Coalition Networks 1 Jin-Hee Cho, Ing-Ray Chen, Yating Wang, and Kevin S. Chan.
Protocols for Self-Organization of a Wireless Sensor Network K. Sohrabi, J. Gao, V. Ailawadhi, and G. J. Pottie IEEE Personal Comm., Oct Presented.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Securing Every Bit: Authenticated Broadcast in Wireless Networks Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, and Calvin Newport.
Effect of Redundancy on Mean Time to Failure of Wireless Sensor Networks Anh Phan Speer, Ing-Ray Chen Paper Presented by: Misha, Neha & Vidhya CS 5214.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
Wireless Sensor Networks COE 499 Energy Aware Routing
Distributed Detection of Node Replication Attacks in Sensor Networks Bryan Parno, Adrian perrig, Virgil Gligor IEEE Symposium on Security and Privacy 2005.
1 Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection Fenye Bao, Ing-Ray Chen,
Improving Routing in Sensor Networks with Heterogeneous Sensor Nodes Xiaojiang Du & Fengjing Lin Vehicular Technology Conference,2005 Spring,Volume 4.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
High-integrity Sensor Networks Mani Srivastava UCLA.
A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.
Secure In-Network Aggregation for Wireless Sensor Networks
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
Modeling In-Network Processing and Aggregation in Sensor Networks Ajay Mahimkar The University of Texas at Austin March 24, 2004.
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.
A Security Framework with Trust Management for Sensor Networks Zhiying Yao, Daeyoung Kim, Insun Lee Information and Communication University (ICU) Kiyoung.
LDTS: A Lightweight and Dependable Trust System for Clustered Wireless Sensor Networks 1 Presented by: Ting Hua Authors: Xiaoyong Li, Feng Zhou, and Junping.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Structure-Free Data Aggregation in Sensor Networks.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Energy Efficient Detection of Compromised Nodes in Wireless Sensor Networks Haengrae Cho Department of Computer Engineering, Yeungnam University Gyungbuk.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
Ing-Ray Chen, Member, IEEE, Hamid Al-Hamadi Haili Dong Secure and Reliable Multisource Multipath Routing in Clustered Wireless Sensor Networks 1.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
In the name of God.
Protocols for Wireless Sensor Networks
Delay-Tolerant Networks (DTNs)
Recommendation Based Trust Model with an Effective Defense Scheme for ManetS Adeela Huma 02/02/2017.
PROVEST: Provenance-based Trust Model for Delay Tolerant Networks
Wireless Sensor Network Architectures
Leach routing protocol in WSN
Authors: Ing-Ray Chen; Yating Wang Present by: Kaiqun Fu
Leach routing protocol in WSN
Presentation transcript:

Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang Nov 16, 2015 NVC, Falls Church, Virginia

Outlines  Introduction  System Model  Hierarchical Trust Management Protocol  Performance Model  Trust Evaluation Results  Trust-Based Intrusion Detection  Conclusion

Introduction  Wireless sensor network A large number of spatially distributed autonomous senor nodes (SNs) Monitor physical or environment conditions, e.g., temperature, sound,, pollutants, etc.

Introduction  Capability of SNs  Read sensed info  Transmit info to a base station/sink node via multi-hop routing  Constraints of SNs  Restricted resources, e. g., energy, memory and computation power, etc.  Unreliable communication  Can be compromised, active attack  Need scalable algorithm for highly reconfigurable communication operations

Key Design Challenges  Novel hierarchical trust management protocol  Scalability and reconfigurability for heterogeneous  Survivability and intrusion tolerance for selfish or malicious SNs  Key challenges  Trust composition  What trust components (TC) considered  Trust aggregation  What info aggregated for each TC  Trust formation  How trust formed from each TC

Contributions  Trust judgement by both QoS and social trusts  Dynamic trust management  Novel model-based analysis methodology for analyzing and validating protocol design  Application-level trust optimization approach for trusted-based applications, such as geographic routing and intrusion detection

System Model  Two-level hierarchy  Upper level – cluster; cluster head (CH); more power and resources  Lower level – SNs in each clusters  Periodic trust evaluation  peer to peer  CH to SN  Base station to CH  Trust metric  Social trust -- intimacy, honesty, privacy, centrality, connectivity  QoS trust – energy, unselfishness, reliability, task completion capability, etc.

Hierarchical Trust Management Protocol  Solutions to trust formation, aggregation and composition  Two levels of trust – SN and CH  Trust evaluation by direct or indirect observations  Four trust components – intimacy, honesty, energy and unselfishness  trust value that node i evaluates towards node j at time t w 1 +w 2 +w 3 +w 4 = 1

Hierarchical Trust Management Protocol  Peer-to-peer Trust Evaluation For 1-hop neighbors T ij X,direct new trust based on direct observation T ij X (t- Δt) old trust based on past experiences 0 ≤ α ≤ 1

Hierarchical Trust Management Protocol  Four trust component values:  T ij intimacy, direct (t)  Measure level of interaction experiences based on the maturity model  # of interactions between i and j over the maximum # of interactions between i and any other neighbor node during [0, t]  T ij honesty, direct (t)  Measure belief of node i that node j is honest based i’s direct observations towards j  a count of suspicious dishonest experiences of node j which node i has observed during [0, t]  0 if j dishonest; otherwise 1- ratio of count to a system- defined threshold

Hierarchical Trust Management Protocol  T ij energy, direct (t)  Measure belief of node i that node j has sufficient energy  overhearing node j’s packet transmission activities over the time period [0, t]  T ij unselfishness, direct (t)  Measure the degree of unselfishness of node j as evaluated by node i based on direct observations over [0, t].  May be estimated by giving recent interaction experiences a higher priority over old experiences

Hierarchical Trust Management Protocol

 CH-to-SN Trust Evaluation  Compare node j’s trust T cj (t) with the system minimum trust threshold T th  If T cj (t) is greater, j is deemed honest; otherwise take j as compromised node  Station-to-CH Trust Evaluation  CH-to-CH peer evaluation similar to SN-to-SN  Similar procedures to the ch-to-sn trust evaluation

Performance Model Probability model based on SPN For every node will have a SPN.

SPN model for a SH or a CH

Indicates the remaining energy T_ENERGY is the energy consumption rate SPN model for a SH or a CH

Mark(SN) = 1 indicates it is working in Selfish mode now. T_SELFISH & T_REDEMP determined by the percentage of remaining energy and the percentage of neighbors working in selfish mode. SPN model for a SH or a CH

Mark(CN) = 1 indicates it is compromised. T_COMPRO is modeled by: \lambda c is initial node compromise rate. Latter is Ratio of compromised node in 1 hop. Indicates, more likely to be Compromised if neighbors are compromised. SPN model for a SH or a CH

Compromised node be caught by rate: T_IDS is the IDS(Intrusion detection system) detection interval. SPN model for a SH or a CH When detected, a token move to place DCN

Subjective trust evaluation

Remember alpha is for coordinating impact of current value or past value

Objective trust evaluation

Trust Evaluation Results

With these, we can assume Subjective trust is nearly equal To objective trust which is the Ground truth Trust Evaluation Results Remember alpha is for coordinating impact of current value or past value and beta for Indirect and direct neighbor

Trust Based Geographic Routing

Use best alpha and beta pair to ensure Subjective trust is similar to ground truth Weights of social and Qos change with The percentage of compromised nodes L= message copies sent to multi nodes Compared with traditional ways which Does not consider node may be Compromised. Trust Based Geographic Routing

Source and sink node 700m away To ensure sufficient intermediate nodes On the path Geographic Routing (L=1) fails to Deliver any message after 50% of Compromised nodes. TBGR will find trustworthy nodes Instead of residing on the most direct Path to the sink node Tradeoff of overhead. Can be more Like traditional GR or Flooding-based Routing.

Trust Based Intrusion Detection Based on the idea of min. trust threshold CH evaluates a SN with help of other SNs Mc is set of SNs in that Cluster.

Trust Based Intrusion Detection Prob that node j is diagnosed as compromised: FP and FN of IDS:

Trust Based Intrusion Detection

Conclusion This paper consider social trust and QoS trust to build a trust management protocol. They use SPN to analyze the protocol They show the benefit by two specific appications.