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

Sensory semantic user interfaces (SenSUI)

Rapid evolution of the World Wide Web with its underlying sources of data, knowledge, services and applications continually attempts to support a variety of users, with different backgrounds, requirements and capabilities. In such an environment, it is highly unlikely that a single user interface will prevail and be able to fulfill the requirements of each user adequately. Adaptive user interfaces are able to adapt information and application functionalities to the user context. In contrast, pervasive computing and sensor networks open new opportunities for context aware platforms, one that is able to improve user interface adaptation reacting to environmental and user sensors. Semantic web technologies and ontologies are able to capture sensor data and provide contextual information about the user, their actions, required applications and environment. This paper investigates the viability of an approach where semantic web technologies are used to maximize the efficacy of interface adaptation through the use of available ontology

Dynamic Reconfiguration in Camera Networks: A Short Survey

There is a clear trend in camera networks towards enhanced functionality and flexibility, and a fixed static deployment is typically not sufficient to fulfill these increased requirements. Dynamic network reconfiguration helps to optimize the network performance to the currently required specific tasks while considering the available resources. Although several reconfiguration methods have been recently proposed, e.g., for maximizing the global scene coverage or maximizing the image quality of specific targets, there is a lack of a general framework highlighting the key components shared by all these systems. In this paper we propose a reference framework for network reconfiguration and present a short survey of some of the most relevant state-of-the-art works in this field, showing how they can be reformulated in our framework. Finally we discuss the main open research challenges in camera network reconfiguration

Communication-aware motion planning in mobile networks

Over the past few years, considerable progress has been made in the area of networked robotic systems and mobile sensor networks. The vision of a mobile sensor network cooperatively learning and adapting in harsh unknown environments to achieve a common goal is closer than ever. In addition to sensing, communication plays a key role in the overall performance of a mobile network, as nodes need to cooperate to achieve their tasks and thus have to communicate vital information in environments that are typically challenging for communication. Therefore, in order to realize the full potentials of such networks, an integrative approach to sensing (information gathering), communication (information exchange), and motion planning is needed, such that each mobile sensor considers the impact of its motion decisions on both sensing and communication, and optimizes its trajectory accordingly. This is the main motivation for this dissertation. This dissertation focuses on communication-aware motion planning of mobile networks in the presence of realistic communication channels that experience path loss, shadowing and multipath fading. This is a challenging multi-disciplinary task. It requires an assessment of wireless link qualities at places that are not yet visited by the mobile sensors as well as a proper co-optimization of sensing, communication and navigation objectives, such that each mobile sensor chooses a trajectory that provides the best balance between its sensing and communication, while satisfying the constraints on its connectivity, motion and energy consumption. While some trajectories allow the mobile sensors to sense efficiently, they may not result in a good communication. On the other hand, trajectories that optimize communication may result in poor sensing. The main contribution of this dissertation is then to address these challenges by proposing a new paradigm for communication-aware motion planning in mobile networks. We consider three examples from networked robotics and mobile sensor network literature: target tracking, surveillance and dynamic coverage. For these examples, we show how probabilistic assessment of the channel can be used to integrate sensing, communication and navigation objectives when planning the motion in order to guarantee satisfactory performance of the network in realistic communication settings. Specifically, we characterize the performance of the proposed framework mathematically and unveil new and considerably more efficient system behaviors. Finally, since multipath fading cannot be assessed, proper strategies are needed to increase the robustness of the network to multipath fading and other modeling/channel assessment errors. We further devise such robustness strategies in the context of our communication-aware surveillance scenario. Overall, our results show the superior performance of the proposed motion planning approaches in realistic fading environments and provide an in-depth understanding of the underlying design trade-off space

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks

Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain location information through local communication, or they assume a dense network that remains connected. In addition, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not governed by these assumptions, and thus adapt to a wider range of application scenarios. The schemes are designed to maximize sensing coverage and also guarantee connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance. The schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Our first scheme is an enhanced form of the traditional virtual-force-based method, which we term the Connectivity-Preserved Virtual Force (CPVF) scheme. We show that the localized communication, which is the very reason for its simplicity, results in poor coverage in certain cases. We then describe a Floor-based scheme which overcomes the difficulties of CPVF and, as a result, significantly outperforms it and other state-of-the-art approaches. Throughout the paper our conclusions are corroborated by the results from extensive simulations