Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Qua...

Full description

Bibliographic Details
Main Authors: Lianggui Liu, Li Chen, Huiling Jia
Format: Article
Language:English
Published: MDPI AG 2016-02-01
Series:Sensors
Subjects:
Online Access:http://www.mdpi.com/1424-8220/16/2/247
id doaj-b36923b82bcc41449a2a1e5b65622ee6
record_format Article
spelling doaj-b36923b82bcc41449a2a1e5b65622ee62020-11-24T21:32:26ZengMDPI AGSensors1424-82202016-02-0116224710.3390/s16020247s16020247Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNsLianggui Liu0Li Chen1Huiling Jia2School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, ChinaSchool of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, ChinaSchool of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, ChinaIn large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.http://www.mdpi.com/1424-8220/16/2/247social milieu oriented routingquality of trustquantum annealingquantum tunnelingWSNs
collection DOAJ
language English
format Article
sources DOAJ
author Lianggui Liu
Li Chen
Huiling Jia
spellingShingle Lianggui Liu
Li Chen
Huiling Jia
Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs
Sensors
social milieu oriented routing
quality of trust
quantum annealing
quantum tunneling
WSNs
author_facet Lianggui Liu
Li Chen
Huiling Jia
author_sort Lianggui Liu
title Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs
title_short Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs
title_full Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs
title_fullStr Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs
title_full_unstemmed Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs
title_sort social milieu oriented routing: a new dimension to enhance network security in wsns
publisher MDPI AG
series Sensors
issn 1424-8220
publishDate 2016-02-01
description In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.
topic social milieu oriented routing
quality of trust
quantum annealing
quantum tunneling
WSNs
url http://www.mdpi.com/1424-8220/16/2/247
work_keys_str_mv AT liangguiliu socialmilieuorientedroutinganewdimensiontoenhancenetworksecurityinwsns
AT lichen socialmilieuorientedroutinganewdimensiontoenhancenetworksecurityinwsns
AT huilingjia socialmilieuorientedroutinganewdimensiontoenhancenetworksecurityinwsns
_version_ 1725957539539976192