Routing Protocols for Underwater Acoustic Sensor Networks: A Survey from an Application Perspective

Underwater acoustic communications are different from terrestrial radio communications; acoustic channel is asymmetric and has large and variable end‐to‐end propagation delays, distance‐dependent limited bandwidth, high bit error rates, and multi‐path fading. Besides, nodes’ mobility and limited battery power also cause problems for networking protocol design. Among them, routing in underwater acoustic networks is a challenging task, and many protocols have been proposed. In this chapter, we first classify the routing protocols according to application scenarios, which are classified according to the number of sinks that an underwater acoustic sensor network (UASN) may use, namely single‐sink, multi‐sink, and no‐sink. We review some typical routing strategies proposed for these application scenarios, such as cross‐layer and reinforcement learning as well as opportunistic routing. Finally, some remaining key issues are highlighted

Advances in Computer Science and Engineering

The book Advances in Computer Science and Engineering constitutes the revised selection of 23 chapters written by scientists and researchers from all over the world. The chapters cover topics in the scientific fields of Applied Computing Techniques, Innovations in Mechanical Engineering, Electrical Engineering and Applications and Advances in Applied Modeling

An energy efficient interference-aware routing protocol for underwater WSNs

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay

Prévision du temps de vie du lien pour améliorer la stabilité de routage dans les réseaux Ad hoc

Les réseaux MANETs {Mobile Ad hoc NETworks) ont été le sujet de nombreux travaux de recherche au cours des dernières années. Ces recherches ont couvert plusieurs aspects tels que la qualité de service, les problèmes de routage et le problème d'accès au niveau de la couche MAC, mais bien d'autres ont essayé de résoudre ces problématiques avec une approche plus globale et ceci en diminuant l'importance de l'indépendance des couches pour introduire la collaboration entre les couches {cross-layer). La variation constante de la qualité des liens entre les noeuds, suite au mouvement des noeuds, est un des principaux problèmes dans les MANETs. En effet, de nombreuses approches ont été développées pour prédire la qualité de lien, les modèles de mouvement et aussi le temps de rupture. Nous proposons l'intégration de deux méthodes mathématiques de prédiction de temps de vie de lien en utilisant le Global Posisioning System (GPS), la puissance du signal ou les deux systèmes en même temps. Ce qui nous ramène à trois implantations différentes. Le but est de permettre aux noeuds ad hoc de tirer avantage des technologies et outils qui existent sur le marché pour prédire le temps de connectivité restant avec leurs voisins. Dynamic Source Routing (DSR) est notre choix du protocole de routage du réseau ad hoc. Par conséquent, nous avons comparé quatre variantes du protocole DSR, notant qu'il est toujours possible d'utiliser les méthodes avec tout autre protocole de routage tout en prenant compte des spécificités de chacun. Pour tester les propositions, une simulation d'un réseau MANET est de loin meilleure à une étude mathématique ou purement théorique. Pour cette raison le simulateur OPNET a été utilisé pour l'implantation de différentes méthodes de prédiction de temps de vie de lien, a fin de comparer les performances des MANETs avec les différentes variantes du protocole DSR. À travers des simulations sous OPNET, nous montrons l'avantage des approches implantées par rapport à la version originale du protocole DSR et le paramètre qui permet de maximiser les performances des réseaux MANETs

Simulation and optimization of a multi-agent system on physical internet enabled interconnected urban logistics.

An urban logistics system is composed of multiple agents, e.g., shippers, carriers, and distribution centers, etc., and multi-modal networks. The structure of Physical Internet (PI) transportation network is different from current logistics practices, and simulation can effectively model a series of PI-approach scenarios. In addition to the baseline model, three more scenarios are enacted based on different characteristics: shared trucks, shared hubs, and shared flows with other less-than-truckload shipments passing through the urban area. Five performance measures, i.e., truck distance per container, mean truck time per container, lead time, CO2 emissions, and transport mean fill rate, are included in the proposed procedures using real data in an urban logistics case. The results show that PI enables a significant improvement of urban transportation efficiency and sustainability. Specifically, truck time per container reduces 26 percent from that of the Private Direct scenario. A 42 percent reduction of CO2 emissions is made from the current logistics practice. The fill rate of truckload is increased by almost 33 percent, whereas the relevant longer distance per container and the lead time has been increased by an acceptable range. Next, the dissertation applies an auction mechanism in the PI network. Within the auction-based transportation planning approach, a model is developed to match the requests and the transport services in transport marketplaces and maximize the carriers’ revenue. In such transportation planning under the protocol of PI, it is a critical system design problem for decision makers to understand how various parameters through interactions affect this multi-agent system. This study provides a comprehensive three-layer structure model, i.e. agent-based simulation, auction mechanism, and optimization via simulation. In term of simulation, a multi-agent model simulates a complex PI transportation network in the context of sharing economy. Then, an auction mechanism structure is developed to demonstrate a transport selection scheme. With regard of an optimization via simulation approach and sensitivity analysis, it has been provided with insights on effects of combination of decision variables (i.e. truck number and truck capacity) and parameters settings, where results can be drawn by using a case study in an urban freight transportation network. In the end, conclusions and discussions of the studies have been summarized. Additionally, some relevant areas are required for further elaborate research, e.g., operational research on airport gate assignment problems and the simulation modelling of air cargo transportation networks. Due to the complexity of integration with models, I relegate those for future independent research

A Local Approach to Fast Failure Recovery of LISP Ingress Tunnel Routers

Part 8: LISP and Multi-domain RoutingInternational audienceLISP (Locator/ID Separation Protocol) has been proposed as a future Internet architecture in order to solve the scalability issues the current architecture is facing. LISP tunnels packets between border routers, which are the locators of the non-globally routable identifiers associated to end-hosts. In this context, the encapsulating routers, which are called Ingress Tunnel Routers (ITR) and learn dynamically identifier-to-locators mappings needed for the encapsulation, can cause severe and long lasting traffic disruption upon failure. In this paper, thanks to real traffic traces, we first explore the impact of ITR failures on ongoing traffic. Our measurements confirm that the failure of an ITR can have severe impact on traffic. We then propose and evaluate an ITR synchronization mechanism to locally protect ITRs, achieving disruptionless traffic redirection. We finally explore how to minimize the number of ITRs to synchronize in large networks

Architectures and protocols for sub-wavelength optical networks: contributions to connectionless and connection-oriented data transport

La ràpida evolució d’Internet i l’àmplia gamma de noves aplicacions (per exemple, multimèdia, videoconferència, jocs en línia, etc.) ha fomentat canvis revolucionaris en la manera com ens comuniquem. A més, algunes d’aquestes aplicacions demanden grans quantitats de recursos d’ample de banda amb diversos requeriments de qualitat de servei (QoS). El desenvolupament de la multiplexació per divisió de longitud d’ona (WDM) en els anys noranta va fer molt rendible la disponibilitat d’ample de banda. Avui dia, les tecnologies de commutació òptica de circuits són predominants en el nucli de la xarxa, les quals permeten la configuració de canals (lightpaths) a través de la xarxa. No obstant això, la granularitat d’aquests canals ocupa tota la longitud d’ona, el que fa que siguin ineficients per a proveir canals de menor ample de banda (sub-longitud d’ona). Segons la comunitat científica, és necessari augmentar la transparència dels protocols, així com millorar l’aprovisionament d’ample de banda de forma dinàmica. Per tal de fer això realitat, és necessari desenvolupar noves arquitectures. La commutació òptica de ràfegues i de paquets (OBS/OPS), són dues de les tecnologies proposades. Aquesta tesi contribueix amb tres arquitectures de xarxa destinades a millorar el transport de dades sub-longitud d’ona. En primer lloc, aprofundim en la naturalesa sense connexió en OBS. En aquest cas, la xarxa incrementa el seu dinamisme a causa de les transmissions a ràfega. A més, les col·lisions entre ràfegues degraden el rendiment de la xarxa fins i tot a càrregues molt baixes. Per fer front a aquestes col·lisions, es proposa un esquema de resolució de col·lisions pro actiu basat en un algorisme d’encaminament i assignació de longitud d’ona (RWA) que balanceja de forma automàtica i distribuïda la càrrega en la xarxa. En aquest protocol, el RWA i la transmissió de ràfegues es basen en l’explotació i exploració de regles de commutació que incorporen informació sobre contencions i encaminament. Per donar suport a aquesta arquitectura, s’utilitzen dos tipus de paquets de control per a l’encaminament de les ràfegues i l’actualització de les regles de commutació, respectivament. Per analitzar els beneficis del nou algorisme, s’utilitzen quatre topologies de xarxa diferents. Els resultats indiquen que el mètode proposat millora en diferents marges la resta d’algorismes RWA en funció de la topologia i sense penalitzar altres paràmetres com el retard extrem a extrem. La segona contribució proposa una arquitectura híbrida sense i orientada a connexió sobre la base d’un protocol de control d’accés al medi (MAC) per a xarxes OBS (DAOBS). El MAC ofereix dos mètodes d’accés: arbitratge de cua (QA) per a la transmissió de ràfegues sense connexió, i pre-arbitratge (PA) per serveis TDM orientats a connexió. Aquesta arquitectura permet una àmplia gamma d’aplicacions sensibles al retard i al bloqueig. Els resultats avaluats a través de simulacions mostren que en l’accés QA, les ràfegues de més alta prioritat tenen garantides zero pèrdues i latències d’accés molt baixes. Pel que fa a l’accés PA, es reporta que la duplicació de la càrrega TDM augmenta en més d’un ordre la probabilitat de bloqueig, però sense afectar en la mateixa mesura les ràfegues sense connexió. En aquest capítol també es tracten dos dels problemes relacionats amb l’arquitectura DAOBS i el seu funcionament. En primer lloc, es proposa un model matemàtic per aproximar el retard d’accés inferior i superior com a conseqüència de l’accés QA. En segon lloc, es formula matemàticament la generació i optimització de les topologies virtuals que suporten el protocol per a l’escenari amb tràfic estàtic. Finalment, l’última contribució explora els beneficis d’una arquitectura de xarxa òptica per temps compartit (TSON) basada en elements de càlcul de camins (PCE) centralitzats per tal d’evitar col·lisions en la xarxa. Aquesta arquitectura permet garantir l’aprovisionament orientat a connexió de canals sub-longitud d’ona. En aquest capítol proposem i simulem tres arquitectures GMPLS/PCE/TSON. A causa del enfocament centralitzat, el rendiment de la xarxa depèn en gran mesura de l’assignació i aprovisionament de les connexions. Amb aquesta finalitat, es proposen diferents algorismes d’assignació de ranures temporals i es comparen amb les corresponents formulacions de programació lineal (ILP) per al cas estàtic. Per al cas de tràfic dinàmic, proposem i avaluem mitjançant simulació diferents heurístiques. Els resultats mostren els beneficis de proporcionar flexibilitat en els dominis temporal i freqüencial a l’hora d’assignar les ranures temporals.The rapid evolving Internet and the broad range of new data applications (e.g., multimedia, video-conference, online gaming, etc.) is fostering revolutionary changes in the way we communicate. In addition, some of these applications demand for unprecedented amounts of bandwidth resources with diverse quality of service (QoS). The development of wavelength division multiplexing (WDM) in the 90's made very cost-effective the availability of bandwidth. Nowadays, optical circuit switching technologies are predominant in the core enabling the set up of lightpaths across the network. However, full-wavelength lightpath granularity is too coarse, which results to be inefficient for provisioning sub-wavelength channels. As remarked by the research community, an open issue in optical networking is increasing the protocol transparency as well as provisioning true dynamic bandwidth allocation at the network level. To this end, new architectures are required. Optical burst/packet switching (OBS/OPS) are two such proposed technologies under investigation. This thesis contributes with three network architectures which aim at improving the sub-wavelength data transport from different perspectives. First, we gain insight into the connectionless nature of OBS. Here, the network dynamics are increased due to the short-lived burst transmissions. Moreover, burst contentions degrade the performance even at very low loads. To cope with them, we propose a proactive resolution scheme by means of a distributed auto load-balancing routing and wavelength assignment (RWA) algorithm for wavelength-continuity constraint networks. In this protocol, the RWA and burst forwarding is based on the exploitation and exploration of switching rule concentration values that incorporate contention and forwarding desirability information. To support such architecture, forward and backward control packets are used in the burst forwarding and updating rules, respectively. In order to analyze the benefits of the new algorithm, four different network topologies are used. Results indicate that the proposed method outperforms the rest of tested RWA algorithms at various margins depending on the topology without penalizing other parameters such as end-to-end delay. The second contribution proposes a hybrid connectionless and connection-oriented architecture based on a medium access control (MAC) protocol for OBS networks (DAOBS). The MAC provides two main access mechanisms: queue arbitrated (QA) for connectionless bursts and pre-arbitrated (PA) for TDM connection-oriented services. Such an architecture allows for a broad range of delay-sensitive applications or guaranteed services. Results evaluated through simulations show that in the QA access mode highest priority bursts are guaranteed zero losses and very low access latencies. Regarding the PA mode, we report that doubling the offered TDM traffic load increases in more than one order their connection blocking, slightly affecting the blocking of other connectionless bursts. In this chapter, we also tackle two of the issues related with the DAOBS architecture and its operation. Firstly, we model mathematically the lower and upper approximations of the access delay as a consequence of the connectionless queue arbitrated access. Secondly, we formulate the generation of the virtual light-tree overlay topology for the static traffic case.Postprint (published version