基于ZigBee技术的黄河河道冰情多点监测系统设计

针对黄河河道冰情的多点监测问题,提出了一种基于ZigBee技术的河道冰层厚度多点监测系统的设计方案,简要介绍了ZigBee技术的主要特点,冰层厚度传感器结构与检测原理,提出了基于ZigBee的黄河河道冰情多点监测系统结构,讨论了监测系统硬件与软件的设计思路,利用系统可以实现黄河河道局部区域内多点冰情远程无人连续自动监测.     

Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges

Wireless sensor networks involve many different real-world contexts, such as monitoring and control tasks for traffic, surveillance, military and environmental applications, among others. Usually, these applications consider the use of a large number of low-cost sensing devices to monitor the activities occurring in a certain set of target locations. We want to individuate a set of covers (that is, subsets of sensors that can cover the whole set of targets) and appropriate activation times for each of them in order to maximize the total amount of time in which the monitoring activity can be performed (network lifetime), under the constraint given by the limited power of the battery contained in each sensor. A variant of this problem considers that each sensor can be activated in a certain number of alternative power levels, which determine different sensing ranges and power consumptions. We present some heuristic approaches and an exact approach based on the column generation technique. An extensive experimental phase proves the advantage in terms of solution quality of using adjustable sensing ranges with respect to the classical single range scheme.     

On Dyakonov type theorems for harmonic quasiregular mappings

We prove two Dyakonov type theorems which relate the modulus of continuity of a function on the unit disc with the modulus of continuity of its absolute value. The methods we use are quite elementary, they cover the case of functions which are quasiregular and harmonic, briefly hqr, in the unit disc.     

Modeling and optimization of energy efficient routing in wireless sensor networks

Wireless sensor networks (WSNs) have important applications in remote environmental monitoring and target tracking. The development of WSNs in recent years has been facilitated by the availability of sensors that are smaller, less expensive, and more intelligent. The design of a WSN depends significantly on its desired applications and must take into account factors such as the environment, the design objectives of the application, the associated costs, the necessary hardware, and any applicable system constraints. In this study, we propose mathematical models for a routing protocol (network design) under particular resource restrictions within a wireless sensor network. We consider two types of constraints: the distance between the linking sensors and the energy used by the sensors. The proposed models aim to identify energy-efficient paths that minimize the energy consumption of the network from the source sensor to the base station. The computational results show that the presented models can be used efficiently and applied to other network design contexts with resource restrictions (e.g., to multi-level supply chain networks).     

A unified solving approach for two and three dimensional coverage problems in sensor networks

The problem of designing a wired or a wireless sensor network to cover, monitor and/or control a region of interest has been widely treated in literature. This problem is referred to in literature as the sensor placement problem (SPP) and in the most general case it consists in determining the number and the location of one or more kind of sensors with the aim of covering all the region of interest or a significant part of it. In this paper we propose a unified and stepwise solving approach for two and three dimensional coverage problems to be used in omni-directional and directional sensor networks. The proposed approach is based on schematizing the region of interest and the sensor potential locations by a grid of points and representing the sensor coverage area by a circle or by a circular sector. On this basis, the SPP is reduced to an optimal coverage problem and can be formulated by integer linear programming (ILP) models. We will resume the main ILP models used in our approach, highlighting, for each of them, the specific target to be achieved and the design constraints taken into account. The paper concludes with an application of the proposed approach to a real test case and a discussion of the obtained results.     

A programming system for sensor-based scientific applications

Technical advances are leading to a pervasive computational ecosystem that integrates computing infrastructures with embedded sensors and actuators, and are giving rise to a new paradigm for monitoring, understanding, and managing natural and engineered systems – one that is information/data-driven. In this paper, we present a programming system that can support such end-to-end sensor-based dynamic data-driven applications. Specifically, the programming system enables these applications at two levels. First, it provides programming abstractions for integrating sensor systems with computational models for scientific and engineering processes and with other application components in an end-to-end experiment. Second, it provides programming abstractions and system software support for developing in-network data processing mechanisms. The former supports complex querying of the sensor system, while the latter enables development of in-network data processing mechanisms such as aggregation, adaptive interpolation and assimilation. Furthermore, for the latter, we also explore the use of temporal and spatial correlations of sensor measurements in the targeted application domains to tradeoff between the complexity of coordination among sensor clusters and the savings that result from having fewer sensors for in-network processing, while maintaining an acceptable error threshold. The research is evaluated using two application scenarios: the management and optimization of an instrumented oil field and the management and optimization of an instrumented data center. Experimental results show that the provided programming system reduces overheads while achieving near optimal and timely management and control in both application scenarios.     

Optimization scheme for sensor coverage scheduling with bandwidth constraints

Wireless Sensor Network has attracted a lot of attentions due to its broad applications in recent years and also introduces many challenges. Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize the network lifetime. We show a “trade-off” scheme by presenting two strongly related models, which aim to tradeoffs between the two conflicting objectives. The main approach of our models is organizing sensors into non-disjoint sets, which is different from the current most popular approach and can gain longer network lifetime as well as less coverage breach. We proposed two algorithms for the first model based on linear programming and greedy techniques, respectively. Then we transform these algorithms to solve the second model by revealing the strong connection between the models. Through numerical simulation, we showed the good performance of our algorithms and the pictures of the tradeoff scheme in variant scenarios, which coincide with theoretical analysis very well. It is also showed that our algorithms could obtain less breach rate than the one proposed in (Cheng et al. in INFOCOM’ 05, 2005).     

Design and simulation of sensor fusion using symbolic engines

Sensor fusion is the art of estimating accurate information from noisy multi-sensor data. Due to the complexity of stochastic sensor errors, design and testing of sensor fusion algorithms have been always challenging. Existing design approaches are mainly mission specific with fixed system models that do not verify if the filter can estimate hidden errors. To address these challenges, this paper presents a flexible design and simulation environment for sensor fusion. The environment utilizes symbolic engine as a flexible representation of system models to enable flexible and accurate generation of linearized error models. Inverse kinematic is used to generate pseudo-error-free inertial data to test the ability of the filte to estimate sensor errors. The developed environment is demonstrated on an Attitude and Heading Reference System using Extended Kalman Filter. The demonstration includes both simulation and experimental tests. The designed filter supports both loosely and tightly coupled filtering approaches.     

Optimal sensor placement for modal identification of structures using genetic algorithms—a case study: the olympic stadium in Cali,Colombia

Adequate sensor placement plays a key role in such fields as system identification, structural control, damage detection and structural health monitoring of flexible structures. In recent years, interest has increased in the development of methods for determining an arrangement of sensors suitable for characterizing the dynamic behavior of a given structure. This paper describes the implementation of genetic algorithms as a strategy for optimal placement of a predefined number of sensors. The method is based on the maximization of a fitness function that evaluates sensor positions in terms of natural frequency identification effectiveness and mode shape independence under various occupation and excitation scenarios using a custom genetic algorithm. A finite element model of the stadium was used to evaluate modal parameters used in the fitness function, and to simulate different occupation and excitation scenarios. The results obtained with the genetic algorithm strategy are compared with those obtained from applying the Effective Independence and Modal Kinetic Energy sensor placement techniques. The sensor distribution obtained from the proposed strategy will be used in a structural health monitoring system to be installed in the stadium.     

基于DS18B20的冰层温度梯度-厚度传感器的设计

根据高寒地区河流结冰时,河道冰情监测点垂直柱面内空气、冰与水三种介质所表现出的不同温度特性,设计了基于DS18820温度传感器的高显示分辨率冰层温度梯度一厚度自动化检测传感器,传感器内部采用单总线结构,通过MSP430单片机的控制实现了温度梯度各监测点的数字化数据采集,使传感器具有结构简单、功耗低、抗干扰能力强等优点.将新型传感器安装在内蒙古三湖口黄河河道并进行了连续两个月的现场冰情数据采集试验,传感器获得了黄河河道监测点系统的温度梯度数据.通过对采集获得的冰层温度梯度数据的进一步分析,可以全面掌握河道冰层变化的状况,实验结果表明这一新的冰层温度梯度一厚度传感器是一种更加适应于工程应用的冰情检测设备.     

Fuzzy minimum weight edge covering problem

Minimum weight edge covering problem, known as a classic problem in graph theory, is employed in many scientific and engineering applications. In the applications, the weight may denote cost, time, or opponent’s payoff, which can be vague in practice. This paper considers the edge covering problem under fuzzy environment, and formulates three models which are expected minimum weight edge cover model, α-minimum weight edge cover model, and the most minimum weight edge cover model. As an extension for the models, we respectively introduce the crisp equivalent of each model in the case that the weights are independent trapezoidal fuzzy variables. Due to the complexity of the problem, a hybrid intelligent algorithm is employed to solve the models, which can deal with the problem with any type of fuzzy weights. At last, some numerical experiments are given to show the application of the models and the robustness of the algorithm.     

Limit laws for coverage in backbone-sensor networks

We study coverage in sensor networks having two types of nodes, namely, sensor nodes and backbone nodes. Each sensor is capable of transmitting information over relatively small distances. The backbone nodes collect information from the sensors. This information is processed and communicated over an ad hoc network formed by the backbone nodes, which are capable of transmitting over much larger distances. We consider two models of deployment for the sensor and backbone nodes. One is a Poisson–Poisson cluster model and the other a dependently thinned Poisson point process. We deduce limit laws for functionals of vacancy in both models using properties of association for random measures.     

On minimum submodular cover with submodular cost

In this paper, we show that a minimum non-submodular cover problem can be reduced into a problem of minimum submodular cover with submodular cost. In addition, we present an application in wireless sensor networks.     

G-networks with multiple classes of signals and positive customers

G-networks are queueing models in which the types of customers one usually deals with in queues are enriched in several ways. In Gnetworks, positive customers are those that are ordinarily found in queueing systems; they queue up and wait for service, obtain service and then leave or go to some other queue. Negative customers have the specific function of destroying ordinary or positive customers. Finally triggers simply move an ordinary customer from one queue to the other. The term “signal” is used to cover negative customers and triggers. G-networks contain these three type of entities with certain restrictions; positive customers can move from one queue to another, and they can change into negative customers or into triggers when they leave a queue. On the other hand, signals (i.e. negative customers and triggers) do not queue up for service and simply disappear after having joined a queue and having destroyed or moved a negative customer. This paper considers this class of networks with multiple classes of positive customers and of signals. We show that with appropriate assumptions on service times, service disciplines, and triggering or destruction rules on the part of signals, these networks have a product form solution, extending earlier results.     

Directional approach to gradual cover: a maximin objective

The objective of original cover location models is to cover demand within a given distance by facilities. Locating a given number of facilities to cover as much demand as possible is referred to as max-cover, and finding the minimum number of facilities required to cover all the demand is referred to as set covering. When the objective is to maximize the minimum cover of demand points, the maximin objective is equivalent to set covering because each demand point is either covered or not. The gradual (or partial) cover replaces abrupt drop from full cover to no cover by defining gradual decline in cover. Both maximizing total cover and maximizing the minimum cover are useful objectives using the gradual cover measure. In this paper we use a recently proposed rule for calculating the joint cover of a demand point by several facilities termed “directional gradual cover”. The objective is to maximize the minimum cover of demand points. The solution approaches were extensively tested on a case study of covering Orange County, California.

     

Properties of the inverses of a set of band matrices

Those regions where the elements of the inverse of a Toeplitz matrix of band width four and order nalternate in sign are determined. A similar result concerning the elements of the inverse of a commonly occurring symmetric positive definite Toeplitz matrix of band width five and order nis extended to cover the case when the first and last rows of the matrix are modified through a change in the boundary conditions of the associated application. A method for economically obtaining the infinity norm of the pent-diagonal symmetric positive definite Toeplitz matrix is then derived.     

Covering a plane with ellipses

Abstract

This paper is devoted to the construction of regular min-density plane coverings with ellipses of one, two and three types. This problem is relevant, for example, to power-efficient surface sensing by autonomous above-grade sensors. A similar problem, for which discs are used to cover a planar region, has been well studied. On the one hand, the use of ellipses generalizes a mathematical problem; on the other hand, it is necessary to solve these types of problems in real applications of wireless sensor networks. This paper both extends some previous results and offers new regular covers that use a small number of ellipses to cover each regular polygon; these covers are characterized by having minimal known density in their classes and give the new upper bounds for densities in these classes as well.     

基于模糊时间序列的传感器网络感知数据预测模型

传感器网络监控系统属于大型复杂系统,由感知节点以一定的时间间隔向sink节点发送感知数据,以实现对应用环境的监控。由于网络本身及应用环境的影响,得到的感知数据往往存在不确定性。此外,周期性报告数据模式影响到实时监控数据的精确性。本文应用时间序列模型预测传感器数据以响应用户查询,可有效降低网络通信量。通过对无线传感器网络的数据分析,引入多属性模糊时间序列预测模型,充分考虑了无线传感器网络时间序列中存在的趋势因素,并提出了适合于传感器网络的修正预测模型。实验结果表明模糊时间序列模型可有效预测传感器网络数据,且能提高预测精度。     

Finite element simulation of water circulation in the North Sea

The modelling of tidal effects, storm surges and currents in large bodies of water is considered. The solution is attempted using the evolutionary shallow water equations with velocities and wave heights as unknowns. Two finite element simulation models are described based on six noded triangular elements. Special consideration has been given to the adequacy of the models which were applied to the North Sea only after extensive tests in channels. Results for velocities and wave heights are compared and discussed. A set of conclusions on the applicability and scope of the models is presented.     

Robust optimization of contaminant sensor placement for community water systems

We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We formulate sensor placement problems as mixed-integer programs, for which the objective coefficients are not known with certainty. We consider a restricted absolute robustness criteria that is motivated by natural restrictions on the uncertain data, and we define three robust optimization models that differ in how the coefficients in the objective vary. Under one set of assumptions there exists a sensor placement that is optimal for all admissible realizations of the coefficients. Under other assumptions, we can apply sorting to solve each worst-case realization efficiently, or we can apply duality to integrate the worst-case outcome and have one integer program. The most difficult case is where the objective parameters are bilinear, and we prove its complexity is NP-hard even under simplifying assumptions. We consider a relaxation that provides an approximation, giving an overall guarantee of near-optimality when used with branch-and-bound search. We present preliminary computational experiments that illustrate the computational complexity of solving these robust formulations on sensor placement applications.