Handshake

About: Handshake is a research topic. Over the lifetime, 1105 publications have been published within this topic receiving 15166 citations. The topic is also known as: 🤝.

Method and device for checking WiFi password safety, computer device and storage medium

Abstract: The present invention relates to a password technology, and discloses a method and a device for checking WiFi password safety, a computer device and a storage medium. The method comprises the steps of: in an Mac OS platform, transferring a wireless network safety tool in a preset frequency to continuously poll real-time communication data of an assigned WiFi, wherein, the wireless network safety tool is transferred each time, data is captured from the real-time communication data of the assigned WiFi once; determining whether the data captured from the real-time communication data of the assigned WiFi are a handshake data packet carrying keywords or not; if yes, performing decoding analysis of the handshake data packet through the decoding tool of the Mac OS platform to obtain the decodingdata of the handshake data packet; performing cracking of the assigned WiFi according to the decoding data; and if the cracking is successful, feeding back that the WiFi passwords of the assigned WiFi are not safe. The method and the device for checking WiFi password safety, the computer device and the storage medium can employ the data packet in a continuous polling mode to perform password cracking.

Optimal Probing of Wireless Error Prone Channels for QoS Enhancements in IEEE 802.16 Wireless MAN

Abstract: Ensuring reliable and efficient packet transmission in the error prone shared radio channel is one of the ways to support QoS for integrated services in IEEE 802.16 wireless MAN network. To minimize the wasted bandwidth in transmitting corrupted packets, it is critical for the subscriber station and base station to know the channel state at and schedule the next transmission. A periodical handshake is proposed to probe the channel state for proper transmission in this paper. We built a mathematical model to determine an the optimal handshake interval. In this model, we consider the bandwidth used for transmission handshake overhead and retransmission of corrupted packets as an associated cost. Using the theory of renewal process and dynamic programming method, we obtain an optimal handshake policy under which the average cost per unit time is minimized. The numerical results are presented to demonstrate the effectiveness of our approach

Solving the Twin Yard Crane Scheduling Problem in Automated Container Terminals

Abstract: This study focuses on scheduling twin Automated Stacking Cranes (ASCs) that collaborate to serve storage and retrieval jobs from opposite ends of a block. Since the ASCs cannot cross each other, there is a handshake bay that serves as a temporary storage location so that one crane can leave a job for the other to complete. A proposed mixed integer programming model that aims to minimize the time required to finish all jobs is formulated and solved. Four modes of crane interference that may occur at the handshake bay are taken into consideration. This paper is the first to investigate the effect of different handshake bay locations on the objective value when a task is split into jobs, and results show that the handshake bay location has no effect on the objective value if the task is split into jobs of equal number of size.

Aspects of Cyber Security in Autonomous and Connected Vehicles

Abstract: An automobile is a computer on wheels after the integration of electronics. This handshake of electronics and mechanical systems makes a vehicle smart, and comfortable; driver assistance for achieving this involves data exchange and surroundings sensing. Devices such as sensors, telematics, protocols, etc., are responsible for data exchange and data sensing. This process contains some loopholes that are the preliminary sources for the attacker to attack the vulnerable devices to control the vehicle. This article provides a review of possible attacks and defenses on autonomous and connected vehicles. The attacker’s area of autonomous and connected vehicles is classified into three categories that are safety system attacks, connectivity attacks, and diagnostics attacks, and provided all possible defenses for those attacks. In addition, we provided an analysis of the domain to understand the scenarios in this domain, recommendations, and future scope in this area for further work.

Positioning a Handshake Bay for Twin Stacking Cranes in an Automated Container Terminal Yard Block

Abstract: At automated container terminals (ACTs), twin automated stacking cranes (ASCs) can carry out the tasks—store and retrieve containers simultaneously in a yard block using a handshake bay, where a primary ASC stacks the container at the handshake bay and the other crane carries it to the destination bay. Although the handshake bay increases the degree of crane utilization, the ASCs will interfere with each other at the bay, decreasing the stacking efficiency. This study formulates a mixed-integer linear program (MILP) to position the handshake bay and simultaneously schedule the twin ASCs to minimize the tasks’ makespan. The proposed formulation considers the safe time interval to avoid crane collisions during adjacent crane movements. To solve the model, we developed a random-key genetic algorithm with a priority-based decoding scheme to optimize the task sequences and tasks assigned to the cranes. The priority-based GA can always generate feasible solutions by ranking the container-handling tasks. Numerical experiments prove that the safe temporal interval affects the makespan and the handshake bay’s position. An optimal handshake bay reduces 35% of the makespan compared with a nonoptimal bay, and the proposed algorithm is competitive compared with the on-the-shelf MILP solver and can solve medium- and large-scale instances in short computing time with gaps lower than 5% compared with ideal solutions.