scholarly journals A Framework for Managing Device Association and Offloading the Transport Layer’s Security Overhead of WiFi Device to Access Points

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6433
Author(s):  
Ramzi A. Nofal ◽  
Nam Tran ◽  
Behnam Dezfouli ◽  
Yuhong Liu
Keyword(s):  
Secure Communication ◽  
Data Exchange ◽  
Optimization Problem ◽  
Resource Constraints ◽  
Security Requirements ◽  
Data Driven ◽  
Processing Load ◽  
Access Points ◽  
Minimum Number ◽  
Comprehensive Framework

Considering the resource constraints of Internet of Things (IoT) stations, establishing secure communication between stations and remote servers imposes a significant overhead on these stations in terms of energy cost and processing load. This overhead, in particular, is considerable in networks providing high communication rates and frequent data exchange, such as those relying on the IEEE 802.11 (WiFi) standard. This paper proposes a framework for offloading the processing overhead of secure communication protocols to WiFi access points (APs) in deployments where multiple APs exist. Within this framework, the main problem is finding the AP with sufficient computation and communication capacities to ensure secure and efficient transmissions for the stations associated with that AP. Based on the data-driven profiles obtained from empirical measurements, the proposed framework offloads most heavy security computations from the stations to the APs. We model the association problem as an optimization process with a multi-objective function. The goal is to achieve maximum network throughput via the minimum number of APs while satisfying the security requirements and the APs’ computation and communication capacities. The optimization problem is solved using genetic algorithms (GAs) with constraints extracted from a physical testbed. Experimental results demonstrate the practicality and feasibility of our comprehensive framework in terms of task and energy efficiency as well as security.

Lightweight Key Management for Adaptive Addressing in Next Generation Internet

2021 ◽  
pp. 1890-1914
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit Narendra Mahalle
Keyword(s):  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Next Generation ◽  
Secret Key ◽  
Next Generation Internet ◽  
Node Capture

The continuous evolution of Next Generation Internet (NGI) amplifies the demand for efficient and secure communication capable of responding effectively to the challenges posed by the emerging applications. For secure communication between two sensor nodes, a secret key is needed. Cryptographic key management is a challenging task in sensor networks as the hostile environment of sensor networks makes it more prone to attacks. Apart from resource constraints of the devices, unknown topology of the network, the higher risk of node capture and lack of a fixed infrastructure makes the key management more challenging in Wireless Sensor Network (WSN). Paper surveys different key Management schemes for WSN. The paper presents the efficiency versus security requirements tradeoffs in key management for WSN. Paper also proposes a novel key management protocol which provides strong resistance against replay attacks. The results obtained from the mathematical model based on conditional probability of the scheme suggest that the proposed key management in NGI is efficient and attack resistant.

Lightweight Key Management for Adaptive Addressing in Next Generation Internet

2017 ◽  
Vol 8 (1) ◽  
pp. 50-69 ◽  
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit N Mahalle
Keyword(s):  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Next Generation ◽  
Secret Key ◽  
Next Generation Internet ◽  
Management Protocol

The continuous evolution of Next Generation Internet (NGI) amplifies the demand for efficient and secure communication capable of responding effectively to the challenges posed by the emerging applications. For secure communication between two sensor nodes, a secret key is needed. Cryptographic key management is a challenging task in sensor networks as the hostile environment of sensor networks makes it more prone to attacks. Apart from resource constraints of the devices, unknown topology of the network, the higher risk of node capture and lack of a fixed infrastructure makes the key management more challenging in Wireless Sensor Network (WSN). Paper surveys different key Management schemes for WSN. The paper presents the efficiency versus security requirements tradeoffs in key management for WSN. Paper also proposes a novel key management protocol which provides strong resistance against replay attacks. The results obtained from the mathematical model based on conditional probability of the scheme suggest that the proposed key management in NGI is efficient and attack resistant.

scholarly journals Drone Secure Communication Protocol for Future Sensitive Applications in Military Zone

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2057
Author(s):  
Yongho Ko ◽  
Jiyoon Kim ◽  
Daniel Gerbi Duguma ◽  
Philip Virgil Astillo ◽  
Ilsun You ◽  
...  
Keyword(s):  
Performance Evaluation ◽  
Secure Communication ◽  
Communication Protocol ◽  
Denial Of Service ◽  
Mutual Authentication ◽  
Information Leakage ◽  
Security Protocol ◽  
Security Requirements ◽  
Forward Secrecy ◽  
Perfect Forward Secrecy

Unmanned Aerial Vehicle (UAV) plays a paramount role in various fields, such as military, aerospace, reconnaissance, agriculture, and many more. The development and implementation of these devices have become vital in terms of usability and reachability. Unfortunately, as they become widespread and their demand grows, they are becoming more and more vulnerable to several security attacks, including, but not limited to, jamming, information leakage, and spoofing. In order to cope with such attacks and security threats, a proper design of robust security protocols is indispensable. Although several pieces of research have been carried out with this regard, there are still research gaps, particularly concerning UAV-to-UAV secure communication, support for perfect forward secrecy, and provision of non-repudiation. Especially in a military scenario, it is essential to solve these gaps. In this paper, we studied the security prerequisites of the UAV communication protocol, specifically in the military setting. More importantly, a security protocol (with two sub-protocols), that serves in securing the communication between UAVs, and between a UAV and a Ground Control Station, is proposed. This protocol, apart from the common security requirements, achieves perfect forward secrecy and non-repudiation, which are essential to a secure military communication. The proposed protocol is formally and thoroughly verified by using the BAN-logic (Burrow-Abadi-Needham logic) and Scyther tool, followed by performance evaluation and implementation of the protocol on a real UAV. From the security and performance evaluation, it is indicated that the proposed protocol is superior compared to other related protocols while meeting confidentiality, integrity, mutual authentication, non-repudiation, perfect forward secrecy, perfect backward secrecy, response to DoS (Denial of Service) attacks, man-in-the-middle protection, and D2D (Drone-to-Drone) security.

scholarly journals A Hybrid Analytics Paradigm Combining Physics-Based Modeling and Data-Driven Modeling to Accelerate Incompressible Flow Solvers

Fluids ◽  
2018 ◽  
Vol 3 (3) ◽  
pp. 50 ◽  
Author(s):  
Sk. Rahman ◽  
Adil Rasheed ◽  
Omer San
Keyword(s):  
Poisson Equation ◽  
Incompressible Flow ◽  
Data Exchange ◽  
Incompressible Flows ◽  
Stokes Equations ◽  
Time Integration ◽  
Data Driven ◽  
Integration Algorithm ◽  
Reduced Order ◽  
Advection Diffusion Equation

Numerical solution of the incompressible Navier–Stokes equations poses a significant computational challenge due to the solenoidal velocity field constraint. In most computational modeling frameworks, this divergence-free constraint requires the solution of a Poisson equation at every step of the underlying time integration algorithm, which constitutes the major component of the computational expense. In this study, we propose a hybrid analytics procedure combining a data-driven approach with a physics-based simulation technique to accelerate the computation of incompressible flows. In our approach, proper orthogonal basis functions are generated to be used in solving the Poisson equation in a reduced order space. Since the time integration of the advection–diffusion equation part of the physics-based model is computationally inexpensive in a typical incompressible flow solver, it is retained in the full order space to represent the dynamics more accurately. Encoder and decoder interface conditions are provided by incorporating the elliptic constraint along with the data exchange between the full order and reduced order spaces. We investigate the feasibility of the proposed method by solving the Taylor–Green vortex decaying problem, and it is found that a remarkable speed-up can be achieved while retaining a similar accuracy with respect to the full order model.

A Virtual Bearing Method for Optimal Bearing Placement of Flexible Rotor Systems

2017 ◽  
Author(s):  
Shibing Liu ◽  
Bingen Yang
Keyword(s):  
Optimization Problem ◽  
Optimization Method ◽  
Rotor System ◽  
Problem Solution ◽  
Flexible Rotor ◽  
Rotor Systems ◽  
Real Coded Genetic Algorithm ◽  
Minimum Number ◽  
Distributed Transfer Function ◽  
Flexible Rotor Systems

Flexible multistage rotor systems have a variety of engineering applications. Vibration optimization is important to the improvement of performance and reliability for this type of rotor systems. Filling a technical gap in the literature, this paper presents a virtual bearing method for optimal bearing placement that minimizes the vibration amplitude of a flexible rotor system with a minimum number of bearings. In the development, a distributed transfer function formulation is used to define the optimization problem. Solution of the optimization problem by a real-coded genetic algorithm yields the locations and dynamic coefficients of bearings, by which the prescribed operational requirements for the rotor system are satisfied. A numerical example shows that the proposed optimization method is efficient and accurate, and is useful in preliminary design of a new rotor system with the number of bearings unforeknown.

scholarly journals A systematic Study of Security Challenges and Infrastructures for Internet of Things

2018 ◽  
Vol 7 (4.36) ◽  
pp. 700
Author(s):  
N. Koteswara Rao ◽  
Gandharba Swain
Keyword(s):  
Internet Of Things ◽  
Secure Communication ◽  
Smart Cities ◽  
Security Requirements ◽  
The Internet ◽  
Security Challenges ◽  
Authentication And Authorization ◽  
New Applications ◽  
Privacy And Anonymity ◽  
The Internet Of Things

The proliferation of smart objects with capability of sensing, processing and communication has grown in recent years. In this scenario, the Internet of Things (IoT) connects these objects to the Internet and provides communication with users and devices. IoT enables a huge amount of new applications, with which academics and industries can benefit, such as smart cities, health care and automation. In this environment, compose of constrained devices, the widespread adoption of this paradigm depends of security requirements like secure communication between devices, privacy and anonymity of its users. This paper presents the main security challenges and solutions to provide authentication and authorization on the Internet of Things. 

scholarly journals Power Allocation for Reducing PAPR of Artificial-Noise-Aided Secure Communication System

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Tao Hong ◽  
Geng-xin Zhang
Keyword(s):  
Power Allocation ◽  
Nonconvex Optimization ◽  
Communication System ◽  
Secure Communication ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Average Power ◽  
Finite Alphabet ◽  
Artificial Noise ◽  
Communication Signals

The research of improving the secrecy capacity (SC) of wireless communication system using artificial noise (AN) is one of the classic models in the field of physical layer security communication. In this paper, we consider the peak-to-average power ratio (PAPR) problem in this AN-aided model. A power allocation algorithm for AN subspaces is proposed to solve the nonconvex optimization problem of PAPR. This algorithm utilizes a series of convex optimization problems to relax the nonconvex optimization problem in a convex way based on fractional programming, difference of convex (DC) functions programming, and nonconvex quadratic equality constraint relaxation. Furthermore, we also derive the SC of the proposed signal under the condition of the AN-aided model with a finite alphabet and the nonlinear high-power amplifiers (HPAs). Simulation results show that the proposed algorithm reduces the PAPR value of transmit signal to improve the efficiency of HPA compared with benchmark AN-aided secure communication signals in the multiple-input single-output (MISO) model.

scholarly journals A Television Recommender System Learning a User’s Time-Aware Watching Patterns Using Quadratic Programming

2018 ◽  
Vol 8 (8) ◽  
pp. 1323 ◽  
Author(s):  
Noo-ri Kim ◽  
Sungtak Oh ◽  
Jee-Hyong Lee
Keyword(s):  
Quadratic Programming ◽  
Optimization Problem ◽  
Programming Model ◽  
Multiple Time ◽  
Computational Power ◽  
Tv Program ◽  
Minimum Number ◽  
Preference Models ◽  
Available Information ◽  
Time Aware

In this paper, a novel television (TV) program recommendation method is proposed by merging multiple preferences. We use channels and genres of programs, which is available information in standalone TVs, as features for the recommendation. The proposed method performs multi-time contextual profiling and constructs multiple-time contextual preference matrices of channels and genres. Since multiple preference models are constructed with different time contexts, there can be conflicts among them. In order to effectively merge the preferences with the minimum number of conflicts, we develop a quadratic programming model. The optimization problem is formulated with a minimum number of constraints so that the optimization process is scalable and fast even in a standalone TV with low computational power. Experiments with a real-world dataset prove that the proposed method is more efficient and accurate than other TV recommendation methods. Our method improves recommendation performance by 5–50% compared to the baselines.

scholarly journals Extracting Value from Industrial Alarms and Events: A Data-Driven Approach Based on Exploratory Data Analysis

Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2772 ◽  
Author(s):  
Aguinaldo Bezerra ◽  
Ivanovitch Silva ◽  
Luiz Affonso Guedes ◽  
Diego Silva ◽  
Gustavo Leitão ◽  
...  
Keyword(s):  
Big Data ◽  
Data Analysis ◽  
Data Exchange ◽  
Data Science ◽  
Exploratory Data Analysis ◽  
Data Driven ◽  
Industrial Data ◽  
Industrial Big Data ◽  
Data Driven Approach ◽  
Exploratory Data

Alarm and event logs are an immense but latent source of knowledge commonly undervalued in industry. Though, the current massive data-exchange, high efficiency and strong competitiveness landscape, boosted by Industry 4.0 and IIoT (Industrial Internet of Things) paradigms, does not accommodate such a data misuse and demands more incisive approaches when analyzing industrial data. Advances in Data Science and Big Data (or more precisely, Industrial Big Data) have been enabling novel approaches in data analysis which can be great allies in extracting hitherto hidden information from plant operation data. Coping with that, this work proposes the use of Exploratory Data Analysis (EDA) as a promising data-driven approach to pave industrial alarm and event analysis. This approach proved to be fully able to increase industrial perception by extracting insights and valuable information from real-world industrial data without making prior assumptions.

scholarly journals Blockchain for the Internet of Vehicles: A Decentralized IoT Solution for Vehicles Communication Using Ethereum

Sensors ◽  
2020 ◽  
Vol 20 (14) ◽  
pp. 3928 ◽  
Author(s):  
Rateb Jabbar ◽  
Mohamed Kharbeche ◽  
Khalifa Al-Khalifa ◽  
Moez Krichen ◽  
Kamel Barkaoui
Keyword(s):  
Intelligent Transportation Systems ◽  
Secure Communication ◽  
Data Exchange ◽  
Smart Cities ◽  
Transportation Systems ◽  
Smart Devices ◽  
The Internet ◽  
Internet Of Vehicles ◽  
Computing Platform ◽  
Blockchain Technology

The concept of smart cities has become prominent in modern metropolises due to the emergence of embedded and connected smart devices, systems, and technologies. They have enabled the connection of every “thing” to the Internet. Therefore, in the upcoming era of the Internet of Things, the Internet of Vehicles (IoV) will play a crucial role in newly developed smart cities. The IoV has the potential to solve various traffic and road safety problems effectively in order to prevent fatal crashes. However, a particular challenge in the IoV, especially in Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications, is to ensure fast, secure transmission and accurate recording of the data. In order to overcome these challenges, this work is adapting Blockchain technology for real time application (RTA) to solve Vehicle-to-Everything (V2X) communications problems. Therefore, the main novelty of this paper is to develop a Blockchain-based IoT system in order to establish secure communication and create an entirely decentralized cloud computing platform. Moreover, the authors qualitatively tested the performance and resilience of the proposed system against common security attacks. Computational tests showed that the proposed solution solved the main challenges of Vehicle-to-X (V2X) communications such as security, centralization, and lack of privacy. In addition, it guaranteed an easy data exchange between different actors of intelligent transportation systems.

Sign in / Sign up

Export Citation Format

Share Document