Wireless Information and Power Transfer in Underwater Acoustic Sensor Networks

Wireless information and power transfer(WIPT) enables simultaneously communications and sustainable power supplement without the erection of power supply lines and the replacement operation of the batteries for the terminals. The application of WIPT to the underwater acoustic sensor networks(UWASNs) not only retains the long range communication capabilities, but also provides an auxiliary and convenient energy supplement way for the terminal sensors, and thus is a promising scheme to solve the energy-limited problem for the UWASNs. In this paper, we propose the integration of WIPT into the UWASNs and provide an overview on various enabling techniques for the WIPT based UWASNs(WIPT-UWASNs) as well as pointing out future research challenges and opportunities for WIPT-UWASNs.

A neighbor information based false data filtering scheme in wireless sensor networks

In sensor networks,the adversaries can inject false data reports from compromised nodes.Previous approaches to filter false reports,e.g.,SEF,only verify the correctness of the message authentication code (MACs) carried in each data report on intermediate nodes,thus cannot filter out fake reports that are forged in a collaborative manner by a group of compromised nodes,even if these compromised nodes distribute in different geographical areas.Furthermore,if the adversary obtains keys from enough (e.g.,more than t in SEF) distinct key partitions,it then can successfully forge a data report without being detected en-route.A neighbor information based false report filtering scheme (NFFS) in wireless sensor networks was presented.In NFFS,each node distributes its neighbor information to some other nodes after deployment.When a report is generated for an observed event,it must carry the IDs and the MACs from t detecting nodes.Each forwarding node checks not only the correctness of the MACs carried in the report,but also the legitimacy of the relative position of these detecting nodes.Analysis and simulation results demonstrate that NFFS can resist collaborative false data injection attacks efficiently,and thus can tolerate much more compromised nodes than existing schemes.

Implementation Study of a Centralized Routing Protocol for Data Acquisition in Wireless Sensor Networks

Wireless sensor networks (WSNs) attract considerable amount of research efforts from both industry and academia. With limited power and computational capability available on a sensor node, robustness and efficiency are the main concerns when designing a routing protocol for WSNs with low complexity. There are various existing design approaches, such as data-centric approach, hierarchical approach and location-based approach, which were designed for a particular application with specific requirements. In this paper, we study the design and implementation of a routing protocol for data acquisition in WSNs. The designed routing protocol is named Centralized Sensor Protocol for Information via Negotiation (CSPIN), which essentially combines the advertise-request-transfer process and a routing distribution mechanism. Implementation is realized and demonstrated with the Crossbow MicaZ hardware using nesC/TinyOS. It was our intention to provide a hand-on study of implementation of centralized routing protocol for WSNs.

Information-Driven Collaborative Processing for Diffusive Source Estimation in Wireless Sensor Networks

This paper discusses an accurate distributed algorithm for diffusive source localization while maintaining the low energy consumption of sensor nodes in wireless sensor networks. In this algorithm, the sensor selection scheme based on the information utility measure is used. To update the estimation in each selected node, a neighborhood radius equal to the communication range of the sensor nodes is defined and all sensors located in the neighborhood circle, whose radius is equal to the neighborhood radius and the selected node is its centre, collaborate their information. To decrease the energy consumption, the neighborhood radius is reduced gradually based on the error covariance value of the estimation. In addition, this paper includes a new method for the initial point calculation which is important in the recursive methods used for distributed algorithms in wireless sensor networks. Numerical examples are used to study the performance of the algorithms. Simulation results show the accuracy of the new algorithm becomes better while its energy consumption is low enough.

A Contention-Based MAC and Routing Protocol for Wireless Sensor Network

Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.

A Novel Energy Aware Clustering Technique for Routing in Wireless Sensor Networks

Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.

UAV trajectory planning algorithmfor data collection in wireless sensor networks

In order to maximize the value of information(VoI)of collected data in unmanned aerial vehicle(UAV)-aided wireless sensor networks(WSNs),a UAV trajectory planning algorithm named maximum VoI first and successive convex approximation(MVF-SCA)is proposed.First,the Rician channel model is adopted in the system and sensor nodes(SNs)are divided into key nodes and common nodes.Secondly,the data collection problem is formulated as a mixed integer non-linear program(MINLP)problem.The problem is divided into two sub-problems according to the different types of SNs to seek a sub-optimal solution with a low complexity.Finally,the MVF-SCA algorithm for UAV trajectory planning is proposed,which can not only be used for daily data collection in the target area,but also collect time-sensitive abnormal data in time when the exception occurs.Simulation results show that,compared with the existing classic traveling salesman problem(TSP)algorithm and greedy path planning algorithm,the VoI collected by the proposed algorithm can be improved by about 15%to 30%.

A Sensor Awakening Algorithm for Wireless Multimedia Sensor Networks Three Dimensional Target Tracking

For node awakening in wireless multi-sensor networks, an algorithm is put forward for three dimensional tar- get tracking. To monitor target dynamically in three dimensional area by controlling nodes, we constract vir- tual force between moving target and the current sense node depending on the virtual potential method, then select the next sense node with information gain function, so that when target randomly move in the specific three dimensional area, the maximum sensing ratio of motion trajectory is get with few nodes. The proposed algorithm is verified from the simulations.

Monitoring System for Field Soil Water Content Based on the Wireless Sensor Network

[Objective] To water content monitoring study the application of wireless sensor network in field so and to discuss the methods for solving the problems of low sampling rate, high cost and poor real-time in actual monitoring. [Method] The architecture of wireless sensor network, network nodes, hardware design as well as principle for the program structure of software operating system and corresponding parameters were analyzed to illustrate the characteristics of monitoring system for field soil water content based on wireless sensor network, and the advantages in application of this system. [Result] Sensor nodes could correctly collect and transmit soil water content, realize stable data transmission of soil water content, indicating that wireless sensor network is suitable for real-time monitoring of field soil water content. [Conclusion] This study indicates that wireless sensor network possesses a widely application foreground in the development of agriculture.

Information gain based sensor search scheduling for low-earth orbit constellation estimation

This paper addresses the problem of sensor search scheduling in the complicated space environment faced by the low-earth orbit constellation.Several search scheduling methods based on the commonly used information gain are compared via simulations first.Then a novel search scheduling method in the scenarios of uncertainty observation is proposed based on the global Shannon information gain and beta density based uncertainty model.Simulation results indicate that the beta density model serves a good option for solving the problem of target acquisition in the complicated space environments.

L3SN: A Level-Based, Large-Scale, Longevous Sensor Network System for Agriculture Information Monitoring

We developed L3SN, a scalable, longevous, adaptive, and internet accessible wireless sensor network system for agriculture information monitoring, which is meticulously designed to meet the requirement of thousands hectares coverage, years of time monitoring and the adverse environment. The system architecture, the agriculture sensor device, the mesh protocol, and the web-based information processing platform are introduced. We also presented some implementation experience. The mesh protocol (LayerMesh) is highlighted, in which “stair scheduling” and “distributed dynamic load-balancing” are proposed to response the scalability, longevity and adaptivity requirements. We believe the design of L3SN is useful to many other large-scale, longevous applications such as hydrologic monitoring, geological monitoring etc.

Sensor Networking: Concepts, Applications, and Challenges

Sensor network has experienced world-wide explosive interests in recent years. It combines the technology of modern microelectronic sensors, embedded computational processing systems, and modern computer and wireless networking methodologies. In this overview paper, we first provide some rationales for the growth of sensor networking. Then we discuss various basic concepts and hardware issues. Four basic application cases in the US. National Science Foundation funded Ceneter for Embedded Networked Sensing program at UCLA are presented. Finally, six challenging issues in sensor networks are discussed. Numerous references including relevant papers, books, and conferences that have appeared in recent years are given.

一种广域无线传感网络移动Sink节点路径规划方法

在广域无线传感网络中,大量Sink节点处在移动状态,路径规划过程易受其他节点特征的干扰,导致规划效果较差,提出一种针对广域无线传感网络的移动Sink节点路径规划方法。利用Sink数据采集协议确定节点的最佳位置,通过计算最大网络寿命成本比确定节点的最佳数量后,根据节点的最佳位置和数量规划出最大容量路径。依据最大容量路径计算出Sink节点在四个方向上的权值系数,并沿着最大权值系数的方向移动,完成广域无线传感网络移动Sink节点路径规划。仿真结果表明,所提方法的运行时间低于6 s、路径长度最长为53 cm、拐点数量少于9个、迭代次数高达69次。

A Framework Study for Healthcare Information Systems

Healthcare information systems are crucial components for better coordination of healthcare. They focus on the proper generation, transmission, storage, and retrieval of health data. It is obvious that production of accurate, relevant, and timely health information is foundation of good decision making. Rapid progress in wireless communications and embedded systems result in wireless sensor networks to be employed even in biomedical applications as well as their prominent deployment options. This study proposes a healthcare information system framework which consists of such components as;wireless sensor networks, cellular networks, a MATLAB interface, a database, and a web based monitoring interface. A case study that includes sensing, transferring, storing and web based monitoring processes of ECG signal is also introduced in the study, so that the behavior of the system developed can be tested. The results show that the framework presented here can not only be employed as a healthcare information system, but it can also be used as an infrastructure in related research activities and consequently, lots of time can be saved from creating an experimental environment.

基于Python的无线传感器网络数据采集系统

无线传感器因节点结构复杂度高,数据量巨大,无法在海量数据中快速采集用户需求数据.为解决该问题,研究设计了基于Python的无线传感器网络数据采集系统,系统硬件包括数据采集芯片选型单元、无线收发芯片选型单元与串口通讯电路设计单元;软件模块包括网络数据挖掘采集框架设计模块、采集数据压缩模块和采集数据缓存模块.通过对上述硬件单元与软件模块的设计与开发,实现无线传感器网络数据采集系统的运行与应用.实验数据显示:相较于基于Android安全容器的网络数据采集系统,应用设计系统采集数据耗时更短、压缩率数值更大、能耗更小,充分证实设计系统的数据采集性能更佳.

面向UAV辅助的WSN信息年龄优化算法

提出了一种综合传感器能源供给、数据传输时效性和移动用户需求的系统平均信息年龄(AoI)优化算法。首先,采用无人机(UAV)辅助WSN来保障传感器的能量收集和数据传输。其次,引入AoI作为衡量指标,联合优化多设备调度、发射功率和UAV轨迹,建立了以最小化传感器的平均AoI为目标的非凸优化问题。然后,通过约束松弛、变量替换和连续凸逼近等方法,将非凸问题转化为凸问题,并设计了一种迭代式的平均AoI最小化算法。仿真结果表明:该算法在满足移动用户体验的同时有效提升了传感器数据新鲜度。

动态层簇式无线传感网络信息加密算法

与传统的无线网络基于某种确定的网络拓扑结构组织不同,动态层簇式无线传感网络(Dynamic Layer Clustered Wireless Sensor Networks,DLCN)则是通过动态层次化的方式进行组织,导致DLCN在层次簇、簇首节点选取等诸多细节,实现较为复杂,其信息加密复杂度增加,安全性和平衡性问题一直是一个难点。提出针对动态层簇式无线传感网络的信息加密算法。分析动态层簇式无线传感网络结构,计算网络节点权重跳数以及传输时延,选取最优簇首,通过Logistic混沌映射对混沌序列展开计算,结合Merlay状态机的迁移传输,输出子密钥,实现了传感信息的加密。仿真结果表明:所提算法在DLCN数据加密过程中的密文位数始终在60左右、平均密钥扩展用时在2.5 ms以下、且二值比数值更接近于1,具备较高的安全性和平衡性。

Mutual-information based weighted fusion for target tracking in underwater wireless sensor networks

Underwater wireless sensor networks(UWSNs)can provide a promising solution to underwater target tracking.Due to limited energy and bandwidth resources,only a small number of nodes are selected to track a target at each interval.Because all measurements are fused together to provide information in a fusion center,fusion weights of all selected nodes may affect the performance of target tracking.As far as we know,almost all existing tracking schemes neglect this problem.We study a weighted fusion scheme for target tracking in UWSNs.First,because the mutual information(MI)between a node’s measurement and the target state can quantify target information provided by the node,it is calculated to determine proper fusion weights.Second,we design a novel multi-sensor weighted particle filter(MSWPF)using fusion weights determined by MI.Third,we present a local node selection scheme based on posterior Cramer-Rao lower bound(PCRLB)to improve tracking efficiency.Finally,simulation results are presented to verify the performance improvement of our scheme with proper fusion weights.