Handshake Mechanism Research Articles

Countering DDoS threats: leveraging ensemble methods for detection and mitigation

Cloud computing is the modern concept of distributing numerous services through the Internet, such as web applications, databases, and programmers that operate on several servers. As Cloud computing technologies evolve, increasing susceptibility to attack may result from service outages during data storage and transmission. The most common sort of assault against Cloud settings is distributed denial-of-service (DDoS). Several approaches for detecting and mitigating these attacks have been offered, however they are ineffective. In this research, we propose a method for detecting and mitigating DDoS attacks in their early phases, considering top-layer advances at the application layer and the TCP handshake mechanism. This study employs a variety of ensemble-based machine learning approaches to classify incoming data as legitimate or malicious to respond to DDoS attacks at the application layer. Furthermore, the double TCP connection concept is used to prevent DDoS. Experiments show that the stacked voting system detects DDOS attacks with the best F-score of 99.9%.

Handshake mechanism selection in MANETs with directional antennas: A new evaluation view

AbstractHandshake mechanism plays a significant role in neighbour discovery (ND) algorithms in mobile ad hoc networks (MANETs) with directional antennas. In this letter, aiming at 1) the MANET scenario of uniformly‐distributed nodes and 2) the random beam‐scanning manner, the upper and lower bounds of ND time of the network are theoretically derived for both 1‐way and 2‐way. This analysis indicates that the ND time is approximately linear growth with NDT‐Mutual, where the NDT‐Mutual is defined as the expected time for a node to complete mutual discovery with its neighbours. Then the theoretical expression for NDT‐mutual is derived, which is a function of the number of nodes. The asymptotic analysis reveals that when the number of nodes is very small, the NDT‐mutual of 2‐way is lower than 1‐way, while 1‐way performs better when the number of nodes approaches infinity. The number of nodes when 1‐way and 2‐way perform as well is further presented, which can be utilized to guide the selection of handshake mechanism in MANETs with directional antennas. Simulation results demonstrate the accuracy of our modelling for ND and the effectiveness of using NDT‐mutual to approximate who performs better with 1‐way and 2‐way.

MR-SFAMA-Q: A MAC Protocol based on Q-Learning for Underwater Acoustic Sensor Networks

<p>In recent years, with the rapid development of science and technology, many new technologies have made people’s exploration of the ocean deeper and deeper, and due to the requirements of national defense and marine development, the underwater acoustic sensor network (UASN) has been paid more and more attention. Nevertheless, the underwater acoustic channel has the properties of considerable propagation delay, limited bandwidth, and unstable network topology. In order to improve the performance of the medium access control (MAC) protocol in UASN, we propose a new MAC protocol based on the Slotted-FAMA of Multiple Reception (MR-SFAMA) protocol. The protocol uses the Q-Learning algorithm to optimize the multi-receiver handshake mechanism. The current state is judged according to the received node request, and the Q-table is established. Through the multi-round interaction between the node and the environment, the Q-table is continuously updated to obtain the optimal strategy and determine the optimal data transmission scheduling scheme. The reward function is set according to the total back-off time and frame error rate, which can reduce the packet loss rate during network data transmission while reducing the delay. In addition, the matching asynchronous operation and uniform random back-off algorithm are used to solve the problem of long channel idle time and low channel utilization. This new protocol can be well applied to unstable network topology. The simulation results show that the protocol performs better than Slotted-FAMA and MR-SFAMA regarding delay and normalized throughput.</p> <p> </p>

Reliable design of communication link for power emergency vehicle mobile station based on Beidou satellite

In order to establish a reliable power emergency communication network and speed up the efficiency of power rescue, a vehicle-mounted reliable communication link based on Beidou short message protocol is designed. Aiming at the unreliability of Beidou short message communication and the limitation of communication capacity, the enhanced data handshake mechanism is adopted to enhance the reliability of data transmission, and the multi-card cooperative transmission mechanism is adopted to improve the efficiency of data transmission. The example results show that the transmission success rate of the proposed reliable communication link is significantly higher than that of the traditional method, which can improve the reliability of mobile station data transmission and provide communication guarantee for power recovery.

Implementasi KRACK dan KRACK Detector terhadap Wpa_Supplicant pada Perangkat Android dan Linux Ubuntu

Nowadays WiFi services is available in many public places to accesses the information. Most of WiFi services use the Wifi Protected Access 2 (WPA2) security. This protocol uses a 4-way handshake mechanism for authentication process, but there is a weakness by using the 4-way handshake mechanism that possible to re-install the key (KRACK). This weakness can be used by attackers to hold up communications so that attackers can enter the network. This study, KRACK analysis was carried out on wpa_supplicant Android and Linux Ubuntu which connected to WiFi and the WPA2 security protocol to know the weaknesses. The analysis is doing on the user's device by connecting to the Rogue AP generated by the Vanhoef script. This dangerous line is compared to normal line. Analyzing attacks on 4-way handshakes, this research create implementation of KRACK Detector and the result of detection will be used to get the KRACK characteristics. The information getting from the result can prevent the disadvantages which coming by attacks. The validation of the research was carried out by using Wireshark to make sure that the third massage sends which show threat of attack.

Public-Key Reinforced Blockchain Platform for Fog-IoT Network System Administration

The number of embedded devices that connect to a wireless network has been growing for the past decade. This interaction creates a network of Internet-of-Things (IoT) devices where data travel continuously. With the increase of devices and the need for the network to extend via fog computing, we have fog-based IoT networks. However, with more endpoints introduced to it, the network becomes open to malicious attackers. This work attempts to protect fog-based IoT networks by creating a platform that secures the endpoints through public-key encryption. The servers are allowed to mask the data packets shared within the network. To be able to track all of the encryption processes, we incorporated the use of permissioned blockchains. This technology completes the security layer by providing an immutable and automated data structure to function as a hyper ledger for the network. Each data transaction incorporates a handshake mechanism with the use of a public-key pair. This design guarantees that only devices that have proper access through the keys can use the network. Hence, management is made convenient and secure. The implementation of this platform is through a wireless server–client architecture to simulate the data transactions between devices. The conducted qualitative tests provide an in-depth feasibility investigation on the network’s levels of security. The results show the validity of the design as a means of fortifying the network against endpoint attacks.

A Handshake-Based Low Delay MAC Protocol in Hybrid Topology for Urban Lake Monitoring

Underwater acoustic sensor networks (UASNs), which adopt acoustic communication, have been widely used underwater, such as in oceans and rivers, for monitoring applications. However, the UASNs designed for urban lake monitoring are facing challenges and are seldom regarded. Based on the analysis of the features of the urban lakes and the monitoring requirements, a UASN system is designed in this article. The node deployment strategy is discussed to balance the node density and transmission bandwidth. Then a hybrid topology is proposed to meet the monitoring requirements, in which the nodes on the water surface construct a 2-D ring topology, and the nodes underwater construct a 3-D grid structure. Based on this topology, a media access control (MAC) protocol-improved handshake-based low delay (i-HALO) is designed which improves the existing handshaking mechanism with a dynamic adaptive backoff algorithm to avoid unnecessary back off. As the result, the high delay problem is addressed and the “one handshake, multiple transmission” is realized. The channel access delay is analyzed theoretically and the formula of waiting time for a frame before sending is given. The performance of throughput and transmission delay under different node densities and frame lengths are simulated. The results indicate that a node having about 13 neighbors will have the best performance on throughput, and when the frame length is longer than 100 bytes, the throughput and delay will have fluctuation. In comparison with existing protocols, i-HALO has a better performance on throughput, delay, frame reception rate (FRR), and fairness.

A Survey on MAC-Based Physical Layer Security over Wireless Sensor Network

Physical layer security for wireless sensor networks (WSNs) is a laborious and highly critical issue in the world. Wireless sensor networks have great importance in civil and military fields or applications. Security of data/information through wireless medium remains a challenge. The data that we transmit wirelessly has increased the speed of transmission rate. In physical layer security, the data transfer between source and destination is not confidential, and thus the user has privacy issues, which is why improving the security of wireless sensor networks is a prime concern. The loss of physical security causes a great threat to a network. We have various techniques to resolve these issues, such as interference, noise, fading in the communications, etc. In this paper we have surveyed the different parameters of a security design model to highlight the vulnerabilities. Further we have discussed the various attacks on different layers of the TCP/IP model along with their mitigation techniques. We also elaborated on the applications of WSNs in healthcare, military information integration, oil and gas. Finally, we have proposed a solution to enhance the security of WSNs by adopting the alpha method and handshake mechanism with encryption and decryption.

A Short Signal Backoff MAC Protocol Based on Game Theory for Underwater Sensor Networks

Underwater wireless sensor networks(UWSNs) have a long propagation delay; In order to avoid collision, the handshake mechanism is adopted in the design of media access control protocol. However, with the increase of propagation delay, The time of waiting for the feedback signal will increase continuously, resulting in the delay that too many channels are occupied by reservation. When the delay starts to be larger than the transmission time of the packet, the handshake protocol will lose its advantage in performance completely. However, the protocol that does not use the handshake mechanism has the loopholes of the confirmation mechanism or the excessive backoff after the number of nodes’s increasing, which leads to the increase of conflicts. Therefore, this paper proposes a MAC protocol based on short signal game backoff. Based on counting the number of short signal messages in the reservation stage, The protocol adopts game theory to ensure that the sending node can send without conflict after winning the reservation channel competition with the best probability without using handshake mechanism. In addition, the remaining nodes are allowed to choose the backoff time in a more reasonable way, rather than the random backoff which reduces the efficiency infinitely. The simulation results show that the protocol can greatly improve the network performance.

DESIGNING A SECURE NETWORK SOLUTION AGAINST DHCP ATTACKS

DHCP is an important aspect in small and large networks, since it facilitates the IP configuration of computers. However, DHCP is vulnerable to different attacks; therefore, the essential objective of this paper is to propose solutions against DHCP attacks. The paper gives an explanation about how DHCP works and understand the handshake mechanism and give a brief summary about DHCP attack, how they occur and how they affect the security of the enterprise since a leakage of sensitive Information could happen, which threatens the enterprise's security or a denial of service that immobilizes the network. Three effective countermeasures are looked up and tested against DHCP attacks, and each one successfully prevented the attack.

Collective Strategies With a Master-Slave Mechanism Dominate in Spatial-Iterated Prisoner's Dilemma

How cooperation emerges and persists in a population of selfish agents is a fundamental question in evolutionary game theory. The research shows that collective strategies with master-slave mechanism (CSMSM) defeat tit-for-tat and other well-known strategies in spatial iterated prisoner's dilemma. A CSMSM identifies kin members by means of a handshaking mechanism. If the opponent is identified as non-kin, a CSMSM will always defect. Once two CSMSMs meet, they play master and slave roles. A mater defects and a slave cooperates in order to maximize the master's payoff. CSMSM outperforms non-collective strategies in spatial IPD even if there is only a small cluster of CSMSMs in the population. The existence and performance of CSMSM in spatial iterated prisoner's dilemma suggests that cooperation first appears and persists in a group of collective agents.

On the Detection of Low-Rate Denial of Service Attacks at Transport and Application Layers

Distributed denial of service (DDoS) attacks aim to deplete the network bandwidth and computing resources of targeted victims. Low-rate DDoS attacks exploit protocol features such as the transmission control protocol (TCP) three-way handshake mechanism for connection establishment and the TCP congestion-control induced backoffs to attack at a much lower rate and still effectively bring down the targeted network and computer systems. Most of the statistical and machine/deep learning-based detection methods proposed in the literature require keeping track of packets by flows and have high processing overheads for feature extraction. This paper presents a novel two-stage model that uses Long Short-Term Memory (LSTM) and Random Forest (RF) to detect the presence of attack flows in a group of flows. This model has a very low data processing overhead; it uses only two features and does not require keeping track of packets by flows, making it suitable for continuous monitoring of network traffic and on-the-fly detection. The paper also presents an LSTM Autoencoder to detect individual attack flows with high detection accuracy using only two features. Additionally, the paper presents an analysis of a support vector machine (SVM) model that detects attack flows in slices of network traffic collected for short durations. The low-rate attack dataset used in this study is made available to the research community through GitHub.

Prioritized multi-channel MAC protocol in ad hoc networks using a TDMA/CSMA approach

Multi-channel ad hoc networks are promising technology to alleviate the spectrum scarcity in dense networks. The main challenge for channel access in distributed multi-channel ad hoc networks is channel synchronization and competition with neither common control channel nor dedicated control transceiver. In this paper, a Tight Synchronized MAC protocol with distributed synchronization and competition process without any dedicated control channel is proposed. The protocol uses a simple handshaking mechanism to create a channel table for each node, which contains its neighbors and channels’ status. By this, any node knows the priority of its channels and also the priority of neighbors’ channels. By assigning priorities, a sender node starts synchronization. If sender and receiver nodes have a common channel, the proposed method finds it directly or indirectly using the common neighbor mechanism. The other feature of the proposed scheme is using a fair preemptive data transmission phase, which reduces the number of switchings along data transmission. The fair preemptive mechanism is achieved by an analytical solution to estimate the number of competing nodes and thus, estimates the number of assigned data slots. Simulation results show the performance improvements in terms of synchronization delay and packet delivery ratio over HMMAC and MSRMMAC protocols.

Data Flow Obfuscation: A New Paradigm for Obfuscating Circuits

In this article, unlike almost all state-of-the-art obfuscation solutions that focus on functional/logic obfuscation, we introduce a new paradigm, called data flow obfuscation, which exploits the essence of asynchronicity. In data flow obfuscation, by benefiting from the handshaking mechanism of asynchronous circuits, the system's FFs/latches will operate out of sync. Hence, the adversary has no sufficient knowledge to apply unrolling/BMC. Also, due to the inherited asynchronicity, the exact time of writing/capturing data into/from the scan chain becomes hidden. Hence, the SAT attack cannot be applied even while scan chain access is open. Moreover, our new proposed paradigm creates stateful/oscillating combinational cycles into the design which extensively boosts the difficulty of modeling this technique. We also demonstrate how data flow obfuscation could easily be integrated with any circuit at low overhead while there is no limitation such as compromising test flow.

Tcp Syn Flood Attack Detection and Prevention System using Adaptive Thresholding Method

Transmission Control Protocol Synchronized (SYN) flooding contributes to a major part of the Denial of service attacks (Dos) because of the easy to exploit nature of the TCP three way handshake mechanism. Attackers use this weakness to overflow the TCP queue of the server and make its re-sources consumed resulting it to be unavailable for the requests of legitimate users. So we are in need of a quick and precise defence mechanism to detect the TCP-SYN Flood attack. The main objective of the paper is to propose a detection and prevention mechanism of the TCP-SYN flood attack using adaptive thresholding. Adaptive threshold algorithm (ATA) is used to calculate dynamic threshold .Thus this algorithm helps to overcome the limitations of static thresholding like high false positive ratio and also alert users after violation of the threshold calculated by adaptive thresholding algorithm. The result of the suggested mechanism is very effective in the detection and prevention of the TCP SYN flood attack using adaptive thresholding algorithm.

Using Overhearing and Rateless Coding in Disseminating Various Messages in Vehicular AdHoc Networks

Vehicular Ad hoc Networks (VANETs) are emerging technologies with the primary purpose of establishing Vehicular communications. Available protocols for data dissemination in VANETs are faced with issues like discontinuous connections, uncertainty about receiving messages, collisions, and latency. In this paper, a new method is presented for the dissemination of advertising and infotainment messages. The proposed method has used store carry and forward (SCF), rateless coding, and a new handshake mechanism to solve discontinuous connections, uncertainty about receiving messages, and collision problems, respectively. In this paper, changing the Road Side Unit (RSU) message over time and its impact on the network is proposed as a new step in evaluating data dissemination methods. Our results showed that if changing the RSU message happened very rapidly, the network performance will almost be eliminated; to address this problem and due to the advertising nature of messages, the use of overhearing has been suggested. To the best of our knowledge, this is the first time that message overhearing has been used in VANET. Extensive and accurate simulations results show that the proposed method for 2, 3, 5, and 10 messages: (i) reduces the overhead of handshake on average 70% 63%, 48%, and 3%, (ii) increases the number of delivered packets on average 5%, 22%, 75%, and 84%, and (iii) increases the range of data dissemination on average 47%, 187%, 661%, and 2962%, respectively. With the mentioned improvements, the proposed method can also significantly reduce the latency of disseminating messages between vehicles.

Big Data analysis of demand side management for Industrial IOT applications

Companies today demand even more high quality services and infrastructure in the field ofIndustrial Internet IOT. There are several problems facing smart urbanization. Of special concern are secured energy demand side management. The IIoT makes ransomware, cyber attacks and other security threats open to industrial systems. IIoT will provide meaningful solutions to these problems through the amalgamation of big data analytics. That first author recommends a safe, reliable Demand Side Managementengine for a smart cooperative client using IIoT based Big Data Analysis. A highly distributed framework to the theoretical engine for optimizing DSM across a Home Area Network. A payload authentication framework based on a lightweight handshake mechanism is used to improve the protection of this engine. In order to make users to control different server native resources energy efficiently, our theoretical method uses the portable utilizes of the Constrained Application Protocol. Moreover, data streams with parallel MapReduce processing are managed using big data analysis. In addition, we use Apache Spark with Apache Hadoop to check the theoretical engine to test our input transform match on stable datafile. The test results indicate that the architecture outlined provides useful insights into the intelligent social communities of the IIoT.

SFM-MAC: Multichannel MAC Protocol for Underwater Sensor Networks Based on Underwater Passive Localization Mechanisms

Yang, Q.; Dong, W.; Xu, Z., and Huang, X., 2020. SFM-MAC: Multichannel MAC protocol for underwater sensor networks based on underwater passive localization mechanisms. Journal of Coastal Research, 36(6), 1332–1342. Coconut Creek (Florida), ISSN 0749-0208.With the continuous development of ocean research in recent years, underwater acoustic sensor networks, as the extension of terrestrial wireless sensor networks (WSNs), play an increasingly important role in ocean and coastal research. To solve the problem of spatial unfairness caused by spatiotemporal uncertainty of underwater acoustic signal propagation in underwater WSNs and improve the throughput of underwater networks, this paper proposes a slotted-floor multichannel medium access control (SFM-MAC) protocol based on a single transceiver. SFM-MAC uses an underwater passive localization algorithm to obtain location information and then transforms spatiotemporal information to avoid the synchronization of the whole network to reduce the spatiotemporal uncertainty of underwater networks; further, it uses request to send (RT)/channel announcement/channel listening/clear to send (CTS) handshaking mechanism to avoid multichannel hidden terminal problems and achieve fair access. In addition, the paper uses the Markov chain to construct the reservation model of control channels, and theoretically analyzes and calculates the theoretical throughput of the multichannel MAC protocol under the condition of reserved collision. Simulation experiments show that the network fairness index of SFM-MAC is 15% higher than that of traditional RTS/ CTS protocols. The effective network throughput of SFM-MAC in different business scenarios is 60–70% and 12–15% higher than the single-channel underwater MAC protocol SF acquisition multiple access and the multichannel underwater MAC protocol, respectively.

Performance Analysis of DCF- Two Way Handshake vs RTS/CTS During Train-Trackside Communication in CBTC based on WLAN802.11b

Background:Wireless Local Area Network (WLAN) is used primarily in CBTC because of easy availability of commercial WLAN equipment. In present scenario, WLAN Medium Access Control (MAC) protocol is a well-known protocol which is used to satisfy real-time traffic and delay- sensitive applications. The bidirectional train-trackside communication is the fundamental key of train control in CBTC.Methods:DCF describes two basic techniques used for packet transmission: First technique is a Two Way Handshake (TWH) mechanism and another is Four Way Handshake (FWH) mechanisms. RTS/CTS FWH protocol specified by IEEE802.11b is introduced to rectify the Hidden Node Problem (HNP) encounters in TWH protocol. That is why the TWH mechanism of DCF technique suffers from higher average packet delay time when this protocol is applied to CBTC. DCF- Four Way Handshake (FWH), Request To Send (RTS) and Clear To Send (CTS) delay model is proposed to develop Communication Based Train Control (CBTC) system.Results:FWH is applied in CBTC to overcome the packet delay and throughput limitations of Two Way Handshake (TWH) mechanism of distributed coordination function (DCF) based technique. An experiment is designed to simulate and compare the performance of RTS/CTS delay model against TWH mechanism of DCF.Conclusion:It was found that the Average packet delay is slightly higher and throughput is lesser in RTS/CTS in comparison to TWH method. By comparing the performance of these two medium access mechanism in CBTC it was found that for multiple retransmissions with various data rates the RTS/CTS model had better packet delay time than TWH.

Smart Sensing-Enabled Decision Support System for Water Scheduling in Orange Orchard

The scarcity of water resources throughout the world demands its optimum utilization in various sectors. Smart Sensing-enabled irrigation management systems are the ideal solutions to ensure the optimum utilization of water resources in the agriculture sector. This paper presents a wireless sensor network-enabled Decision Support System (DSS) for developing a need-based irrigation schedule for the orange orchard. For efficient monitoring of various in-field parameters, our proposed approach uses the latest smart sensing technology such as soil moisture, leaf-wetness, temperature and humidity. The proposed smart sensing-enabled test-bed was deployed in the orange orchard of our institute for approximately one year and successfully adjusted its irrigation schedule according to the needs and demands of the plants. Moreover, a modified Longest Common SubSequence (LCSS) mechanism is integrated with the proposed DSS for distinguishing multi-valued noise from the abrupt changing scenarios. To resolve the concurrent communication problem of two or more wasp-mote sensor boards with a common receiver, an enhanced RTS/CTS handshake mechanism is presented. Our proposed DSS compares the most recently refined data with pre-defined threshold values for efficient water management in the orchard. Irrigation activity is scheduled if water deficit criterion is met and the farmer is informed accordingly. Both the experimental and simulation results show that the proposed scheme performs better in comparison to the existing schemes.