Urban flooding is one of the major issues in many parts of the world, and its management is often challenging. One of the challenges highlighted by the hydrology and related communities is the need for more open data and monitoring of floods in space and time. In this paper, we present the development phases and experiments of an Internet of Things (IoT)-based wireless sensor network for hydrometeorological data collection and flood monitoring for the urban area of Colima-Villa de Álvarez in Mexico. The network is designed to collect fluvial water level, soil moisture and weather parameters that are transferred to the server and to a web application in real-time using IoT Message Queuing Telemetry Transport protocol over 3G and Wi-Fi networks. The network is tested during three different events of tropical storms that occurred over the area of Colima during the 2019 tropical cyclones season. The results show the ability of the smart water network to collect real-time hydrometeorological information during extreme events associated with tropical storms. The technology used for data transmission and acquisition made it possible to collect information at critical times for the city. Additionally, the data collected provided essential information for implementing and calibrating hydrological models and hydraulic models to generate flood inundation maps and identify critical infrastructure.

This paper presents a wireless communication protocol based on the Earliest Deadline First policy for wireless body sensor networks. This work advances a previous effort by proposing using an implicit Earliest Deadline First policy to guarantee real-time communication by optimizing network traffic flow, although this strategy may imply using the totality of bandwidth resources. The proposed protocol uses a slotted time-triggered medium access transmission control that is collision-free, even in the presence of hidden nodes. The protocol has been analytically modeled using Colored Petri Networks and Simulated in OPNET.

This chapter proposes a new routing algorithm that allows communication in vehicular ad hoc networks. In vehicular ad hoc networks, the transmitter node cannot determine the immediate future position of the receiving node beforehand. Furthermore, rapid topological changes and limited bandwidth compound the difficulties nodes experience when attempting to exchange position information. The authors first validate their algorithm in a small-scale network with test bed results. Then, for large-scale networks, they compare their protocol with the models of two prominent reactive routing algorithms: Ad-Hoc On-Demand Distance Vector and Dynamic Source Routing on a multi-lane circular dual motorway, representative of motorway driving. Then the authors compare their algorithm with motorway vehicular mobility, a location-based routing algorithm, on a multi-lane circular motorway. This chapter then provides motorway vehicular mobility results of a microscopic traffic model developed in OPNET, which the authors use to evaluate the performance of each protocol in terms of: Route Discovery Time, End to End Delay, Routing Overhead, Overhead, Routing Load, and Delivery Ratio.

No abstract

This paper proposes a new routing algorithm to facilitate communication in highly mobile This paper discusses simulations of 250 vehicles driving on a six-lane circular highway using Location Routing Algorithm with Cluster-Based Flooding (LORA-CBF). Highway vehicular mobility is simulated by a microscopic traffic model, developed in OPNET, to evaluate the performance of the LORA-CBF and Greedy Perimeter Stateless Routing (GPSR) algorithms in terms of Route Discovery Time (RDT), End-to-End Delay (EED), Routing Overhead (RO), Routing Load (RL) and Delivery Ratio (DR).Keywords: Unicast routing, multi-hop wireless networks, inter-vehicular data exchange, ad-hoc networks, location routing algorithm with cluster-based flooding. ResumenEste trabajo presenta un nuevo algoritmo de enrutamiento que permite la comunicación inter-vehicular en redes ad-hoc, las cuales carecen de infraestructura fija y sufren frecuentes cambios topológicos. Este nuevo algoritmo es reactivo y adecuado para la comunicación inter-vehicular y su estrategia de enrutamiento emplea el sistema global GPS, donde el nodo originador del mensaje solicita la posición del nodo destino antes de iniciar la comunicación. La ventaja de este algoritmo es que no requiere un conocimiento global de la red para enviar datos entre el transmisor-receptor; sólo necesita conocer las posiciones relativas de los nodos vecinos y Inves tiga ciones Estudios eRecientes la posición del destino para reducir significativamente la inundación de paquetes de control. Este trabajo simula el comportamiento de 250 vehículos sobre una autopista de tres carriles por dirección, utilizando el algoritmo de enrutamiento geográfico con difusión basada en grupos (LORA-CBF). La movilidad de los vehículos utiliza un algoritmo microscópico que se simula en OPNET. Se compara LORA-CBF con "Greedy Perimeter Stateless Routing" (GPSR) en términos del tiempo de descubrimiento de rutas (RDT), retardo punto a punto (EED), y Sobre-encabezado de enrutamiento para evaluar el algoritmogeográficocondifusiónbasadaengrupos.Descriptores: Enrutamiento con dirección única, redes inalámbricas multisalto, intercambio de datos entre vehículos, redes ad hoc, enrutamiento por localización con difusiónbasadaengrupos.