The Multipath Fault-Tolerant Protocol for Routing in Packet-Switched Communication Network

In order to provide improved service quality to applications, networks need to address the need for reliability of data delivery. Reliability can be improved by incorporating fault tolerance into network routing, wherein a set of multiple routes are used for routing between a given source and destination. This thesis proposes a new fault-tolerant protocol, called the Multipath Fault Tolerant Protocol for Routing (MFTPR), to improve the reliability of network routing services. The protocol is based on a multipath discovery algorithm, the Quasi-Shortest Multipath (QSMP), and is designed to work in conjunction with the routing protocol employed by the network. MFTPR improves upon the QSMP algorithm by finding more routes than QSMP, and also provides for maintenance of these routes in the event of failure of network components. In order to evaluate the resilience of a pair of paths to failure, this thesis proposes metrics that evaluate the non-disjointness of a pair of paths and measure the probability of simultaneous failure of these paths. The performance of MFTPR to find alternate routes based on these metrics is analyzed through simulation

Medium access control, error control and routing in underwater acoustic networks: a discussion on protocol design and implementation

The journey of underwater communication which began from Leonardo’s era took four and a half centuries to find practical applications for military purposes during World War II. However, over the last three decades, underwater acoustic communications witnessed a massive development due to the advancements in the design of underwater communicating peripherals and their supporting protocols. Successively, doors are opened for a wide range of applications to employ in the underwater environment, such as oceanography, pollution monitoring, offshore exploration, disaster prevention, navigation assistance, monitoring, coastal patrol and surveillance. Different applications may have different characteristics and hence, may require different network architectures. For instance, routing protocols designed for unpartitioned multi-hop networks are not suitable for Delay-Tolerant Networks. Furthermore, single-hop networks do not need routing protocols at all. Therefore, before developing a protocol one must study the network architecture properly and design it accordingly. There are several other factors which should also be considered with the network architecture while designing an efficient protocol for underwater networks, such as long propagation delay, limited bandwidth, limited battery power, high bit error rate of the channel and several other adverse properties of the channel, such as, multi-path, fading and refractive behaviors. Moreover, the environment also has an impact on the performance of the protocols designed for underwater networks. Even temperature changes in a single day have an impact on the performance of the protocols. A good protocol designed for any network should consider some or all of these characteristics to achieve better performance. In this thesis, we first discuss the impact of the environment on the performance of MAC and routing protocols. From our investigation, we discover that even temperature changes within a day may affect the sound speed profile and hence, the channel changes and the protocol performance vary. After that we discuss several protocols which are specifically designed for underwater acoustic networks to serve different purposes and for different network architectures. Underwater Selective Repeat (USR) is an error control protocol designed to assure reliable data transmission in the MAC layer. One may suspect that employing an error control technique over a channel which already suffers from long propagation delays is a burden. However, USR utilizes long propagation by transmitting multiple packets in a single RTT using an interlacing technique. After USR, a routing protocol for surveillance networks is discussed where some sensors are laid down at the bottom of the sea and some sinks are placed outside the area. If a sensor detects an asset within its detection range, it announces the presence of intruders by transmitting packets to the sinks. It may happen that the discovered asset is an enemy ship or an enemy submarine which creates noise to jam the network. Therefore, in surveillance networks, it is necessary that the protocols have jamming resistance capabilities. Moreover, since the network supports multiple sinks with similar anycast address, we propose a Jamming Resistance multi-path Multi-Sink Routing Protocol (MSRP) using a source routing technique. However, the problem of source routing is that it suffers from large overhead (every packet includes the whole path information) with respect to other routing techniques, and also suffers from the unidirectional link problem. Therefore, another routing protocol based on a distance vector technique, called Multi-path Routing with Limited Cross-Path Interference (L-CROP) protocol is proposed, which employs a neighbor-aware multi-path discovery algorithm to support low interference multiple paths between each source-destination pair. Following that, another routing protocol is discussed for next generation coastal patrol and surveillance network, called Underwater Delay-Tolerant Network (UDTN) routing where some AUVs carry out the patrolling work of a given area and report to a shore based control-center. Since the area to be patrolled is large, AUVs experience intermittent connectivity. In our proposed protocol, two nodes that understand to be in contact with each other calculate and divide their contact duration equally so that every node gets a fair share of the contact duration to exchange data. Moreover, a probabilistic spray technique is employed to restrict the number of packet transmissions and for error correction a modified version of USR is employed. In the appendix, we discuss a framework which was designed by our research group to realize underwater communication through simulation which is used in most of the simulations in this thesis, called DESERT Underwater (short for DEsign, Simulate, Emulate and Realize Test-beds for Underwater network protocols). It is an underwater extension of the NS-Miracle simulator to support the design and implementation of underwater network protocols. Its creation assists the researchers in to utilizing the same codes designed for the simulator to employ in actual hardware devices and test in the real underwater scenario

Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work

Efficient Route Discovery and Repair in Mobile Ad-hoc Networks

[[abstract]]Building proper routing protocols for a Mobile Ad-hoc Network (MANET) is a critical challenge because (1) flooding route requests often results in broadcast storm (especially when nodes or connections increase) and (2) re-broadcasting route discovery packets to rebuild or repair a broken path (caused by node mobility) will consume more control packets. To solve such broadcast storm and path damage problems, this paper mixes the ideas of multipoint relaying and 2-hop route repair into a new routing protocol suitable for large-scale MANETs. Simulation results show that the new protocol can effectively repair damaged routes at reduced bandwidth consumption.[[conferencetype]]國際[[conferencedate]]20120326~20120329[[iscallforpapers]]Y[[conferencelocation]]Fukuoka, Japa

Secure and Reliable Wireless Communication through End-to-End-based Solution

In the past few decades, network architectures and protocols are often designed to achieve a high throughput and a low latency. Security was rarely considered during the initial design phases. As a result, many network systems are insecure by design. Once they are widely deployed, the inherent vulnerabilities may be difficult to eliminate due to the prohibitive update cost. In this dissertation, we examine such types of vulnerabilities in various networks and design end-to-end-based solutions that allow end systems to address such loopholes. The end-to-end argument was originally proposed to let end hosts implement application-specific functions rather than letting intermediate network nodes (i.e., routers) perform unneeded functions. In this dissertation, we apply the end-to-end principle to address three problems in wireless networks that are caused by design flaw with following reasons: either because integrating solutions into a large number of already deployed intermediate nodes is not a viable option or because end hosts are in a better position to cope with the problems. First, we study the problem of jamming in a multihop wireless network. Jamming attacks are possible because wireless networks communicate over a shared medium. It is easy to launch a jamming attack but is difficult to defend against it. To ensure the end-to-end packet delivery, we propose a jamming-resilient multipath routing algorithm that maximizes end-to-end availability based on the availability history between sources and destinations. Second, we investigate caller ID spoofing attacks in telephone networks in which an attacker can send a fake caller ID to a callee rather than her real one to impersonate as someone else. Such attacks are possible because there is no caller ID authentication mechanism in operator interconnection protocols. Modifying current protocols to verify caller ID between operators may be infeasible due to the scale of deployed systems. So, we propose two schemes to detect caller ID spoofing attacks based on end-to-end verification. Finally, we examine evil twin access point attacks in wireless hotspots. In such attacks, an adversary sets up a phishing access point that has the same Service Set IDentification (SSID) as the legitimate ones in the hotspot. Such attacks are easy to launch because of how 802.11 standards are designed. Existing solutions take away convenience from the user while providing security. Our aim is to detect evil twin access point attacks in wireless hotspots without modifying how access point works in hotspots and without additional infrastructure support. We propose an end-to-end-based mechanism that can effectively detect evil twin access point attacks in wireless hotspots

Integrated Architecture for Configuration and Service Management in MANET Environments

Esta tesis nos ha permitido trasladar algunos conceptos teóricos de la computación ubicua a escenarios reales, identificando las necesidades específicas de diferentes tipos de aplicaciones. Con el fin de alcanzar este objetivo, proponemos dos prototipos que proporcionan servicios sensibles al contexto en diferentes entornos, tales como conferencias o salas de recuperación en hospitales. Estos prototipos experimentales explotan la tecnología Bluetooth para ofrecer información basada en las preferencias del usuario. En ambos casos, hemos llevado a cabo algunos experimentos con el fin de evaluar el comportamiento de los sistemas y su rendimento. También abordamos en esta tesis el problema de la autoconfiguración de redes MANET basadas en el estándar 802.11 a través de dos soluciones novedosas. La primera es una solución centralizada que se basa en la tecnología Bluetooth, mientras la segunda es una solución distribuida que no necesita recurrir a ninguna tecnología adicional, ya que se basa en el uso del parámetro SSID. Ambos métodos se han diseñado para permitir que usuarios no expertos puedan unirse a una red MANET de forma transparente, proporcionando una configuración automática, rápida, y fiable de los terminales. Los resultados experimentales en implementaciones reales nos han permitido evaluar el rendimiento de las soluciones propuestas y demostrar que las estaciones cercanas se pueden configurar en pocos segundos. Además, hemos comparado ambas soluciones entre sí para poner de manifiesto las diferentes ventajas y desventajas en cuanto a rendimento. La principal contribución de esta tesis es EasyMANET, una plataforma ampliable y configurable cuyo objetivo es automatizar lo máximo posible las tareas que afectan a la configuración y puesta en marcha de redes MANET, de modo que su uso sea más simple y accesible.Cano Reyes, J. (2012). Integrated Architecture for Configuration and Service Management in MANET Environments [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/14675Palanci

Survivable Virtual Network Embedding in Transport Networks

Network Virtualization (NV) is perceived as an enabling technology for the future Internet and the 5th Generation (5G) of mobile networks. It is becoming increasingly difficult to keep up with emerging applications’ Quality of Service (QoS) requirements in an ossified Internet. NV addresses the current Internet’s ossification problem by allowing the co-existence of multiple Virtual Networks (VNs), each customized to a specific purpose on the shared Internet. NV also facilitates a new business model, namely, Network-as-a-Service (NaaS), which provides a separation between applications and services, and the networks supporting them. 5G mobile network operators have adopted the NaaS model to partition their physical network resources into multiple VNs (also called network slices) and lease them to service providers. Service providers use the leased VNs to offer customized services satisfying specific QoS requirements without any investment in deploying and managing a physical network infrastructure. The benefits of NV come at additional resource management challenges. A fundamental problem in NV is to efficiently map the virtual nodes and virtual links of a VN to physical nodes and paths, respectively, known as the Virtual Network Embedding (VNE) problem. A VNE that can survive physical resource failures is known as the survivable VNE (SVNE) problem, and has received significant attention recently. In this thesis, we address variants of the SVNE problem with different bandwidth and reliability requirements for transport networks. Specifically, the thesis includes four main contributions. First, a connectivity-aware VNE approach that ensures VN connectivity without bandwidth guarantee in the face of multiple link failures. Second, a joint spare capacity allocation and VNE scheme that provides bandwidth guarantee against link failures by augmenting VNs with necessary spare capacity. Third, a generalized recovery mechanism to re-embed the VNs that are impacted by a physical node failure. Fourth, a reliable VNE scheme with dedicated protection that allows tuning of available bandwidth of a VN during a physical link failure. We show the effectiveness of the proposed SVNE schemes through extensive simulations. We believe that the thesis can set the stage for further research specially in the area of automated failure management for next generation networks

Mobility in wireless sensor networks : advantages, limitations and effects

The primary aim of this thesis is to study the benefits and limitations of using a mobile base station for data gathering in wireless sensor networks. The case of a single mobile base station and mobile relays are considered. A cluster-based algorithm to determine the trajectory of a mobile base station for data gathering within a specified delay time is presented. The proposed algorithm aims for an equal number of sensors in each cluster in order to achieve load balance among the cluster heads. It is shown that there is a tradeoff between data-gathering delay and balancing energy consumption among sensor nodes. An analytical solution to the problem is provided in terms of the speed of the mobile base station. Simulation is performed to evaluate the performance of the proposed algorithm against the static case and to evaluate the distribution of energy consumption among the cluster heads. It is demonstrated that the use of clustering with a mobile base station can improve the network lifetime and that the proposed algorithm balances energy consumption among cluster heads. The effect of the base station velocity on the number of packet losses is studied and highlights the limitation of using a mobile base station for a large-scale network. We consider a scenario where a number of mobile relays roam through the sensing field and have limited energy resources that cannot reach each other directly. A routing scheme based on the multipath protocol is proposed, and explores how the number of paths and spread of neighbour nodes used by the mobile relays to communicate affects the network overhead. We introduce the idea of allowing the source mobile relay to cache multiple routes to the destination through its neighbour nodes in order to provide redundant paths to destination. An analytical model of network overhead is developed and verified by simulation. It is shown that the desirable number of routes is dependent on the velocity of the mobile relays. In most cases the network overhead is minimized when the source mobile relay caches six paths via appropriately distributed neighbours at the destination. A new technique for estimating routing-path hop count is also proposed. An analytical model is provided to estimate the hop count between source-destination pairs in a wireless network with an arbitrary node degree when the network nodes are uniformly distributed in the sensing field. The proposed model is a significant improvement over existing models, which do not correctly address the low-node density situation