1
|
Xie G, Zhou X, Gao J. Adaptive Trust Threshold Model Based on Reinforcement Learning in Cooperative Spectrum Sensing. Sensors 2023; 23:4751. [PMID: 37430665 DOI: 10.3390/s23104751] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 03/23/2023] [Revised: 05/03/2023] [Accepted: 05/08/2023] [Indexed: 07/12/2023]
Abstract
In cognitive radio systems, cooperative spectrum sensing (CSS) can effectively improve the sensing performance of the system. At the same time, it also provides opportunities for malicious users (MUs) to launch spectrum-sensing data falsification (SSDF) attacks. This paper proposes an adaptive trust threshold model based on a reinforcement learning (ATTR) algorithm for ordinary SSDF attacks and intelligent SSDF attacks. By learning the attack strategies of different malicious users, different trust thresholds are set for honest and malicious users collaborating within a network. The simulation results show that our ATTR algorithm can filter out a set of trusted users, eliminate the influence of malicious users, and improve the detection performance of the system.
Collapse
Affiliation(s)
- Gang Xie
- School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
| | - Xincheng Zhou
- School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
| | - Jinchun Gao
- Beijing Key Laboratory of Work Safety Intelligent Monitoring, Beijing University of Posts and Telecommunications, Beijing 100876, China
| |
Collapse
|
2
|
Cho Y, Qu G. A Hybrid Trust Model against Insider Packet Drop Attacks in Wireless Sensor Networks. Sensors (Basel) 2023; 23:s23094407. [PMID: 37177609 PMCID: PMC10181746 DOI: 10.3390/s23094407] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 03/02/2023] [Revised: 04/18/2023] [Accepted: 04/26/2023] [Indexed: 05/15/2023]
Abstract
Quick and accurate detection of inside packet drop attackers is of critical importance to reduce the damage they can have on the network. Trust mechanisms have been widely used in wireless sensor networks for this purpose. However, existing trust models are not effective because they cannot distinguish between packet drops caused by an attack and those caused by normal network failure. We observe that insider packet drop attacks will cause more consecutive packet drops than a network abnormality. Therefore, we propose the use of consecutive packet drops to speed up the detection of inside packet drop attackers. In this article, we describe a new trust model based on consecutive drops and develop a hybrid trust mechanism to seamlessly integrate the new trust model with existing trust models. We perform extensive OPNET (Optimized Network Engineering Tool) simulations using a geographic greedy routing protocol to validate the effectiveness of our new model. The simulation results show that our hybrid trust model outperforms existing trust models for all types of inside packet drop attacks, not only in terms of detection speed and accuracy as it is designed for, but also in terms of other important network performance metrics, such as packet delivery rate, routing reliability, and energy efficiency.
Collapse
Affiliation(s)
- Youngho Cho
- Department of Defense Science (Computer Engineering and Cyberwarfare Major), Graduate School of Defense Management, Korea National Defense University, Nonsan 33021, Republic of Korea
| | - Gang Qu
- Department of Electrical and Computer Engineering and Institute of Systems Research, University of Maryland, College Park, MD 20742, USA
| |
Collapse
|
3
|
Farrer Mackie J, Marshall J, Gray HL, Himmelgreen D, Alkon A, Kirby RS. "Just sit and eat." Adult and Child Mealtime Responsibilities in Early Care and Education Centers During COVID-19 in Florida. Ecol Food Nutr 2022; 61:559-575. [PMID: 35575781 DOI: 10.1080/03670244.2022.2073352] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/03/2022]
Abstract
Most young children in the United States attend early care and education (ECE) programs, in which they eat 3-4 times daily. 'Division of responsibility' between adult and child means the adults are responsible for what, when and where, and the child is responsible for whether, what and how much to eat. A balanced division of responsibility can support children's development of healthy eating competency. This paper aims to describe division of responsibility during mealtimes during COVID-19 in Florida using a cross-sectional, mixed methods design. Questions were developed based on Trust Model and Social Cognitive Theory. A survey was completed by 759 ECE directors and 431 teachers, and 29 teachers completed in-depth interviews. COVID-19 increased teacher mealtime responsibilities. Most (95%+) ECE teachers provided meals at the same time and place daily (when and where). Children determined what and how much they ate, but did not serve or handle food. Implications include modifying mealtime routines to minimize the risk of COVID-19 and support healthy eating with a balanced division of responsibility.
Collapse
Affiliation(s)
| | - Jennifer Marshall
- College of Public Health, University of South Florida, Tampa, Florida, USA
| | - Heewon L Gray
- College of Public Health, University of South Florida, Tampa, Florida, USA
| | - David Himmelgreen
- Department of Anthropology, University of South Florida, Tampa, Florida, USA
| | - Abbey Alkon
- School of Nursing, University of California San Francisco, San Francisco, California, USA
| | - Russell S Kirby
- College of Public Health, University of South Florida, Tampa, Florida, USA
| |
Collapse
|
4
|
Tatschner S, Jarisch F, Giehl A, Plaga S, Newe T. The Stream Exchange Protocol: A Secure and Lightweight Tool for Decentralized Connection Establishment. Sensors (Basel) 2021; 21:s21154969. [PMID: 34372205 PMCID: PMC8348180 DOI: 10.3390/s21154969] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 06/14/2021] [Revised: 07/02/2021] [Accepted: 07/15/2021] [Indexed: 11/30/2022]
Abstract
With the growing availability and prevalence of internet-capable devices, the complexity of networks and associated connection management increases. Depending on the use case, different approaches in handling connectivity have emerged over the years, tackling diverse challenges in each distinct area. Exposing centralized web-services facilitates reachability; distributing information in a peer-to-peer fashion offers availability; and segregating virtual private sub-networks promotes confidentiality. A common challenge herein lies in connection establishment, particularly in discovering, and securely connecting to peers. However, unifying different aspects, including the usability, scalability, and security of this process in a single framework, remains a challenge. In this paper, we present the Stream Exchange Protocol (SEP) collection, which provides a set of building blocks for secure, lightweight, and decentralized connection establishment. These building blocks use unique identities that enable both the identification and authentication of single communication partners. By utilizing federated directories as decentralized databases, peers are able to reliably share authentic data, such as current network locations and available endpoints. Overall, this collection of building blocks is universally applicable, easy to use, and protected by state-of-the-art security mechanisms by design. We demonstrate the capabilities and versatility of the SEP collection by providing three tools that utilize our building blocks: a decentralized file sharing application, a point-to-point network tunnel using the SEP trust model, and an application that utilizes our decentralized discovery mechanism for authentic and asynchronous data distribution.
Collapse
Affiliation(s)
- Stefan Tatschner
- Fraunhofer Institute AISEC, 85748 Garching bei München, Germany; (F.J.); (A.G.); (S.P.)
- Department of Electronic and Computer Engineering, University of Limerick, V94 T9PX Limerick, Ireland;
- Correspondence:
| | - Ferdinand Jarisch
- Fraunhofer Institute AISEC, 85748 Garching bei München, Germany; (F.J.); (A.G.); (S.P.)
- Department of Informatics, Technical University of Munich, 85748 Garching bei München, Germany
| | - Alexander Giehl
- Fraunhofer Institute AISEC, 85748 Garching bei München, Germany; (F.J.); (A.G.); (S.P.)
- Department of Informatics, Technical University of Munich, 85748 Garching bei München, Germany
| | - Sven Plaga
- Fraunhofer Institute AISEC, 85748 Garching bei München, Germany; (F.J.); (A.G.); (S.P.)
- Department of Electronic and Computer Engineering, University of Limerick, V94 T9PX Limerick, Ireland;
| | - Thomas Newe
- Department of Electronic and Computer Engineering, University of Limerick, V94 T9PX Limerick, Ireland;
| |
Collapse
|
5
|
Zhou J, Jin X, Yu L, Xue L, Ren Y. TruthTrust: Truth Inference-Based Trust Management Mechanism on a Crowdsourcing Platform. Sensors (Basel) 2021; 21:s21082578. [PMID: 33916964 PMCID: PMC8067557 DOI: 10.3390/s21082578] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/09/2021] [Revised: 03/27/2021] [Accepted: 03/29/2021] [Indexed: 11/16/2022]
Abstract
On a crowdsourcing platform, in order to cheat for rewards or sabotage the crowdsourcing processes, spam workers may submit numerous erroneous answers to the tasks published by requesters. This type of behavior extremely reduces the completion rate of tasks and the enthusiasm of honest users, which may lead a crowdsourcing platform to a failure. Defending against malicious attacks is an important issue in crowdsourcing, which has been extensively addressed by existing methods, e.g., verification-based defense mechanisms, data analysis solutions, trust-based defense models, and workers' properties matching mechanisms. However, verification-based defense mechanisms will consume a lot of resources, and data analysis solutions cannot motivate workers to provide high-quality services. Trust-based defense models and workers' properties matching mechanisms cannot guarantee the authenticity of information when collusion requesters publish shadow tasks to help malicious workers get more participation opportunities. To defend such collusion attacks in crowdsourcing platforms, we propose a new defense model named TruthTrust. Firstly, we define a complete life cycle system that from users' interaction to workers' recommendation, and separately define the trust value of each worker and the credence of each requester. Secondly, in order to ensure the authenticity of the information, we establish a trust model based on the CRH framework. The calculated truth value and weight are used to define the global properties of workers and requesters. Moreover, we propose a reverse mechanism to improve the resistance under attacks. Finally, extensive experiments demonstrate that TruthTrust significantly outperforms the state-of-the-art approaches in terms of effective task completion rate.
Collapse
Affiliation(s)
- Jiyuan Zhou
- School of Cyberspace, Hangzhou Dianzi University, Hangzhou 310018, China; (J.Z.); (X.J.); (L.X.); (Y.R.)
| | - Xing Jin
- School of Cyberspace, Hangzhou Dianzi University, Hangzhou 310018, China; (J.Z.); (X.J.); (L.X.); (Y.R.)
| | - Lanping Yu
- School of Information Engineering, Hangzhou Dianzi University, Hangzhou 310018, China
- Correspondence:
| | - Limin Xue
- School of Cyberspace, Hangzhou Dianzi University, Hangzhou 310018, China; (J.Z.); (X.J.); (L.X.); (Y.R.)
| | - Yizhi Ren
- School of Cyberspace, Hangzhou Dianzi University, Hangzhou 310018, China; (J.Z.); (X.J.); (L.X.); (Y.R.)
| |
Collapse
|
6
|
Bhansali R, Schaposnik LP. A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model. Proc Math Phys Eng Sci 2020; 476:20190826. [PMID: 32271857 DOI: 10.1098/rspa.2019.0826] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/27/2019] [Accepted: 02/13/2020] [Indexed: 11/12/2022] Open
Abstract
We introduce here a multi-type bootstrap percolation model, which we call T -Bootstrap Percolation ( T -BP), and apply it to study information propagation in social networks. In this model, a social network is represented by a graph G whose vertices have different labels corresponding to the type of role the person plays in the network (e.g. a student, an educator etc.). Once an initial set of vertices of G is randomly selected to be carrying a gossip (e.g. to be infected), the gossip propagates to a new vertex provided it is transmitted by a minimum threshold of vertices with different labels. By considering random graphs, which have been shown to closely represent social networks, we study different properties of the T -BP model through numerical simulations, and describe its implications when applied to rumour spread, fake news and marketing strategies.
Collapse
Affiliation(s)
- Rinni Bhansali
- Half Hollow Hills High School East, 50 Vanderbilt Pkwy, Dix Hills, NY 11746, USA
| | - Laura P Schaposnik
- University of Illinois at Chicago, Chicago, IL 60607, USA.,Simons Center for Geometry and Physics, NY 11794, USA
| |
Collapse
|
7
|
Khan AS, Balan K, Javed Y, Tarmizi S, Abdullah J. Secure Trust-Based Blockchain Architecture to Prevent Attacks in VANET. Sensors (Basel) 2019; 19:s19224954. [PMID: 31739437 PMCID: PMC6891648 DOI: 10.3390/s19224954] [Citation(s) in RCA: 36] [Impact Index Per Article: 7.2] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/09/2019] [Revised: 11/08/2019] [Accepted: 11/08/2019] [Indexed: 11/17/2022]
Abstract
Vehicular ad hoc networks (VANET) are also known as intelligent transportation systems. VANET ensures timely and accurate communications between vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) to improve road safety and enhance the efficiency of traffic flow. Due to its open wireless boundary and high mobility, VANET is vulnerable to malicious nodes that could gain access into the network and carry out serious medium access control (MAC) layer threats, such as denial of service (DoS) attacks, data modification attacks, impersonation attacks, Sybil attacks, and replay attacks. This could affect the network security and privacy, causing harm to the information exchange within the network by genuine nodes and increase fatal impacts on the road. Therefore, a novel secure trust-based architecture that utilizes blockchain technology has been proposed to increase security and privacy to mitigate the aforementioned MAC layer attacks. A series of experiment has been conducted using the Veins simulation tool to assess the performance of the proposed solution in the terms of packet delivery ratio (PDR), end-to-end delay, packet loss, transmission overhead, and computational cost.
Collapse
Affiliation(s)
- Adnan Shahid Khan
- Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan 94300, Malaysia; (K.B.); (Y.J.); (S.T.); (J.A.)
- Correspondence:
| | - Kuhanraj Balan
- Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan 94300, Malaysia; (K.B.); (Y.J.); (S.T.); (J.A.)
| | - Yasir Javed
- Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan 94300, Malaysia; (K.B.); (Y.J.); (S.T.); (J.A.)
- Department of Computer Science, Prince Sultan University, Riyadh 11586, Saudi Arabia
| | - Seleviawati Tarmizi
- Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan 94300, Malaysia; (K.B.); (Y.J.); (S.T.); (J.A.)
| | - Johari Abdullah
- Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan 94300, Malaysia; (K.B.); (Y.J.); (S.T.); (J.A.)
| |
Collapse
|
8
|
Sohail M, Wang L. 3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment. Sensors (Basel) 2018; 18:E856. [PMID: 29538314 DOI: 10.3390/s18030856] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [What about the content of this article? (0)] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Indexed: 12/03/2022]
Abstract
Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.
Collapse
|