无线传感器与执行器网络层次结构研究

WSAN（无线传感器与执行器网络）通常是由一组传感器节点和执行器节点构成,能够改变环境和物理世界,正在成长为下一代WSN（无线传感器网络）。文章在分析WSAN基本构成与功能的基础上,给出了无线传感器与执行器网络的简单模型与应用．介绍了WSAN物理层、MAC（媒介接入控制）层、传输层当前存在的主要问题,最后从拓扑控制、数...     

一种基于位置的WSAN密钥预分配方案

论文从无线传感器和执行器网络的信息传输方式出发,提出一种新的密钥预分配方案。方案充分利用执行器节点具有能量充足、存储器资源丰富、较强计算和通信能力等特点,结合部署位置信息,在执行器节点-执行器节点和执行器-传感器节点两个通信层上采用不同的密钥预分配方案。通过分析可知,新方案在连通性、安全性、计算和通信消耗上都有良好性能。     

基于安全性的无线传感器网络时钟同步算法研究

无线传感器网络存储能力不高,导致以往提出的无线传感器网络时钟同步算法的安全性能不高、同步误差较大,现提出基于安全性的无线传感器网络时钟同步算法。基于安全性的无线传感器网络时钟同步系统中的父节点构建无线传感器网络和子节点,子节点通过与父节点进行数据交互,平衡无线传感器网络时钟同步,CC2530芯片将父节点和子节点进行连接。无线传感器网络时钟同步的运算工作在仿真器中完成,传输接口将父节点和子节点的交互信息输出到仿真器,为运算工作提供数据仿真源。安全性调试接口对父节点构建网络结果和时钟同步运算结果进行实时展示。系统对同步安全算法和同步算法语言的设计,较为有效地实现了无线传感器网络时钟同步。经实验验证可知,所提算法同步误差小,安全性能高。     

基于本地的无线传感器与执行器网络位置服务方法

文章分析了无线传感器与执行器网络位置服务的基本要求,介绍了无线传感器与执行器网络位置服务的主要类型,描述了执行器位置更新的策略,归纳了扁平式本地位置服务算法和分层式本地位置服务算法的工作原理。     

无线传感器网络多汇聚节点分簇算法

为解决大规模无线传感器网络的节点通信效率问题,提出无线传感器网络的一种多汇聚节点分簇算法,针对拥有多个汇聚节点的监控区域,对网络进行层次化管理。算法通过对多种参数的综合考虑后产生簇头,并将传感器节点分配到相应的簇,由此可以有效降低节点的非均匀能耗,减少因能耗较大节点的能量过度衰竭而造成网络可用率下降。仿真结果显示,该算法可以延缓首个死亡节点的发生时间,并能有效延长无线传感器网络的整体可用率。     

无线传感网络坏点识别研究与应用

无线传感器网络中各传感器节点通过自组织的方式构成,协作地实时监测、感知和采集各种环境或监测对象的信息,一旦某个节点损坏或者被窃取,那么将可能影响整个网络并在网络中传递错误信息。该文针对区域监控网络中单跳网络损坏节点的检测问题,以图论分析为基础,采用特别的网络模型对无线传感网络加以描述,以基站产生虚拟报警机制和特殊报警源求因算法来定位损坏节点,以网络覆盖性能和损坏节点检测率作为算法性能评估标准。实验结果表明:基于二分图的损坏节点识别算法能很好地检测并剔除损坏节点,从而保证无线传感器网络正常工作。     

WSN中基于能量感知的最小跳数路由算法

无线传感器网络的拓扑往往由于节点死亡而发生变化。网络拓扑的重新构建加速了剩余传感器节点的死亡,缩短了网络的生存时间。针对无线传感器网络对网络生存时间的苛刻要求,提出了一种基于能量感知的最小跳数路由算法。建立路由时,该算法综合考虑了节点剩余能量和该节点潜在的转发能力。仿真结果显示,该算法在生存时间、存活节点数和吞吐量方面的性能要远优于LEACH算法和HEED算法。     

一种无线视频传感器网络节点模型的设计方案

无线视频传感器网络可应用于监控、护理、农产品防害等多重领域,具有十分广泛的应用价值。同时,无线视频传感器网络涉及数字图像处理、传感器、无线通信和嵌入式系统等多门学科,也具有很高的理论研究价值。无线视频传感器网络的各项功能都紧密依赖于其节点平台的软硬件能力。另一方面,节点的设计方案也在很大程度上主宰了无线传感器网络的性能...     

基于无线传感器网络的火灾现场定位技术研究

针对目前由消防人员在火灾环境中进行侦察工作的危险性,将无线传感器网络技术应用于消防系统,用具有耐热特性且对温度具有敏感的感知能力的微型传感器在火场中组网,利用DV-hop算法对传感器节点定位,并结合节点处温度变化情况,实现对火场环境的实时监控.经分析得知,基于无线传感器网络的火灾现场定位技术具有很好的可实现性.     

面向电力监控的无线传感器网络算法研究

文中考虑在电力监控系统中部署能量受限的传感器网络,这种网络中的每个传感器节点系统地收集传输的数据并将其传输到基站,着重于降低无线传感器网络的功耗。提出了一种适用于大范围无线传感器网络的能量平衡聚类路由算法(LEACH-L),并推导出最佳跳数。最后对发射节点的最佳位置进行了估计。仿真结果表明,改进后的方案可以在网络中的第一个节点结束前将网络生存期延长80%,该算法比现有的LEACH、LEACH-M等聚类算法具有更高的性能。     

Lightweight routing with dynamic interests in wireless sensor and actor networks

Wireless sensor and actor networks (WSANs) have been increasingly popular for environmental monitoring applications in the last decade. While the deployment of sensor nodes enables a fine granularity of data collection, resource-rich actor nodes provide further evaluation of the information and reaction. Quality of service (QoS) and routing solutions for WSANs are challenging compared to traditional networks because of the limited node resources. WSANs also have different QoS requirements than wireless sensor networks (WSNs) since actors and sensor nodes have distinct resource constraints.In this paper, we present, LRP-QS, a lightweight routing protocol with dynamic interests and QoS support for WSANs. LRP-QS provides QoS by differentiating the rates among different types of interests with dynamic packet tagging at sensor nodes and per flow management at actor nodes. The interests, which define the types of events to observe, are distributed in the network. The weights of the interests are determined dynamically by using a nonsensitive ranking algorithm depending on the variation in the observed values of data collected in response to interests. Our simulation studies show that the proposed protocol provides a higher packet delivery ratio and a lower memory consumption than the existing state of the art protocols.     

Wireless sensor and actor networks: research challenges

Wireless sensor and actor networks (WSANs) refer to a group of sensors and actors linked by wireless medium to perform distributed sensing and acting tasks. The realization of wireless sensor and actor networks (WSANs) needs to satisfy the requirements introduced by the coexistence of sensors and actors. In WSANs, sensors gather information about the physical world, while actors take decisions and then perform appropriate actions upon the environment, which allows a user to effectively sense and act from a distance. In order to provide effective sensing and acting, coordination mechanisms are required among sensors and actors. Moreover, to perform right and timely actions, sensor data must be valid at the time of acting. This paper explores sensor-actor and actor-actor coordination and describes research challenges for coordination and communication problems.     

Network Partitioning Recovery Mechanisms in WSANs: a Survey

Wireless sensor and actor networks (WSANs) are more promising and most addressing research field in the area of wireless sensor networks in recent scenario. It composed of possibly a large number of tiny, autonomous sensor devices and resources rich actor nodes equipped with wireless communication and computation capabilities. Actors collect sensors’ information and respond collaboratively to achieve an application specific mission. Since actors have to coordinate their operation, a strongly connected inter-actor network would be required at all the time in the network. Actor nodes may fail for many reasons (i.e. due of battery exhaustion or hardware failure due to hash environment etc.) and failures may convert connected network into disjoint networks. This can hinder sometimes not only the performance of network but also degrade the usefulness and effectiveness of the network. Thus, having a partitioning detection and connectivity restoration procedure at the time of failure occurs in the network is crucial for WSANs. In this paper, we review the present network partitioning recovery approaches and provide an overall view of this study by summarizing previous achievements.     

Communication and Coordination in Wireless Sensor and Actor Networks

In this paper, coordination and communication problems in wireless sensor and actor networks (WSANs) are jointly addressed in a unifying framework. A sensor-actor coordination model is proposed based on an event-driven partitioning paradigm. Sensors are partitioned into different sets, and each set is constituted by a data-delivery tree associated with a different actor. The optimal solution for the partitioning strategy is determined by mathematical programming, and a distributed solution is proposed. In addition, a new model for the actor-actor coordination problem is introduced. The actor coordination is formulated as a task assignment optimization problem for a class of coordination problems in which the area to be acted upon needs to be optimally split among different actors. An auction-based distributed solution of the problem is also presented. Performance evaluation shows how global network objectives, such as compliance with real-time constraints and minimum energy consumption, can be achieved in the proposed framework with simple interactions between sensors and actors that are suitable for large-scale networks of energy-constrained devices.     

Actor-oriented directional anycast routing in wireless sensor and actor networks with smart antennas

Current routing protocols in wireless sensor and actor networks (WSANs) shows a lack of unification for different traffic patterns because the communication for sensor to actor and that for actor to actor are designed separately. Such a design poses a challenge for interoperability between sensors and actors. With the presence of rich-resource actor nodes, we argue that to improve network lifetime, the problem transforms from reducing overall network energy consumption to reducing energy consumption of constrained sensor nodes. To reduce energy consumption of sensor nodes, especially in challenging environments with coverage holes/obstacles, we propose that actor nodes should share forwarding tasks with sensor nodes. To enable such a feature, efficient interoperability between sensors and actors is required, and thus a unified routing protocol for both sensors and actors is needed. This paper explores capabilities of directional transmission with smart antennas and rich-resource actors to design a novel unified actor-oriented directional anycast routing protocol (ADA) which supports arbitrary traffic in WSANs. The proposed routing protocol exploits actors as main routing anchors as much as possible because they have better energy and computing power compared to constraint sensor nodes. In addition, a directional anycast routing approach is also proposed to further reduce total delay and energy consumption of overall network. Through extensive experiments, we show that ADA outperforms state-of-the-art protocols in terms of packet delivery latency, network lifetime, and packet reliability. In addition, by offer fault tolerant features, ADA also performs well in challenging environments where coverage holes and obstacles are of concerns.     

A Real-Time and Reliable Transport (RT)$^{2}$ Protocol for Wireless Sensor and Actor Networks

Wireless sensor and actor networks (WSANs) are characterized by the collective effort of heterogeneous nodes called sensors and actors. Sensor nodes collect information about the physical world, while actor nodes take action decisions and perform appropriate actions upon the environment. The collaborative operation of sensors and actors brings significant advantages over traditional sensing, including improved accuracy, larger coverage area and timely actions upon the sensed phenomena. However, to realize these potential gains, there is a need for an efficient transport layer protocol that can address the unique communication challenges introduced by the coexistence of sensors and actors. In this paper, a real-time and reliable transport (RT) protocol is presented for WSANs. The objective of the (RT) protocol is to reliably and collaboratively transport event features from the sensor field to the actor nodes with minimum energy dissipation and to timely react to sensor information with a right action. In this respect, the (RT) protocol simultaneously addresses congestion control and timely event transport reliability objectives in WSANs. To the best of our knowledge, this is the first research effort focusing on real-time and reliable transport protocol for WSANs. Performance evaluations via simulation experiments show that the (RT) protocol achieves high performance in terms of reliable event detection, communication latency and energy consumption in WSANs.     

Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time‐aware, energy‐aware, and starvation‐free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi‐automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well‐known task‐scheduling algorithms, namely, the max‐min, min‐min, and opportunistic load balancing algorithms, is used.     

Detecting and connecting disjoint sub-networks in wireless sensor and actor networks

Wireless sensor and actor networks (WSANs) can be considered as a combination of a sensor network and an actor network in which powerful and mobile actor nodes can perform application specific actions based on the received data from the sensors. As most of these actions are performed collaboratively among the actors, inter-actor connectivity is one of the desirable features of WSANs. In this paper, we propose a novel distributed algorithm for establishing a connected inter-actor network topology. Considering initially disjoint sets of actors, our algorithm first initiates a search process by using the underlying sensor network in order to detect the possible sub-networks of actors in the region. After these sub-networks are detected, our algorithm pursues a coordinated actor movement in order to connect the sub-networks and thus achieve inter-actor connectivity for all the actors. This coordinated movement approach exploits the minimum connected dominating set of each sub-network when picking the appropriate actor to move so that the connectivity of each sub-network is not violated. In addition, the approach strives to minimize the total travel distance of actors and the messaging cost on both sensors and actors in order to extend the lifetime of WSAN. We analytically study the performance of our algorithm. Extensive simulation experiments validate the analytical results and confirm the effectiveness of our approach.     

Performance evaluation of single and multi-channel actor to actor communication for wireless sensor actor networks

The paper discusses two distributed actor to actor communication schemes (a single channel one and a multi-channel one) for wireless sensor actor networks (WSANs). The performance of these two schemes is evaluated through analysis and simulation. The simulation results show that the whole analysis is fairly accurate. It is further proven that the multi-channel scheme has better performance than the single channel one. The key feature of the multi-channel scheme is the separation of the single hop from the multi-hop traffic.     

Timing-Based Mobile Sensor Localization in Wireless Sensor and Actor Networks

In this paper, localization problem in wireless sensor and actor networks (WSAN) is addressed. In WSAN, the performance of event detection and tracking highly depends on the exact location information of the events that must be reported along with the event features. Having precise location information of the sensor nodes, actors are able to execute actions more effectively in the region of detected events. In this context, the accurate localization of sensor nodes is essential with respect to the actors. Particularly, the problem becomes much more complicated when the sensor nodes as well as the anchor nodes (actors) are mobile. In order to localize the mobile sensor nodes relative to the actors, a novel Timing-based Mobile Sensor Localization (TMSL) algorithm is introduced. In TMSL, sensor nodes determine their distance from actors by using propagation time and speed of RF signal. In order to determine distance from the actors, actors actively broadcast reference beacons in a pattern of intervals adaptively defined according to the mobility of sensor nodes and the required level of localization accuracy. These reference beacons carry the interval numbers in which they were transmitted. The interval numbers are then used by the sensor nodes to calculate the start time of the beacons locally which is then used to determine the propagation time. TMSL does neither require nor assume any time synchronization among the sensor nodes or with the actors. Performance evaluations clearly show that TMSL is adaptive to velocity of mobile sensor and actor nodes and can be configured according to the required localization accuracy in order to avoid overhead raised due to high velocity.