Deployment Design of Wireless Sensor Network for Simple Multi-Point Surveillance of a Moving Target

In this paper, we focus on the problem of tracking a moving target in a wireless sensor network (WSN), in which the capability of each sensor is relatively limited, to construct large-scale WSNs at a reasonable cost. We first propose two simple multi-point surveillance schemes for a moving target in a WSN and demonstrate that one of the schemes can achieve high tracking probability with low power consumption. In addition, we examine the relationship between tracking probability and sensor density through simulations, and then derive an approximate expression representing the relationship. As the results, we present guidelines for sensor density, tracking probability, and the number of monitoring sensors that satisfy a variety of application demands

Wireless Sensor Technologies and Applications

Recent years have witnessed tremendous advances in the design and applications of wirelessly networked and embedded sensors. Wireless sensor nodes are typically low-cost, low-power, small devices equipped with limited sensing, data processing and wireless communication capabilities, as well as power supplies. They leverage the concept of wireless sensor networks (WSNs), in which a large (possibly huge) number of collaborative sensor nodes could be deployed. As an outcome of the convergence of micro-electro-mechanical systems (MEMS) technology, wireless communications, and digital electronics, WSNs represent a significant improvement over traditional sensors. In fact, the rapid evolution of WSN technology has accelerated the development and deployment of various novel types of wireless sensors, e.g., multimedia sensors. Fulfilling Moore’s law, wireless sensors are becoming smaller and cheaper, and at the same time more powerful and ubiquitous. [...

Long-Range Wireless Mesh Network for Weather Monitoring in Unfriendly Geographic Conditions

In this paper a long-range wireless mesh network system is presented. It consists of three main parts: Remote Terminal Units (RTUs), Base Terminal Units (BTUs) and a Central Server (CS). The RTUs share a wireless network transmitting in the industrial, scientific and medical applications ISM band, which reaches up to 64 Km in a single point-to-point communication. A BTU controls the traffic within the network and has as its main task interconnecting it to a Ku-band satellite link using an embedded microcontroller-based gateway. Collected data is stored in a CS and presented to the final user in a numerical and a graphical form in a web portal

Field Measurements and Guidelines for the Application of Wireless Sensor Networks to the Environment and Security

Frequently, Wireless Sensor Networks (WSN) are designed focusing on applications and omitting transmission problems in these wireless networks. In this paper, we present a measurement campaign that has been carried out using one of the most commonly used WSN platforms, the micaZ from Crossbow©. Based on these measurements, some guidelines to deploy a robust and reliable WSN are provided. The results are focused on security and environmental applications but can also be extrapolated to other scenarios. A main conclusion that can be extracted is that, from the transmission point of view, a dense WSN is one of the best choices to overcome many of the transmission problems such as the existence of a transitional region, redundance, forwarding, obstructions or interference with other systems

Wireless Sensor Network Deployment for Monitoring Wildlife Passages

Wireless Sensor Networks (WSNs) are being deployed in very diverse application scenarios, including rural and forest environments. In these particular contexts, specimen protection and conservation is a challenge, especially in natural reserves, dangerous locations or hot spots of these reserves (i.e., roads, railways, and other civil infrastructures). This paper proposes and studies a WSN based system for generic target (animal) tracking in the surrounding area of wildlife passages built to establish safe ways for animals to cross transportation infrastructures. In addition, it allows target identification through the use of video sensors connected to strategically deployed nodes. This deployment is designed on the basis of the IEEE 802.15.4 standard, but it increases the lifetime of the nodes through an appropriate scheduling. The system has been evaluated for the particular scenario of wildlife monitoring in passages across roads. For this purpose, different schemes have been simulated in order to find the most appropriate network operational parameters. Moreover, a novel prototype, provided with motion detector sensors, has also been developed and its design feasibility demonstrated. Original software modules providing new functionalities have been implemented and included in this prototype. Finally, main performance evaluation results of the whole system are presented and discussed in depth

Monitoring using Heterogeneous Autonomous Agents.

This dissertation studies problems involving different types of autonomous agents observing objects of interests in an area. Three types of agents are considered: mobile agents, stationary agents, and marsupial agents, i.e., agents capable of deploying other agents or being deployed themselves. Objects can be mobile or stationary. The problem of a mobile agent without fuel constraints revisiting stationary objects is formulated. Visits to objects are dictated by revisit deadlines, i.e., the maximum time that can elapse between two visits to the same object. The problem is shown to be NP-complete and heuristics are provided to generate paths for the agent. Almost periodic paths are proven to exist. The efficacy of the heuristics is shown through simulation. A variant of the problem where the agent has a finite fuel capacity and purchases fuel is treated. Almost periodic solutions to this problem are also shown to exist and an algorithm to compute the minimal cost path is provided. A problem where mobile and stationary agents cooperate to track a mobile object is formulated, shown to be NP-hard, and a heuristic is given to compute paths for the mobile agents. Optimal configurations for the stationary agents are then studied. Several methods are provided to optimally place the stationary agents; these methods are the maximization of Fisher information, the minimization of the probability of misclassification, and the minimization of the penalty incurred by the placement. A method to compute optimal revisit deadlines for the stationary agents is given. The placement methods are compared and their effectiveness shown using numerical results. The problem of two marsupial agents, one carrier and one passenger, performing a general monitoring task using a constrained optimization formulation is stated. Necessary conditions for optimal paths are provided for cases accounting for constrained release of the passenger, termination conditions for the task, as well as retrieval and constrained retrieval of the passenger. A problem involving two marsupial agents collecting information about a stationary object while avoiding detection is then formulated. Necessary conditions for optimal paths are provided and rectilinear motion is demonstrated to be optimal for both agents.PhDAerospace EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/111439/1/jfargeas_1.pd