9,472 research outputs found
inTrack: High Precision Tracking of Mobile Sensor Nodes
Radio-interferometric ranging is a novel technique that allows
for fine-grained node localization in networks of inexpensive COTS
nodes. In this paper, we show that the approach can also be applied
to precision tracking of mobile sensor nodes. We introduce inTrack, a
cooperative tracking system based on radio-interferometry that features
high accuracy, long range and low-power operation. The system utilizes
a set of nodes placed at known locations to track a mobile sensor. We
analyze how target speed and measurement errors affect the accuracy of
the computed locations. To demonstrate the feasibility of our approach,
we describe our prototype implementation using Berkeley motes. We
evaluate the system using data from both simulations and field tests
Robotic Wireless Sensor Networks
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
Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks
It has been shown that cooperative localization is capable of improving both
the positioning accuracy and coverage in scenarios where the global positioning
system (GPS) has a poor performance. However, due to its potentially excessive
computational complexity, at the time of writing the application of cooperative
localization remains limited in practice. In this paper, we address the
efficient cooperative positioning problem in wireless sensor networks. A
space-time hierarchical-graph based scheme exhibiting fast convergence is
proposed for localizing the agent nodes. In contrast to conventional methods,
agent nodes are divided into different layers with the aid of the space-time
hierarchical-model and their positions are estimated gradually. In particular,
an information propagation rule is conceived upon considering the quality of
positional information. According to the rule, the information always
propagates from the upper layers to a certain lower layer and the message
passing process is further optimized at each layer. Hence, the potential error
propagation can be mitigated. Additionally, both position estimation and
position broadcasting are carried out by the sensor nodes. Furthermore, a
sensor activation mechanism is conceived, which is capable of significantly
reducing both the energy consumption and the network traffic overhead incurred
by the localization process. The analytical and numerical results provided
demonstrate the superiority of our space-time hierarchical-graph based
cooperative localization scheme over the benchmarking schemes considered.Comment: 14 pages, 15 figures, 4 tables, accepted to appear on IEEE
Transactions on Signal Processing, Sept. 201
A survey of localization in wireless sensor network
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
Dead Reckoning Localization Technique for Mobile Wireless Sensor Networks
Localization in wireless sensor networks not only provides a node with its
geographical location but also a basic requirement for other applications such
as geographical routing. Although a rich literature is available for
localization in static WSN, not enough work is done for mobile WSNs, owing to
the complexity due to node mobility. Most of the existing techniques for
localization in mobile WSNs uses Monte-Carlo localization, which is not only
time-consuming but also memory intensive. They, consider either the unknown
nodes or anchor nodes to be static. In this paper, we propose a technique
called Dead Reckoning Localization for mobile WSNs. In the proposed technique
all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in
DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are
localized for the first time using three anchor nodes. For their subsequent
localizations, only two anchor nodes are used. The proposed technique estimates
two possible locations of a node Using Bezouts theorem. A dead reckoning
approach is used to select one of the two estimated locations. We have
evaluated DRLMSN through simulation using Castalia simulator, and is compared
with a similar technique called RSS-MCL proposed by Wang and Zhu .Comment: Journal Paper, IET Wireless Sensor Systems, 201
Cooperative and Distributed Localization for Wireless Sensor Networks in Multipath Environments
We consider the problem of sensor localization in a wireless network in a
multipath environment, where time and angle of arrival information are
available at each sensor. We propose a distributed algorithm based on belief
propagation, which allows sensors to cooperatively self-localize with respect
to one single anchor in a multihop network. The algorithm has low overhead and
is scalable. Simulations show that although the network is loopy, the proposed
algorithm converges, and achieves good localization accuracy
- …