3,194 research outputs found
MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops
When deploying resource-intensive signal processing applications in wireless
sensor or mesh networks, distributing processing blocks over multiple nodes
becomes promising. Such distributed applications need to solve the placement
problem (which block to run on which node), the routing problem (which link
between blocks to map on which path between nodes), and the scheduling problem
(which transmission is active when). We investigate a variant where the
application graph may contain feedback loops and we exploit wireless networks?
inherent multicast advantage. Thus, we propose Multicast-Aware Routing for
Virtual network Embedding with Loops in Overlays (MARVELO) to find efficient
solutions for scheduling and routing under a detailed interference model. We
cast this as a mixed integer quadratically constrained optimisation problem and
provide an efficient heuristic. Simulations show that our approach handles
complex scenarios quickly.Comment: 6 page
An ant colony optimization approach for maximizing the lifetime of heterogeneous wireless sensor networks
Maximizing the lifetime of wireless sensor networks (WSNs) is a challenging problem. Although some methods exist to address the problem in homogeneous WSNs, research on this problem in heterogeneous WSNs have progressed at a slow pace. Inspired by the promising performance of ant colony optimization (ACO) to solve combinatorial problems, this paper proposes an ACO-based approach that can maximize the lifetime of heterogeneous WSNs. The methodology is based on finding the maximum number of disjoint connected covers that satisfy both sensing coverage and network connectivity. A construction graph is designed with each vertex denoting the assignment of a device in a subset. Based on pheromone and heuristic information, the ants seek an optimal path on the construction graph to maximize the number of connected covers. The pheromone serves as a metaphor for the search experiences in building connected covers. The heuristic information is used to reflect the desirability of device assignments. A local search procedure is designed to further improve the search efficiency. The proposed approach has been applied to a variety of heterogeneous WSNs. The results show that the approach is effective and efficient in finding high-quality solutions for maximizing the lifetime of heterogeneous WSNs
Coverage Protocols for Wireless Sensor Networks: Review and Future Directions
The coverage problem in wireless sensor networks (WSNs) can be generally
defined as a measure of how effectively a network field is monitored by its
sensor nodes. This problem has attracted a lot of interest over the years and
as a result, many coverage protocols were proposed. In this survey, we first
propose a taxonomy for classifying coverage protocols in WSNs. Then, we
classify the coverage protocols into three categories (i.e. coverage aware
deployment protocols, sleep scheduling protocols for flat networks, and
cluster-based sleep scheduling protocols) based on the network stage where the
coverage is optimized. For each category, relevant protocols are thoroughly
reviewed and classified based on the adopted coverage techniques. Finally, we
discuss open issues (and recommend future directions to resolve them)
associated with the design of realistic coverage protocols. Issues such as
realistic sensing models, realistic energy consumption models, realistic
connectivity models and sensor localization are covered
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Efficient energy management for the internet of things in smart cities
The drastic increase in urbanization over the past few years requires sustainable, efficient, and smart solutions for transportation, governance, environment, quality of life, and so on. The Internet of Things offers many sophisticated and ubiquitous applications for smart cities. The energy demand of IoT applications is increased, while IoT devices continue to grow in both numbers and requirements. Therefore, smart city solutions must have the ability to efficiently utilize energy and handle the associated challenges. Energy management is considered as a key paradigm for the realization of complex energy systems in smart cities. In this article, we present a brief overview of energy management and challenges in smart cities. We then provide a unifying framework for energy-efficient optimization and scheduling of IoT-based smart cities. We also discuss the energy harvesting in smart cities, which is a promising solution for extending the lifetime of low-power devices and its related challenges. We detail two case studies. The first one targets energy-efficient scheduling in smart homes, and the second covers wireless power transfer for IoT devices in smart cities. Simulation results for the case studies demonstrate the tremendous impact of energy-efficient scheduling optimization and wireless power transfer on the performance of IoT in smart cities
A Coverage Monitoring algorithm based on Learning Automata for Wireless Sensor Networks
To cover a set of targets with known locations within an area with limited or
prohibited ground access using a wireless sensor network, one approach is to
deploy the sensors remotely, from an aircraft. In this approach, the lack of
precise sensor placement is compensated by redundant de-ployment of sensor
nodes. This redundancy can also be used for extending the lifetime of the
network, if a proper scheduling mechanism is available for scheduling the
active and sleep times of sensor nodes in such a way that each node is in
active mode only if it is required to. In this pa-per, we propose an efficient
scheduling method based on learning automata and we called it LAML, in which
each node is equipped with a learning automaton, which helps the node to select
its proper state (active or sleep), at any given time. To study the performance
of the proposed method, computer simulations are conducted. Results of these
simulations show that the pro-posed scheduling method can better prolong the
lifetime of the network in comparison to similar existing method
- …