Person Identification through Harvesting Kinetic Energy

Energy-based devices made this possible to recognize the need for batteryless wearables. The batteryless wearable notion created an opportunity for continuous and ubiquitous human identification. Traditionally, securing device passwords, PINs, and fingerprints based on the accelerometer to sample the acceleration traces for identification, but the accelerometer's energy consumption has been a critical issue for the existing ubiquitous self-enabled devices. In this paper, a novel method harvesting kinetic energy for identification improves energy efficiency and reduces energy demand to provide the identification. The idea of utilizing harvested power for personal identification is actuated by the phenomena that people walk distinctly and generate different kinetic energy levels leaving their signs with a harvested power signal. The statistical evaluation of experimental results proves that power traces contain sufficient information for person identification. The experimental analysis is conducted on 85 persons walking data for kinetic power signal-based person identification. We select five different classifiers that provide exemplary performance for identifying an individual for their generated power traces, namely NaiveBayes, OneR, and Meta Bagging. The experimental outcomes demonstrate the classifier's accuracy of 90%, 97%, and 98%, respectively. The Dataset used is publicly available for the gait acceleration series

Gentle Slow Start to Alleviate TCP Incast in Data Center Networks

Modern data center networks typically adopt symmetric topologies, such as leaf-spine and fat-tree. When a large number of transmission control protocol (TCP) flows in data center networks send data to the same receiver, the congestion collapse, called TCP Incast, frequently happens because of the huge packet losses and Time-Out. To address the TCP Incast issue, we firstly demonstrate that adjusting the increasing speed of the congestion window during the slow start phase is crucially important. Then we propose the Gentle Slow Start (GSS) algorithm, which adjusts the congestion window according to real-time congestion state in a gentle manner and smoothly switches from slow start to congestion avoidance phase. Furthermore, we present the implementation and design of Gentle Slow Start and also integrate it into the state-of-the-art data center transport protocols. The test results show that GSS effectively decreases the Incast probability and increases the network goodput by average 8x

An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET

Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”

Vehicular Ad Hoc Network (VANET) Connectivity Analysis of a Highway Toll Plaza

The aim of this paper was to study issues of network connectivity in vehicular ad hoc networks (VANETs) to avoid traffic congestion at a toll plaza. An analytical model was developed for highway scenarios where the traffic congestion could have the vehicles reduce their speed instead of blocking the flow of traffic. In this model, nearby vehicles must be informed when traffic congestion occurs before reaching the toll plaza so they can reduce their speed in order to avoid traffic congestion. Once they have crossed the toll plaza they can travel on at their normal speed. The road was divided into two or three sub-segments to help analyze the performance of connectivity. The proposed analytical model considered various parameters that might disturb the connectivity probability, including traveling speed, communication range of vehicles, vehicle arrival rate, and road length. The simulation results matched those of the analytical model, which showed the analytical model developed in this paper is effective

Efficient Association Rules Hiding Using Genetic Algorithms

In today’s world, millions of transactions are connected to online businesses, and the main challenging task is ensuring the privacy of sensitive information. Sensitive association rules hiding (SARH) is an important goal of privacy protection algorithms. Various approaches and algorithms have been developed for sensitive association rules hiding, differentiated according to their hiding performance through utility preservation, prevention of ghost rules, and computational complexity. A meta-heuristic algorithm is a good candidate to solve the problem of SARH due to its selective and parallel search behavior, avoiding local minima capability. This paper proposes simple genetic encoding for SARH. The proposed algorithm formulates an objective function that estimates the effect on nonsensitive rules and offers recursive computation to reduce them. Three benchmark datasets were used for evaluation. The results show an improvement of 81% in execution time, 23% in utility, and 5% in accuracy

Acceptance of IoT learning among university students at Pakistan

The Internet of Things abbreviated as an IoT is considered the most recent innovative and fastest-developing field that is to be applied in all aspects of life, in particular higher education. It has sparked interest as well as challenges among academics; the current research will concentrate on acceptance and adoption of IoT in the higher educational institutions of Pakistan. IoT supports educators in environment of learning and can have an impact on how we interact, connect, and work. In this study, we will look at two different aspects. The first one is how to teach students, and secondly how IoT can be used in educational institutions to enhance learning. This study looks at the factors that affect acceptance of IoT and use in an academic setting in Pakistan's higher education institutions. The current research establishes foundation for a comprehensive framework based on trusted technology and social psychology models, such as the Use of Technology 2 and Unified Theory of Acceptance (UTAUT2). The method proposed in this study is network analysis method to observe users' actions in relation to several IoT applications in higher education. An in-depth analysis and consideration of key deliverables which have a major impact on the Internet of Things (IoT) adoption in Pakistani educational institutions of higher level, revealed that only a few applications are heavily used in comparison to all other applications. This research lays the groundwork for developed countries to grow adoption and IoT technologies use in higher education, which will support both students and faculty

Novel Multi-Level Dynamic Traffic Load-Balancing Protocol for Data Center

Typically, the production data centers function with various risk factors, such as for instance the network dynamicity, topological asymmetry, and switch failures. Hence, the load-balancing schemes should consider the sensing accurate path circumstances as well as the reduction of failures. However, under dynamic traffic, current load-balancing schemes use the fixed parameter setting, resulting in suboptimal performances. Therefore, we propose a multi-level dynamic traffic load-balancing (MDTLB) protocol, which uses an adaptive approach of parameter setting. The simulation results show that the MDTLB outperforms the state-of-the-art schemes in terms of both the flow completion time and throughput in typical data center applications