Event-to-sink reliable transport in wireless sensor networks

Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Hence, the WSN paradigm necessitates a collective event-to-sink reliability notion rather than the traditional end-to-end notion. To the best of our knowledge, reliable transport in WSN has not been studied from this perspective before. In order to address this need, a new reliable transport scheme for WSN, the event-to-sink reliable transport (ESRT) protocol, is presented in this paper. ESRT is a novel transport solution developed to achieve reliable event detection in WSN with minimum energy expenditure. It includes a congestion control component that serves the dual purpose of achieving reliability and conserving energy. Importantly, the algorithms of ESRT mainly run on the sink, with minimal functionality required at resource constrained sensor nodes. ESRT protocol operation is determined by the current network state based on the reliability achieved and congestion condition in the network. This self-configuring nature of ESRT makes it robust to random, dynamic topology in WSN. Furthermore, ESRT can also accommodate multiple concurrent event occurrences in a wireless sensor field. Analytical performance evaluation and simulation results show that ESRT converges to the desired reliability with minimum energy expenditure, starting from any initial network state.     

Delay aware reliable transport in wireless sensor networks

Wireless sensor networks (WSN) are event‐based systems that rely on the collective effort of several sensor nodes. Reliable event detection at the sink is based on collective information provided by the sensor nodes and not on any individual sensor data. Hence, conventional end‐to‐end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Moreover, the reliability objective of WSN must be achieved within a certain real‐time delay bound posed by the application. Therefore, the WSN paradigm necessitates a collective delay‐constrained event‐to‐sink reliability notion rather than the traditional end‐to‐end reliability approaches. To the best of our knowledge, there is no transport protocol solution which addresses both reliability and real‐time delay bound requirements of WSN simultaneously. In this paper, the delay aware reliable transport (DART) protocol is presented for WSN. The objective of the DART protocol is to timely and reliably transport event features from the sensor field to the sink with minimum energy consumption. In this regard, the DART protocol simultaneously addresses congestion control and timely event transport reliability objectives in WSN. In addition to its efficient congestion detection and control algorithms, it incorporates the time critical event first (TCEF) scheduling mechanism to meet the application‐specific delay bounds at the sink node. Importantly, the algorithms of the DART protocol mainly run on resource rich sink node, with minimal functionality required at resource constrained sensor nodes. Furthermore, the DART protocol can accommodate multiple concurrent event occurrences in a wireless sensor field. Performance evaluation via simulation experiments show that the DART protocol achieves high performance in terms of real‐time communication requirements, reliable event detection and energy consumption in WSN. Copyright © 2007 John Wiley & Sons, Ltd.     

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.     

基于事件驱动的动态分簇网络的协作传输方法

针对事件驱动的无线传感器网络的传输可靠性问题,该文利用节点间的互助,提出一种基于事件驱动的动态分簇网络的协作传输方法。无事件发生时,各节点按预先形成的静态簇低频传输数据。而一旦有事件发生,能感知事件发生的节点快速组成事件簇,向簇头发送采集的数据,簇头融合数据后发往汇聚节点。为提升传输可靠性,当簇头传输失败时,由最佳中继协作转发数据给汇聚节点。在最佳中继的选择上,考虑到事件的连续移动,以及处于事件前向通道上的节点具有较大的感应值和较好的协作能力等条件,该文提出了基于前向通道的最佳中继选择策略。仿真和实验结果表明,所提协作传输方法能够有效提高传输可靠性。     

REBTAM: reliable energy balance traffic aware data reporting algorithm for object tracking in multi-sink wireless sensor networks

Recently, Multi-sink Wireless Sensor Networks (WSNs) have received more and more attention due to their significant advantages over the single sink WSNs such as improving network throughput, balancing energy consumption, and prolonging network lifetime. Object tracking is regarded as one of the key applications of WSNs due to its wide real-life applications such as wildlife animal monitoring and military area intrusion detection. However, many object tracking researches usually focus on how to track the location of objects accurately, while few researches focus on data reporting. In this work, we propose an efficient data reporting method for object tracking in multi-sink WSNs. Due to the limited energy resource of sensor nodes, it seems especially important to design an energy efficient data reporting algorithm for object tracking in WSNs. Moreover, the reliable data transmission is an essential aspect that should be considered when designing a WSN for object tracking application, where the loss of data packets will affect the accuracy of the tracking and location estimation of a mobile object. In addition, congestion in WSNs has negative impact on the performance, namely, decreased throughput, increased per-packet energy consumption and delay, thus congestion control is an important issue in WSNs. Consequentially, this paper aims to achieve both minimum energy consumption in reporting operation and balanced energy consumption among sensor nodes for WSN lifetime extension. Furthermore, data reliability is considered in our model where the sensed data can reach the sink node in a more reliable way. Finally, this paper presents a solution that sufficiently exerts the underloaded nodes to alleviate congestion and improve the overall throughput in WSNs. This work first formulates the problem as 0/1 Integer Linear Programming problem, and proposes a Reliable Energy Balance Traffic Aware greedy Algorithm in multi-sink WSNs (REBTAM) to solve the optimization problem. Through simulation, the performance of the proposed approach is evaluated and analyzed compared with the previous work which is related to our topic such as DTAR, NBPR, and MSDDGR protocols.     

A scalable joint routing and scheduling scheme for large-scale wireless sensor networks

The multihop configuration of a large-scale wireless sensor network enables multiple simultaneous transmissions without interference within the network. Existing time division multiple access (TDMA) scheduling schemes exploit gain based on the assumption that the path is optimally determined by a routing protocol. In contrast, our scheme jointly considers routing and scheduling and introduces several new concepts. We model a large-scale wireless sensor network as a tiered graph relative to its distance from the sink, and introduce the notion of relay graph and relay factor to direct the next-hop candidates toward the sink fairly and efficiently. The sink develops a transmission and reception schedule for the sensor nodes based on the tiered graph search for a set of nodes that can simultaneously transmit and receive. The resulting schedule eventually allows data from each sensor node to be delivered to the sink. We analyze our scheduling algorithm both numerically and by simulation, and we discuss the impact of protocol parameters. Further, we prove that our scheme is scalable to the number of nodes, from the perspectives of mean channel capacity and maximum number of concurrent transmission nodes. Compared with the existing TDMA scheduling schemes, our scheme shows better performance in network throughput, path length, end-to-end delay, and fairness index.     

Statistical en-route filtering of injected false data in sensor networks

In a large-scale sensor network individual sensors are subject to security compromises. A compromised node can be used to inject bogus sensing reports. If undetected, these bogus reports would be forwarded to the data collection point (i.e., the sink). Such attacks by compromised nodes can result in not only false alarms but also the depletion of the finite amount of energy in a battery powered network. In this paper, we present a statistical en-route filtering (SEF) mechanism to detect and drop false reports during the forwarding process. Assuming that the same event can be detected by multiple sensors, in SEF each of the detecting sensors generates a keyed message authentication code (MAC) and multiple MACs are attached to the event report. As the report is forwarded, each node along the way verifies the correctness of the MAC's probabilistically and drops those with invalid MACs. SEF exploits the network scale to filter out false reports through collective decision-making by multiple detecting nodes and collective false detection by multiple forwarding nodes. We have evaluated SEF's feasibility and performance through analysis, simulation, and implementation. Our results show that SEF can be implemented efficiently in sensor nodes as small as Mica2. It can drop up to 70% of bogus reports injected by a compromised node within five hops, and reduce energy consumption by 65% or more in many cases.     

EARQ: Energy Aware Routing for Real-Time and Reliable Communication in Wireless Industrial Sensor Networks

Wireless industrial sensor networks are wireless sensor networks which have been adapted to industrial applications. Most techniques for wireless sensor networks can be applied to wireless industrial sensor networks. However, for industrial applications of wireless industrial sensor networks, new requirements such as real-time, reliable delivery need to be considered. In this paper, we propose EARQ, which is a novel routing protocol for wireless industrial sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In EARQ, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that EARQ is suitable for industrial applications, due to its capability for energy efficient, real-time, reliable communications.      

Clustering Based Two Dimensional Motion of Sink Node in Wireless Sensor Networks

The wireless sensor network (WSN) is always known for its limited-energy issues and finding a good solution for energy minimization in WSNs is still a concern for researchers. Implementing mobility to the sink node is used widely for energy conservation or minimization in WSNs which reduces the distance between sink and communicating nodes. In this paper, with the intention to conserve energy from the sensor nodes, we designed a clustering based routing protocol implementing a mobile sink called ‘two dimensional motion of sink node (TDMS)’. In TDMS, each normal sensor node collects data and send it to their respective leader node called cluster head (CH). The sink moves in the two dimensional direction to collect final data from all CH nodes, particularly it moves in the direction to that CH which has the minimum remaining energy. The proposed protocol is validated through rigorous simulation using MATLAB and comparisons have been made with WSN’s existing static sink and mobile sink routing protocols over two different geographical square dimensions of the network. Here, we found that TDMS model gives the optimal result on energy dissipation per round and increased network lifetime.

     

Distributed audio sensing with homeostasis-inspired autonomous communication

Emerging applications of wireless sensor networks (WSN) requiring wide-band event signal communication such as multimedia surveillance sensor networks impose additional challenges including high communication bandwidth requirement and energy cost. Besides their partially or fully dependency on feedback messages from sink node, the existing protocols designed for WSN do not address the communication of wide-band event signals. Furthermore, the feedback messages may not reach in time to provide reliable communication of event information and save scarce network resources. Therefore, an autonomous communication protocol is imperative in order to provide wide-band event signal communication without any feedback from the sink. In nature, biological systems have self-organization capability, i.e., homeostasis, as they autonomously maintain a relatively stable equilibrium state for operation of vital functions. Hence, this natural phenomenon clearly gives promising inspirations in order to develop autonomous and efficient communication models and protocols for WSN domain. In this paper, the homeostasis-inspired autonomous communication (HAC) protocol is introduced for wireless audio sensor networks (WASN). Using the spectral properties of the wide-band event signal, i.e., audio signal, HAC enables WASN to maintain a relatively stable state in which sensor nodes reliably and energy-efficiently communicate the event signal to the sink node. Furthermore, with its self-organization capability, HAC does not rely on any feedback message from the sink node. Performance evaluations reveal that HAC successfully communicates wide-band event signal with minimum energy expenditure.     

Toward Reliable and Efficient Reporting in Wireless Sensor Networks

Energy-efficiency is one of the major concerns in wireless sensor networks since it impacts the network lifetime. In this paper, we investigate the relationship between sensor network performance, particularly its lifetime, and the number of active reporting nodes N by using both analytical and simulation approaches. We first demonstrate that decreasing the number of reporting nodes increases the number of reports that need to be sent to the sink in order to achieve the desired information reliability regarding a detected event. On an other side, we show that reducing the number of reporting nodes reduces the probability of collision occurrence. Based on these results, and as a first main contribution, we derive the optimal number of reporting nodes Nopt_energy that minimizes the energy consumed to report reliably the occurrence of an event. In other words, we prove that limiting the reporting tasks of a detected event to a small subset of sensor nodes (i.e., Nopt_energy), instead of using all the sensor nodes in the event area, enables significant energy conservation.     

A New Method to Find a High Reliable Route in IoT by Using Reinforcement Learning and Fuzzy Logic

Recently, Internet is moving quickly toward the interaction of objects, computing devices, sensors, and which are usually indicated as the Internet of things (IoT). The main monitoring infrastructure of IoT systems main monitoring infrastructure of IoT systems is wireless sensor networks. A wireless sensor network is composed of a large number of sensor nodes. Each sensor node has sensing, computing, and wireless communication capability. The sensor nodes send the data to a sink or a base station by using wireless transmission techniques However, sensor network systems require suitable routing structure to optimizing the lifetime. For providing reasonable energy consumption and optimizing the lifetime of WSNs, novel, efficient and economical schemes should be developed. In this paper, for enhancing network lifetime, a novel energy-efficient mechanism is proposed based on fuzzy logic and reinforcement learning. The fuzzy logic system and reinforcement learning is based on the remained energies of the nodes on the routes, the available bandwidth and the distance to the sink. This study also compares the performance of the proposed method with the fuzzy logic method and IEEE 802.15.4 protocol. The simulations of the proposed method which were carried out by OPNET (Optimum Network performance) indicated that the proposed method performed better than other protocols such as fuzzy logic and IEEE802.15.4 in terms of power consumption and network lifetime.

     

Novel service protocol for supporting remote and mobile users in wireless sensor networks with multiple static sinks

A wireless sensor network typically consists of users, a sink, and a number of sensor nodes. The users may be remotely connected to a wireless sensor network and via legacy networks such as Internet or Satellite the remote users obtain data collected by the sink that is statically located at a border of the wireless sensor network. However, in practical sensor network applications, there might be two types of users: the traditional remote users and mobile users such as firefighters and soldiers. The mobile users may move around sensor fields and they communicate with the static sink only via the wireless sensor networks in order to obtain data like location information of victims in disaster areas. For supporting the mobile users, existing studies consider temporary structures. However, the temporary structures are constructed per each mobile user or each source nodes so that it causes large energy consumption of sensor nodes. Moreover, since some of them establish the source-based structure, sinks in them cannot gather collective information like mean temperature and object detection. In this paper, to effectively support both the remote users and the mobile users, we propose a novel service protocol relying on the typical wireless sensor network. In the protocol, multiple static sinks connect with legacy networks and divide a sensor field into the number of the multiple sinks. Through sharing queries and data via the legacy networks, the multiple static sinks provide high throughput through distributed data gathering and low latency through short-hops data delivery. Multiple static sinks deliver the aggregated data to the remote users via the legacy networks. In case of the mobile users, when a mobile user moves around, it receives the aggregated data from the nearest static sink. Simulation results show that the proposed protocol is more efficient in terms of energy consumption, data delivery ratio, and delay than the existing protocols.     

Distributed topology management for wireless multimedia sensor networks: exploiting connectivity and cooperation

In this paper, we propose a distributed topology management algorithm, named T‐Must, which orchestrates coalition formation game between camera and scalar sensor (SS) nodes, for use in wireless multimedia sensor networks. In the proposed solution, connectivity among the peer camera sensor (CS) nodes is maintained, and coverage is ensured between them. Only the scalar data are not sufficient to describe an event in a particular monitored area. In many cases, multimedia data (specifically, video data) are required to provide more precise information about the event. As the CS nodes, which sense and transmit multimedia data, are costlier than the SS nodes, the former are deployed in the monitored area in lesser numbers compared to the latter ones. In case of CS nodes, power consumption due to sensing is also significant, similar to power consumption for the transmission and reception of packets. Therefore, in this work, in order to increase the network lifetime, topology is controlled by forming coalition between the CS and SS nodes. Upon occurrence of an event, the SS nodes send scalar data to their associated CS nodes. If the scalar data received from SS nodes cross a preconfigured threshold, the associated CS node in the coalition starts sensing the event, captures the video data, and forwards the video data toward other coalitions or sink. Copyright © 2014 John Wiley & Sons, Ltd.     

基于ZigBee和CDMA的温室远程测控系统的设计

针对农业数据远程测控的实际需求,本文进行了基于ZigBee协议和CDMA通信技术的温室远程测控系统的设计开发。以支持ZigBee协议的芯片CC2520来构建传感器节点和汇聚节点,以CDMA无线通信模块构建能与INTERNET进行数据连接的网关。传感器节点采用星型拓扑结构组成无线传感器网络后,采集数据并将测量数据发送给汇聚节点,再由汇聚节点发送刮网关,最后网关将数据通过互联网远程传输至测控中心。该测控系统能耗少,组网灵活,安装维护便捷,适合大规模温室的远程无线实时测控。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

BP neural network based continuous objects distribution detection in WSNs

WSNs (Wireless Sensor Networks) are widely applied in environment monitoring. Especially, in large scale environment monitoring, its flexibility in deployment and self-organization are strong points. However for distribution detection of continuous objects in large scale environment monitoring, there are two primary constraints: energy consumption and the accuracy of the detection which relies on the density of the WSNs. Currently, almost all of the continuous object monitoring are based on the boundary detection, and all the energy efficiency solutions only focus on the WSNs itself. Unfortunately, with the boundary detection method, the accuracy of the continuous objects detection highly relies on the density of the sensor nodes. What is worse, it is even impossible to make sure of the density of the sensor nodes in real situation. In order to deal with these issues, we proposed the Optimal Fusion Set based Clustering algorithm based on the continuous characteristics of the targets to enhance the energy efficiency and Global Distribution Status Monitoring (GDSM) algorithm to implement the monitoring with finite sensor nodes. Firstly, a dynamic diffusion model based on the Gaussian Puff model is proposed, and then the characteristics of continuous objects are analyzed. According to the theoretic analysis and simulation results, the GDSM algorithm can achieve stable accuracy with limited sensor nodes.     

An energy aware event-driven routing protocol for cognitive radio sensor networks

Cognitive radio sensor network (CRSN) is an intelligent and reasonable combination of cognitive radio technology and wireless sensor networks. It poses significant challenges to the design of topology maintenance techniques due to dynamic primary-user activities, which in turn decreases the data delivery performance of the network as well as it’s lifetime. This paper aims to provide a solution to the CRSN clustering and routing problem using an energy aware event-driven routing protocol (ERP) for CRSN. Upon detection of an event, the ERP determines eligible nodes for clustering according to local positions of CRSN nodes between the event and the sink and their residual energy levels. Cluster-heads are selected from the eligible nodes according to their residual energy values, available channels, neighbors and distance to the sink. In ERP, cluster formation is based on relative spectrum awareness such that channels with lower primary user appearance probability are selected as common data channels for clusters. For data routing, ERP employs hop-by-hop data forwarding approach through the CHs and primary/secondary gateways towards the sink. Through extensive simulations, we demonstrate that the proposed ERP provides with better network performances compared to those of the state-of-the-art protocols under a dynamic spectrum-aware data transmission environment.     

Energy‐Efficient Quorum‐Based MAC Protocol for Wireless Sensor Networks

The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum‐Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum‐based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake‐up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves.     

E2SRT: enhanced event‐to‐sink reliable transport for wireless sensor networks

An event‐to‐sink reliable transport (ESRT) control scheme was recently proposed to address the event‐to‐sink reliability issues in wireless sensor network (WSN). In this paper, we study the performance of ESRT in the presence of ‘over‐demanding’ event reliability, using both the analytical and simulation approaches. We show that the ESRT protocol does not achieve optimum reliability and begins to fluctuate between two inefficient network states. With insights from update mechanism in ESRT, we propose a new algorithm, called enhanced ESRT (E²SRT), to solve the ‘over‐demanding’ event reliability problem and to stabilize the network. Simulation results show that E²SRT outperforms ESRT in terms of both reliability and energy consumption in the presence of ‘over‐demanding’ event reliability. Besides, it ensures robust convergence in the presence of dynamic network environments. Copyright © 2008 John Wiley & Sons, Ltd.