287 research outputs found

    Wireless Sensor Networks

    Get PDF
    The aim of this book is to present few important issues of WSNs, from the application, design and technology points of view. The book highlights power efficient design issues related to wireless sensor networks, the existing WSN applications, and discusses the research efforts being undertaken in this field which put the reader in good pace to be able to understand more advanced research and make a contribution in this field for themselves. It is believed that this book serves as a comprehensive reference for graduate and undergraduate senior students who seek to learn latest development in wireless sensor networks

    Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks Using Rateless Codes

    Full text link
    In this paper, we address the problem of distributing a large amount of bulk data to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using \emph{rateless} coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless codes packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles

    Routing protocol optimization in challenged multihop wireless networks

    Get PDF
    Durant ces derniĂšres annĂ©es, de nombreux travaux de recherches ont Ă©tĂ© menĂ©s dans le domaine des rĂ©seaux multi-sauts sans fil Ă  contraintes (MWNs: Multihop Wireless Networks). GrĂące Ă  l'Ă©volution de la technologie des systĂšmes mico-electro-mĂ©chaniques (MEMS) et, depuis peu, les nanotechnologies, les MWNs sont une solution de choix pour une variĂ©tĂ© de problĂšmes. Le principal avantage de ces rĂ©seaux est leur faible coĂ»t de production qui permet de dĂ©velopper des applications ayant un unique cycle de vie. Cependant, si le coĂ»t de fabrication des nƓuds constituant ce type de rĂ©seaux est assez faible, ces nƓuds sont aussi limitĂ©s en capacitĂ© en termes de: rayon de transmission radio, bande passante, puissance de calcul, mĂ©moire, Ă©nergie, etc. Ainsi, les applications qui visent l'utilisation des MWNs doivent ĂȘtre conçues avec une grande prĂ©caution, et plus spĂ©cialement la conception de la fonction de routage, vu que les communications radio constituent la tĂąche la plus consommatrice d'Ă©nergie.Le but de cette thĂšse est d'analyser les diffĂ©rents dĂ©fis et contraintes qui rĂ©gissent la conception d'applications utilisant les MWNs. Ces contraintes se rĂ©partissent tout le long de la pile protocolaire. On trouve au niveau application des contraintes comme: la qualitĂ© de service, la tolĂ©rance aux pannes, le modĂšle de livraison de donnĂ©es au niveau application, etc. Au niveau rĂ©seau, on peut citer les problĂšmes de la dynamicitĂ© de la topologie rĂ©seau, la prĂ©sence de trous, la mobilitĂ©, etc. Nos contributions dans cette thĂšse sont centrĂ©es sur l'optimisation de la fonction de routage en considĂ©rant les besoins de l'application et les contraintes du rĂ©seau. PremiĂšrement, nous avons proposĂ© un protocole de routage multi-chemin "en ligne" pour les applications orientĂ©es QoS utilisant des rĂ©seaux de capteurs multimĂ©dia. Ce protocole repose sur la construction de multiples chemins durant la transmission des paquets vers leur destination, c'est-Ă -dire sans dĂ©couverte et construction des routes prĂ©alables. En permettant des transmissions parallĂšles, ce protocole amĂ©liore la transmission de bout-en-bout en maximisant la bande passante du chemin agrĂ©gĂ© et en minimisant les dĂ©lais. Ainsi, il permet de rĂ©pondre aux exigences des applications orientĂ©es QoS.DeuxiĂšmement, nous avons traitĂ© le problĂšme du routage dans les rĂ©seaux mobiles tolĂ©rants aux dĂ©lais. Nous avons commencĂ© par Ă©tudier la connectivitĂ© intermittente entre les diffĂ©rents et nous avons extrait un modĂšle pour les contacts dans le but pouvoir prĂ©dire les future contacts entre les nƓuds. En se basant sur ce modĂšle, nous avons proposĂ© un protocole de routage, qui met Ă  profit la position gĂ©ographique des nƓuds, leurs trajectoires, et la prĂ©diction des futurs contacts dans le but d'amĂ©liorer les dĂ©cisions de routage. Le protocole proposĂ© permet la rĂ©duction des dĂ©lais de bout-en-bout tout en utilisant d'une maniĂšre efficace les ressources limitĂ©es des nƓuds que ce soit en termes de mĂ©moire (pour le stockage des messages dans les files d'attentes) ou la puissance de calcul (pour l'exĂ©cution de l'algorithme de prĂ©diction).Finalement, nous avons proposĂ© un mĂ©canisme de contrĂŽle de la topologie avec un algorithme de routage des paquets pour les applications orientĂ©s Ă©vĂšnement et qui utilisent des rĂ©seaux de capteurs sans fil statiques. Le contrĂŽle de la topologie est rĂ©alisĂ© Ă  travers l'utilisation d'un algorithme distribuĂ© pour l'ordonnancement du cycle de service (sleep/awake). Les paramĂštres de l'algorithme proposĂ© peuvent ĂȘtre rĂ©glĂ©s et ajustĂ©s en fonction de la taille du voisinage actif dĂ©sirĂ© (le nombre moyen de voisin actifs pour chaque nƓud). Le mĂ©canisme proposĂ© assure un compromis entre le dĂ©lai pour la notification d'un Ă©vĂ©nement et la consommation d'Ă©nergie globale dans le rĂ©seau.Great research efforts have been carried out in the field of challenged multihop wireless networks (MWNs). Thanks to the evolution of the Micro-Electro-Mechanical Systems (MEMS) technology and nanotechnologies, multihop wireless networks have been the solution of choice for a plethora of problems. The main advantage of these networks is their low manufacturing cost that permits one-time application lifecycle. However, if nodes are low-costly to produce, they are also less capable in terms of radio range, bandwidth, processing power, memory, energy, etc. Thus, applications need to be carefully designed and especially the routing task because radio communication is the most energy-consuming functionality and energy is the main issue for challenged multihop wireless networks.The aim of this thesis is to analyse the different challenges that govern the design of challenged multihop wireless networks such as applications challenges in terms of quality of service (QoS), fault-tolerance, data delivery model, etc., but also networking challenges in terms of dynamic network topology, topology voids, etc. Our contributions in this thesis focus on the optimization of routing under different application requirements and network constraints. First, we propose an online multipath routing protocol for QoS-based applications using wireless multimedia sensor networks. The proposed protocol relies on the construction of multiple paths while transmitting data packets to their destination, i.e. without prior topology discovery and path establishment. This protocol achieves parallel transmissions and enhances the end-to-end transmission by maximizing path bandwidth and minimizing the delays, and thus meets the requirements of QoS-based applications. Second, we tackle the problem of routing in mobile delay-tolerant networks by studying the intermittent connectivity of nodes and deriving a contact model in order to forecast future nodes' contacts. Based upon this contact model, we propose a routing protocol that makes use of nodes' locations, nodes' trajectories, and inter-node contact prediction in order to perform forwarding decisions. The proposed routing protocol achieves low end-to-end delays while using efficiently constrained nodes' resources in terms of memory (packet queue occupancy) and processing power (forecasting algorithm). Finally, we present a topology control mechanism along a packet forwarding algorithm for event-driven applications using stationary wireless sensor networks. Topology control is achieved by using a distributed duty-cycle scheduling algorithm. Algorithm parameters can be tuned according to the desired node's awake neighbourhood size. The proposed topology control mechanism ensures trade-off between event-reporting delay and energy consumption.BORDEAUX1-Bib.electronique (335229901) / SudocSudocFranceF

    Application-Aware Cross-Layer Framework for Wireless Multihop Networks

    Get PDF
    Current and future mobile and social communications require a rethinking in the development of wireless communication. Optimizing the radio transmission method is not going to scale with the ever increasing user demands. The future internet requires a wireless communication network which can adapt seamlessly to changing environments and service requirements. Especially, service requirements driven by user demand and expanding user device diversity raise a key challenge with respect to content distribution. In this work, research is conducted to improve wireless communication by considering four main aspects: The first aspect is to build a multi layer solution, instead of a conventional single layer solution to achieve higher throughput gains. Here, the physical layer, the medium access layer and the network layer are studied together to utilize capabilities across all these three layers. Thus, a unified graph model is formulated to adapt available mechanisms on the lower three layers in a joint manner. The second aspect is to envision a wireless multihop network which can scale with the increasing number of mobile devices. On the one hand, the number of mobile devices is ever increasing and so is the density of mobile devices in any given network. On the other hand, the requirements and capabilities of mobile devices are becoming more diverse and hence the heterogeneity in a wireless network is growing. This leads to the conclusion that a wireless multihop network is more future proof compared to a wireless network composed only of several base stations. Therefore, the research is focused on wireless multihop scenarios where multiple wireless devices form the network and communication between them occurs over multiple hops. The third aspect is to incorporate different requirements of applications and capabilities of applications. The plethora of applications used in wireless networks come with different sets of requirements, e.g. bandwidth, and capabilities, e.g. adaption of the video quality. Taking into account these requirements and capabilities in addition to a multi layer solution can further increase the performance. In this work, the requirements and capabilities of adaptive video streaming are integrated into an application-aware cross-layer framework. More precisely, scalable video coding and dynamic adaptive streaming over HTTP are integrated into the aforementioned framework. The novel application-aware cross-layer framework adapts network support structures at the network layer, performs resource allocation at the medium access layer, switches between communication types at the physical layer and takes into account the capabilities and requirements of applications, e.g. adaptive video-streaming, at the application layer. The fourth aspect is to utilize aggregation of distributed content, where content is cached over the whole network and can than be aggregated to be consumed by users in the network. Recent research shows promising gains achievable when content is cached at mobile devices, but mostly for single hop wireless networks. Hence, the impact of mobile content caching where popular content is cached and aggregated over multiple devices in a network is investigated in this work. In more detail, a content delivery framework which jointly exploits content already cached at mobile devices as well as switching between mechanisms at the physical layer and the network layer in order to optimally deliver the content to all destinations under changing network conditions is proposed

    A Gossip-based optimistic replication for efficient delay-sensitive streaming using an interactive middleware support system

    Full text link
    While sharing resources the efficiency is substantially degraded as a result of the scarceness of availability of the requested resources in a multiclient support manner. These resources are often aggravated by many factors like the temporal constraints for availability or node flooding by the requested replicated file chunks. Thus replicated file chunks should be efficiently disseminated in order to enable resource availability on-demand by the mobile users. This work considers a cross layered middleware support system for efficient delay-sensitive streaming by using each device's connectivity and social interactions in a cross layered manner. The collaborative streaming is achieved through the epidemically replicated file chunk policy which uses a transition-based approach of a chained model of an infectious disease with susceptible, infected, recovered and death states. The Gossip-based stateful model enforces the mobile nodes whether to host a file chunk or not or, when no longer a chunk is needed, to purge it. The proposed model is thoroughly evaluated through experimental simulation taking measures for the effective throughput Eff as a function of the packet loss parameter in contrast with the effectiveness of the replication Gossip-based policy.Comment: IEEE Systems Journal 201
    • 

    corecore