On the design of smart parking networks in the smart cities: an optimal sensor placement model

Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called ''anchor'' nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and e ciency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering e ciency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative e ciency of the single-step compared to the two-step model on di erent performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network

Development of a GIS-based method for sensor network deployment and coverage optimization

Au cours des dernières années, les réseaux de capteurs ont été de plus en plus utilisés dans différents contextes d’application allant de la surveillance de l’environnement au suivi des objets en mouvement, au développement des villes intelligentes et aux systèmes de transport intelligent, etc. Un réseau de capteurs est généralement constitué de nombreux dispositifs sans fil déployés dans une région d'intérêt. Une question fondamentale dans un réseau de capteurs est l'optimisation de sa couverture spatiale. La complexité de l'environnement de détection avec la présence de divers obstacles empêche la couverture optimale de plusieurs zones. Par conséquent, la position du capteur affecte la façon dont une région est couverte ainsi que le coût de construction du réseau. Pour un déploiement efficace d'un réseau de capteurs, plusieurs algorithmes d'optimisation ont été développés et appliqués au cours des dernières années. La plupart de ces algorithmes reposent souvent sur des modèles de capteurs et de réseaux simplifiés. En outre, ils ne considèrent pas certaines informations spatiales de l'environnement comme les modèles numériques de terrain, les infrastructures construites humaines et la présence de divers obstacles dans le processus d'optimisation. L'objectif global de cette thèse est d'améliorer les processus de déploiement des capteurs en intégrant des informations et des connaissances géospatiales dans les algorithmes d'optimisation. Pour ce faire, trois objectifs spécifiques sont définis. Tout d'abord, un cadre conceptuel est développé pour l'intégration de l'information contextuelle dans les processus de déploiement des réseaux de capteurs. Ensuite, sur la base du cadre proposé, un algorithme d'optimisation sensible au contexte local est développé. L'approche élargie est un algorithme local générique pour le déploiement du capteur qui a la capacité de prendre en considération de l'information spatiale, temporelle et thématique dans différents contextes d'applications. Ensuite, l'analyse de l'évaluation de la précision et de la propagation d'erreurs est effectuée afin de déterminer l'impact de l'exactitude des informations contextuelles sur la méthode d'optimisation du réseau de capteurs proposée. Dans cette thèse, l'information contextuelle a été intégrée aux méthodes d'optimisation locales pour le déploiement de réseaux de capteurs. L'algorithme développé est basé sur le diagramme de Voronoï pour la modélisation et la représentation de la structure géométrique des réseaux de capteurs. Dans l'approche proposée, les capteurs change leur emplacement en fonction des informations contextuelles locales (l'environnement physique, les informations de réseau et les caractéristiques des capteurs) visant à améliorer la couverture du réseau. La méthode proposée est implémentée dans MATLAB et est testée avec plusieurs jeux de données obtenus à partir des bases de données spatiales de la ville de Québec. Les résultats obtenus à partir de différentes études de cas montrent l'efficacité de notre approche.In recent years, sensor networks have been increasingly used for different applications ranging from environmental monitoring, tracking of moving objects, development of smart cities and smart transportation system, etc. A sensor network usually consists of numerous wireless devices deployed in a region of interest. A fundamental issue in a sensor network is the optimization of its spatial coverage. The complexity of the sensing environment with the presence of diverse obstacles results in several uncovered areas. Consequently, sensor placement affects how well a region is covered by sensors as well as the cost for constructing the network. For efficient deployment of a sensor network, several optimization algorithms are developed and applied in recent years. Most of these algorithms often rely on oversimplified sensor and network models. In addition, they do not consider spatial environmental information such as terrain models, human built infrastructures, and the presence of diverse obstacles in the optimization process. The global objective of this thesis is to improve sensor deployment processes by integrating geospatial information and knowledge in optimization algorithms. To achieve this objective three specific objectives are defined. First, a conceptual framework is developed for the integration of contextual information in sensor network deployment processes. Then, a local context-aware optimization algorithm is developed based on the proposed framework. The extended approach is a generic local algorithm for sensor deployment, which accepts spatial, temporal, and thematic contextual information in different situations. Next, an accuracy assessment and error propagation analysis is conducted to determine the impact of the accuracy of contextual information on the proposed sensor network optimization method. In this thesis, the contextual information has been integrated in to the local optimization methods for sensor network deployment. The extended algorithm is developed based on point Voronoi diagram in order to represent geometrical structure of sensor networks. In the proposed approach sensors change their location based on local contextual information (physical environment, network information and sensor characteristics) aiming to enhance the network coverage. The proposed method is implemented in MATLAB and tested with several data sets obtained from Quebec City spatial database. Obtained results from different case studies show the effectiveness of our approach

The Coverage Problem in Video-Based Wireless Sensor Networks: A Survey

Wireless sensor networks typically consist of a great number of tiny low-cost electronic devices with limited sensing and computing capabilities which cooperatively communicate to collect some kind of information from an area of interest. When wireless nodes of such networks are equipped with a low-power camera, visual data can be retrieved, facilitating a new set of novel applications. The nature of video-based wireless sensor networks demands new algorithms and solutions, since traditional wireless sensor networks approaches are not feasible or even efficient for that specialized communication scenario. The coverage problem is a crucial issue of wireless sensor networks, requiring specific solutions when video-based sensors are employed. In this paper, it is surveyed the state of the art of this particular issue, regarding strategies, algorithms and general computational solutions. Open research areas are also discussed, envisaging promising investigation considering coverage in video-based wireless sensor networks

Advances in analytical models and applications for RFID, WSN and AmI systems

Experimentos llevados a cabo con el equipo de división de honor UCAM Volleyball Murcia.[SPA] Internet de las cosas (IoT) integra distintos elementos que actúan tanto como fuentes, como sumideros de información, a diferencia de la percepción que se ha tenido hasta ahora de Internet, centrado en las personas. Los avances en IoT engloban un amplio número de áreas y tecnologías, desde la adquisición de información hasta el desarrollo de nuevos protocolos y aplicaciones. Un concepto clave que subyace en el concepto de IoT, es el procesamiento de forma inteligente y autónoma de los flujos de información que se dispone. En este trabajo, estudiamos tres aspectos diferentes de IoT. En primer lugar, nos centraremos en la infraestructura de obtención de datos. Entre las diferentes tecnologías de obtención de datos disponibles en los sistemas IoT, la Identificación por Radio Frecuencia (RFID) es considerada como una de las tecnologías predominantes. RFID es la tecnología detrás de aplicaciones tales como control de acceso, seguimiento y rastreo de contenedores, gestión de archivos, clasificación de equipaje o localización de equipos. Con el auge de la tecnología RFID, muchas instalaciones empiezan a requerir la presencia de múltiples lectores RFID que operan próximos entre sí y conjuntamente. A estos escenarios se les conoce como dense reader environments (DREs). La coexistencia de varios lectores operando simultáneamente puede causar graves problemas de interferencias en el proceso de identificación. Uno de los aspectos claves a resolver en los RFID DREs consiste en lograr la coordinación entre los lectores. Estos problemas de coordinación son tratados en detalle en esta tesis doctoral. Además, dentro del área de obtención de datos relativa a IoT, las Redes de Sensores Inalámbricas (WSNs) desempeñan un papel fundamental. Durante la última década, las WSNs han sido estudiadas ampliamente de forma teórica, y la mayoría de problemas relacionados con la comunicación en este tipo de redes se han conseguido resolver de forma favorable. Sin embargo, con la implementación de WSNs en proyectos reales, han surgido nuevos problemas, siendo uno de ellos el desarrollo de estrategias realistas para desplegar las WSN. En este trabajo se estudian diferentes métodos que resuelven este problema, centrándonos en distintos criterios de optimización, y analizando las diferentes ventajas e inconvenientes que se producen al buscar una solución equilibrada. Por último, la Inteligencia Ambiental (AmI) forma parte del desarrollo de aplicaciones inteligentes en IoT. Hasta ahora, han sido las personas quienes han tenido que adaptarse al entorno, en cambio, AmI persigue crear entornos de obtención de datos capaces de anticipar y apoyar las acciones de las personas. AmI se está introduciendo progresivamente en diversos entornos reales tales como el sector de la educación y la salud, en viviendas, etc. En esta tesis se introduce un sistema AmI orientado al deporte que busca mejorar el entrenamiento de los atletas, siendo el objetivo prioritario el desarrollo de un asistente capaz de proporcionar órdenes de entrenamiento, basadas tanto en el entorno como en el rendimiento de los atletas. [ENG] Internet of Things (IoT) is being built upon many different elements acting as sources and sinks of information, rather than the previous human-centric Internet conception. Developments in IoT include a vast set of fields ranging from data sensing, to development of new protocols and applications. Indeed, a key concept underlying in the conception of IoT is the smart and autonomous processing of the new huge data flows available. In this work, we aim to study three different aspects within IoT. First, we will focus on the sensing infrastructure. Among the different kind of sensing technologies available to IoT systems, Radio Frequency Identification (RFID) is widely considered one of the leading technologies. RFID is the enabling technology behind applications such as access control, tracking and tracing of containers, file management, baggage sorting or equipment location. With the grow up of RFID, many facilities require multiple RFID readers usually operating close to each other. These are known as Dense Reader Environments (DREs). The co-existence of several readers operating concurrently is known to cause severe interferences on the identification process. One of the key aspects to solve in RFID DREs is achieving proper coordination among readers. This is the focus of the first part of this doctoral thesis. Unlike previous works based on heuristics, we address this problem through an optimization-based approach. The goal is identifying the maximum mean number of tags while network constraints are met. To be able to formulate these optimization problems, we have obtained analytically the mean number of identifications in a bounded -discrete or continuous- time period, an additional novel contribution of our work. Results show that our approach is overwhelmingly better than previous known methods. Along sensing technologies of IoT, Wireless Sensor Networks (WSNs) plays a fundamental role. WSNs have been largely and theoretically studied in the past decade, and many of their initial problems related to communication aspects have been successfully solved. However, with the adoption of WSNs in real-life projects, new issues have arisen, being one of them the development of realistic strategies to deploy WSNs. We have studied different ways of solving this aspect by focusing on different optimality criteria and evaluating the different trade-offs that occur when a balanced solution must be selected. On the one hand, deterministic placements subject to conflicting goals have been addressed. Results can be obtained in the form of Pareto-frontiers, allowing proper solution selection. On the other hand, a number of situations correspond to deployments were the nodes¿ position is inherently random. We have analyzed these situations leading first to a theoretical model, which later has been particularized to a Moon WSN survey. Our work is the first considering a full model with realistic properties such as 3D topography, propellant consumptions or network lifetime and mass limitations. Furthermore, development of smart applications within IoT is the focus of the Ambient Intelligence (AmI) field. Rather than having people adapting to the surrounding environment, AmI pursues the development of sensitive environments able to anticipate support in people¿s actions. AmI is progressively being introduced in many real-life environments like education, homes, health and so forth. In this thesis we develop a sport-oriented AmI system designed to improve athletes training. The goal is developing an assistant able to provide real-time training orders based on both environment and athletes¿ biometry, which is aimed to control the aerobic and the technical-tactical training. Validation experiments with the honor league UCAM Volleyball Murcia team have shown the suitability of this approach.[ENG] Internet of Things (IoT) is being built upon many different elements acting as sources and sinks of information, rather than the previous human-centric Internet conception. Developments in IoT include a vast set of fields ranging from data sensing, to development of new protocols and applications. Indeed, a key concept underlying in the conception of IoT is the smart and autonomous processing of the new huge data flows available. In this work, we aim to study three different aspects within IoT. First, we will focus on the sensing infrastructure. Among the different kind of sensing technologies available to IoT systems, Radio Frequency Identification (RFID) is widely considered one of the leading technologies. RFID is the enabling technology behind applications such as access control, tracking and tracing of containers, file management, baggage sorting or equipment location. With the grow up of RFID, many facilities require multiple RFID readers usually operating close to each other. These are known as Dense Reader Environments (DREs). The co-existence of several readers operating concurrently is known to cause severe interferences on the identification process. One of the key aspects to solve in RFID DREs is achieving proper coordination among readers. This is the focus of the first part of this doctoral thesis. Unlike previous works based on heuristics, we address this problem through an optimization-based approach. The goal is identifying the maximum mean number of tags while network constraints are met. To be able to formulate these optimization problems, we have obtained analytically the mean number of identifications in a bounded -discrete or continuous- time period, an additional novel contribution of our work. Results show that our approach is overwhelmingly better than previous known methods. Along sensing technologies of IoT, Wireless Sensor Networks (WSNs) plays a fundamental role. WSNs have been largely and theoretically studied in the past decade, and many of their initial problems related to communication aspects have been successfully solved. However, with the adoption of WSNs in real-life projects, new issues have arisen, being one of them the development of realistic strategies to deploy WSNs. We have studied different ways of solving this aspect by focusing on different optimality criteria and evaluating the different trade-offs that occur when a balanced solution must be selected. On the one hand, deterministic placements subject to conflicting goals have been addressed. Results can be obtained in the form of Pareto-frontiers, allowing proper solution selection. On the other hand, a number of situations correspond to deployments were the nodes¿ position is inherently random. We have analyzed these situations leading first to a theoretical model, which later has been particularized to a Moon WSN survey. Our work is the first considering a full model with realistic properties such as 3D topography, propellant consumptions or network lifetime and mass limitations. Furthermore, development of smart applications within IoT is the focus of the Ambient Intelligence (AmI) field. Rather than having people adapting to the surrounding environment, AmI pursues the development of sensitive environments able to anticipate support in people¿s actions. AmI is progressively being introduced in many real-life environments like education, homes, health and so forth. In this thesis we develop a sport-oriented AmI system designed to improve athletes training. The goal is developing an assistant able to provide real-time training orders based on both environment and athletes¿ biometry, which is aimed to control the aerobic and the technical-tactical training. Validation experiments with the honor league UCAM Volleyball Murcia team have shown the suitability of this approach.Universidad Politécnica de CartagenaPrograma de doctorado en Tecnología de la Información y de las Comunicacione

Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors

Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance

Self-organizing Network Optimization via Placement of Additional Nodes

Das Hauptforschungsgebiet des Graduiertenkollegs "International Graduate School on Mobile Communication" (GS Mobicom) der Technischen Universität Ilmenau ist die Kommunikation in Katastrophenszenarien. Wegen eines Desasters oder einer Katastrophe können die terrestrischen Elementen der Infrastruktur eines Kommunikationsnetzwerks beschädigt oder komplett zerstört werden. Dennoch spielen verfügbare Kommunikationsnetze eine sehr wichtige Rolle während der Rettungsmaßnahmen, besonders für die Koordinierung der Rettungstruppen und für die Kommunikation zwischen ihren Mitgliedern. Ein solcher Service kann durch ein mobiles Ad-Hoc-Netzwerk (MANET) zur Verfügung gestellt werden. Ein typisches Problem der MANETs ist Netzwerkpartitionierung, welche zur Isolation von verschiedenen Knotengruppen führt. Eine mögliche Lösung dieses Problems ist die Positionierung von zusätzlichen Knoten, welche die Verbindung zwischen den isolierten Partitionen wiederherstellen können. Hauptziele dieser Arbeit sind die Recherche und die Entwicklung von Algorithmen und Methoden zur Positionierung der zusätzlichen Knoten. Der Fokus der Recherche liegt auf Untersuchung der verteilten Algorithmen zur Bestimmung der Positionen für die zusätzlichen Knoten. Die verteilten Algorithmen benutzen nur die Information, welche in einer lokalen Umgebung eines Knotens verfügbar ist, und dadurch entsteht ein selbstorganisierendes System. Jedoch wird das gesamte Netzwerk hier vor allem innerhalb eines ganz speziellen Szenarios - Katastrophenszenario - betrachtet. In einer solchen Situation kann die Information über die Topologie des zu reparierenden Netzwerks im Voraus erfasst werden und soll, natürlich, für die Wiederherstellung mitbenutzt werden. Dank der eventuell verfügbaren zusätzlichen Information können die Positionen für die zusätzlichen Knoten genauer ermittelt werden. Die Arbeit umfasst eine Beschreibung, Implementierungsdetails und eine Evaluierung eines selbstorganisierendes Systems, welche die Netzwerkwiederherstellung in beiden Szenarien ermöglicht.The main research area of the International Graduate School on Mobile Communication (GS Mobicom) at Ilmenau University of Technology is communication in disaster scenarios. Due to a disaster or an accident, the network infrastructure can be damaged or even completely destroyed. However, available communication networks play a vital role during the rescue activities especially for the coordination of the rescue teams and for the communication between their members. Such a communication service can be provided by a Mobile Ad-Hoc Network (MANET). One of the typical problems of a MANET is network partitioning, when separate groups of nodes become isolated from each other. One possible solution for this problem is the placement of additional nodes in order to reconstruct the communication links between isolated network partitions. The primary goal of this work is the research and development of algorithms and methods for the placement of additional nodes. The focus of this research lies on the investigation of distributed algorithms for the placement of additional nodes, which use only the information from the nodes’ local environment and thus form a self-organizing system. However, during the usage specifics of the system in a disaster scenario, global information about the topology of the network to be recovered can be known or collected in advance. In this case, it is of course reasonable to use this information in order to calculate the placement positions more precisely. The work provides the description, the implementation details and the evaluation of a self-organizing system which is able to recover from network partitioning in both situations