无线传感器网络的通信能量有效性的研究

无线传感器节点通常依靠电池供能,为了满足无线传感器网络的往往长达数年的生命周期要求,应当努力提高其能量有效性,特别是消耗大部分能量的通信模块的能量有效性.首先系统讨论了无线传感器网络的通信的能量有效性的研究现状,然后基于传感器节点的通信模块的功耗特性,运用应用驱动和跨层优化的方法,设计了一种无线传感器网络通信架构--ADCOCA (Application-Driven and Cross-layer Optimized Communication Architecture).理论分析表明,ADCOCA改善了无线传感器网络通信的能量有效性,延长了网络的生命周期,推动了无线传感器网络应用的普及.     

An analytical study of central and in-network data processing for wireless sensor networks

This paper compares the performance of centralized and in-network data processing for wireless sensor networks (WSNs) under various deployment conditions on the real sensor hardware Sun SPOT from Sun Microsystems. We define several criteria to measure the quality of responses in WSN applications. Guided by an extensive experimental study, we discuss in detail the performance impacts of different deployment factors on algorithms that implement both centralized and in-network computing. Finally, performance guidelines are given to algorithm designers for WSN applications.     

QoS-aware optimization of sensor network queries

The resource-constrained nature of mote-level wireless sensor networks (WSNs) poses challenges for the design of a general-purpose sensor network query processors (SNQPs). Existing SNQPs tend to generate query execution plans (QEPs) that are selected on the basis of a fixed, implicit expectation, for example, that energy consumption should be kept as small as possible. However, in WSN applications, the same query may be subject to several, possibly conflicting, quality-of-service (QoS) expectations concomitantly (for example maximizing data acquisition rates subject to keeping energy consumption low). It is also not uncommon for the QoS expectations to change over the lifetime of a deployment (for example from low to high data acquisition rates). This paper describes optimization algorithms that respond to stated QoS expectations (about acquisition rate, delivery time, energy consumption and lifetime) when making routing, placement, and timing decisions for in-WSN query processing. The paper shows experimentally that QoS-awareness offers significant benefits in responding to, and reconciling, diverse QoS expectations, thereby enabling QoS-aware SNQPs to generate efficient QEPs for a broader range WSN applications than has hitherto been possible.     

Wireless sensor networks: a survey on recent developments and potential synergies

Wireless sensor network (WSN) has emerged as one of the most promising technologies for the future. This has been enabled by advances in technology and availability of small, inexpensive, and smart sensors resulting in cost effective and easily deployable WSNs. However, researchers must address a variety of challenges to facilitate the widespread deployment of WSN technology in real-world domains. In this survey, we give an overview of wireless sensor networks and their application domains including the challenges that should be addressed in order to push the technology further. Then we review the recent technologies and testbeds for WSNs. Finally, we identify several open research issues that need to be investigated in future. Our survey is different from existing surveys in that we focus on recent developments in wireless sensor network technologies. We review the leading research projects, standards and technologies, and platforms. Moreover, we highlight a recent phenomenon in WSN research that is to explore synergy between sensor networks and other technologies and explain how this can help sensor networks achieve their full potential. This paper intends to help new researchers entering the domain of WSNs by providing a comprehensive survey on recent developments.     

A survey on coverage and connectivity issues in wireless sensor networks

A wireless sensor network (WSN) is composed of a group of small power-constrained nodes with functions of sensing and communication, which can be scattered over a vast region for the purpose of detecting or monitoring some special events. The first challenge encountered in WSNs is how to cover a monitoring region perfectly. Coverage and connectivity are two of the most fundamental issues in WSNs, which have a great impact on the performance of WSNs. Optimized deployment strategy, sleep scheduling mechanism, and coverage radius cannot only reduce cost, but also extend the network lifetime. In this paper, we classify the coverage problem from different angles, describe the evaluation metrics of coverage control algorithms, analyze the relationship between coverage and connectivity, compare typical simulation tools, and discuss research challenges and existing problems in this area.     

An agent-assisted QoS-based routing algorithm for wireless sensor networks

Existing routing algorithms are not effective in supporting the dynamic characteristics of wireless sensor networks (WSNs) and cannot ensure sufficient quality of service in WSN applications. This paper proposes a novel agent-assisted QoS-based routing algorithm for wireless sensor networks. In the proposed algorithm, the synthetic QoS of WSNs is chosen as the adaptive value of a Particle Swarm Optimization algorithm to improve the overall performance of network. Intelligent software agents are used to monitor changes in network topology, network communication flow, and each node's routing state. These agents can then participate in network routing and network maintenance. Experiment results show that the proposed algorithm can ensure better quality of service in wireless sensor networks compared with traditional algorithms.     

A dynamic password-based user authentication scheme for hierarchical wireless sensor networks

Most queries in wireless sensor network (WSN) applications are issued at the point of the base station or gateway node of the network. However, for critical applications of WSNs there is a great need to access the real-time data inside the WSN from the nodes, because the real-time data may no longer be accessed through the base station only. So, the real-time data can be given access directly to the external users (parties) those who are authorized to access data as and when they demand. The user authentication plays a vital role for this purpose. In this paper, we propose a new password-based user authentication scheme in hierarchical wireless sensor networks. Our proposed scheme achieves better security and efficiency as compared to those for other existing password-based approaches. In addition, our scheme has merit to change dynamically the user's password locally without the help of the base station or gateway node. Furthermore, our scheme supports dynamic nodes addition after the initial deployment of nodes in the existing sensor network.     

Energy‐efficient task allocation with quality of service provisioning for concurrent applications in multi‐functional wireless sensor network systems

Multi‐functional wireless sensor network (WSN) system is a new design trend of WSNs, which are evolving from dedicated application‐specific systems to an integrated infrastructure that supports the execution of multiple concurrent applications. Such system offers inherent advantages in terms of cost and flexibility because it allows the effective utilization of available sensors and resource sharing among multiple applications. However, sensor nodes are very constrained in resources, mainly regarding their energy. Therefore, the usage of such resources needs to be carefully managed, and the sharing with several applications imposes new challenges in achieving energy efficiency in these networks. In order to exploit the full potential of multi‐functional WSN systems, it is crucial to design mechanisms that effectively allocate tasks onto sensors so that the entire system lifetime is maximized while meeting various application requirements. However, it is likely that the requirements of different applications cannot be simultaneously met. In this paper, we present the Multi‐Application Requirements Aware and Energy Efficiency algorithm as a new resource allocation heuristic for multi‐functional WSN system to maximize system lifetime subject to various application requirements. The heuristic effectively deals with different quality of service parameters (possibly conflicting) trading those parameters and exploiting heterogeneity of multiple WSNs. Copyright © 2013 John Wiley & Sons, Ltd.     

Information quality model and optimization for 802.15.4-based wireless sensor networks

High information quality is a paramount requirement for wireless sensor network (WSN) monitoring applications. However, it is challenging to achieve a cost effective information quality solution due to unpredictable environment noise and events, unreliable wireless channel and network bandwidth, and sensor resource and energy constraints. Specifically, the dynamic and unreliable nature of WSNs make it difficult to pre-determine optimum sensor rates and predict packet loss. To address this problem, we present an information quality metric which characterizes information quality based on the sampling frequency of sensor nodes and the packet loss rate during network transmission. Our fundamental quality metric is based on signal-to-noise ratio and is therefore application independent. Based on our metric, a quality-aware scheduling system (QSS) is developed, which exploits cross-layer control of sensor nodes to effectively schedule data sensing and forwarding. Particularly, we develop and evaluate several QSS scheduling mechanisms: passive, reactive and perceptive. These mechanisms can adapt to environment noise, bandwidth variation and wireless channel collisions by dynamically controlling sensor rates and phase. Our experimental results indicate that our QSS is a novel and effective approach to improve information quality for WSNs.     

Efficient allocation of resources in multiple heterogeneous Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are useful for a wide range of applications, from different domains. Recently, new features and design trends have emerged in the WSN field, making those networks appealing not only to the scientific community but also to the industry. One such trend is the running different applications on heterogeneous sensor nodes deployed in multiple WSNs in order to better exploit the expensive physical network infrastructure. Another trend deals with the capability of accessing sensor generated data from the Web, fitting WSNs in novel paradigms of Internet of Things (IoT) and Web of Things (WoT). Using well-known and broadly accepted Web standards and protocols enables the interoperation of heterogeneous WSNs and the integration of their data with other Web resources, in order to provide the final user with value-added information and applications. Such emergent scenarios where multiple networks and applications interoperate to meet high level requirements of the user will pose several changes in the design and execution of WSN systems. One of these challenges regards the fact that applications will probably compete for the resources offered by the underlying sensor nodes through the Web. Thus, it is crucial to design mechanisms that effectively and dynamically coordinate the sharing of the available resources to optimize resource utilization while meeting application requirements. However, it is likely that Quality of Service (QoS) requirements of different applications cannot be simultaneously met, while efficiently sharing the scarce networks resources, thus bringing the need of managing an inherent tradeoff. In this paper, we argue that a middleware platform is required to manage heterogeneous WSNs and efficiently share their resources while satisfying user needs in the emergent scenarios of WoT. Such middleware should provide several services to control running application as well as to distribute and coordinate nodes in the execution of submitted sensing tasks in an energy-efficient and QoS-enabled way. As part of the middleware provided services we present the Resource Allocation in Heterogeneous WSNs (SACHSEN) algorithm. SACHSEN is a new resource allocation heuristic for systems composed of heterogeneous WSNs that effectively deals with the tradeoff between possibly conflicting QoS requirements and exploits heterogeneity of multiple WSNs.     

基于零打扰测试背板的无线传感器网络测试平台

精确的网络运行状态监视和性能评估对于无线传感器网络的研究和实际部署具有极为关键的意义,而现有的测试技术和测试平台对无线传感器网络的自身运行存在一定的打扰,测试数据的精度也受限于传感器节点的硬件配置.针对现有测试技术和测试平台的缺陷,提出了内部侦听的测试方式,并进一步研发了基于零打扰测试背板的无线传感器网络测试平台.测试平台首先通过由额外的测试背板直接捕获传感器节点内部互连信号,产生测试数据;然后测试数据经由额外的传输网络传送到测试服务器,进行解析和预处理;最后,远程访问客户端通过订阅机制访问测试服务器上的测试数据,并对其分析和处理.测试平台在避免对无线传感器网络正常运行产生干扰的前提下,实现对运行时刻的无线传感器网络的高精度零打扰的透明测试.实验结果表明,基于零打扰测试背板的无线传感器网络测试平台可以对无线传感器网络进行信号分析、协议验证,并对性能进行精确的评估,     

Energy-efficient multipath routing in wireless sensor network considering wireless interference

Due to the energy and resource constraints of a wireless sensor node in a wireless sensor network (WSN), design of energy-efficient multipath routing protocols is a crucial concern for WSN applications. To provide high-quality monitoring information, many WSN applications require high-rate data transmission. Multipath routing protocols are often used to increase the network transmission rate and throughput. Although large-scale WSN can be supported by high bandwidth backbone network, the WSN remains the bottleneck due to resource constraints of wireless sensors and the effects of wireless interference. In this paper, we propose a multipath energy-efficient routing protocol for WSN that considers wireless interference. In the proposed routing protocol, nodes in the interference zone of the discovered path are marked and not allowed to take part in the subsequent routing process. In this way, the quality of wireless communication is improved because the effects of wireless interference can be reduced as much as possible. The network load is distributed on multiple paths instead of concentrating on only one path, and node energy cost is more balanced for the entire wireless network. The routing protocol is simulated in NS2 software. Simulation result shows that the proposed routing protocol achieves lower energy cost and longer network lifetime than that in the literature.     

An adaptive in-network aggregation operator for query processing in wireless sensor networks

A wireless sensor network (WSN) is composed of tens or hundreds of spatially distributed autonomous nodes, called sensors. Sensors are devices used to collect data from the environment related to the detection or measurement of physical phenomena. In fact, a WSN consists of groups of sensors where each group is responsible for providing information about one or more physical phenomena (e.g., group for collecting temperature data). Sensors are limited in power, computational capacity, and memory. Therefore, a query engine and query operators for processing queries in WSNs should be able to handle resource limitations such as memory and battery life. Adaptability has been explored as an alternative approach when dealing with these conditions. Adaptive query operators (algorithms) can adjust their behavior in response to specific events that take place during data processing. In this paper, we propose an adaptive in-network aggregation operator for query processing in sensor nodes of a WSN, called ADAGA (ADaptive AGgregation Algorithm for sensor networks). The ADAGA adapts its behavior according to memory and energy usage by dynamically adjusting data-collection and data-sending time intervals. ADAGA can correctly aggregate data in WSNs with packet replication. Moreover, ADAGA is able to predict non-performed detection values by analyzing collected values. Thus, ADAGA is able to produce results as close as possible to real results (obtained when no resource constraint is faced). The results obtained through experiments prove the efficiency of ADAGA.     

基于RSSI的无线传感器网络定位技术的研究

节点定位技术是无线传感器网络(WSN)的支撑技术之一,给无线传感器网络的各种应用提供节点的位置信息,具有重要的作用。本文分析了无线传感器网络的节点定位算法的原理和分类,并着重分析了基于信号强度测距法(RSSI)的无线定位技术,提出了将信号强度理论值与经验值相融合的定位方法。     

Delay characterization and performance evaluation of cluster-based WSN with different deployment distributions

Provisioning of quality of service (QoS) is the ultimate goal for any wireless sensor network (WSN). Several factors can influence this requirement such as the adopted cluster formation algorithm. Almost all WSNs are structured based on grouping the sensors nodes into clusters. Not all contemporary cluster formation and routing algorithms (e.g. LEACH) were designed to provide/sustain certain QoS requirement such as delay constraint. Another fundamental design issue is that, these algorithms were built and tested under the assumption of uniformly distributed sensor nodes. However, this assumption is not always true. In some industrial applications and due to the scope of the ongoing monitoring process, sensors are installed and condensed in certain areas, while they are widely separated in other areas. Also unlike the random deployment distributions, there are many applications that need deterministic deployment of sensors like grid distribution. In this work, we investigated and characterized the impact of sensor node deployment distributions on the performance of different flavors of LEACH routing algorithm. In particular, we studied via extensive simulation experiments how LEACH cluster formation approach affects the delay (inter and intra-cluster delay) and energy efficiency expressed in terms of packet/joule for different base station locations and data loads. In this study, we consider four deployment distributions: grid, normal, exponential and uniform. The results showed the significant impact of nodes distribution on the network energy efficiency, throughput and delay performance measures. These findings would help the architects of real time application wireless sensor networks such as secure border sensor networks to design such networks to meet its specifications effectively and fulfill their critical mission.     

无线传感器网络路由算法的研究

无线传感器网络是一种全新的信息获取和处理技术,路由协议是其组网的基础,在综合大量路由协议和算法文献的基础上,提出了一种新的无线传感器网络路由算法;在该算法中,信息素的形成不仅考虑节点间的梯度因素,还融合了节点的剩余能量,同时,算法中还设置了节点的能量阈值,以防止一些节点由于作为中间节点转发数据包过早死亡而导致这些节点所在区域失去监控;实验结果验证了该算法的有效性,可以很好地适应无线传感器网络无集中控制和动态拓扑的特点,同时支持多径路由。     

Existence of dumb nodes in stationary wireless sensor networks

Wireless sensor networks (WSNs), which are typically autonomous and unattended, require energy-efficient and fault-tolerant protocols to maximize the network lifetime and operations. In this work, we consider a previously unexplored aspect of the sensing nodes – dumb behavior. A sensor node is termed as “dumb”, when it can sense its surroundings, but cannot communicate with its neighbors due to shrinkage in communication range attributed to adverse environmental effects and can behave normally in the presence of favorable environment. As a result of this temporary behavior, a node may get isolated from the network when adverse environmental effects are present, but re-connects with the network with the resumption of favorable environmental conditions. We consider the effects of dumb nodes on the, otherwise, energy-efficient stationary WSNs having complete network coverage achieved using sufficient number of activated sensor nodes. While the presence of redundancy in the deployment of nodes, or the number of active nodes can guarantee communication opportunities, such deployment is not necessarily energy-efficient and cost-effective. The dumb behavior of nodes results in wastage of power, thereby reducing the lifetime of a network. Such effects can be detrimental to the performance of WSN applications. The simulation results exhibit that the network performance degrades in the presence of dumb nodes in stationary WSNs.     

无线传感器网络中的资源优化

无线传感器网络是一种新兴的技术,与传统的网络相比最突出的特点就是超大规模,无人值守,应用环境变化频繁.解决能量受限问题,适应变化频繁的拓扑结构是目前无线传感器网络面临的最大挑战.针对这一特点,本文以优化网络资源和延长网络寿命为目标,归纳了无线传感器网络部署、任务分配、信息处理和中间件定位中的优化问题,并分别对这些具体问题进行了探讨,对一些可能的研究方向进行了简要的阐述,为以后的研究奠定了基础.     

随机部署WSNs多环形泊松指数负载均衡分布*

针对传统随机部署无线传感器网络(WSNs)信号传输算法中能耗分布不均,影响网络使用寿命的问题,提出一种多环形泊松指数负载均衡分布WSNs信号传输机制。首先,利用sink节点发送“HELLO”数据包方式,构建多环形数据传输的分区机制;其次,为避免“HELLO”数据包产生冲突,给出数据包发送等待时间形式,同时,通过数值理论分析和图形化分析方式,给出多环节点能耗泊松指数分布形式。最后,通过在网络模拟器NS-2上的仿真测试显示,本文算法比采用的两种对比算法具有更均匀的能耗分布,及更长的网络使用寿命。     

Node localization algorithm for wireless sensor networks using compressive sensing theory

In recent years, localization has been recognized as an important supporting technology for wireless sensor networks (WSNs). Along with the increase in WSN indoor applications, indoor localization has become a hot research topic and many localization algorithms have been studied. Among these algorithms, the localization method based on compressive sensing theory emerges as a popular approach to indoor localization. In this approach, the nodes are sparse when compared to the number of grids utilized to represent the locations of the nodes, so the locations are considered as sparse signal and can be reconstructed using the compressive sensing techniques. The localization problem is formulated as the sparse reconstruction of sparsifying matrix which is comprised of measurement of received signal at grids. In order to improve the localization accuracy and meet the real-time requirement of localization applications in large indoor area, an indoor localization algorithm based on dynamic measurement compressive sensing for wireless sensor networks is proposed. Using the bounding-box method, we firstly identify a potential area that possesses the independent features. Instead of using the entire node deployment region as the measurement area, our method can decrease the number of meshing and also the dimension of measurement matrix. Meanwhile, we assume that only the anchor nodes which have communication relationship with the unknown nodes can be used as the measuring nodes; the measurement matrix of unknown nodes which need to be localized can be dynamically constructed according to the potential area and the received anchor node information, and the maximum number of measurement is decided by the number of grids of potential area. The proposed algorithm can mitigate the measurement redundancy and improve the real-time feature. Simulation results indicate that the proposed algorithm can reduce the time complexity and also maintain good localization accuracy and localization efficiency.