373 research outputs found
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
Optimal Relay Placement in Multi-hop Wireless Networks
Relay node placement in wireless environments is a research topic recurrently
studied in the specialized literature. A variety of network performance goals,
such as coverage, data rate and network lifetime, are considered as criteria
to lead the placement of the nodes. In this work, a new relay placement approach to maximize network connectivity in a multi-hop wireless network is
presented. Here, connectivity is defined as a combination of inter-node reachability and network throughput. The nodes are placed following a two-step
procedure: (i) initial distribution, and (ii) solution selection. Additionally,
a third stage for placement optimization is optionally proposed to maximize
throughput. This tries to be a general approach for placement, and several
initialization, selection and optimization algorithms can be used in each of
the steps. For experimentation purposes, a leave-one-out selection procedure and a PSO related optimization algorithm are employed and evaluated
for second and third stages, respectively. Other node placement solutions
available in the literature are compared with the proposed one in realistic
simulated scenarios. The results obtained through the properly devised experiments show the improvements achieved by the proposed approach
The Deployment in the Wireless Sensor Networks: Methodologies, Recent Works and Applications
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
A Dynamical Relay Node placement Solution for MANETs
Network deployment in wireless networks implies the distribution of the communication nodes to improve some key operational aspects, such as energy
saving, coverage, connectivity, or simply reducing the network cost. Most
node placement approaches are focused on static scenarios like WSNs, where
the topology of the network does not vary over time. Nevertheless, there exist certain situations in which the network node locations can continuously
change. In this case, the use of special nodes, so-called Relay Nodes (RNs),
contributes to supporting, maintaining or recovering communication in the
network. The present work introduces a multi-stage dynamical RN placement
solution to lead the RNs to their time-varying optimized positions. The approach, named Dynamical Relay Node placement Solution (DRNS), is based
on the use of Particle Swarm Optimization (PSO) algorithms and is inspired
by Model Predictive Control (MPC) techniques following a bi-objective optimization procedure, where both network connectivity and throughput are
jointly maximized. DRNS is validated in both simulated and real environments composed of mobile robotic nodes, the results showing its goodness and operational suitability for real MANET environments
A Novel Enhanced Quantum PSO for Optimal Network Configuration in Heterogeneous Industrial IoT
A novel enhanced quantum particle swarm optimization algorithm for IIoT deployments is proposed. It provides enhanced connectivity, reduced energy consumption, and optimized delay. We consider heterogeneous scenarios of network topologies for optimal path configuration by exploring and exploiting the hunts. It uses multiple inputs from heterogeneous IIoT into quantum and bio-inspired optimization techniques. The differential evolution operator and crossover operations are used for information interchange among the nodes to avoid trapping into local minima. The different topology scenarios are simulated to study the impact of -degrees of connectivity concerning objective functions’ evaluation and compared with existing techniques. The results demonstrate that our algorithm consumes a minimum of 30.3% lesser energy. Furthermore, it offers improved searching precision and convergence swiftness in the possible search space for -disjoint paths and reduces the delay by a minimum of 26.7%. Our algorithm also improves the throughput by a minimum of 29.87% since the quantum swarm inclines to generate additional diverse paths from multiple source nodes to the gateway
Resilient Wireless Sensor Networks Using Topology Control: A Review
Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs
- …