6 June 2018 in IEEE Access
Internet of Things (IoT) comprises of large number of smart devices that can exchange sensed data by availing online services. Smart devices can directly interact with the human beings for sensing the healthcare parameters and transmitting to a central repository. During the data exchange, it is mandatory to secure the messages between sender and receiver to handle the malicious human based attacks. For providing secure communication, a number of signature-based schemes are explored in literature but smart devices need more lightweight operations by ensuring desired security strengths. The main problem during signature based approaches is the computational overhead due to large real numbers required for signature and verification processes. This paper presents a light weight shortened complex digital signature algorithm for providing secure communication between smart devices in human centered IoT. We have used less extensive operations to achieve signature and verification processes like human beings do signatures on legal documents and verify later as per witness. We have also presented a multi-option parameter selection to use a signature-verification pair of expressions at particular index by adopting the common practice of human beings for using different signatures as per document criticality level. It enhances the security strength to guard against traffic analysis attacks. We have developed an experimental setup where a number of cell phones and smart devices are considered for secure communication using existing and proposed digital signature schemes. Results demonstrate the supremacy of our scheme as compared to preliminaries.
10 June 2019 in IEEE Access
With the rapid growth in a huge number of devices connecting online, Internet of Things (IoT) is rapidly growing and getting interest of researchers. IoT enabled Wireless Sensor Network (WSN) plays a significant role to collect sensing data and transmit to central repositories. Moreover, multicasting ensures efficient group communication for disseminating same query or command to all smart devices to perform mobile service computing. It is applicable in smart home, healthcare, smart cities, and smart industries for monitoring and control. To secure such sensitive information exchange, we have considered secure group communication scenario where logical trees are maintained for each group. The main problem is unnecessary rekeying when a smart device frequently joining or leaving the network. It causes computation, communication and energy overheads. To overcome the excessive rekeying problem, we have presented a Logical Tree based Secure Mobility Management Scheme (LT-SMM) using mobile service computing in IoT. It includes the group deployment phase where smart devices securely setup a group by registering with group heads for future secure information exchange. We have presented group deployment, mobile node joining and mobile node migration protocols. Moreover, we have used chaotic map based one-way hash functions to ensure message integrity. To validate our work, extensive simulations are performed using NS 2.35. TCL code is used to configure smart devices, deploy logical tree, messaging. C language is used for algorithm implementation and messaging backend coding. Results verify the supremacy of our scheme as compared to existing tree based schemes in terms of computation, communication and energy consumption.
27 February 2024 in Heliyon
The Internet of Things (IoT) is a network of intelligent devices especially in healthcare-based systems. Internet of Medical Things (IoMT) uses wearable sensors to collect data and transmit to central repositories. The security and privacy of healthcare data is a challenging task. The aim of the study is to provide a secure data sharing mechanism. The existing studies provide secure data sharing schemes but still have limitations in terms of hiding the patient identify in the messages exchanged to upload the data on central repositories. This paper presents a Secure Aggregated Data Collection and Transmission (SADCT) that provides anonymity for the identities of patient's mobile device and the intermediate fog nodes. Our system involves an authenticated server for node registration and authentication by saving security credentials. The proposed scheme presents the novel data aggregation algorithm at the mobile device, and the data extraction algorithm at the fog node. The work is validated through extensive simulations in NS along with a security analysis. Results prove the supremacy of SADCT in terms of energy consumption, storage, communication, and computational costs.
24 May 2024 in IEEE Transactions on Automation Science and Engineering
In this paper, a real-time obstacle avoidance approach and a trajectory planning method are proposed to avoid collisions to move an object jointly by a human and an omnidirectional mobile robot. Different from many existing approaches of local trajectory planning, the proposed method called Multiscale Local Perception Region Approach (MLPRA) is specially designed for obstacle avoidance of omnidirectional wheeled robots with direction constraints of human guidance, which can respond fast to dynamic obstacles and guarantee the safety of the robot. To solve the problem that the position of the human hand is difficult to obtain by visual sensing due to visual occlusion, a simple mechanism that can indirectly measure the change of the position of the human hand is designed, and further a method to follow the human’s intention based on this mechanism is proposed. Finally, the simulation environment on the Gazebo simulation platform is built to verify the feasibility and effectiveness of our proposed methods. Experimental results show that after embedding proposed methods into the omnidirectional mobile robot, obstacles can be effectively avoided in co-transporting processes. Note to Practitioners —The motivation of this paper is focusing on obstacle avoidance of omnidirectional mobile robots in human-robot co-transporting, application scenarios concentrated in factories and logistics warehouses, such as the mobile robot collaborates with a human (a robot teleoperated by human) transporting a table. The existing obstacle avoidance algorithm can be regarded as a local trajectory planning problem, which cannot directly adapt to co-transporting tasks in real-time. Considering the specific task if the robot cannot cooperate with human in real-time, the carried object will fall. In this paper, a local trajectory planning method is proposed, regarding the obstacle generating virtual repulsive force, regarding the human action on the robot as the virtual gravitational force, and the mobile robot under two virtual forces not only follows human action in co-transporting, but also avoids obstacles. The method shows quick calculation and good real-time performance. The method proposed is evaluated by co-transporting in Gazebo and experiments based on omnidirectional mobile robots, and ensured that the object being carried does not fall and robot can avoid collisions in the unknown environments without positioning systems.
10 September 2024 in IEEE Transactions on Neural Networks and Learning Systems
This article studies the generalized Nash equilibrium (GNE) seeking problem of second-integrator multiplayer systems. In particular, each player is endowed with an individual payoff function with respect to collective decision variables, and simultaneously, a coupling inequality constraint and a set constraint are imposed to each player. The players communicate with their local neighbors over a directed topology. To begin with, a distributed-observer-based seeking strategy is synthesized by leveraging a proper composite variable. It is first demonstrated using nonsmooth analysis that the established distributed observer enables each player to accurately estimate the decision variables of others in terms of a strongly connected topology condition. Upon this basis, all the decision variables are then shown to converge to the expected GNE asymptotically borrowing from convex theory. In addition, three extension results are also given under the built GNE seeking framework. First, under the postulation that the velocity information is unavailable, a velocity-free distributed GNE seeking strategy is synthesized for second-integrator systems by implementing a proper auxiliary dynamics. Second, we consider nonlinear Euler–Lagrange systems with unknown inertia parameters and synthesize an improved distributed GNE seeking strategy resorting to an adaptation technique. Third, we focus on integrator chain systems and synthesize a modified distributed GNE seeking strategy using a new composite variable based on a proper coordinate transformation. For three extension cases, we all show in detail the achievement of the GNE seeking objective. Finally, a practical example is simulated to confirm the built GNE seeking results.