Lourdes Peñalver

A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation

This paper presents a secure protocol for spontaneous wireless ad hoc networks which uses an hybrid symmetric/asymmetric scheme and the trust between users in order to exchange the initial data and to exchange the secret keys that will be used to encrypt the data. Trust is based on the first visual contact between users. Our proposal is a complete self-configured secure protocol that is able to create the network and share secure services without any infrastructure. The network allows sharing resources and offering new services among users in a secure environment. The protocol includes all functions needed to operate without any external support. We have designed and developed it in devices with limited resources. Network creation stages are detailed and the communication, protocol messages, and network management are explained. Our proposal has been implemented in order to test the protocol procedure and performance. Finally, we compare the protocol with other spontaneous ad hoc network protocols in order to highlight its features and we provide a security analysis of the system.

Two secure and energy-saving spontaneous ad-hoc protocol for wireless mesh client networks

We can find many cases where a spontaneous wireless ad-hoc network must be built for a limited period of time in a wireless mesh network: meetings, conferences, etc. One of the main aspects in a spontaneous network is to provide security mechanisms to the users. Confidentially, integrity, authentication, availability and no-repudiation should be provided for all the users in the network and the information should travel ciphered through the network. This paper shows two secure spontaneous wireless ad-hoc network protocols for wireless mesh clients that are based on the computational costs: the weak and the strong one. They are based on the trust of the users and guarantee a secure protocol between the users and the mesh routers. Both protocols provide node authenticity, intermediate node authenticity, integrity checking, random checking, verification distribution and erroneous packets elimination (before they arrive to the destination). The protocol procedure, its messages and development are explained in detail. Finally, we will compare their energy consumption with other secure protocols. The comparison will prove their benefits.

A spontaneous ad hoc network to share WWW access

In this paper, we propose a secure spontaneous ad-hoc network, based on direct peer-to-peer interaction, to grant a quick, easy, and secure access to the users to surf the Web. The paper shows the description of our proposal, the procedure of the nodes involved in the system, the security algorithms implemented, and the designed messages. We have taken into account the security and its performance. Although some people have defined and described the main features of spontaneous ad-hoc networks, nobody has published any design and simulation until today. Spontaneous networking will enable a more natural form of wireless computing when people physically meet in the real world. We also validate the success of our proposal through several simulations and comparisons with a regular architecture, taking into account the optimization of the resources of the devices. Finally, we compare our proposal with other caching techniques published in the related literature. The proposal has been developed with the main objective of improving the communication and integration between different study centers of low-resource communities. That is, it lets communicate spontaneous networks, which are working collaboratively and which have been created on different physical places.

Spontaneous Ad Hoc Mobile Cloud Computing Network

Cloud computing helps users and companies to share computing resources instead of having local servers or personal devices to handle the applications. Smart devices are becoming one of the main information processing devices. Their computing features are reaching levels that let them create a mobile cloud computing network. But sometimes they are not able to create it and collaborate actively in the cloud because it is difficult for them to build easily a spontaneous network and configure its parameters. For this reason, in this paper, we are going to present the design and deployment of a spontaneous ad hoc mobile cloud computing network. In order to perform it, we have developed a trusted algorithm that is able to manage the activity of the nodes when they join and leave the network. The paper shows the network procedures and classes that have been designed. Our simulation results using Castalia show that our proposal presents a good efficiency and network performance even by using high number of nodes.

Internet of things: where to be is to trust

Networks’ creation is getting more and more required, anytime, anywhere. Devices that can participate on these networks can be quite different among them. Sensors, mobiles, home appliances, or other type of devices will have to collaborate to increase and improve the services provided to clients. In the same way, network configuration, security mechanisms establishment, and optimal performance control must be done by them. Some of these devices could have limited resources to work, sometimes even resources restriction not existing, they must work to optimize network traffic. In this article, we center our researching on spontaneous networks. We propose a secure spontaneous ad-hoc network, based on direct peer-to-peer interaction and communities’ creation to grant a quick, easy, and secure access to users to surf the Web. Each device will have an identity in the network. Each community will also have an identity and will act as a unity on a world based on Internet connection. Security will be established in the moment they access to the network through the use of the trust chain generated by nodes. Trust is modified by each node on the basis of nodes behavior.

High performance algorithm to obtain Johansson adaptive control in robot manipulators

Abstract The dynamics equation of robot manipulators is nonlinear and coupled. An inverse dynamic control algorithm that requires a full knowledge of the dynamics of the system is one way to solve the control movement. Adaptive control is used to identify these unknown parameters. These algorithms are based on the linear relationship of inertial parameters in the dynamic equation. A formulation to generalize this relationship is applied to the Johansson adaptive algorithm. The objective of this paper is to present the optimizations to obtain the matrices of the Johansson adaptive algorithm using the Lagrange–Euler formulation and apply it to an on-line identification problem.

Distributed Parallel Algorithms for the Inverse Dynamics Control of Robot Manipulators

Abstract The inverse dynamics control of robot manipulators is based on the application of a nonlinear feedback control law. The implementation of this control requires, at each sample instant, the computation of all the terms of the dynamic equation. For solving this time request, distributed memory parallel algorithms using the Lagrange-Euler formulation are presented. This formulation permits us to establish matrix structures that could be implemented in parallel. To obtain a good load balance the computation of the different matrix structures is distributed among the processors by rows. Good speed-ups and efficiences have been obtained.

Software Requirements for Ubiquitous Ad Hoc Mobile Networks: An Example of a Bluetooth Application

In contrast with the simple and elegant concept of global computing, also called ubiquitous computing - where daily life objects get now computing capacity and interact among them to provide a wide range of services to users - a major difficulty is arising with the software engineering process to develop applications for these devices. This article discusses the additional parameters that should be taken into account when designing and developing software for ubiquitous devices in ad-hoc networks. In these networks the mobility of the devices could increase the complexity of the requirements to be considered. As a case study, we present a Bluetooth application that has been developed to fulfill a variety of established requirements. The application allows the creation of different types of networks for non-expert users thanks to the context-aware capacity of Bluetooth.

A Secure Spontaneous Ad-Hoc Network to Share Internet Access

In this paper, we propose a secure spontaneous ad-hoc network to grant the access of the users to surf the Web. The paper shows the description of our proposal, the procedure of the nodes involved in the system and the designed messages. We also validate the success of our proposal through several simulations and comparisons with a regular architecture. The proposal has been developed with the main objective of improving the communication and integration between different study centers of low resource communities.

Implementation of Adaptive Control Algorithms in Robot Manipulators Using Parallel Computing

The dynamics equation of robot manipulators is non linear and coupled. An inverse dynamic control algorithm that requires a full knowledge of the dynamics of the system is one way to solve the control movement. Adaptive control is used to identify the unknown parameters (inertial parameters, mass, etc). The adaptive control algorithms are based on the linear relationship of inertial parameters in the dynamic equation. A formulation to generalize this relationship is applied to the Johansson adaptive algorithm. The objective of this paper is to present the implementation of this relationship using parallel computing and apply it to an on-line identification problem in real-time.