A Novel and Comprehensive Trust Estimation Clustering Based Approach for Large Scale Wireless ‎Sensor Networks‎

Faculty Computer Science Year: 2019
Type of Publication: ZU Hosted Pages:
Authors:
Journal: IEEE Access IEEE Volume:
Keywords : , Novel , Comprehensive Trust Estimation Clustering Based    
Abstract:
With the wide applications of wireless sensor networks (WSNs) in various fields, such as environment monitoring, battlefield surveillance, healthcare, and intrusion detection, trust establishment among sensor nodes becomes a vital requirement to improve security, reliability, and successful cooperation. The existing trust management approaches for large-scale WSN are failed due to their low dependability (i.e., cooperation), higher communication, and memory overheads (i.e., resource inefficient). In this paper, we propose a novel and comprehensive trust estimation approach (LTS) for large-scale WSN that employs clustering to improve cooperation, trustworthiness, and security by detecting malicious (faulty or selfish) sensor nodes with reduced resource (memory and power) consumption. The proposed scheme (LTS) operates on two levels, namely, intra-cluster and inter-cluster along with distributed approach and centralized approach, respectively, to make accurate trust decision of sensor nodes with minimum overheads. LTS consists of unique features, such as robust trust estimation function, attack resistant, and efficient trust aggregation at the cluster, head to obtain the global feedback trust value. Data trust along with communication trust plays a significant role to cope with malicious nodes. In LTS, punishment and trust severity can be tuned according to the application requirement, which makes it an innovative LTS. Moreover, dishonest recommendations (outliers) are eliminated before aggregation at the base station by observing the statistical dispersion. The theoretical and mathematical validations along with simulation results exhibit the great performance of our proposed approach in terms of trust evaluation cost, prevention, and detection of malicious nodes as well as communication overhead.
   
     
 
       

Author Related Publications

  • Mohammed Abdel Basset Metwally Attia, "Discrete greedy flower pollination algorithm for spherical traveling salesman problem", Springer, 2019 More
  • Mohammed Abdel Basset Metwally Attia, "A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems", Natural Sciences Publishing Cor., 2014 More
  • Mohammed Abdel Basset Metwally Attia, "A novel equilibrium optimization algorithm for multi-thresholding image segmentation problems", Springer London, 2021 More
  • Mohammed Abdel Basset Metwally Attia, "An efficient binary slime mould algorithm integrated with a novel attacking-feeding strategy for feature selection", Pergamon, 2021 More
  • Mohammed Abdel Basset Metwally Attia, "An efficient teaching-learning-based optimization algorithm for parameters identification of photovoltaic models: Analysis and validations", Pergamon, 2021 More

Department Related Publications

  • Mohammed Abdel Basset Metwally Attia, "Discrete greedy flower pollination algorithm for spherical traveling salesman problem", Springer, 2019 More
  • Mohammed Abdel Basset Metwally Attia, "A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems", Natural Sciences Publishing Cor., 2014 More
  • Saber Mohamed, "Training and Testing a Self-Adaptive Multi-Operator Evolutionary Algorithm for Constrained Optimization", ELSEVEIR, 2015 More
  • Saber Mohamed, "An Improved Self-Adaptive Differential Evolution Algorithm for Optimization Problems", IEEE, 2013 More
  • Saber Mohamed, "Differential Evolution with Dynamic Parameters Selection for Optimization Problems", IEEE, 2014 More
Tweet