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

Optimizing Distribution Sensor Placement for Border Patrol Interdiction using Microsoft Excel

The purpose of this research was to develop an electronic sensor placement model for border security. A model was developed using Microsoft Excel, with some add-on capabilities, to optimize the placement of electronic sensors on a border network given a pre-determined budgetary constraint. The model is capable of handling multiple sensor types, which are placed together as packages, and allows for daytime, nighttime, or 24 hour operation of each sensor type. Additionally, each sensor can be assigned a specific range and detection probability curve within the given range. The model is capable of optimizing either average coverage, or minimum coverage, across the nodes of a network by selecting the nodes where sensor packages are to be placed. Due to its simplicity and ability to run in Microsoft Excel, it is believed that the model developed in this research can also be used in a number of military applications where border security is necessary

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative. We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other approaches, they produce significantly better results. They are very robust against variations in node degree and do not rely on simplified assumptions of the communication model. Moreover, they are much easier to implement on real sensor nodes than most existing approaches.Comment: extended version of accepted submission to SEA 201

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

Smartening the Environment using Wireless Sensor Networks in a Developing Country

The miniaturization process of various sensing devices has become a reality by enormous research and advancements accomplished in Micro Electro-Mechanical Systems (MEMS) and Very Large Scale Integration (VLSI) lithography. Regardless of such extensive efforts in optimizing the hardware, algorithm, and protocols for networking, there still remains a lot of scope to explore how these innovations can all be tied together to design Wireless Sensor Networks (WSN) for smartening the surrounding environment for some practical purposes. In this paper we explore the prospects of wireless sensor networks and propose a design level framework for developing a smart environment using WSNs, which could be beneficial for a developing country like Bangladesh. In connection to this, we also discuss the major aspects of wireless sensor networks.Comment: 5 page

Optimal Placement of Relay Stations in Wireless Sensor Networks

Wireless sensor networks (WSNs) are a collection of nodes organized into a cooperative network with sensing, processing and transmitting capabilities. WSNs are becoming an increasingly prominent technology that can be used in diverse application areas. In WSNs, cooperative relay stations are projected as one of the most cost effective solutions to meet the demanding requirement of capacity enhancement. In this paper, major concerns of the wireless sensor networks addressed are optimizing the number of relay stations required for covering the desired percentage of sensor nodes by optimal placement of relay stations and optimal assignment of the sensors to the relay stations. The joint problem of relay station placement and coverage is formulated into a mixed integer program which is solvable by commercial GAMS software with Xpress-MP Solver. Sensitivity analysis is carried out, along with a case study to demonstrate the performance gain of the model

The Coverage Problem in Video-Based Wireless Sensor Networks: A Survey

Wireless sensor networks typically consist of a great number of tiny low-cost electronic devices with limited sensing and computing capabilities which cooperatively communicate to collect some kind of information from an area of interest. When wireless nodes of such networks are equipped with a low-power camera, visual data can be retrieved, facilitating a new set of novel applications. The nature of video-based wireless sensor networks demands new algorithms and solutions, since traditional wireless sensor networks approaches are not feasible or even efficient for that specialized communication scenario. The coverage problem is a crucial issue of wireless sensor networks, requiring specific solutions when video-based sensors are employed. In this paper, it is surveyed the state of the art of this particular issue, regarding strategies, algorithms and general computational solutions. Open research areas are also discussed, envisaging promising investigation considering coverage in video-based wireless sensor networks