Anycast services and its applications

Anycast in next generation Internet Protocol is a hot topic in the research of computer networks. It has promising potentials and also many challenges, such as architecture, routing, Quality-of-Service, anycast in ad hoc networks, application-layer anycast, etc. In this thesis, we tackle some important topics among them. The thesis at first presents an introduction about anycast, followed by the related work. Then, as our major contributions, a number of challenging issues are addressed in the following chapters. We tackled the anycast routing problem by proposing a requirement based probing algorithm at application layer for anycast routing. Compared with the existing periodical based probing routing algorithm, the proposed routing algorithm improves the performance in terms of delay. We addressed the reliable service problem by the design of a twin server model for the anycast servers, providing a transparent and reliable service for all anycast queries. We addressed the load balance problem of anycast servers by proposing new job deviation strategies, to provide a similar Quality-of-Service to all clients of anycast servers. We applied the mesh routing methodology in the anycast routing in ad hoc networking environment, which provides a reliable routing service and uses much less network resources. We combined the anycast protocol and the multicast protocol to provide a bidirectional service, and applied the service to Web-based database applications, achieving a better query efficiency and data synchronization. Finally, we proposed a new Internet based service, minicast, as the combination of the anycast and multicast protocols. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. We show that the minicast service consumes less network resources while providing the same services. The last chapter of the thesis presents the conclusions and discusses the future work

Internet protocol over wireless sensor networks, from myth to reality

Internet Protocol (IP) is a standard network layer protocol of the Internet architecture, allowing communication among heterogeneous networks. For a given network to be accessible from the Internet it must have a router that complies with this protocol. Wireless sensor networks have many smart sensing nodes with computational, communication and sensing capabilities. Such smart sensors cooperate to gather relevant data and present it to the user. The connection of sensor networks and the Internet has been realized using gateway or proxy- based approaches. Historically, several routing protocols were specifically created, discarding IP. However, recent research, prototypes and even implementation tools show that it is possible to combine the advantages of IP access with sensor networks challenges, with a major contribution from the 6LoWPAN Working Group. This paper presents the advantages and challenges of IP on sensor networks, surveys the state-of-art with some implementation examples, and points further research topics in this area

Contention techniques for opportunistic communication in wireless mesh networks

Auf dem Gebiet der drahtlosen Kommunikation und insbesondere auf den tieferen Netzwerkschichten sind gewaltige Fortschritte zu verzeichnen. Innovative Konzepte und Technologien auf der physikalischen Schicht (PHY) gehen dabei zeitnah in zelluläre Netze ein. Drahtlose Maschennetzwerke (WMNs) können mit diesem Innovationstempo nicht mithalten. Die Mehrnutzer-Kommunikation ist ein Grundpfeiler vieler angewandter PHY Technologien, die sich in WMNs nur ungenügend auf die etablierte Schichtenarchitektur abbilden lässt. Insbesondere ist das Problem des Scheduling in WMNs inhärent komplex. Erstaunlicherweise ist der Mehrfachzugriff mit Trägerprüfung (CSMA) in WMNs asymptotisch optimal obwohl das Verfahren eine geringe Durchführungskomplexität aufweist. Daher stellt sich die Frage, in welcher Weise das dem CSMA zugrunde liegende Konzept des konkurrierenden Wettbewerbs (engl. Contention) für die Integration innovativer PHY Technologien verwendet werden kann. Opportunistische Kommunikation ist eine Technik, die die inhärenten Besonderheiten des drahtlosen Kanals ausnutzt. In der vorliegenden Dissertation werden CSMA-basierte Protokolle für die opportunistische Kommunikation in WMNs entwickelt und evaluiert. Es werden dabei opportunistisches Routing (OR) im zustandslosen Kanal und opportunistisches Scheduling (OS) im zustandsbehafteten Kanal betrachtet. Ziel ist es, den Durchsatz von elastischen Paketflüssen gerecht zu maximieren. Es werden Modelle für Überlastkontrolle, Routing und konkurrenzbasierte opportunistische Kommunikation vorgestellt. Am Beispiel von IEEE 802.11 wird illustriert, wie der schichtübergreifende Entwurf in einem Netzwerksimulator prototypisch implementiert werden kann. Auf Grundlage der Evaluationsresultate kann der Schluss gezogen werden, dass die opportunistische Kommunikation konkurrenzbasiert realisierbar ist. Darüber hinaus steigern die vorgestellten Protokolle den Durchsatz im Vergleich zu etablierten Lösungen wie etwa DCF, DSR, ExOR, RBAR und ETT.In the field of wireless communication, a tremendous progress can be observed especially at the lower layers. Innovative physical layer (PHY) concepts and technologies can be rapidly assimilated in cellular networks. Wireless mesh networks (WMNs), on the other hand, cannot keep up with the speed of innovation at the PHY due to their flat and decentralized architecture. Many innovative PHY technologies rely on multi-user communication, so that the established abstraction of the network stack does not work well for WMNs. The scheduling problem in WMNs is inherent complex. Surprisingly, carrier sense multiple access (CSMA) in WMNs is asymptotically utility-optimal even though it has a low computational complexity and does not involve message exchange. Hence, the question arises whether CSMA and the underlying concept of contention allows for the assimilation of advanced PHY technologies into WMNs. In this thesis, we design and evaluate contention protocols based on CSMA for opportunistic communication in WMNs. Opportunistic communication is a technique that relies on multi-user diversity in order to exploit the inherent characteristics of the wireless channel. In particular, we consider opportunistic routing (OR) and opportunistic scheduling (OS) in memoryless and slow fading channels, respectively. We present models for congestion control, routing and contention-based opportunistic communication in WMNs in order to maximize both throughput and fairness of elastic unicast traffic flows. At the instance of IEEE 802.11, we illustrate how the cross-layer algorithms can be implemented within a network simulator prototype. Our evaluation results lead to the conclusion that contention-based opportunistic communication is feasible. Furthermore, the proposed protocols increase both throughput and fairness in comparison to state-of-the-art approaches like DCF, DSR, ExOR, RBAR and ETT

Distributed aop middleware for large-scale scenarios

En aquesta tesi doctoral presentem una proposta de middleware distribuït pel desenvolupament d'aplicacions de gran escala. La nostra motivació principal és permetre que les responsabilitats distribuïdes d'aquestes aplicacions, com per exemple la replicació, puguin integrar-se de forma transparent i independent. El nostre enfoc es basa en la implementació d'aquestes responsabilitats mitjançant el paradigma d'aspectes distribuïts i es beneficia dels substrats de les xarxes peer-to-peer (P2P) i de la programació orientada a aspectes (AOP) per realitzar-ho de forma descentralitzada, desacoblada, eficient i transparent. La nostra arquitectura middleware es divideix en dues capes: un model de composició i una plataforma escalable de desplegament d'aspectes distribuïts. Per últim, es demostra la viabilitat i aplicabilitat del nostre model mitjançant la implementació i experimentació de prototipus en xarxes de gran escala reals.In this PhD dissertation we present a distributed middleware proposal for large-scale application development. Our main aim is to separate the distributed concerns of these applications, like replication, which can be integrated independently and transparently. Our approach is based on the implementation of these concerns using the paradigm of distributed aspects. In addition, our proposal benefits from the peer-to-peer (P2P) networks and aspect-oriented programming (AOP) substrates to provide these concerns in a decentralized, decoupled, efficient, and transparent way. Our middleware architecture is divided into two layers: a composition model and a scalable deployment platform for distributed aspects. Finally, we demonstrate the viability and applicability of our model via implementation and experimentation of prototypes in real large-scale networks

Improving Content Delivery and Service Discovery in Networks

Production and consumption of multimedia content on the Internet is rising, fueled by the demand for content from services such as YouTube, Netflix and Facebook video. The Internet is shifting from host-based to content-centric networking. At the same time, users are shifting away from a homogeneous desktop computing environment to using a heterogeneous mix of devices, such as smartphones, tablets and thin clients, all of which allow users to consume data on the move using wireless and cellular data networks. The popularity of these new class of devices has, in turn, increased demand for multimedia content by mobile users. The emergence of rich Internet applications and the widespread adoption and use of High Definition (HD) video has also placed higher pressure on the service providers and the core Internet backbone, forcing service providers to respond to increased bandwidth use in such networks. In my thesis, I aim to provide clarity and insight into the usage of core networking protocols and multimedia consumption on both mobile and wireless networks, as well as the network core. I also present research prototypes for potential solutions to some of the problems caused by the increased multimedia consumption on the Internet

QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK

A Wireless Sensor Networks (WSN) is composed of a large number of low-powered sensor nodes that are randomly deployed to collect environmental data. In a WSN, because of energy scarceness, energy efficient gathering of sensed information is one of the most critical issues. Thus, most of the WSN routing protocols found in the literature have considered energy awareness as a key design issue. Factors like throughput, latency and delay are not considered as critical issues in these protocols. However, emerging WSN applications that involve multimedia and imagining sensors require end-to-end delay within acceptable limits. Hence, in addition to energy efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have now become issues of primary concern. Such performance metrics are usually referred to as the Quality of Service (QoS) in communication systems. Therefore, to have efficient use of a sensor node’s energy, and the ability to transmit the imaging and multimedia data in a timely manner, requires both a QoS based and energy efficient routing protocol. In this research work, a QoS based energy efficient routing protocol for WSN is proposed. To achieve QoS based energy efficient routing, three protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC) for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a Clustered WSN. Firstly, in the QoSEC, to achieve energy efficiency and to prolong network/coverage lifetime, some nodes with additional energy resources, termed as super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster head (normal node) at the middle tier, and cluster member (normal node) at the lowest tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the network/coverage lifetime through a cluster-head-selection algorithm and a sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs network/coverage lifetime. Secondly, the QoSES addressed the delay-minimization problem in sleep/wake scheduling for event-driven sensor networks for delay-sensitive applications. For this purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to potential overloaded nodes, according to their varied traffic load requirement defined a) by node position in the network, b) by node topological importance, and c) by handling burst traffic in the proximity of the event occurrence node. Using these heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and ultimately reduces end-to-end delay while maximizing the throughput. Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS assurance. To address hot-spot problem, mobile sink is used, that move in the network to gather data by virtue of which nodes near to the mobile sink changes with each movement, consequently hot spot problem is minimized. To achieve delay minimization, static sink is used in addition to the mobile sink. Delay sensitive data is forwarded to the static sink, while the delay tolerant data is sent through the mobile sink. For QoS assurance, incoming traffic is divided into different traffic classes and each traffic class is assigned different priority based on their QoS requirement (bandwidth, delay) determine by its message type and content. Furthermore, to minimize delay in mobile sink data gathering, the mobile sink is moved throughout the network based on the priority messages at the nodes. Using these heuristics, QoSEM incur less end-to-end delay, is energy efficient, as well as being able to ensure QoS. Simulations are carried out to evaluate the performance of the proposed protocols of QoSEC, QoSES and QoSEM, by comparing their performance with the established contemporary protocols. Simulation results have demonstrated that when compared with contemporary protocols, each of the proposed protocol significantly prolong the network and coverage lifetime, as well as improve the other QoS routing parameters, such as delay, packet loss ratio, and throughput

Location-aware service discovery on IPv6 GeoNetworking for VANET

Conference is technically co-sponsored by IEEE Communications Society and co-organized by the Technical Sub-Committee on Vehicular Networks and Telematics (VNAT)International audienceService discovery is an essential component for applications in vehicular communication systems. While there have been numerous service discovery protocols dedicated to a local network, mobile ad-hoc networks and the Internet, in vehicular communication systems, applications pose additional requirements; They need to discover services according to geo- graphical position. In this paper, we propose a location-aware service discovery mechanism for Vehicular Ad-hoc NETwork (VANET). The proposed mechanism exploits IPv6 multicast on top of IPv6 GeoNetworking specified by the GeoNet project. Thanks to the GeoBroadcast mechanism, it efficiently propagates service discovery messages to a subset of nodes inside a relevant geographical area with encapsulating IPv6 multicast packets. We implemented the mechanism using CarGeo6, an open source implementation of IPv6 GeoNetworking. Our real field evaluation shows the system can discover services with low latency and low bandwidth usage in VANETs