Contribuci��n a los modelos de gesti��n de las redes m��viles ad hoc

La capacidad de comunicaci��n de los seres humanos ha crecido gracias a la evoluci��n de dispositivos m��viles cada vez m��s peque��os, manejables, potentes, de mayor autonom��a y m��s asequibles. Esta tendencia muestra que en un futuro pr��ximo cercano cada persona llevar��a consigo por lo menos un dispositivo de altas prestaciones. Estos dispositivos tienen incorporados algunas formas de comunicaci��n: red de telefon��a, redes inal��mbricas, bluetooth, entre otras. Lo que les permite tambi��n ser empleados para la configuraci��n de redes m��viles Ad Hoc. Las redes m��viles Ad Hoc, son redes temporales y autoconfigurables, no necesitan un punto de acceso para que los nodos intercambien informaci��n entre s��. Cada nodo realiza las tareas de encaminador cuando sea requerido. Los nodos se pueden mover, cambiando de ubicaci��n a discreci��n. La autonom��a de estos dispositivos depende de las estrategias de como sus recursos son utilizados. De tal forma que los protocolos, algoritmos o modelos deben ser dise��ados de forma eficiente para no impactar el rendimiento del dispositivo, siempre buscando un equilibrio entre sobrecarga y usabilidad. Es importante definir una gesti��n adecuada de estas redes especialmente cuando est��n siendo utilizados en escenarios cr��ticos como los de emergencias, desastres naturales, conflictos b��licos. La presente tesis doctoral muestra una soluci��n eficiente para la gesti��n de redes m��viles Ad Hoc. La soluci��n contempla dos componentes principales: la definici��n de un modelo de gesti��n para redes m��viles de alta disponibilidad y la creaci��n de un protocolo de enrutamiento jer��rquico asociado al modelo. El modelo de gesti��n propuesto, denominado High Availability Management Ad Hoc Network (HAMAN), es definido en una estructura de cuatro niveles, acceso, distribuci��n, inteligencia e infraestructura. Adem��s se describen los componentes de cada nivel: tipos de nodos, protocolos y funcionamiento. Se estudian tambi��n las interfaces de comunicaci��n entre cada componente y la relaci��n de estas con los niveles definidos. Como parte del modelo se dise��a el protocolo de enrutamiento Ad Hoc, denominado Backup Cluster Head Protocol (BCHP), que utiliza como estrategia de encaminamiento el empleo de cluster y jerarqu��as. Cada cluster tiene un Jefe de Cluster que concentra la informaci��n de enrutamiento y de gesti��n y la env��a al destino cuando esta fuera de su ��rea de cobertura. Para mejorar la disponibilidad de la red el protocolo utiliza un Jefe de Cluster de Respaldo el que asume las funciones del nodo principal del cluster cuando este tiene un problema. El modelo HAMAN es validado a trav��s de un proceso la simulaci��n del protocolo BCHP. El protocolo BCHP se implementa en la herramienta Network Simulator 2 (NS2) para ser simulado, comparado y contrastado con el protocolo de enrutamiento jer��rquico Cluster Based Routing Protocol (CBRP) y con el protocolo de enrutamiento Ad Hoc reactivo denominado Ad Hoc On Demand Distance Vector Routing (AODV). Abstract The communication skills of humans has grown thanks to the evolution of mobile devices become smaller, manageable, powerful, more autonomy and more affordable. This trend shows that in the near future each person will carry at least one high-performance device. These high-performance devices have some forms of communication incorporated: telephony network, wireless networks, bluetooth, among others. What can also be used for configuring mobile Ad Hoc networks. Ad Hoc mobile networks, are temporary and self-configuring networks, do not need an access point for exchange information between their nodes. Each node performs the router tasks as required. The nodes can move, change location at will. The autonomy of these devices depends on the strategies of how its resources are used. So that the protocols, algorithms or models should be designed to efficiently without impacting device performance seeking a balance between overhead and usability. It is important to define appropriate management of these networks, especially when being used in critical scenarios such as emergencies, natural disasters, wars. The present research shows an efficient solution for managing mobile ad hoc networks. The solution comprises two main components: the definition of a management model for highly available mobile networks and the creation of a hierarchical routing protocol associated with the model. The proposed management model, called High Availability Management Ad Hoc Network (HAMAN) is defined in a four-level structure: access, distribution, intelligence and infrastructure. The components of each level: types of nodes, protocols, structure of a node are shown and detailed. It also explores the communication interfaces between each component and the relationship of these with the levels defined. The Ad Hoc routing protocol proposed, called Backup Cluster Head Protocol( BCHP), use of cluster and hierarchies like strategies. Each cluster has a cluster head which concentrates the routing information and management and sent to the destination when out of cluster coverage area. To improve the availability of the network protocol uses a Backup Cluster Head who assumes the functions of the node of the cluster when it has a problem. The HAMAN model is validated accross the simulation of their BCHP routing protocol. BCHP protocol has been implemented in the simulation tool Network Simulator 2 (NS2) to be simulated, compared and contrasted with a hierarchical routing protocol Cluster Based Routing Protocol (CBRP) and a routing protocol called Reactive Ad Hoc On Demand Distance Vector Routing (AODV).

Analysis of ad hoc routing protocols for emergency and rescue scenarios.

A mobile ad hoc network MANET is a collection of wireless mobile nodes that can dynamically configure a network without a fixed infrastructure or centralized administration. This makes it ideal for emergency and rescue scenarios where information sharing is essential and should occur as soon as possible. This article discusses which of the routing strategies for mobile ad hoc networks: proactive, reactive and hierarchical, have a better performance in such scenarios. Using a real urban area being set for the emergency and rescue scenario, we calculate the density of nodes and the mobility model needed for validation. The NS2 simulator has been used in our study. We also show that the hierarchical routing strategies are beffer suited for this type of scenarios.

Behavior of Ad Hoc routing protocols, analyzed for emergency and rescue scenarios, on a real urban area

A mobile Ad Hoc network (MANET) is a collection of wireless mobile nodes that can dynamically configure a network without a fixed infrastructure or central administration. This makes it ideal for emergency and rescue scenarios, where sharing information is essential and should occur as soon as possible. This article discusses which of the routing strategies for mobile MANETs: proactive, reactive or hierarchical, has a better performance in such scenarios. By selecting a real urban area for the emergency and rescue scenario, we calculated the density of nodes and the mobility model needed for the validation study of AODV, DSDV and CBRP in the routing model. The NS2 simulator has been used for our study. We also show that the hierarchical routing strategies are better suited for this type of scenarios.

An energy efficient adaptive HELLO algorithm for mobile ad hoc networks

HELLO protocol or neighborhood discovery is essential in wireless ad hoc networks. It makes the rules for nodes to claim their existence/aliveness. In the presence of node mobility, no fix optimal HELLO frequency and optimal transmission range exist to maintain accurate neighborhood tables while reducing the energy consumption and bandwidth occupation. Thus a Turnover based Frequency and transmission Power Adaptation algorithm (TFPA) is presented in this paper. The method enables nodes in mobile networks to dynamically adjust both their HELLO frequency and transmission range depending on the relative speed. In TFPA, each node monitors its neighborhood table to count new neighbors and calculate the turnover ratio. The relationship between relative speed and turnover ratio is formulated and optimal transmission range is derived according to battery consumption model to minimize the overall transmission energy. By taking advantage of the theoretical analysis, the HELLO frequency is adapted dynamically in conjunction with the transmission range to maintain accurate neighborhood table and to allow important energy savings. The algorithm is simulated and compared to other state-of-the-art algorithms. The experimental results demonstrate that the TFPA algorithm obtains high neighborhood accuracy with low HELLO frequency (at least 11% average reduction) and with the lowest energy consumption. Besides, the TFPA algorithm does not require any additional GPS-like device to estimate the relative speed for each node, hence the hardware cost is reduced.

Cognitive wireless sensor network platform for cooperative communications

Nowadays, Wireless Ad Hoc Sensor Networks (WAHSNs), specially limited in energy and resources, are subject to development constraints and difficulties such as the increasing RF spectrum saturation at the unlicensed bands. Cognitive Wireless Sensor Networks (CWSNs), leaning on a cooperative communication model, develop new strategies to mitigate the inefficient use of the spectrum that WAHSNs face. However, few and poorly featured platforms allow their study due to their early research stage. This paper presents a versatile platform that brings together cognitive properties into WAHSNs. It combines hardware and software modules as an entire instrument to investigate CWSNs. The hardware fits WAHSN requirements in terms of size, cost, features, and energy. It allows communication over three different RF bands, becoming the only cognitive platform for WAHSNs with this capability. In addition, its modular and scalable design is widely adaptable to almost any WAHSN application. Significant features such as radio interface (RI) agility or energy consumption have been proven throughout different performance tests.

Analysis of QoS Parameter in AODV a DSR in Mobile Ad Hoc Networks

Providing QoS in the context of Ad Hoc networks includes a very wide field of application from the perspective of every level of the architecture in the network. Saying It in another way, It is possible to speak about QoS when a network is capable of guaranteeing a trustworthy communication in both extremes, between any couple of the network nodes by means of an efficient Management and administration of the resources that allows a suitable differentiation of services in agreement with the characteristics and demands of every single application.The principal objective of this article is the analysis of the quality parameters of service that protocols of routering reagents such as AODV and DSR give in the Ad Hoc mobile Networks; all of this is supported by the simulator ns-2. Here were going to analyze the behavior of some other parameters like effective channel, loss of packages and latency in the protocols of routering. Were going to show you which protocol presents better characteristics of Quality of Service (QoS) in the MANET networks.

Un modelo de encaminamiento en las redes m��viles ad hoc con QoS

En la ��ltima d��cada ha aumentado en gran medida el inter��s por las redes m��viles Ad Hoc. La naturaleza din��mica y sin infraestructura de estas redes, exige un nuevo conjunto de algoritmos y estrategias para proporcionar un servicio de comunicaci��n fiable extremo a extremo. En el contexto de las redes m��viles Ad Hoc, el encaminamiento surge como una de las ��reas m��s interesantes para transmitir informaci��n desde una fuente hasta un destino, con la calidad de servicio de extremo a extremo. Debido a las restricciones inherentes a las redes m��viles, los modelos de encaminamiento tradicionales sobre los que se fundamentan las redes fijas, no son aplicables a las redes m��viles Ad Hoc. Como resultado, el encaminamiento en redes m��viles Ad Hoc ha gozado de una gran atenci��n durante los ��ltimos a��os. Esto ha llevado al acrecentamiento de numerosos protocolos de encaminamiento, tratando de cubrir con cada uno de ellos las necesidades de los diferentes tipos de escenarios. En consecuencia, se hace imprescindible estudiar el comportamiento de estos protocolos bajo configuraciones de red variadas, con el fin de ofrecer un mejor encaminamiento respecto a los existentes. El presente trabajo de investigaci��n muestra precisamente una soluci��n de encaminamiento en las redes m��viles Ad Hoc. Dicha soluci��n se basa en el mejoramiento de un algoritmo de agrupamiento y la creaci��n de un modelo de encaminamiento; es decir, un modelo que involucra la optimizaci��n de un protocolo de enrutamiento apoyado de un mecanismo de agrupaci��n. El algoritmo mejorado, denominado GMWCA (Group Management Weighted Clustering Algorithm) y basado en el WCA (Weighted Clustering Algorithm), permite calcular el mejor n��mero y tama��o de grupos en la red. Con esta mejora se evitan constantes reagrupaciones y que los jefes de cl��steres tengan m��s tiempo de vida intra-cl��ster y por ende una estabilidad en la comunicaci��n inter-cl��ster. En la tesis se detallan las ventajas de nuestro algoritmo en relaci��n a otras propuestas bajo WCA. El protocolo de enrutamiento Ad Hoc propuesto, denominado QoS Group Cluster Based Routing Protocol (QoSG-CBRP), utiliza como estrategia el empleo de cl��ster y jerarqu��as apoyada en el algoritmo de agrupamiento. Cada cl��ster tiene un jefe de cl��ster (JC), quien administra la informaci��n de enrutamiento y la env��a al destino cuando esta fuera de su ��rea de cobertura. Para evitar que haya constantes reagrupamientos y llamados al algoritmo de agrupamiento se consider�� agregarle un jefe de cluster de soporte (JCS), el que asume las funciones del JC, siempre y cuando este haya roto el enlace con los otros nodos comunes del cl��ster por razones de alejamiento o por desgaste de bater��a. Matem��ticamente y a nivel de algoritmo se han demostrado las mejoras del modelo propuesto, el cual ha involucrado el mejoramiento a nivel de algoritmo de clustering y del protocolo de enrutamiento. El protocolo QoSG-CBRP, se ha implementado en la herramienta de simulaci��n Network Simulator 2 (NS2), con la finalidad de ser comparado con el protocolo de enrutamiento jer��rquico Cluster Based Routing Protocol (CBRP) y con un protocolo de enrutamiento Ad Hoc reactivo denominado Ad Hoc On Demand Distance Vector Routing (AODV). Estos protocolos fueron elegidos por ser los que mejor comportamiento presentaron dentro de sus categor��as. Adem��s de ofrecer un panorama general de los actuales protocolos de encaminamiento en redes Ad Hoc, este proyecto presenta un procedimiento integral para el an��lisis de capacidades de la propuesta del nuevo protocolo con respecto a otros, sobre redes que tienen un alto n��mero de nodos. Estas prestaciones se miden en base al concepto de eficiencia de encaminamiento bajo par��metros de calidad de servicio (QoS), permitiendo establecer el camino m��s corto posible entre un nodo origen y un nodo destino. Con ese fin se han realizado simulaciones con diversos escenarios para responder a los objetivos de la tesis. La conclusiones derivadas del an��lisis de los resultados permiten evaluar cualitativamente las capacidades que presenta el protocolo dentro del modelo propuesto, al mismo tiempo que avizora un atractivo panorama en l��neas futuras de investigaci��n. ABSTRACT In the past decade, the interest in mobile Ad Hoc networks has greatly increased. The dynamic nature of these networks without infrastructure requires a new set of algorithms and strategies to provide a reliable end-to-end communication service. In the context of mobile Ad Hoc networks, routing emerges as one of the most interesting areas for transmitting information from a source to a destination, with the quality of service from end-to-end. Due to the constraints of mobile networks, traditional routing models that are based on fixed networks are not applicable to Ad Hoc mobile networks. As a result, the routing in mobile Ad Hoc networks has experienced great attention in recent years. This has led to the enhancement of many routing protocols, trying to cover with each one of them, the needs of different types of scenarios. Consequently, it is essential to study the behavior of these protocols under various network configurations, in order to provide a better routing scheme. Precisely, the present research shows a routing solution in mobile Ad Hoc networks. This solution is based on the improvement of a clustering algorithm, and the creation of a routing model, ie a model that involves optimizing a routing protocol with the support of a grouping mechanism. The improved algorithm called GMWCA (Group Management Weighted Clustering Algorithm) and based on the WCA (Weighted Clustering Algorithm), allows to calculate the best number and size of groups in the network. With this enhancement, constant regroupings are prevented and cluster heads are living longer intra-cluster lives and therefore stability in inter-cluster communication. The thesis details the advantages of our algorithm in relation to other proposals under WCA. The Ad Hoc routing protocol proposed, called QoS Group Cluster Based Routing Protocol (QoSG-CBRP), uses a cluster-employment strategy and hierarchies supported by the clustering algorithm. Each cluster has a cluster head (JC), who manages the routing information and sends it to the destination when is out of your coverage area. To avoid constant rearrangements and clustering algorithm calls, adding a support cluster head (JCS) was considered. The JCS assumes the role of the JC as long as JC has broken the link with the other nodes in the cluster for common restraining reasons or battery wear. Mathematically and at an algorithm level, the improvements of the proposed model have been showed, this has involved the improvement level clustering algorithm and the routing protocol. QoSG-CBRP protocol has been implemented in the simulation tool Network Simulator 2 (NS2), in order to be compared with the hierarchical routing protocol Cluster Based Routing Protocol (CBRP) and with the reactive routing protocol Ad Hoc On Demand Distance Vector Routing (AODV). These protocols were chosen because they showed the best individual performance in their categories. In addition to providing an overview of existing routing protocols in Ad Hoc networks, this project presents a comprehensive procedure for capacity analysis of the proposed new protocol with respect to others on networks that have a high number of nodes. These benefits are measured based on the concept of routing efficiency under the quality of service (QoS) parameters, thus allowing for the shortest possible path between a source node and a destination node. To meet the objectives of the thesis, simulations have been performed with different scenarios. The conclusions derived from the analysis of the results to assess qualitatively the protocol capabilities presented in the proposed model, while an attractive scenario for future research appears.

Assessment of troughput performance under NS2 in Mobile Ad Hoc Networks (MANETs)

Providing QoS in the context of Ad Hoc networks includes a very wide field of application from the perspective of every level of the architecture in the network.In order for simulation studies to be useful, it is very important that the simulation results match as closely as possible with the test bed results. In this Paper, we study the throughput performance (parameter QoS) in Mobile Ad Hoc Networks (MANETs) and compares emulated test bed results with simulation results from NS2 (Network Simulator). The performance of the Mobile Ad Hoc Networks is very sensitive to the number of users and the offered load. When the number of users/offered load is high then the collisions increase resulting in larger wastage of the medium and lowering overall throughput. The aim of this research is to compare the throughput of Mobile Ad Hoc Networks using three different scenarios: 97, 100 and 120 users (nodes) using simulator NS2. By analyzing the graphs in MANETs, it is concluded When the number of users o nodes is increased beyond the certain limit, throughput decreases.

MIRACLE���s Ad-Hoc and Geographical IR Approaches for CLEF 2006

This paper presents the 2006 Miracle team���s approaches to the Ad-Hoc and Geographical Information Retrieval tasks. A first set of runs was obtained using a set of basic components. Then, by putting together special combinations of these runs, an extended set was obtained. With respect to previous campaigns some improvements have been introduced in our system: an entity recognition prototype is integrated in our tokenization scheme, and the performance of our indexing and retrieval engine has been improved. For GeoCLEF, we tested retrieving using geo-entity and textual references separately, and then combining them with different approaches.

MIRACLE at Ad-Hoc CLEF 2005: Merging and Combining Without Using a Single Approach

This paper presents the 2005 Miracle���s team approach to the Ad-Hoc Information Retrieval tasks. The goal for the experiments this year was twofold: to continue testing the effect of combination approaches on information retrieval tasks, and improving our basic processing and indexing tools, adapting them to new languages with strange encoding schemes. The starting point was a set of basic components: stemming, transforming, filtering, proper nouns extraction, paragraph extraction, and pseudo-relevance feedback. Some of these basic components were used in different combinations and order of application for document indexing and for query processing. Second-order combinations were also tested, by averaging or selective combination of the documents retrieved by different approaches for a particular query. In the multilingual track, we concentrated our work on the merging process of the results of monolingual runs to get the overall multilingual result, relying on available translations. In both cross-lingual tracks, we have used available translation resources, and in some cases we have used a combination approach.

Simulation Tool and Case Study for Planning Wireless Sensor Network

In this paper, a simulation tool for assisting the deployment of wireless sensor network is introduced and simulation results are verified under a specific indoor environment. The simulation tool supports two modes: deterministic mode and stochastic mode. The deterministic mode is environment dependent in which the information of environment should be provided beforehand. Ray tracing method and deterministic propagation model are employed in order to increase the accuracy of the estimated coverage, connectivity and routing; the stochastic mode is useful for large scale random deployment without previous knowledge on geographic information. Dynamic Source Routing protocol (DSR) and Ad hoc On-Demand Distance Vector Routing protocol (AODV) are implemented in order to calculate the topology of WSN. Hence this tool gives direct view on the performance of WSN and assists users in finding the potential problems of wireless sensor network before real deployment. At the end, a case study is realized in Centro de Electronica Industrial (CEI), the simulation results on coverage, connectivity and routing are verified by the measurement.

Study of OLSR protocol with Network Simulator 2 over Linux

Until a few years ago, most of the network communications were based in the wire as the physical media, but due to the advances and the maturity of the wireless communications, this is changing. Nowadays wireless communications offers fast, secure, efficient and reliable connections. Mobile communications are in expansion, clearly driven by the use of smart phones and other mobile devices, the use of laptops, etc��� Besides that point, the inversion in the installation and maintenance of the physical medium is much lower than in wired communications, not only because the air has no cost, but because the installation and maintenance of the wire require a high economic cost. Besides the economic cost we find that wire is a more vulnerable medium to external threats such as noise, sabotages, etc��� There are two different types of wireless networks: those which the structure is part of the network itself and those which have a lack of structure or any centralization, in a way that the devices that form part of the network can connect themselves in a dynamic and random way, handling also the routing of every control and information messages, this kind of networks is known as Ad-hoc. In the present work we will proceed to study one of the multiple wireless protocols that allows mobile communications, it is Optimized Link State Routing, from now on, OLSR, it is an pro-active routing, standard mechanism that works in a distributed in order to stablish the connections among the different nodes that belong to a wireless network. Thanks to this protocol it is possible to get all the routing tables in all the devices correctly updated every moment through the periodical transmission of control messages and on this way allow a complete connectivity among the devices that are part of the network and also, allow access to other external networks such as virtual private networks o Internet. This protocol could be perfectly used in environments such as airports, malls, etc��� The update of the routing tables in all the devices is got thanks to the periodical transmission of control messages and finally it will offer connectivity among all the devices and the corresponding external networks. For the study of OLSR protocol we will have the help of the network simulator ���Network Simulator 2���, a freeware network simulator programmed in C++ based in discrete events. This simulator is used mainly in educational and research environments and allows a very extensive range of protocols, both, wired networks protocols and wireless network protocols, what is going to be really useful to proceed to the simulation of different configurations of networks and protocols. In the present work we will also study different simulations with Network Simulator 2, in different scenarios with different configurations, wired networks, and Ad-hoc networks, where we will study OLSR Protocol. RESUMEN. Hasta hace pocos a��os, la mayor��a de las comunicaciones de red estaban basadas en el cable como medio f��sico pero debido al avance y madurez alcanzados en el campo de las comunicaciones inal��mbricas esto est�� cambiando. Hoy d��a las comunicaciones inal��mbricas nos ofrecen conexiones veloces, seguras, eficientes y fiables. Las comunicaciones m��viles se encuentran en su momento de m��xima expansi��n, claramente impulsadas por el uso de tel��fonos y dem��s dispositivos m��viles, el uso de port��tiles, etc��� Adem��s la inversi��n a realizar en la instalaci��n y el mantenimiento del medio f��sico en las comunicaciones m��viles es much��simo menor que en comunicaciones por cable, ya no s��lo porque el aire no tenga coste alguno, sino porque la instalaci��n y mantenimiento del cable precisan de un elevado coste econ��mico por norma. Adem��s del coste econ��mico nos encontramos con que es un medio m��s vulnerable a amenazas externas tales como el ruido, escuchas no autorizadas, sabotajes, etc��� Existen dos tipos de redes inal��mbricas: las constituidas por una infraestructura que forma parte m��s o menos de la misma y las que carecen de estructura o centralizaci��n alguna, de modo que los dispositivos que forman parte de ella pueden conectarse de manera din��mica y arbitraria entre ellos, encarg��ndose adem��s del encaminamiento de todos los mensajes de control e informaci��n, a este tipo de redes se las conoce como redes Ad-hoc. En el presente Proyecto de Fin de Carrera se proceder�� al estudio de uno de los m��ltiples protocolos inal��mbricos que permiten comunicaciones m��viles, se trata del protocolo inal��mbrico Optimized Link State Routing, de ahora en adelante OLSR, un mecanismo est��ndar de enrutamiento pro-activo, que trabaja de manera distribuida para establecer las conexiones entre los nodos que formen parte de las redes inal��mbricas Ad-hoc, las cuales carecen de un nodo central y de una infraestructura pre-existente. Gracias a este protocolo es posible conseguir que todos los equipos mantengan en todo momento las tablas de ruta actualizadas correctamente mediante la transmisi��n peri��dica de mensajes de control y as�� permitir una completa conectividad entre todos los equipos que formen parte de la red y, a su vez, tambi��n permitir el acceso a otras redes externas tales como redes privadas virtuales o Internet. Este protocolo ser��a usado en entornos tales como aeropuertos La actualizaci��n de las tablas de enrutamiento de todos los equipos se conseguir�� mediante la transmisi��n peri��dica de mensajes de control y as�� finalmente se podr�� permitir conectividad entre todos los equipos y con las correspondientes redes externas. Para el estudio del protocolo OLSR contaremos con el simulador de redes Network Simulator 2, un simulador de redes freeware programado en C++ basado en eventos discretos. Este simulador es usado principalmente en ambientes educativos y de investigaci��n y permite la simulaci��n tanto de protocolos unicast como multicast. El campo donde m��s se utiliza es precisamente en el de la investigaci��n de redes m��viles Ad-hoc. El simulador Network Simulator 2 no s��lo implementa el protocolo OLSR, sino que ��ste implementa una amplia gama de protocolos, tanto de redes cableadas como de redes inal��mbricas, lo cual va a sernos de gran utilidad para proceder a la simulaci��n de distintas configuraciones de redes y protocolos. En el presente Proyecto de Fin de Carrera se estudiar��n tambi��n diversas simulaciones con el simulador NS2 en diferentes escenarios con diversas configuraciones; redes cableadas, redes inal��mbricas Ad-hoc, donde se estudiar�� el protocolo antes mencionado: OLSR. Este Proyecto de Fin de Carrera consta de cuatro apartados distintos: Primeramente se realizar�� el estudio completo del protocolo OLSR, se ver��n los beneficios y contrapartidas que ofrece este protocolo inal��mbrico. Tambi��n se ver��n los distintos tipos de mensajes existentes en este protocolo y unos peque��os ejemplos del funcionamiento del protocolo OLSR. Seguidamente se har�� una peque��a introducci��n al simulador de redes Network Simulator 2, veremos la historia de este simulador, y tambi��n se har�� referencia a la herramienta extra NAM, la cual nos permitir�� visualizar el intercambio de paquetes que se produce entre los diferentes dispositivos de nuestras simulaciones de forma intuitiva y amigable. Se har�� menci��n a la plataforma MASIMUM, encargada de facilitar en un entorno acad��mico software y documentaci��n a sus alumnos con el fin de facilitarles la investigaci��n y la simulaci��n de redes y sensores Ad-hoc. Finalmente se ver��n dos ejemplos, uno en el que se realizar�� una simulaci��n entre dos PCs en un entorno Ethernet y otro ejemplo en el que se realizar�� una simulaci��n inal��mbrica entre cinco dispositivos m��viles mediante el protocolo a estudiar, OLSR.

Desarrollo de aplicaciones de comunicaciones inal��mbricas en sistemas de monitorizaci��n estructural desarrollados en aeron��utica.

Los Sistemas de SHM o de monitorizaci��n de la integridad estructural surgen ante la necesidad de mejorar los m��todos de evaluaci��n y de test no destructivos convencionales. De esta manera, se puede tener controlado todo tipo de estructuras en las cuales su correcto estado o funcionamiento suponga un factor cr��tico. Un Sistema SHM permite analizar una estructura concreta capturando de manera peri��dica el estado de la integridad estructural, que en este proyecto se ha aplicado a estructuras aeron��uticas. P.A.M.E.L.A. (Phase Array Monitoring for Enhanced Life Assessment) es la denominaci��n utilizada para definir una serie de equipos electr��nicos para Sistemas SHM desarrollados por AERNOVA y los Grupos de Dise��o Electr��nico de las universidades UPV/EHU y UPM. Los dispositivos P.A.M.E.L.A. originalmente no cuentan con tecnolog��a Wi-Fi, por lo que incorporan un m��dulo hardware independiente que se encarga de las comunicaciones inal��mbricas, a los que se les denomina Nodos. Estos Nodos poseen un Sistema Operativo propio y todo lo necesario para administrar y organizar la red Mallada Wi-Fi. De esta manera se obtiene una red mallada inal��mbrica compuesta por Nodos que interconectan los Sistemas SHM y que se encargan de transmitir los datos a los equipos que procesan los resultados adquiridos por P.A.M.E.L.A. Los Nodos son dispositivos empotrados que llevan instalados un firmware basado en una distribuci��n de Linux para Nodos (o Routers), llamado Openwrt. Que para disponer de una red mallada necesitan de un protocolo orientado a este tipo de redes. Entre las opciones de protocolo m��s destacadas se puede mencionar: DSDV (Destination Sequenced Distance Vector), OLSR (Optimized Link State Routing), B.A.T.M.A.N-Adv (Better Approach To Mobile Adhoc Networking Advance), BMX (una versi��n de B.A.T.M.A.N-Adv), AODV (Ad hoc On-Demand Distance Vector) y el DSR (Dynamic Source Routing). Adem��s de la existencia de protocolos orientados a las redes malladas, tambi��n hay organizaciones que se dedican a desarrollar firmware que los utilizan, como es el caso del firmware llamado Nightwing que utiliza BMX, Freifunk que utiliza OLSR o Potato Mesh que utiliza B.A.T.M.A.N-Adv. La ventaja de estos tres firmwares mencionados es que las agrupaciones que las desarrollan proporcionan las im��genes precompiladas del sistema,listas para cargarlas en distintos modelos de Nodos. En este proyecto se han instalado las im��genes en los Nodos y se han probado los protocolos BMX, OLSR y B.A.T.M.A.N.-Adv. Concluyendo que la red gestionada por B.A.T.M.A.N.-Adv era la que mejor rendimiento obten��a en cuanto a estabilidad y ancho de banda. Despu��s de haber definido el protocolo a usar, se procedi�� a desarrollar una distribuci��n basada en Openwrt, que utilice B.A.T.M.A.N.-Adv para crear la red mallada, pero que se ajuste mejor a las necesidades del proyecto, ya que Nightwing, Freifunk y Potato Mesh no lo hac��an. Adem��s se implementan aplicaciones en lenguaje ANSI C y en LabVIEW para interactuar con los Nodos y los Sistemas SHM. Tambi��n se procede a hacer alguna modificaci��n en el Hardware de P.A.M.E.L.A. y del Nodo para obtener una mejor integraci��n entre los dos dispositivos. Y por ultimo, se prueba la transferencia de datos de los Nodos en distintos escenarios. ABSTRACT. Structural Health Monitoring (SHM) systems arise from the need of improving assessment methods and conventional nondestructive tests. Critical structures can be monitored using SHM. A SHM system analyzes periodically a specific structure capturing the state of structural integrity. The aim of this project is to contribute in the implementation of Mesh network for SHM system in aircraft structures. P.A.M.E.L.A. (Phase Array Monitoring for Enhanced Life Assessment) is the name for electronic equipment developed by AERNOVA, the Electronic Design Groups of university UPV/EHU and the Instrumentation and Applied Acoustics research group from UPM. P.A.M.E.L.A. devices were not originally equipped with Wi-Fi interface. In this project a separate hardware module that handles wireless communications (nodes) has been added. The nodes include an operating system for manage the Wi-Fi Mesh Network and they form the wireless mesh network to link SHM systems with monitoring equipment. Nodes are embedded devices with an installed firmware based on special Linux distribution used in routers or nodes, called OpenWRT. They need a Mesh Protocol to stablish the network. The most common protocols options are: DSDV (Destination Sequenced Distance Vector), OLSR (Optimized Link State Routing), BATMAN-Adv (Better Approach To Mobile Ad-hoc Networking Advance), BMX (a version of BATMAN-Adv) AODV (Ad hoc on-Demand Distance Vector) and DSR (Dynamic Source Routing). In addition, there are organizations that are dedicated to develope firmware using these Mesh Protocols, for instance: Nightwing uses BMX, Freifunk use OLSR and Potato Mesh uses BATMAN-Adv. The advantage of these three firmwares is that these groups develop pre-compiled images of the system ready to be loaded in several models of Nodes. In this project the images were installed in the nodes. In this way, BMX, OLSR and BATMAN-Adv have been tested. We conclude that the protocol BATMAN-Adv has better performance in terms of stability and bandwidth. After choosing the protocol, the objective was to develop a distribution based on OpenWRT, using BATMAN-Adv to create the mesh network. This distribution is fitted to the requirements of this project. Besides, in this project it has been developed applications in C language and LabVIEW to interact with the Nodes and the SHM systems. The project also address some modifications to the PAMELA hardware and the Node, for better integration between both elements. Finally, data transfer tests among the different nodes in different scenarios has been carried out.

Enhancement of a body area network to support smart health monitoring at the digital home

The deployment of home-based smart health services requires effective and reliable systems for personal and environmental data management. ooperation between Home Area Networks (HAN) and Body Area Networks (BAN) can provide smart systems with ad hoc reasoning information to support health care. This paper details the implementation of an architecture that integrates BAN, HAN and intelligent agents to manage physiological and environmental data to proactively detect risk situations at the digital home. The system monitors dynamic situations and timely adjusts its behavior to detect user risks concerning to health. Thus, this work provides a reasoning framework to infer appropriate solutions in cases of health risk episodes. Proposed smart health monitoring approach integrates complex reasoning according to home environment, user profile and physiological parameters defined by a scalable ontology. As a result, health care demands can be detected to activate adequate internal mechanisms and report public health services for requested actions.

Desarrollo de aplicaciones android usando la tecnolog��a wifi-direct

Este proyecto de fin de grado pretende demostrar la importancia y la utilidad de la creaci��n de redes de dispositivos m��viles conectados entre s��. Para ello se explicar��n varios tipos de redes inal��mbricas que permiten estas conexiones directas entre dispositivos sin la necesidad de un servidor. En estas redes inal��mbricas se destacan las redes P2P y las redes Ad-hoc, las cuales se explicar��n posteriormente. El despliegue de estas redes se puede encontrar en un amplio rango de campos como puede ser la agricultura, la medicina e incluso en el ��mbito militar. Es objetivo de este proyecto, adem��s, el estudio de la tecnolog��a Wi-Fi Direct creada por la Wi-Fi Alliance. Como se explicar�� a lo largo del proyecto, Wi-Fi Direct est�� basado en las redes P2P. Esta tecnolog��a permite a los dispositivos cercanos crear redes P2P a trav��s de la red Wi-Fi sin la necesidad de un punto de acceso a Internet. Por otro lado, una gran cantidad de los dispositivos m��viles que existen actualmente poseen el sistema operativo Android. Android ha incorporado en sus dispositivos m��s recientes la tecnolog��a Wi-Fi Direct. Debido a ello han ido surgiendo aplicaciones que usando esta tecnolog��a consiguen desde enviar ficheros hasta indicar la localizaci��n de un usuario. Esta tecnolog��a combinada con este tipo de dispositivos puede ser muy ��til para utilizar en casos de emergencia donde las infraestructuras de comunicaciones no est��n disponibles ya que al no necesitar un punto de acceso a internet es posible la comunicaci��n entre un usuario en peligro y otro que se encuentre dentro de un radio cercano. Por estos motivos otro de los principales objetivos de este proyecto es la implementaci��n de una aplicaci��n para dispositivos Android que use la tecnolog��a Wi-Fi Direct para realizar varias funcionalidades diferentes, como es el intercambio de ficheros entre dispositivos y la creaci��n de un chat para la comunicaci��n simultanea entre dos dispositivos. Con esto se pretende conocer mejor el funcionamiento de la tecnolog��a Wi-Fi Direct y demostrar su utilidad en los dispositivos m��viles como son los dispositivos Android. ABSTRACT. This final degree Project tries to demonstrate the importance and utility of networking mobile devices. For this purpose several types of wireless networks will be explained. These networks allow direct connections between devices. The most prominent Wireless networks are P2P and Ad-hoc which will be explained later. The use of these networks can be found in a wide range of fields such as agriculture medicine, and even in the military sector. Besides, other aim of this project is the study of Wi-Fi Direct Technology which is created by Wi-Fi Alliance. As it explained along the project, Wi-Fi Direct is based on P2P networks. This technology lets nearby devices create P2P networks through Wi-Fi network without an Internet access point. On the other hand, a large number of mobile devices have the Android OS. Android has integrated Wi-Fi Direct technology in its latest devices. Because of this applications have emerged that using this technology they get from sending files to send the user���s location. This technology combined with these devices can be very useful to use in emergencies where communications infrastructures are not available. Since not need an Internet access point, communication between a user in danger and another within close radius is possible. For these reasons another of the main aims of this project is the implementation of an application for Android devices which use Wi-Fi Direct technology to perform several different functionalities, such as file exchange or chat for simultaneous communication between devices. This is intended to better understand the operation of Wi-Fi Direct technology and prove its utility on mobile devices such as Android devices.