481 research outputs found
A directional preference ETX measure for the collection tree protocol in mobile sensor networks
There has been a growing interest in Wireless Sensor Networks (WSN) that utilizes mobile nodes for various purposes. These mobile wireless sensor networks tend to suffer from constant link breakages mainly caused by connected nodes moving apart, often moving very quickly. These lost connections require WSNs to constantly repair the network connections; this constant maintenance in turn causes power and packet losses and very noisy network conditions. However a performance extending metric can be implemented in order to reduce the frequency and occurrence of lost links between a parent node and its child. As such a directional preference Estimated Transmissions Count (ETX) measure was developed for the Collection Tree Protocol (CTP) in order to create longer lasting links. This thesis describes and measures the performance of this directional preference ETX measure utilizing various metrics such as Packet Reception Ratio, average number of beacon transmissions per node, Parent changes and various others. The Packet Reception Ratio metric is primarily used to compare this directional preference ETX measure to other popular WSN algorithms such as M-Leach, Geographic Greedy Forwarding and as well regular CTP due to the differences in topology between these algorithms. Based on the packet reception ratio the directional preference ETX measure improves the performance of CTP such that it is capable of outperforming M-Leach in various scenarios
Software Defined Networks based Smart Grid Communication: A Comprehensive Survey
The current power grid is no longer a feasible solution due to
ever-increasing user demand of electricity, old infrastructure, and reliability
issues and thus require transformation to a better grid a.k.a., smart grid
(SG). The key features that distinguish SG from the conventional electrical
power grid are its capability to perform two-way communication, demand side
management, and real time pricing. Despite all these advantages that SG will
bring, there are certain issues which are specific to SG communication system.
For instance, network management of current SG systems is complex, time
consuming, and done manually. Moreover, SG communication (SGC) system is built
on different vendor specific devices and protocols. Therefore, the current SG
systems are not protocol independent, thus leading to interoperability issue.
Software defined network (SDN) has been proposed to monitor and manage the
communication networks globally. This article serves as a comprehensive survey
on SDN-based SGC. In this article, we first discuss taxonomy of advantages of
SDNbased SGC.We then discuss SDN-based SGC architectures, along with case
studies. Our article provides an in-depth discussion on routing schemes for
SDN-based SGC. We also provide detailed survey of security and privacy schemes
applied to SDN-based SGC. We furthermore present challenges, open issues, and
future research directions related to SDN-based SGC.Comment: Accepte
Doctor of Philosophy
dissertationWe develop a novel framework for friend-to-friend (f2f) distributed services (F3DS) by which applications can easily offer peer-to-peer (p2p) services among social peers with resource sharing governed by approximated levels of social altruism. Our frame- work differs significantly from typical p2p collaboration in that it provides a founda- tion for distributed applications to cooperate based on pre-existing trust and altruism among social peers. With the goal of facilitating the approximation of relative levels of altruism among social peers within F3DS, we introduce a new metric: SocialDistance. SocialDistance is a synthetic metric that combines direct levels of altruism between peers with an altruism decay for each hop to approximate indirect levels of altruism. The resulting multihop altruism levels are used by F3DS applications to proportion and prioritize the sharing of resources with other social peers. We use SocialDistance to implement a novel flash file/patch distribution method, SocialSwarm. SocialSwarm uses the SocialDistance metric as part of its resource allocation to overcome the neces- sity of (and inefficiency created by) resource bartering among friends participating in a BitTorrent swarm. We find that SocialSwarm achieves an average file download time reduction of 25% to 35% in comparison with standard BitTorrent under a variety of configurations and conditions, including file sizes, maximum SocialDistance, as well as leech and seed counts. The most socially connected peers yield up to a 47% decrease in download completion time in comparison with average nonsocial BitTorrent swarms. We also use the F3DS framework to implement novel malware detection application- F3DS Antivirus (F3AV)-and evaluate it on the Amazon cloud. We show that with f2f sharing of resources, F3AV achieves a 65% increase in the detection rate of 0- to 1-day-old malware among social peers as compared to the average of individual scanners. Furthermore, we show that F3AV provides the greatest diversity of mal- ware scanners (and thus malware protection) to social hubs-those nodes that are positioned to provide strategic defense against socially aware malware
The Sensor Network Workbench: Towards Functional Specification, Verification and Deployment of Constrained Distributed Systems
As the commoditization of sensing, actuation and communication hardware increases, so does the potential for dynamically tasked sense and respond networked systems (i.e., Sensor Networks or SNs) to replace existing disjoint and inflexible special-purpose deployments (closed-circuit security video, anti-theft sensors, etc.). While various solutions have emerged to many individual SN-centric challenges (e.g., power management, communication protocols, role assignment), perhaps the largest remaining obstacle to widespread SN deployment is that those who wish to deploy, utilize, and maintain a programmable Sensor Network lack the programming and systems expertise to do so.
The contributions of this thesis centers on the design, development and deployment of the SN Workbench (snBench). snBench embodies an accessible, modular programming platform coupled with a flexible and extensible run-time system that, together, support the entire life-cycle of distributed sensory services. As it is impossible to find a one-size-fits-all programming interface, this work advocates the use of tiered layers of abstraction that enable a variety of high-level, domain specific languages to be compiled to a common (thin-waist) tasking language; this common tasking language is statically verified and can be subsequently re-translated, if needed, for execution on a wide variety of hardware platforms.
snBench provides: (1) a common sensory tasking language (Instruction Set Architecture) powerful enough to express complex SN services, yet simple enough to be executed by highly constrained resources with soft, real-time constraints, (2) a prototype high-level language (and corresponding compiler) to illustrate the utility of the common tasking language and the tiered programming approach in this domain, (3) an execution environment and a run-time support infrastructure that abstract a collection of heterogeneous resources into a single virtual Sensor Network, tasked via this common tasking language, and (4) novel formal methods (i.e., static analysis techniques) that verify safety properties and infer implicit resource constraints to facilitate resource allocation for new services. This thesis presents these components in detail, as well as two specific case-studies: the use of snBench to integrate physical and wireless network security, and the use of snBench as the foundation for semester-long student projects in a graduate-level Software Engineering course
Personalization platform for multimodal ubiquitous computing applications
Dissertação para obtenção do Grau de Mestre em
Engenharia InformáticaWe currently live surrounded by a myriad of computing devices running multiple applications.
In general, the user experience on each of those scenarios is not adapted to each
user’s specific needs, without personalization and integration across scenarios. Moreover, developers usually do not have the right tools to handle that in a standard and generic way. As such, a personalization platform may provide those tools.
This kind of platform should be readily available to be used by any developer. Therefore, it must be developed to be available over the Internet. With the advances in IT infrastructure, it is now possible to develop reliable and scalable services running on abstract and virtualized platforms. Those are some of the advantages of cloud computing, which offers a model of utility computing where customers are able to dynamically allocate the resources they need and are charged accordingly.
This work focuses on the creation of a cloud-based personalization platform built on
a previously developed generic user modeling framework. It provides user profiling and
context-awareness tools to third-party developers.
A public display-based application was also developed. It provides useful information
to students, teachers and others in a university campus as they are detected by Bluetooth scanning. It uses the personalization platform as the basis to select the most relevant information in each situation, while a mobile application was developed to be used as an input mechanism. A user study was conducted to assess the usefulness of the application and to validate some design choices. The results were mostly positive
Mobile Ad-Hoc Networks
Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks
Wake-up radio systems : design, development, performance evaluation and comparison to conventional medium access control protocols for wireless sensor networks
During the recent years, the research related to Wake-up Radio (WuR) systems has gained noticeable interest. In WuR systems, a node initiating a communication first sends a Wake-up Call (WuC) by means of its Wake-up Transmitter (WuTx), to the Wake-up Receiver (WuRx) of a remote node to activate it in an on-demand manner. Until the reception of the WuC, the node's MCU and main data transceiver are in sleep mode. Hence, WuR drastically reduce the power required by wireless nodes.
This thesis provides a complete analysis of several WuR designs vs. conventional MAC protocols for Wireless Sensor Networks (WSN). The research is performed in an incremental fashion and includes hardware, softwar and simulation topics.
WuR systems enable energy savings in plenty of different applications, e.g., retrieving information from environmental pollution sensors placed in a city by a mobile collector node, or activating a sleeping wireless AP. They are easy to program in and provide implicit synchronization. However, achieving a good WuRx design may become a challenge because power amplifiers cannot be used for the sake of energy.
The system proposed in chapter 2 is a successful WuR system prototype. The so-called SµA-WuRx is less complex than commercial WuR systems, it is cheaper from the monetary point of view, requires several times less energy and allows for up to 15 meters of communication, an adequate value for WuR systems. However, the system can be improved by including several desirable features, such as longer operational ranges and/or addressing mechanisms.
The so-called Time-Knocking (TicK) addressing strategy, analyzed in chapter 3, enables energy efficient node addressing by varying the time between WuCs received by a MCU. TicK allows for variable length addresses and multicast.
A WuR system may not fit any possible application. Thus, while the SµA-WuRx and TicK efficiently solved many of the requirements of single-hop and data-collector applications, they lack of flexibility. Instead, SCM-WuR systems in chapter 4 feature an outstanding trade-off between hardware complexity, current consumption and operational range, and even enable multi-hop wake-up for long remote sensor measure collection.
To contextualize the WuR systems developed, chapter 5 provides an overview of the most important WuR systems as of 2014.
Developing a MAC protocol which performs acceptably in a wide range of diverse applications is a very difficult task. Comparatively, SCM-WuR systems perform properly in all the use cases (single and multi-hop) presented in chapter 6.
Bluetooth Low Energy, or BLE, appears as a duty-cycled MAC protocol mainly targeting single-hop applications. Because of its clearly defined use cases and its integration with its upper application layers, BLE appears as an extremely energy-efficient protocol that cannot be easily replaced by WuR. Because of all these aspects, the performance of BLE is analyzed in chapter 7.
Finally, chapter 8 tries to solve one of the issues affecting WuR systems, that is, the need for extra hardware. While this issue seems difficult to solve for WuRx, the chapter provides ideas to use IEEE 802.11-enabled devices as WuTx.Durant els Ăşltims anys, la investigaciĂł relativa als sistemes de RĂ dios de Wake-up (de l'anglès Wake-up Radio, WuR) ha experimentat un interès notable. En aquests sistemes, un node inicia la comunicaciĂł inal.lĂ mbrica transmetent una Wake-up Call (WuC), per mitjĂ del seu transmissor de Wake-up (WuTx), dirigida al receptor de Wake-up (WuRx) del node remot. Aquesta WuC activa el node remot, el microcontrolador (MCU) i la rĂ dio principals del qual han pogut romandre en mode "sleep" fins el moment. AixĂ doncs, els sistemes WuR permeten un estalvi drĂ stic de l'energia requerida pels nodes sense fils. Aquesta tesi proposa diferents sistemes WuR i els compara amb protocols MAC existents per a xarxes de sensors sense fils (Wireless Sensor Networks, WSN). La investigaciĂł es realitza de forma progressiva i inclou hardware, software i simulaciĂł. Els sistemes WuR permeten un estalvi energètic notable en moltes aplicacions: recolÂżlecciĂł d'informaciĂł ambiental, activaciĂł remota de punts d'accĂ©s wi-fi, etc. SĂłn fĂ cils de programar en software i comporten una sincronitzaciĂł implĂcita entre nodes. Malauradament, un consum energètic mĂnim impossibilita l'Ăşs d'amplificadors de potència, i dissenyar-los esdevĂ© un repte. El sistema presentat en el capĂtol 2 Ă©s un prototip exitĂłs de sistema WuR. De nom SµA-WuR, Ă©s mĂ©s senzill que alternatives comercials, Ă©s mĂ©s econòmic, requereix menys energia i permet distĂ ncies de comunicaciĂł WuR majors, de fins a 15 metres. L'estratègia d'adreçament Time-KnocKing, presentada en el capĂtol 3, permet dotar l'anterior SµA-WuR d'una forma d'especificar el node adreçat, permetent estalvi energètic a nivell de xarxa. TicK opera codificant el temps entre diferents WuC. Depenent del temps entre intervals, es desperten el/s node/s desitjats d'una forma extremadament eficient. Tot i els seus beneficis, hi ha aplicacions no implementables amb el sistema SµA-WuR. Per a aquest motiu, en el capĂtol 4 es presenta el sistema SCM-WuR, que ofereix un rang d'operaciĂł de 40 a 100 metres a canvi d'una mĂnima complexitat hardware afegida. SCM-WuR cobreix el ventall d'aplicacions del sistema SµA-WuRx, i tambĂ© les que requereixen multi-hop a nivell WuR. El capĂtol 5 de la tesi compara els dos sistemes WuR anteriors vers les propostes mĂ©s importants fins el 2014. El capĂtol 6 inclou un framework de simulaciĂł complet amb les bases per a substituir els sistemes basats en duty-cycling a WuR. Degut a que desenvolupar un protocol MAC que operi acceptablement bĂ© en multitud d'aplicacions esdevĂ© una tasca prĂ cticament impossible, els sistemes WuR presentats amb anterioritat i modelats en aquest capĂtol representen una soluciĂł versĂ til, interessant i molt mĂ©s eficient des del punt de vista energètic. Bluetooth Low Energy, o Smart, o BLE, representa un cas d'aplicaciĂł especĂfica on, degut a la gran integraciĂł a nivell d'aplicaciĂł, la substituciĂł per sistemes de WuR esdevĂ© difĂcil Per a aquesta raĂł, i degut a que es tracta d'un protocol MAC extremadament eficient energèticament, aquesta tesi contĂ© una caracteritzaciĂł completa de BLE en el capĂtol 7. Finalment, el capĂtol 8 soluciona un dels inconvenients del sistemes WuR, el disseny de WuTx especĂfics, presentant una estratègia per a transformar qualsevol dispositiu IEEE 802.11 en WuTx
The design and implementation of a smart-parking system for Helsinki Area
The strain on the parking infrastructure for the general public has significantly grown as a result of the ever rising number of vehicles geared by the rapid population growth in urban areas. Consequently, finding a vacant parking space has become quite a challenging task, especially at peak hours. Drivers have to cycle back and forth a number of times before they finally find where to park. This leads to increased fuel consumption, air pollution, and increased likelihood of causing accidents, to mention but a few. Paying for the parking is not straight forward either, as the ticket machines, on top of being located at a distance, in many times, they have several payment methods drivers must prepare for. A system therefore, that would allow drivers to check for the vacant parking places before driving to a busy city, takes care of the parking fee for exact time they have used, manages electronic parking permit, is the right direction towards toppling these difficulties.
The main objective of this project was to design and implement a system that would provide parking occupancy estimation, parking fee payment method, parking permit management and parking analytics for the city authorities. The project had three phases. The first and the second phases used qualitative approaches to validate our hypotheses about parking shortcoming in Helsinki area and the recruitment of participants to the pilot of the project, respectively. The third phase involved the design, implementation and installation of the system. The other objective was to study the challenges a smart parking system would face at different stages of its life cycle.
The objectives of the project were achieved and the considered assumption about the challenges associated with parking in a busy city were validated. A smart parking system will allow drivers to check for available parking spaces beforehand, they are able to pay for the parking fee, they can get electronic parking permits, and the city authority can get parking analytics for the city plannin
Design and evaluation of wireless dense networks : application to in-flight entertainment systems
Le réseau sans fil est l'un des domaines de réseautage les plus prometteurs avec des caractéristiques uniques qui peuvent fournir la connectivité dans les situations où il est difficile d'utiliser un réseau filaire, ou lorsque la mobilité des nœuds est nécessaire. Cependant, le milieu de travail impose généralement diverses contraintes, où les appareils sans fil font face à différents défis lors du partage des moyens de communication. De plus, le problème s'aggrave avec l'augmentation du nombre de nœuds. Différentes solutions ont été introduites pour faire face aux réseaux très denses. D'autre part, un nœud avec une densité très faible peut créer un problème de connectivité et peut conduire à l'optension de nœuds isolés et non connectes au réseau. La densité d'un réseau est définit en fonction du nombre de nœuds voisins directs au sein de la portée de transmission du nœud. Cependant, nous croyons que ces métriques ne sont pas suffisants et nous proposons une nouvelle mesure qui considère le nombre de voisins directs et la performance du réseau. Ainsi, la réponse du réseau, respectant l'augmentation du nombre de nœuds, est considérée lors du choix du niveau de la densité. Nous avons défini deux termes: l'auto-organisation et l'auto-configuration, qui sont généralement utilisés de façon interchangeable dans la littérature en mettant en relief la différence entre eux. Nous estimons qu'une définition claire de la terminologie peut éliminer beaucoup d'ambiguïté et aider à présenter les concepts de recherche plus clairement. Certaines applications, telles que Ies systèmes "In-Flight Entertainment (IFE)" qui se trouvent à l'intérieur des cabines d'avions, peuveut être considérées comme des systèmes sans fil de haute densité, même si peu de nœuds sont relativement présents. Pour résoudre ce problème, nous proposons une architecture hétérogène de différentes technologies à fin de surmonter les contraintes spécifiques de l'intérieur de la cabine. Chaque technologie vise à résoudre une partie du problème. Nous avons réalisé diverses expérimentations et simulations pour montrer la faisabilité de l'architecture proposée. Nous avons introduit un nouveau protocole d'auto-organisation qui utilise des antennes intelligentes pour aider certains composants du système IFE; à savoir les unités d'affichage et leurs systèmes de commande, à s'identifier les uns les autres sans aucune configuration préliminaire. Le protocole a été conçu et vérifié en utilisant le langage UML, puis, un module de NS2 a été créé pour tester les différents scénarios.Wireless networking is one of the most challenging networking domains with unique features that can provide connectivity in situations where it is difficult to use wired networking, or when ! node mobility is required. However, the working environment us! ually im poses various constrains, where wireless devices face various challenges when sharing the communication media. Furthermore, the problem becomes worse when the number of nodes increase. Different solutions were introduced to cope with highly dense networks. On the other hand, a very low density can create a poor connectivity problem and may lead to have isolated nodes with no connection to the network. It is common to define network density according to the number of direct neighboring nodes within the node transmission range. However, we believe that such metric is not enough. Thus, we propose a new metric that encompasses the number of direct neighbors and the network performance. In this way, the network response, due to the increasing number of nodes, is considered when deciding the density level. Moreover, we defined two terms, self-organization and self-configuration, which are usually used interchangeably in the literature through highlighting the difference ! between them. We believe that having a clear definition for terminology can eliminate a lot of ambiguity and help to present the research concepts more clearly. Some applications, such as In-Flight Entertainment (IFE) systems inside the aircraft cabin, can be considered as wirelessly high dense even if relatively few nodes are present. To solve this problem, we propose a heterogeneous architecture of different technologies to overcome the inherited constrains inside the cabin. Each technology aims at solving a part of the problem. We held various experimentation and simulations to show the feasibility of the proposed architecture
Intelligent Sensor Networks
In the last decade, wireless or wired sensor networks have attracted much attention. However, most designs target general sensor network issues including protocol stack (routing, MAC, etc.) and security issues. This book focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on their world-class research, the authors present the fundamentals of intelligent sensor networks. They cover sensing and sampling, distributed signal processing, and intelligent signal learning. In addition, they present cutting-edge research results from leading experts
- …