1,216 research outputs found

    Reference Nodes Selection for Anchor-Free Localization in Wireless Sensor Networks

    Get PDF
    DizertačnĂ­ prĂĄce se zabĂœvĂĄ nĂĄvrhem novĂ©ho bezkotevnĂ­ho lokalizačnĂ­ho algoritmu slouĆŸĂ­cĂ­ho pro vĂœpočet pozice uzlĆŻ v bezdrĂĄtovĂœch senzorovĂœch sĂ­tĂ­ch. ProvedenĂ© studie ukĂĄzaly, ĆŸe dosavadnĂ­ bezkotevnĂ­ lokalizačnĂ­ algoritmy, pracujĂ­cĂ­ v paralelnĂ­m reĆŸimu, dosahujĂ­ malĂœch lokalizačnĂ­ch chyb. Jejich nevĂœhodou ovĆĄem je, ĆŸe pƙi sestavenĂ­ mnoĆŸiny referenčnĂ­ch uzlu spotƙebovĂĄvajĂ­ daleko větĆĄĂ­ mnoĆŸstvĂ­ energie neĆŸ algoritmy pracujĂ­cĂ­ v inkrementĂĄlnĂ­m reĆŸimu. ParalelnĂ­ lokalizačnĂ­ algoritmy vyuĆŸĂ­vajĂ­ pro určenĂ­ pozice referenčnĂ­ uzly nachĂĄzejĂ­cĂ­ se na protilehlĂœch hranĂĄch bezdrĂĄtovĂ© sĂ­tě. NovĂœ lokalizačnĂ­ algoritmus označenĂœ jako BRL (Boundary Recognition aided Localization) je zaloĆŸen na myĆĄlence decentralizovaně detekovat uzly leĆŸĂ­cĂ­ na hranici sĂ­ti a pouze z tĂ©to mnoĆŸiny vybrat potƙebnĂœ počet referenčnĂ­ch uzlu. PomocĂ­ navrĆŸenĂ©ho pƙístupu lze znaĆŸně snĂ­ĆŸit mnoĆŸstvĂ­ energie spotƙebovanĂ© v prĆŻběhu procesu vĂœběru referenčnĂ­ch uzlĆŻ v senzorovĂ©m poli. DalĆĄĂ­m pƙínosem ke snĂ­ĆŸenĂ­ energetickĂœch nĂĄroku a zĂĄroveƈ zachovĂĄnĂ­ nĂ­zkĂ© lokalizačnĂ­ chyby je vyuĆŸitĂ­ procesu multilaterace se tƙemi, eventuĂĄlně čtyƙmi referenčnĂ­mi body. V rĂĄmci prĂĄce byly provedeny simulace několika dĂ­lčích algoritmu a jejich funkčnost byla ověƙena experimentĂĄlně v reĂĄlnĂ© senzorovĂ© sĂ­ti. NavrĆŸenĂœ algoritmus BRL byl porovnĂĄn z hlediska lokalizačnĂ­ chyby a počtu zpracovanĂœch paketĆŻ s několika znĂĄmĂœmi lokalizačnĂ­mi algoritmy. VĂœsledky simulacĂ­ dokĂĄzaly, ĆŸe navrĆŸenĂœ algoritmus pƙedstavuje efektivnĂ­ ƙeĆĄenĂ­ pro pƙesnou a zĂĄroveƈ nĂ­zkoenergetickou lokalizaci uzlĆŻ v bezdrĂĄtovĂœch senzorovĂœch sĂ­tĂ­ch.The doctoral thesis is focused on a design of a novel anchor free localization algorithm for wireless sensor networks. As introduction, the incremental and concurrent anchor free localization algorithms are presented and their performance is compared. It was found that contemporary anchor free localization algorithms working in the concurrent manner achieve a low localization error, but dissipate signicant energy reserves. A new Boundary Recognition Aided Localization algorithm presented in this thesis is based on an idea to recognize the nodes placed on the boundary of network and thus reduce the number of transmission realized during the reference nodes selection phase of the algorithm. For the position estimation, the algorithm employs the multilateration technique that work eectively with the low number of the reference nodes. Proposed algorithms are tested through the simulations and validated by the real experiment with the wireless sensor network. The novel Boundary Recognition Aided Localization algorithm is compared with the known algorithms in terms of localization error and the communication cost. The results show that the novel algorithm presents powerful solution for the anchor free localization.

    Robotic Wireless Sensor Networks

    Full text link
    In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

    A survey of localization in wireless sensor network

    Get PDF
    Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

    A hybrid localization approach in 3D wireless sensor network

    Full text link
    Location information acquisition is crucial for many wireless sensor network (WSN) applications. While existing localization approaches mainly focus on 2D plane, the emerging 3D localization brings WSNs closer to reality with much enhanced accuracy. Two types of 3D localization algorithms are mainly used in localization application: the range-based localization and the range-free localization. The range-based localization algorithm has strict requirements on hardware and therefore is costly to implement in practice. The range-free localization algorithm reduces the hardware cost but at the expense of low localization accuracy. On addressing the shortage of both algorithms, in this paper, we develop a novel hybrid localization scheme, which utilizes the range-based attribute RSSI and the range-free attribute hopsize, to achieve accurate yet low-cost 3D localization. As anchor node deployment strategy plays an important role in improving the localization accuracy, an anchor node configuration scheme is also developed in this work by utilizing the MIS (maximal independent set) of a network. With proper anchor node configuration and propagation model selection, using simulations, we show that our proposed algorithm improves the localization accuracy by 38.9% compared with 3D DV-HOP and 52.7% compared with 3D centroid

    EECLA: A Novel Clustering Model for Improvement of Localization and Energy Efficient Routing Protocols in Vehicle Tracking Using Wireless Sensor Networks

    Get PDF
    Due to increase of usage of wireless sensor networks (WSN) for various purposes leads to a required technology in the present world. Many applications are running with the concepts of WSN now, among that vehicle tracking is one which became prominent in security purposes. In our previous works we proposed an algorithm called EECAL (Energy Efficient Clustering Algorithm and Localization) to improve accuracy and performed well. But are not focused more on continuous tracking of a vehicle in better aspects. In this paper we proposed and refined the same algorithm as per the requirement. Detection and tracking of a vehicle when they are in larges areas is an issue. We mainly focused on proximity graphs and spatial interpolation techniques for getting exact boundaries. Other aspect of our work is to reduce consumption of energy which increases the life time of the network. Performance of system when in active state is another issue can be fixed by setting of peer nodes in communication. We made an attempt to compare our results with the existed works and felt much better our work. For handling localization, we used genetic algorithm which handled good of residual energy, fitness of the network in various aspects. At end we performed a simulation task that proved proposed algorithms performed well and experimental analysis gave us faith by getting less localization error factor

    The Deployment in the Wireless Sensor Networks: Methodologies, Recent Works and Applications

    Get PDF
    International audienceThe wireless sensor networks (WSN) is a research area in continuous evolution with a variety of application contexts. Wireless sensor networks pose many optimization problems, particularly because sensors have limited capacity in terms of energy, processing and memory. The deployment of sensor nodes is a critical phase that significantly affects the functioning and performance of the network. Often, the sensors constituting the network cannot be accurately positioned, and are scattered erratically. To compensate the randomness character of their placement, a large number of sensors is typically deployed, which also helps to increase the fault tolerance of the network. In this paper, we are interested in studying the positioning and placement of sensor nodes in a WSN. First, we introduce the problem of deployment and then we present the latest research works about the different proposed methods to solve this problem. Finally, we mention some similar issues related to the deployment and some of its interesting applications
    • 

    corecore