Lifetime Increase for Wireless Sensor Networks Using Cellular Learning Automata

Wireless Personal Communications - With the advent of automation, more and more information is being generated. Thereby, increasingly sensors are being used, featuring increasingly dense networks....     

A Path-Based Approach for Data Aggregation in Grid-Based Wireless Sensor Networks

Sensor nodes in a wireless sensor network(WSN) are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme(PBDAS) for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station(BS), we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.     

Data Aggregation in Wireless Sensor Networks Using Firefly Algorithm

Wireless Personal Communications - The challenging issue of data aggregation in wireless sensor networks (WSNs) is of high significance for reducing network overhead and traffic. The majority of...     

Maximizing Lifetime of Target Coverage in Wireless Sensor Networks Using Learning Automata

In wireless sensor networks, when each target is covered by multiple sensors, we can schedule sensor nodes to monitor deployed targets in order to improve lifetime of network. In this paper, we propose an efficient scheduling method based on learning automata, in which each node is equipped with a learning automaton, which helps the node to select its proper state (active or sleep), at any given time. To study the performance of the proposed method, computer simulations are conducted. Results of these simulations show that the proposed scheduling method can better prolong the lifetime of the network in comparison to similar existing methods.     

无线传感器网络中基于监督的安全数据融合方法

In order to avoid internal attacks during data aggregation in wireless sensor networks, a grid-based network architecture fit for monitoring is designed and the algorithms for network division, initialization and grid tree construction are presented. The characteristics of on-off attacks are first studied and monitoring mechanisms are then designed for sensor nodes. A Fast Detection and Slow Recovery (FDSR) algorithm is proposed to prevent on-off attacks by observing the behaviors of the nodes and computing reputations. A recovery mechanism is designed to isolate malicious nodes by identifying the new roles of nodes and updating the grid tree. In the experiments, some situations of on-off attacks are simulated and the results are compared with other approaches. The experimental results indicate that our approach can detect malicious nodes effectively and guarantee secure data aggregation with acceptable energy consumption.     

SCT Based Adaptive Data Aggregation for Wireless Sensor Networks

Communication overhead is a major concern in wireless sensor networks because of inherent behavior of resource constrained sensors. To degrade the communication overhead, a technique called data aggregation is employed. The data aggregation results are used to make crucial decisions. Certain applications apply approximate data aggregation in order to reduce communication overhead and energy levels. Specifically, we propose a technique called semantic correlation tree, which divides a sensor network into ring-like structure. Each ring in sensor network is divided into sectors, and each sector consists of collection of sensor nodes. For each sector, there will be a sector head that is aggregator node, the aggregation will be performed at sector head and determines data association on each sector head to approximate data on sink node. We propose a doorway algorithm to approximate the sensor node readings in sector head instead of sending all sensed data. The main idea of doorway algorithm is to reduce the congestion and also the communication cost among sensor nodes and sector head. This novel approach will avoid congestion by controlling the size of the queue and marking packets. Specifically, we propose a local estimation model to generate a new sensor reading from historic data. The sensor node sends each one of its parameter to sector head, instead of raw data. The doorway algorithm is utilized to approximate data with minimum and maximum bound value. This novel approach, aggregate the data approximately and efficiently with limited energy. The results demonstrate accuracy and efficiency improvement in data aggregation.     

Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks

This paper studies energy efficient routing for data aggregation in wireless sensor networks. Our goal is to maximize the lifetime of the network, given the energy constraint on each sensor node. Using linear programming (LP) formulation, we model this problem as a multicommodity flow problem, where a commodity represents the data generated from a sensor node and delivered to a base station. A fast approximate algorithm is presented, which is able to compute (1−ε)-approximation to the optimal lifetime for any ε > 0. Then along this baseline, we further study several advanced topics. First, we design an algorithm, which utilizes the unique characteristic of data aggregation, and is proved to reduce the running time of the fastest existing algorithm by a factor of K, K being the number of commodities. Second, we extend our algorithm to accommodate the same problem in the setting of multiple base stations, and study its impact on network lifetime improvement. All algorithms are evaluated through both solid theoretical analysis and extensive simulation results. Yuan Xue received her B.S. in Computer Science from Harbin Institute of Technology, China in 1994 and her M.S. and Ph.D. in Computer Science from the University of Illinois at Urbana-Champaign in 2002, and 2005. Currently she is an assistant professor at the Department of Electrical Engineering and Computer Science of Vanderbilt University. Her research interests include wireless and sensor networks, mobile systems, and network security. Yi Cui received his B.S. and M.S. degrees in 1997 and 1999, from Department of Computer Science, Tsinghua University, China, and his Ph.D. degree in 2005 from the Department of Computer Science, University of Illinois at Urbana-Champaign. Since then, he has been with the Department of Electrical Engineering and Computer Science at Vanderbilt University, where he is currently an assistant professor. His research interests include overlay network, peer-to-peer system, multimedia system, and wireless sensor network. Klara Nahrstedt (M ' 94) received her A.B., M.Sc degrees in mathematics from the Humboldt University, Berlin, Germany, and Ph.D in computer science from the University of Pennsylvania. She is an associate professor at the University of Illinois at Urbana-Champaign, Computer Science Department where she does research on Quality of Service(QoS)-aware systems with emphasis on end-to-end resource management, routing and middleware issues for distributed multimedia systems. She is the coauthor of the widely used multimedia book ‘Multimedia:Computing, Communications and Applications’ published by Prentice Hall, and the recipient of the Early NSF Career Award, the Junior Xerox Award and the IEEE Communication Society Leonard Abraham Award for Research Achievements, and the Ralph and Catherine Fisher Professorship Chair. Since June 2001 she serves as the editor-in-chief of the ACM/Springer Multimedia System Journal. An erratum to this article is available at .     

An Efficient Approach for Big Data Aggregation Mechanism in Heterogeneous Wireless Connected Sensor Networks

Recently and due to the impressive growth in the amounts of transmitted data over the heterogeneous sensor networks and the emerged related technologies especially the Internet of Things in which the number of the connected devices and the data consumption are remarkably growing, big data has emerged as a widely recognized trend and is increasingly being talked about. The term big data is not only about the volume of data, but also refers to the high speed of transmission and the wide variety of information that is difficult to collect, store and process using the available classical technologies. Although the generated data by the individual sensors may not appear to be significant, all the data generated through the many sensors in the connected sensor networks are able to produce large volumes of data. Big data management imposes additional constraints on the wireless sensor networks and especially on the data aggregation process, which represents one of the essential paradigms in wireless sensor networks. Data aggregation process can represent a solution to the problem of big data by allowing data from different sources to be combined to eliminate the redundant ones and consequently reduce the amounts of data and the consumption of the available resources in the network. The main objective of this work is to propose a new approach for supporting big data in the data aggregation process in heterogeneous wireless sensor networks. The proposed approach aims to reduce the data aggregation cost in terms of energy consumption by balancing the data loads on the heterogeneous nodes. The proposal is improved by integrating the feedback control closed loop to reinforce the balance of the data aggregation load on the nodes, maintaining therefore an optimal delay and aggregation time.

     

A Learning Automata Based Area Coverage Algorithm for Wireless Sensor Networks

One way to reduce energy consumption in wireless sensor networks is to reduce the number of active nodes in the network. When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field （referred to as a ＂cover＂）, whereas the rest of the sensors should be put to sleep to conserve their batteries. In this paper, a learning automata based algorithm for energy-efficient monitoring in wireless sensor networks （EEMLA） is proposed. Each node in EEMLA algorithm is equipped with a learning automaton which decides for the node to be active or not at any time during the operation of the network. Using feedback received from neighboring nodes, each node gradually learns its proper state during the operation of the network. Experimental results have shown that the proposed monitoring algorithm in comparison to other existing methods such as Tian and LUC can better prolong the network lifetime.     

Multi-Source Temporal Data Aggregation in Wireless Sensor Networks

Data aggregation has been emerged as a basic approach in wireless sensor networks (WSNs) in order to reduce the number of transmissions of sensor nodes.This paper proposes an energy-efficient multi-source temporal data aggregation model called MSTDA in WSNs. In MSTDA model, a feature selection algorithm using particle swarm optimization (PSO) is presented to simplify the historical data source firstly. And then a data prediction algorithm based on improved BP neural network with PSO (PSO-BPNN) is proposed. This MSTDA model, which helps to find out potential laws according to historical data sets, is deployed at both the base station (BS) and the node. Only when the deviation between the actual and the predicted value at the node exceeds a certain threshold, the sampling value and new model are sent to BS. The experiments on the dataset which comes from the actual data collected from 54 sensors deployed in the Intel Berkeley Research lab made a satisfied performance. When the error threshold greater than 0.15, it can decrease more than 80% data transmissions.     

基于分簇的无线多媒体传感器网络数据聚合方案研究

该文提出了一种基于分簇的无线多媒体传感器网络(WMSNs)数据聚合方案(Cluster-based Data Aggregation Algorithm, CDAA)。利用新的分簇方法和数据聚合策略,CDAA可以有效延长网络生命期。根据多媒体节点数据采集的方向性和节点剩余能耗,该文提出新的无线多媒体传感器网络的分簇方法,并基于该分簇方法进行网内多媒体数据聚合。仿真结果表明,该方法能够有效减少冗余数据的传送,与LEACH, PEGASIS等传统WSNs路由协议和针对WMSNs的AntSensNet协议相比,在能耗均衡和节能方面表现出更好的性能。     

无线传感器网络中有效的安全数据融合机制

在无线传感器网络中,数据融合是实现有效传输和节省能源的一个重要途径,许多应用都需要可靠并且可信的数据来进行融合.针对上述要求,提出了一个新的安全数据融合算法来保证融合数据的机密性和完整性.算法使用端到端加密和逐跳加密相结合的方式进行数据传输,通过认证过程进行恶意节点及伪造数据的检测.仿真表明,提出的算法能够有效地检测出恶意节点,并保证融合结果的准确性.     

Data Fault Detection in Wireless Sensor Networks Using Machine Learning Techniques

Wireless Personal Communications - Wireless Sensor Network (WSN) is a wireless network that consists of spatially distributed autonomous devices with sophisticated subsystem called sensors to...     

Delay-Constrained Optimal Data Aggregation in Hierarchical Wireless Sensor Networks

A lot of realistic applications with wireless sensor networks adopt hierarchical architecture in which sensor nodes are grouped into clusters, with each cluster relying on a gateway node for local data aggregation and long-distance radio transmission. Compared to normal sensor nodes, the gateway nodes, also called application nodes (ANs), are equipped with relatively powerful transceivers and have more energy. Nevertheless, since an AN is the main gateway for sensor nodes within its clusters, its energy may be depleted more quickly than normal sensor nodes. As such, it is important to find methods to save energy for ANs. This paper presents a Delay-Constrained Optimal Data Aggregation (DeCODA) framework that considers the unique feature of traffic patterns and information processing at ANs for energy saving. Mathematical models and analytical results are provided, and simulation studies are performed to verify the effectiveness of the DeCODA framework.     

Malleability Resilient Concealed Data Aggregation in Wireless Sensor Networks

The objective of concealed data aggregation is to achieve the privacy preservation at intermediate nodes while supporting in-network data aggregation. The need for privacy preservation at intermediate nodes and the need for data aggregation at intermediate nodes can be simultaneously realized using privacy homomorphism. Privacy homomorphism processes the encrypted data without decrypting them at intermediate nodes. However, privacy homomorphism is inherently malleable. Although malicious adversaries cannot view transmitted sensor readings, they can manipulate them. Hence, it is a formidable challenge to realize conflicting requirements, such as end-to-end privacy and end-to-end integrity, while performing en route aggregation. In this paper, we propose a malleability resilient concealed data aggregation protocol for protecting the network against active and passive adversaries. In addition, the proposed protocol protects the network against insider and outsider adversaries. The proposed protocol simultaneously realizes the conflicting objectives like privacy at intermediate nodes, end-to-end integrity, replay protection, and en route aggregation. As per our knowledge, the proposed solution is the first that achieves end-to-end security and en route aggregation of reverse multicast traffic in the presence of insider, as well as outsider adversaries.     

Solving Target Coverage Problem Using Cover Sets in Wireless Sensor Networks Based on Learning Automata

Recent years have witnessed a significant increase in employing wireless sensor networks (WSNs) for a variety of applications. Monitoring a set of discrete targets and, at the same time, extending the network lifetime is a critical issue in WSNs. One method to solve this problem is designing an efficient scheduling algorithm that is able to organize sensor nodes into several cover sets in such a way that each cover set could monitor all the targets. This study presents three learning automata-based scheduling algorithms to solve the problem. Moreover, several pruning rules are devised to avoid the selection of redundant sensors and manage critical sensors for extending the network lifetime. To evaluate the performance of proposed algorithms, we conducted several experiments, and the obtained results indicated that Algorithm 3 was more successful in terms of extending the network lifetime.     

一种同时保障隐私性与完整性的无线传感器网络可恢复数据聚合方案

该文针对无线传感器网络(WSNs)数据聚合与安全目标之间的矛盾,基于隐私同态和聚合消息验证码技术提出一种同时保障数据隐私性与完整性的可恢复数据聚合方案。该方案支持由聚合结果恢复出各感知数据,从而一方面能够验证感知数据和聚合数据的完整性,另一方面能够对原始数据进行任意所需的处理,不受聚合函数类型的限制。安全分析表明该方案不仅支持数据隐私性、完整性,还能够抵抗未授权聚合攻击,聚合节点俘获攻击,且能够在一定范围内检测及定位恶意节点。性能分析表明,该方案相比其他算法在通信和计算开销方面具有显著优势。为了评估方案性能和可行性,基于TinyOS给出了算法的原型实现。实验结果表明,该方案开销较低,对于资源受限的WSNs是高效可行的。     

Optimal Stochastic Policies for Distributed Data Aggregation in Wireless Sensor Networks

The scenario of distributed data aggregation in wireless sensor networks is considered, where sensors can obtain and estimate the information of the whole sensing field through local data exchange and aggregation. An intrinsic tradeoff between energy and aggregation delay is identified, where nodes must decide optimal instants for forwarding samples. The samples could be from a node's own sensor readings or an aggregation with samples forwarded from neighboring nodes. By considering the randomness of the sample arrival instants and the uncertainty of the availability of the multiaccess communication channel, a sequential decision process model is proposed to analyze this problem and determine optimal decision policies with local information. It is shown that, once the statistics of the sample arrival and the availability of the channel satisfy certain conditions, there exist optimal control-limit-type policies that are easy to implement in practice. In the case that the required conditions are not satisfied, the performance loss of using the proposed control-limit-type policies is characterized. In general cases, a finite-state approximation is proposed and two on-line algorithms are provided to solve it. Practical distributed data aggregation simulations demonstrate the effectiveness of the developed policies, which also achieve a desired energy-delay tradeoff.     

Data Aggregation Routing for Rechargeable Wireless Sensor Networks in Forest Monitoring

In rechargeable wireless sensor networks (r-WSNs), higher data transmitted efficiency is required because sensor have to operate in a very low duty cycle owing to sporadic availability of energy. In r-WSNs, Data collected by many sensors is based on common phenomena, and hence there is a high probability that this data has some redundancy. In this work, we address the problem of jointly optimizing data aggregation and routing so that the network workload can be maximized. Establish the relationship model between data aggregation rate and throughput, so that the balanced was set up between the data aggregation rate and maximum network data traffic. Through the use of optimal candidate sample allocation, the algorithm can coverage efficiently and can make the maximum data aggregation rate flow to the network while maximizing network workload. Simulations are carried out to show that the proposed algorithm can significantly improve workload.     

ELACCA: Efficient Learning Automata Based Cell Clustering Algorithm for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are a special type of networks deployed in different geographical regions for capturing the important information. WSNs consist of low energy devices called Sensor Nodes (SNs) which are capable of sensing and transferring the gathered information to remote controller called as Base Stations (BSs). Because these devices are generally deployed in unattended environment and are limited in communication and computing power, so it is not always possible to recharge or replace the batteries for these devices. The SNs are supposed to have self healing and built in intelligence to operate independently. Keeping view of the above, in this paper, we propose a new Efficient Learning Automata based Cell Clustering Algorithm (ELACCA) for WSNs. Compared to the earlier approaches, we have taken size of the cell of the area under investigation in rhombus shape rather than the square. The selection of cluster head (CH) is performed by different levels using the participation ratio of the nodes in respective CH. Using the defined participation ratio, a cut off on number of nodes in a particular CH is also computed. Moreover, by varying the angle from base of the cell to its sides, the numbers of CHs formed are also calculated. Using these values, the communication among different CHs is maintained. The performance of the proposed scheme is validated using the extensive simulation with respect to various parameters such as connectivity, coverage and packet delivery ratio. The results obtained show that the proposed scheme is better than the existing schemes with respect to these metrics.