463 research outputs found

    Indoor Localization Based on Wireless Sensor Networks

    Get PDF
    Indoor localization techniques based on wireless sensor networks (WSNs) have been increasingly used in various applications such as factory automation, intelligent building, facility management, security, and health care. However, existing localization techniques cannot meet the accuracy requirement of many applications. Meanwhile, some localization algorithms are affected by environmental conditions and cannot be directly used in an indoor environment. Cost is another limitation of the existing localization algorithms. This thesis is to address those issues of indoor localization through a new Sensing Displacement (SD) approach. It consists of four major parts: platform design, SD algorithm development, SD algorithm improvement, and evaluation. Platform design includes hardware design and software design. Hardware design is the foundation for the system, which consists of the motion sensors embedded on mobile nodes and WSN design. Motion sensors are used to collect motion information for the localizing objects. A WSN is designed according to the characteristics of an indoor scenario. A Cloud Computing based system architecture is developed to support the software design of the proposed system. In order to address the special issues in an indoor environment, a new Sensing Displacement algorithm is developed, which estimates displacement of a node based on the motion information from the sensors embedded on the node. The sensor assembly consists of acceleration sensors and gyroscope sensors, separately sensing the acceleration and angular velocity of the localizing object. The first SD algorithm is designed in a way to be used in a 2-D localization demo to validate the proposal. A detailed analysis of the results of 2-D SD algorithm reveals that there are two critical issues (sensor’s noise and cumulative error) affecting the measurement results. Therefore a low-pass filter and a modified Kalman filter are introduced to solve the issue of sensor’s noises. An inertia tensor factor is introduced to address the cumulative error in a 3-D SD algorithm. Finally, the proposed SD algorithm is evaluated against the commercial AeroScout (WiFi-RFID) system and the ZigBee based Fingerprint algorithm

    MOBILITY CONTROL IN WIRELESS SENSOR NETWORK

    Get PDF
    Wireless sensor networks (WSNs) have become one of the most important topics in wireless communication during the last decade. WSNs integrates many different technologies such as in hardware, software, data fusion, and applications. Hence, WSNs has received recently special research activities. WSNs have so many applications in different areas such as health-care systems, monitoring and control systems, rescue systems, and military applications. Since WSNs are usually deployed with large numbers of nodes in wide areas, they should be reliable, inexpensive, with very low power consumption, and with high redundancy to preserve the life-time of the whole network. In this M.Sc. thesis we consider one extremely important research topic in WSNs which is the mobility control. The mobility control is analyzed theoretically as well as with extensive simulations. In the simulation scenarios, static sensor nodes are first randomly deployed to the decided area. Then a reference trajectory for the mobile node is created based on the observed point phenomena, and the network guides the mobile node to move along the trajectory. A simulation platform called PiccSIM is used to simulate the scenarios. It is developed by the Communication and Control Engineering Groups at Helsinki University of Technology (TKK). The obtained results from these simulations are discussed and analyzed. This work opens the doors for more real applications in this area in the nearby future.fi=OpinnÀytetyö kokotekstinÀ PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=LÀrdomsprov tillgÀngligt som fulltext i PDF-format

    Anchor-Free Localization in Mixed Wireless Sensor Network Systems

    Get PDF
    Recent technological advances have fostered the emergence of Wireless Sensor Networks (WSNs), which consist of tiny, wireless, battery-powered nodes that are expected to revolutionize the ways in which we understand and construct complex physical systems. A fundamental property needed to use and maintain these WSNs is ``localization\u27\u27, which allows the establishment of spatial relationships among nodes over time. This dissertation presents a series of Geographic Distributed Localization (GDL) algorithms for mixed WSNs, in which both static and mobile nodes can coexist. The GDL algorithms provide a series of useful methods for localization in mixed WSNs. First, GDL provides an approximation called ``hop-coordinates\u27\u27, which improves the accuracy of both hop-counting and connectivity-based measurement techniques. Second, GDL utilizes a distributed algorithm to compute the locations of all nodes in static networks with the help of the hop-coordinates approximation. Third, GDL integrates a sensor component into this localization paradigm for possible mobility and as a result allows for a more complex deployment of WSNs as well as lower costs. In addition, the development of GDL incorporated the possibility of manipulated communications, such as wormhole attacks. Simulations show that such a localization system can provide fundamental support for security by detecting and localizing wormhole attacks. Although several localization techniques have been proposed in the past few years, none currently satisfies our requirements to provide an accurate, efficient and reliable localization for mixed WSNs. The contributions of this dissertation are: (1) our measurement technique achieves better accuracy both in measurement and localization than other methods; (2) our method significantly improves the efficiency of localization in updating location in mixed WSNs by incorporating sensors into the method; (3) our method can detect and locate the communication that has been manipulated by a wormhole in a network without relying on a central server

    Cryptographic Key Distribution In Wireless Sensor Networks Using Bilinear Pairings

    Get PDF
    It is envisaged that the use of cheap and tiny wireless sensors will soon bring a third wave of evolution in computing systems. Billions of wireless senor nodes will provide a bridge between information systems and the physical world. Wireless nodes deployed around the globe will monitor the surrounding environment as well as gather information about the people therein. It is clear that this revolution will put security solutions to a great test. Wireless Sensor Networks (WSNs) are a challenging environment for applying security services. They differ in many aspects from traditional fixed networks, and standard cryptographic solutions cannot be used in this application space. Despite many research efforts, key distribution in WSNs still remains an open problem. Many of the proposed schemes suffer from high communication overhead and storage costs, low scalability and poor resilience against different types of attacks. The exclusive usage of simple and energy efficient symmetric cryptography primitives does not solve the security problem. On the other hand a full public key infrastructure which uses asymmetric techniques, digital signatures and certificate authorities seems to be far too complex for a constrained WSN environment. This thesis investigates a new approach to WSN security which addresses many of the shortcomings of existing mechanisms. It presents a detailed description on how to provide practical Public Key Cryptography solutions for wireless sensor networks. The contributions to the state-of-the-art are added on all levels of development beginning with the basic arithmetic operations and finishing with complete security protocols. This work includes a survey of different key distribution protocols that have been developed for WSNs, with an evaluation of their limitations. It also proposes Identity- Based Cryptography (IBC) as an ideal technique for key distribution in sensor networks. It presents the first in-depth study of the application and implementation of Pairing- Based Cryptography (PBC) to WSNs. This is followed by a presentation of the state of the art on the software implementation of Elliptic Curve Cryptography (ECC) on typical WSNplatforms. New optimized algorithms for performing multiprecision multiplication on a broad range of low-end CPUs are introduced as well. Three novel protocols for key distribution are proposed in this thesis. Two of these are intended for non-interactive key exchange in flat and clustered networks respectively. A third key distribution protocol uses Identity-Based Encryption (IBE) to secure communication within a heterogeneous sensor network. This thesis includes also a comprehensive security evaluation that shows that proposed schemes are resistant to various attacks that are specific to WSNs. This work shows that by using the newest achievements in cryptography like pairings and IBC it is possible to deliver affordable public-key cryptographic solutions and to apply a sufficient level of security for the most demanding WSN applications

    Performance assessment of real-time data management on wireless sensor networks

    Get PDF
    Technological advances in recent years have allowed the maturity of Wireless Sensor Networks (WSNs), which aim at performing environmental monitoring and data collection. This sort of network is composed of hundreds, thousands or probably even millions of tiny smart computers known as wireless sensor nodes, which may be battery powered, equipped with sensors, a radio transceiver, a Central Processing Unit (CPU) and some memory. However due to the small size and the requirements of low-cost nodes, these sensor node resources such as processing power, storage and especially energy are very limited. Once the sensors perform their measurements from the environment, the problem of data storing and querying arises. In fact, the sensors have restricted storage capacity and the on-going interaction between sensors and environment results huge amounts of data. Techniques for data storage and query in WSN can be based on either external storage or local storage. The external storage, called warehousing approach, is a centralized system on which the data gathered by the sensors are periodically sent to a central database server where user queries are processed. The local storage, in the other hand called distributed approach, exploits the capabilities of sensors calculation and the sensors act as local databases. The data is stored in a central database server and in the devices themselves, enabling one to query both. The WSNs are used in a wide variety of applications, which may perform certain operations on collected sensor data. However, for certain applications, such as real-time applications, the sensor data must closely reflect the current state of the targeted environment. However, the environment changes constantly and the data is collected in discreet moments of time. As such, the collected data has a temporal validity, and as time advances, it becomes less accurate, until it does not reflect the state of the environment any longer. Thus, these applications must query and analyze the data in a bounded time in order to make decisions and to react efficiently, such as industrial automation, aviation, sensors network, and so on. In this context, the design of efficient real-time data management solutions is necessary to deal with both time constraints and energy consumption. This thesis studies the real-time data management techniques for WSNs. It particularly it focuses on the study of the challenges in handling real-time data storage and query for WSNs and on the efficient real-time data management solutions for WSNs. First, the main specifications of real-time data management are identified and the available real-time data management solutions for WSNs in the literature are presented. Secondly, in order to provide an energy-efficient real-time data management solution, the techniques used to manage data and queries in WSNs based on the distributed paradigm are deeply studied. In fact, many research works argue that the distributed approach is the most energy-efficient way of managing data and queries in WSNs, instead of performing the warehousing. In addition, this approach can provide quasi real-time query processing because the most current data will be retrieved from the network. Thirdly, based on these two studies and considering the complexity of developing, testing, and debugging this kind of complex system, a model for a simulation framework of the real-time databases management on WSN that uses a distributed approach and its implementation are proposed. This will help to explore various solutions of real-time database techniques on WSNs before deployment for economizing money and time. Moreover, one may improve the proposed model by adding the simulation of protocols or place part of this simulator on another available simulator. For validating the model, a case study considering real-time constraints as well as energy constraints is discussed. Fourth, a new architecture that combines statistical modeling techniques with the distributed approach and a query processing algorithm to optimize the real-time user query processing are proposed. This combination allows performing a query processing algorithm based on admission control that uses the error tolerance and the probabilistic confidence interval as admission parameters. The experiments based on real world data sets as well as synthetic data sets demonstrate that the proposed solution optimizes the real-time query processing to save more energy while meeting low latency.Fundação para a CiĂȘncia e Tecnologi

    Efficient Range-Free Monte-Carlo-Localization for Mobile Wireless Sensor Networks

    Get PDF
    Das Hauptproblem von Lokalisierungsalgorithmen fĂŒr WSNs basierend auf Ankerknoten ist die AbhĂ€ngigkeit von diesen. MobilitĂ€t im Netzwerk kann zu Topologien fĂŒhren, in denen einzelne Knoten oder ganze Teile des Netzwerks temporĂ€r von allen Ankerknoten isoliert werden. In diesen FĂ€llen ist keine weitere Lokalisierung möglich. Dies wirkt sich primĂ€r auf den Lokalisierungsfehler aus, der in diesen FĂ€llen stark ansteigt. Des weiteren haben Betreiber von Sensornetzwerken Interesse daran, die Anzahl der kosten- und wartungsintensiveren Ankerknoten auf ein Minimum zu reduzieren. Dies verstĂ€rkt zusĂ€tzlich das Problem von nicht verfĂŒgbaren Ankerknoten wĂ€hrend des Netzwerkbetriebs. In dieser Arbeit werden zunĂ€chst die Vor- und Nachteile der beiden großen Hauptkategorien von Lokalisierungsalgorithmen (range-based und range-free Verfahren) diskutiert und eine Studie eines oft fĂŒr range-based Lokalisierung genutzten Distanzbestimmungsverfahren mit Hilfe des RSSI vorgestellt. Danach werden zwei neue Varianten fĂŒr ein bekanntes range-free Lokalisierungsverfahren mit Namen MCL eingefĂŒhrt. Beide haben zum Ziel das Problem der temporĂ€r nicht verfĂŒgbaren Ankerknoten zu lösen, bedienen sich dabei aber unterschiedlicher Mittel. SA-MCL nutzt ein dead reckoning Verfahren, um die PositionsschĂ€tzung vom letzten bekannten Standort weiter zu fĂŒhren. Dies geschieht mit Hilfe von zusĂ€tzlichen Sensorinformationen, die von einem elektronischen Kompass und einem Beschleunigungsmesser zur VerfĂŒgung gestellt werden. PO-MCL hingegen nutzt das MobilitĂ€tsverhalten von einigen Anwendungen in Sensornetzwerken aus, bei denen sich alle Knoten primĂ€r auf einer festen Anzahl von Pfaden bewegen, um den Lokalisierungsprozess zu verbessern. Beide Methoden werden durch detaillierte Netzwerksimulationen evaluiert. Im Fall von SA-MCL wird außerdem eine Implementierung auf echter Hardware vorgestellt und eine Feldstudie in einem mobilen Sensornetzwerk durchgefĂŒhrt. Aus den Ergebnissen ist zu sehen, dass der Lokalisierungsfehler in Situationen mit niedriger Ankerknotendichte im Fall von SA-MCL um bis zu 60% reduziert werden kann, beziehungsweise um bis zu 50% im Fall von PO-MCL.

    Smart Monitoring and Control in the Future Internet of Things

    Get PDF
    The Internet of Things (IoT) and related technologies have the promise of realizing pervasive and smart applications which, in turn, have the potential of improving the quality of life of people living in a connected world. According to the IoT vision, all things can cooperate amongst themselves and be managed from anywhere via the Internet, allowing tight integration between the physical and cyber worlds and thus improving efficiency, promoting usability, and opening up new application opportunities. Nowadays, IoT technologies have successfully been exploited in several domains, providing both social and economic benefits. The realization of the full potential of the next generation of the Internet of Things still needs further research efforts concerning, for instance, the identification of new architectures, methodologies, and infrastructures dealing with distributed and decentralized IoT systems; the integration of IoT with cognitive and social capabilities; the enhancement of the sensing–analysis–control cycle; the integration of consciousness and awareness in IoT environments; and the design of new algorithms and techniques for managing IoT big data. This Special Issue is devoted to advancements in technologies, methodologies, and applications for IoT, together with emerging standards and research topics which would lead to realization of the future Internet of Things

    Cryptographic key distribution in wireless sensor networks: a hardware perspective

    Get PDF
    In this work the suitability of different methods of symmetric key distribution for application in wireless sensor networks are discussed. Each method is considered in terms of its security implications for the network. It is concluded that an asymmetric scheme is the optimum choice for key distribution. In particular, Identity-Based Cryptography (IBC) is proposed as the most suitable of the various asymmetric approaches. A protocol for key distribution using identity based Non-Interactive Key Distribution Scheme (NIKDS) and Identity-Based Signature (IBS) scheme is presented. The protocol is analysed on the ARM920T processor and measurements were taken for the run time and energy of its components parts. It was found that the Tate pairing component of the NIKDS consumes significants amounts of energy, and so it should be ported to hardware. An accelerator was implemented in 65nm Complementary Metal Oxide Silicon (CMOS) technology and area, timing and energy figures have been obtained for the design. Initial results indicate that a hardware implementation of IBC would meet the strict energy constraint of a wireless sensor network node

    Wireless Data Logger – A Joint Use of Frequency Converter and Wireless Sensor Network

    Get PDF
    “Smart Industry” is a new unavoidable trend in vast varieties of industry fields. In the case of developing smart crane systems, cutting edge innovation and design is required. Many crane manufactures have expressed their strong interest in applying wireless technology to their crane products. Recent research achievements in wireless sensor node development have created technologically mature, cost effective solutions for many applications. When either monitoring or controlling the crane, one must have access to the frequency converter first. As for the purpose of analyzing the behavior of crane, the Wireless Sensor Network can be used to collect data from frequency converters. In this thesis, a wireless sensor network system was designed and developed in order to collect data from several frequency converters. The UWASA Node, a wireless sensor node designed by researchers from Aalto University and University of Vaasa, was implemented for establishing this wireless data logging network. As a result, the system has an ability of logging continuous data as well as the changes of data in user defined logging interval. Additionally, the reliability of the wireless transmission was investigated and possible solutions were presented.fi=OpinnĂ€ytetyö kokotekstinĂ€ PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=LĂ€rdomsprov tillgĂ€ngligt som fulltext i PDF-format
    • 

    corecore