In-network data storage protocols for wireless sensor networks: A state-of-the-art survey
---
paper_title: Techniques and Challenges of Data Centric Storage Scheme in Wireless Sensor Network

paper_content:

Storing, collecting and querying data across miniaturized battery powered Wireless Sensor Networks (WSN) is a key research focus today. Distributed Data-Centric Storage (DCS), an alternate to External Storage (ES) and Local Storage (LS), is thought to be a promising and efficient storage and search mechanism. There has been a growing interest in understanding and optimizing WSN DCS schemes in recent years, where the range query mechanism, similarity search, load balancing, multi-dimensional data search, as well as limited and constrained resources have driven this line of research. In this paper, an extensive state-of-the-art study is provided including the prime WSN DCS schemes, challenges that inspired these schemes, as well as drawbacks and shortcomings of existing solutions. In contrast to previous surveys that briefly discuss the contribution of a few WSN DCS mechanisms, we provide a thematic taxonomy in which schemes are classified according to the problems dealt with including range query, similarity search, data aggregation, sensor network field non-uniformity, multi-replication, load balancing and routing algorithm.
---
paper_title: Multi-mobile agent itinerary planning algorithms for data gathering in wireless sensor networks: A review paper

paper_content:

Recently, wireless sensor networks have employed the concept of mobile agent to reduce energy consumption and obtain effective data gathering. Typically, in data gathering based on mobile agent, it is an important and essential step to find out the optimal itinerary planning for the mobile agent. However, single-agent itinerary planning suffers from two primary disadvantages: task delay and large size of mobile agent as the scale of the network is expanded. Thus, using multi-agent itinerary planning overcomes the drawbacks of single-agent itinerary planning. Despite the advantages of multi-agent itinerary planning, finding the optimal number of distributed mobile agents, source nodes grouping, and optimal itinerary of each mobile agent for simultaneous data gathering are still regarded as critical issues in wireless sensor network. Therefore, in this article, the existing algorithms that have been identified in the literature to address the above issues are reviewed. The review shows that most of the algo...
---
paper_title: Wireless sensor networks: a survey on recent developments and potential synergies

paper_content:

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.
---
paper_title: Energy-Efficient Distributed Data Storage for Wireless Sensor Networks Based on Compressed Sensing and Network Coding

paper_content:

Recently, distributed data storage (DDS) for Wireless Sensor Networks (WSNs) has attracted great attention, especially in catastrophic scenarios. Since power consumption is one of the most critical factors that affect the lifetime of WSNs, the energy efficiency of DDS in WSNs is investigated in this paper. Based on Compressed Sensing (CS) and network coding theories, we propose a Compressed Network Coding based Distributed data Storage (CNCDS) scheme by exploiting the correlation of sensor readings. The CNCDS scheme achieves high energy efficiency by reducing the total number of transmissions Nttot and receptions Nrtot during the data dissemination process. Theoretical analysis proves that the CNCDS scheme guarantees good CS recovery performance. In order to theoretically verify the efficiency of the CNCDS scheme, the expressions for Nttot and Nrtot are derived based on random geometric graphs (RGG) theory. Furthermore, based on the derived expressions, an adaptive CNCDS scheme is proposed to further reduce Nttot and Nrtot. Simulation results validate that, compared with the conventional ICStorage scheme, the proposed CNCDS scheme reduces Nttot, Nrtot, and the CS recovery mean squared error (MSE) by up to 55%, 74%, and 76% respectively. In addition, compared with the CNCDS scheme, the adaptive CNCDS scheme further reduces Nttot and Nrtot by up to 63% and 32% respectively.
---
paper_title: Industrial wireless sensor networks 2016

paper_content:

The industrial wireless sensor network (IWSN) is the next frontier in the Industrial Internet of Things (IIoT), which is able to help industrial organizations to gain competitive advantages in industrial manufacturing markets by increasing productivity, reducing the costs, developing new products and services, and deploying new business models. The IWSN can bridge the gap between the existing industrial systems and cyber networks to offer both new challenges and opportunities for manufacturers.
---
paper_title: Data Centric Storage Technologies: Analysis and Enhancement

paper_content:

This paper surveys the most relevant works of Data Centric Storage (DCS) for Wireless Sensor Networks. DCS is a research area that covers data dissemination and storage inside an ad-hoc sensor network. In addition, we present a Quadratic Adaptive Replication (QAR) scheme for DCS, which is a more adaptive multi-replication DCS system and outperforms previous proposals in the literature by reducing the overall network traffic that has a direct impact on energy consumption. Finally, we discuss the open research challenges for DCS.
---
paper_title: Survey on the Characterization and Classification of Wireless Sensor Network Applications

paper_content:

Nowadays, wireless sensor network (WSN) users are demanding more and more in terms of choice and diversity of applications. Hence, as the diversity of applications is increasing, it is worthwhile to propose a structure for the set of characterization parameters that allows sketching a taxonomy for WSN applications. This taxonomy is established via an application-oriented approach, identifying the specific services offered by each application. In this survey, we fill this gap in the WSN literature by describing the characterization parameters, organized into six different categories. Our taxonomy for application classification is centered on the different sets of parameters that have high impact on a given future WSN application. Typical attributes and values from related research works are considered as a reference, but in this survey, we propose inter- and intra-connections among the considered application groups. Based on these connections, new application groups have been proposed for applications that share common characterization parameters, along with a holistic overview of WSN application taxonomy and the discussion of the three generations of WSNs toward communication between things and the Internet of Things , as well as future trends for the development of WSN applications. Moreover, detailed parameters from different projects and authors in the field of WSNs are joined together for comparison purposes.
---
paper_title: Distributed Mobile Sink Routing for Wireless Sensor Networks: A Survey

paper_content:

The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
---
paper_title: The Evolution of MAC Protocols in Wireless Sensor Networks: A Survey

paper_content:

Wireless Sensor Networks (WSNs) have become a leading solution in many important applications such as intrusion detection, target tracking, industrial automation, smart building and so on. Typically, a WSN consists of a large number of small, low-cost sensor nodes that are distributed in the target area for collecting data of interest. For a WSN to provide high throughput in an energy-efficient way, designing an efficient Medium Access Control (MAC) protocol is of paramount importance because the MAC layer coordinates nodes' access to the shared wireless medium. To show the evolution of WSN MAC protocols, this article surveys the latest progresses in WSN MAC protocol designs over the period 2002-2011. In the early development stages, designers were mostly concerned with energy efficiency because sensor nodes are usually limited in power supply. Recently, new protocols are being developed to provide multi-task support and efficient delivery of bursty traffic. Therefore, research attention has turned back to throughput and delay. This article details the evolution of WSN MAC protocols in four categories: asynchronous, synchronous, frame-slotted, and multichannel. These designs are evaluated in terms of energy efficiency, data delivery performance, and overhead needed to maintain a protocol's mechanisms. With extensive analysis of the protocols many future directions are stated at the end of this survey. The performance of different classes of protocols could be substantially improved in future designs by taking into consideration the recent advances in technologies and application demands.
---
paper_title: Data dissemination scheme for distributed storage for IoT observation systems at large scale

paper_content:

Abstract In the emerging field of the Internet of Things (IoT), Wireless Sensor Networks (WSNs) have a key role to play in sensing and collecting measures on the surrounding environment. In the deployment of large scale observation systems in remote areas, when there is not a permanent connection with the Internet, WSNs are calling for replication and distributed storage techniques that increase the amount of data stored within the WSN and reduce the probability of data loss. Unlike conventional network data storage, WSN-based distributed storage is constrained by the limited resources of the sensors. In this paper, we propose a low-complexity distributed data replication mechanism to increase the resilience of WSN-based distributed storage at large scale. In particular, we propose a simple, yet accurate, analytical modeling framework and an extensive simulation campaign, which complement experimental results on the SensLab testbed. The impact of several key parameters on the system performance is investigated.
---
paper_title: Wireless sensor networks: a survey on recent developments and potential synergies

paper_content:

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.
---
paper_title: Design of smart sensing component for volcano monitoring

paper_content:

With the growing number of wireless sensor network (WSN) monitoring systems in outdoor environments, smart sensing capability has attracted great research interests recently: scientists and researchers expect long-term healthy systems running in harsh environments. Because of the environmental damages to less-protected sensors, a sensing component, is highly desirable to be robust and faithful for high data fidelity. In this paper, we propose a smart sensing design solution aimed to help acquire real-time, faithful scientific monitoring data from the active volcano, Mt. St. Helens. Our smart sensing design provides services of online-configurable sensor driver, fault detection, data prioritization and time synchronization. It could be applied to sensing component design in multiple wireless sensor network applications. This design solution has been implemented on a test-bed of sixteen OASIS prototype sensor nodes.
---
paper_title: The Evolution of MAC Protocols in Wireless Sensor Networks: A Survey

paper_content:

Wireless Sensor Networks (WSNs) have become a leading solution in many important applications such as intrusion detection, target tracking, industrial automation, smart building and so on. Typically, a WSN consists of a large number of small, low-cost sensor nodes that are distributed in the target area for collecting data of interest. For a WSN to provide high throughput in an energy-efficient way, designing an efficient Medium Access Control (MAC) protocol is of paramount importance because the MAC layer coordinates nodes' access to the shared wireless medium. To show the evolution of WSN MAC protocols, this article surveys the latest progresses in WSN MAC protocol designs over the period 2002-2011. In the early development stages, designers were mostly concerned with energy efficiency because sensor nodes are usually limited in power supply. Recently, new protocols are being developed to provide multi-task support and efficient delivery of bursty traffic. Therefore, research attention has turned back to throughput and delay. This article details the evolution of WSN MAC protocols in four categories: asynchronous, synchronous, frame-slotted, and multichannel. These designs are evaluated in terms of energy efficiency, data delivery performance, and overhead needed to maintain a protocol's mechanisms. With extensive analysis of the protocols many future directions are stated at the end of this survey. The performance of different classes of protocols could be substantially improved in future designs by taking into consideration the recent advances in technologies and application demands.
---
paper_title: Design and Deployment of Sensor Network for Real-Time High-Fidelity Volcano Monitoring

paper_content:

This paper presents the design and deployment experience of an air-dropped wireless sensor network for volcano hazard monitoring. The deployment of five self-contained stations into the rugged crater of Mount St. Helens only took one hour with a helicopter. The stations communicate with each other through an amplified 802.15.4 radio and establish a self-forming and self-healing multihop wireless network. The transmit distance between stations was up to 8 km with favorable topography. Each sensor station collects and delivers real-time continuous seismic, infrasonic, lightning, GPS raw data to a gateway. The main contribution of this paper is the design of a robust sensor network optimized for rapid deployment during periods of volcanic unrest and provide real-time long-term volcano monitoring. The system supports UTC-time-synchronized data acquisition with 1 ms accuracy, and is remotely configurable. It has been tested in the lab environment, the outdoor campus, and the volcano crater. Despite the heavy rain, snow, and ice as well as gusts exceeding 160 km per hour, the sensor network has achieved a remarkable packet delivery ratio above 99 percent with an overall system uptime of about 93.8 percent over the 1.5 months evaluation period after deployment. Our initial deployment experiences with the system demonstrated to discipline scientists that a low-cost sensor network system can support real-time monitoring in extremely harsh environments.
---
paper_title: A Survey on Data Storage and Information Discovery in the WSANs-Based Edge Computing Systems

paper_content:

In the post-Cloud era, the proliferation of Internet of Things (IoT) has pushed the horizon of Edge computing, which is a new computing paradigm with data processed at the edge of the network. As the important systems of Edge computing, wireless sensor and actuator networks (WSANs) play an important role in collecting and processing the sensing data from the surrounding environment as well as taking actions on the events happening in the environment. In WSANs, in-network data storage and information discovery schemes with high energy efficiency, high load balance and low latency are needed because of the limited resources of the sensor nodes and the real-time requirement of some specific applications, such as putting out a big fire in a forest. In this article, the existing schemes of WSANs on data storage and information discovery are surveyed with detailed analysis on their advancements and shortcomings, and possible solutions are proposed on how to achieve high efficiency, good load balance, and perfect real-time performances at the same time, hoping that it can provide a good reference for the future research of the WSANs-based Edge computing systems.
---
paper_title: Energy management in Wireless Sensor Networks: A survey

paper_content:

Energy management in Wireless Sensor Networks (WSNs) is of paramount importance for the remotely deployed energy stringent sensor nodes. These nodes are typically powered by attached batteries. Several battery-driven energy conservation schemes are proposed to ensure energy efficient network operation. The constraints associated to the limited battery capacity shifted the research trend towards finding alternate sources by harvesting ambient energy. This survey presents a high level taxonomy of energy management in WSNs. We analyze different battery-driven energy consumption based schemes and energy harvesting based energy provisioning schemes. We also highlight the recent breakthrough of wireless energy transference to a sensor node as an alternative to typical batteries. We recommend taking into account recent energy provisioning advancements in parallel with the traditional energy conservation approaches for a sensor network while designing energy efficient schemes.
---
paper_title: The broadcast storm problem in a mobile ad hoc network

paper_content:

Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.
---
paper_title: Effective strategies and optimal solutions for Hot Spot Problem in wireless sensor networks (WSN)

paper_content:

In the recent past, wireless sensor networks (WSN) have found their way into a wide variety of applications, like animal monitoring, Vehicle monitoring, Machine monitoring and Medical monitoring systems. In this paper we proposed a novel approach in handling the Hot Spot Problem with better connectivity and lifetime for a wireless sensor networks. We used variety of strategies in our experiments and came up with optimal solutions. Our smart Environment includes Sensor Area, Sensor Nodes, Base Station and Enemy Nodes.
---
paper_title: A Survey on Data Dissemination in Wireless Sensor Networks

paper_content:

Wireless sensor networks (WSNs) have been applied in a variety of application areas. Most WSN systems, once deployed, are intended to operate unattended for a long period. During the lifetime, it is necessary to fix bugs, reconfigure system parameters, and upgrade the software in order to achieve reliable system performance. However, manually collecting all nodes back and reconfiguring through serial connections with computer is infeasible since it is labor-intensive and inconvenient due to the harsh deploying environments. Hence, data dissemination over multi-hop is desired to facilitate such tasks. This survey discusses the requirements and challenges of data dissemination in WSNs, reviews existing work, introduces some relevant techniques, presents the metrics of the performance and comparisons of the state-of-the-art work, and finally suggests the possible future directions in data dissemination studies. This survey elaborates and compares existing approaches of two categories: structure-less schemes and structure-based schemes, classified by whether or not the network structure information is used during the disseminating process. In existing literatures, different categories have definite boundary and limited analysis on the trade-off between different categories. Besides, there is no survey that discusses the emerging techniques such as Constructive Interference (CI) while these techniques have the chance to change the framework of data dissemination. In a word, even though many efforts have been made, data dissemination in WSNs still needs some more work to embrace the new techniques and improve the efficiency and practicability further.
---
paper_title: Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting

paper_content:

A water heating system includes a solar collector panel, a hot water heater tank, a serpentine tube-in-sheet heat exchanger jacket built into the water tank assembly, pumping means, fluid transfer means and means for securing the heat exchanger jacket around the hot water heater. The solar collector panel has a first passageway which lies beneath the outer surface of the panel such that incident solar energy is used to elevate the temperature of an energy-absorbing fluid which is circulating through this first passageway. The heat exchanger jacket is constructed with second and third passageways which are positioned in a double serpentine coil arrangement. The energy-absorbing fluid from the collector panel flows through connecting conduits to and from the second passageway. Water within the hot water heater is coupled to the third passageway and, as it circulates through the third passageway, this water is elevated in temperature by means of conduction from the energy-absorbing fluid. The energy-absorbing fluid, by raising the temperature of the heat exchanger jacket, also elevates the temperature of the water within the hot water heater by conduction through the wall of the hot water heater. Thus, two modes of heat transfer are used to heat the water within the hot water heater. Suitable pumps and valves are provided in order to control the flow of the fluids during the various climatic conditions.
---
paper_title: TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor Networks

paper_content:

Sink mobility brings new challenges to data dissemination in large sensor networks. It suggests that information about each mobile sink's location be continuously propagated throughout the sensor field in order to keep all sensors informed of the direction of forwarding future data reports. Unfortunately, frequent location updates from multiple sinks can lead to both excessive drain of sensors' limited battery supply and increased collisions in wireless transmissions. In this paper, we describe TTDD, a Two-Tier Data Dissemination approach that provides scalable and efficient data delivery to multiple, mobile sinks. Each data source in TTDD proactively constructs a grid structure, which enables mobile sinks to continuously receive data on the move by flooding queries within a local cell only. TTDD's design exploits the fact that sensors are stationary and location-aware to construct and maintain the grid infrastructure with low overhead. We evaluate TTDD through both analysis and extensive simulations. Our results show that TTDD handles sink mobility effectively with performance comparable with that of stationary sinks.
---
paper_title: A Spatiotemporal Query Service for Mobile Users in Sensor Networks

paper_content:

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to maintain robust spatiotemporal guarantees even when nodes operate under extremely low duty cycles. Furthermore, it significantly reduces the storage cost and network contention caused by continuous queries from mobile users. We validate our approach through both theoretical analysis and simulation results under a range of realistic settings
---
paper_title: Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks

paper_content:

In this paper, we investigate efficient strategies for supporting on-demand information dissemination and gathering in large-scale wireless sensor networks. In particular, we propose a "comb-needle" discovery support model resembling an ancient method: use a comb to help find a needle in sand or a haystack. The model combines push and pull for information dissemination and gathering. The push component features data duplication in a linear neighborhood of each node. The pull component features a dynamic formation of an on-demand routing structure resembling a comb. The comb-needle model enables us to investigate the cost of a spectrum of push and pull combinations for supporting query and discovery in large-scale sensor networks. Our result shows that the optimal routing structure depends on the frequency of query occurrence and the spatial-temporal frequency of related events in the network. The benefit of balancing push and pull for information discovery is demonstrated
---
paper_title: Grid-Based Energy-Efficient Routing from Multiple Sources to Multiple Mobile Sinks in Wireless Sensor Networks

paper_content:

In this paper, we address the problem of packet transmission from multiple sources to multiple mobile sinks in the large-scale sensor network. Each mobile sink needs to periodically update its location information into the sensor network. Due to multiple mobile sinks, frequent location updates are needed and this causes enormous consumption of the limited battery power in the sensor node. Several routing protocols, such as TTDD and SEAD, suggest hierarchical approach for supporting mobile sinks. These approaches, however, build the grid structure or the tree per event which causes much power consumption as well, so they are not suitable for the sensor network where the event frequently happens. To effectively send the data to multiple mobile sinks and minimize the battery power consumption of sensors, we propose a Grid-Based Energy-Efficient Routing protocol(GBEER) which makes only one grid structure independent of the event. We adopt a Grid-Quorum solution to effectively advertise and request the data for mobile sinks. Simulation results show that GBEER outperforms TTDD in terms of total energy consumption with variation of the number of sinks and sources and mobile sinks' speeds.
---
paper_title: Adaptive location updates for mobile sinks in wireless sensor networks

paper_content:

Mobile sinks can be used to balance energy consumption for sensor nodes in Wireless Sensor Networks (WSNs). Mobile sinks are required to inform sensor nodes about their new location information whenever necessary. However, frequent location updates from mobile sinks can lead to both rapid energy consumption of sensor nodes and increased collisions in wireless transmissions. We propose a new solution with adaptive location updates for mobile sinks to resolve this problem. When a sink moves, it only needs to broadcast its location information within a local area other than among the entire network. Both theoretical analysis and simulation studies show that this solution consumes less energy in each sensor node and also decreases collisions in wireless transmissions, which can be used in large-scale WSNs.
---
paper_title: Query-based data collection in wireless sensor networks with mobile sinks

paper_content:

Considering sensor nodes deployed densely and uniformly in the sensing field, we focus on a scenario that a mobile sink moving through the sensing field queries a specific area or a point of interest for data collection. A Query packet is injected by the mobile sink and routed to the specific area, then the corresponding Response packet is returned to the mobile sink via multi-hop communication. Due to the mobility of the sink, the Query and Response should have different routes. We analyze such a network model to address the problem of efficient data collection in wireless sensor networks and propose an efficient Query-Based Data Collection Scheme (QBDCS). In order to minimize the energy consumption and packet delivery latency, QBDCS chooses the optimal time to send the Query packet and tailors the routing mechanism for partial sensor nodes forwarding packets. Simulation results demonstrate that QBDCS completes a query-based data collection cycle with minimum energy consumption and delivery latency.
---
paper_title: Energy-efficient communication protocol for wireless microsensor networks

paper_content:

Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
---
paper_title: A Line-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sink

paper_content:

In wireless sensor networks, data dissemination is generally performed from the sensor nodes towards a static sink. In this paper, we address the particular case where the sink is mobile, according to an unpredictable mobility pattern. First, we study existing approaches. As an alternative, we present the line-based data dissemination (LBDD) protocol. Next, we analytically evaluate the communication cost of this protocol and we compare it to other approaches. Finally, realistic simulations are performed and results show that LBDD outperforms previous approaches and presents the best tradeoff among the evaluated protocols.
---
paper_title: USEE: A uniform data dissemination and energy efficient protocol for communicating materials

paper_content:

Abstract A new Internet of Things area is coming with communicating materials, which are able to provide diverse functionalities to users all along the product lifecycle. As example, it can track its own evolution which leads to gather helpful information. This new paradigm is fulfilled via the integration of specific electronic components into the product material. In this work, ultra-small Wireless Sensor Networks (WSN) are used for large scale materials such as concrete in smart building. Indeed, storage of lifecycle information and data dissemination in communicating materials are very important issues. Therefore, this paper provides solution for storing data by systematic dissemination through the integrated WSN. It presents USEE, a uniform data storage protocol for large scale communicating material. USEE guarantees that information could be retrieved in each piece of the material by intelligently managing data replication among each neighborhood of the WSN. Unlike related protocols of the literature, USEE considers in the same set uniformity storage in the whole network, the data importance level, and the resource constraints of sensor nodes. When compared with related protocols such as RaWMS, DEEP, and Supple, USEE shows a uniform dissemination and low communication overhead tradeoff for all the data importance levels.
---
paper_title: Wireless Sensors Networks as Black-Box Recorder for Fast Flight Data Recovery during Aircraft Crash Investigation

paper_content:

Abstract Commercial aircrafts use black box comprising a Flight Data Recorder (FDR) required for crash investigation purposes. While FDR can be easily recovered in crash events on land, the same does not apply to crash events in great deep ocean water. This paper presents a new solution towards solving FDR data recovery using a paradigm called "communicating materials". The solution is developed through uniformly integrating hundreds of tiny sensor nodes in the aircraft structure. The nodes could then construct a Wireless Sensor Network (WSN) inside the aircraft. Thus, the latest FDR data could be stored in the nodes using data storage protocol for WSN. The proposed storage protocol uses the probabilistic-based flooding scheme to forward data to all nodes inside the aircraft structure within the lowest delay. To improve reliability and collision-avoidance of flooding, different complementing corrective measures are used based on neighborhood information. The protocol is evaluated using Castalia/OMNeT++ simulator.
---
paper_title: A Quadtree-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sinks

paper_content:

The envisioned sensor network architecture where some of the nodes may be mobile poses several new challenges to this special type of ad hoc wireless network. Recently, researchers have proposed several data dissemination protocols based on some hierarchical structure mainly constructed by a source node to support mobile sinks. However, such a source-initiated hierarchical structure results in significant resource consumption as the number of source-sink pairs are increased. Additionally, stimulus mobility aggravates the situation, where several sources may build a separate data forwarding hierarchy along the stimulus moving path. In this paper, we propose a new data dissemination protocol that exploits “Quadtree-based network space partitioning” to provide more efficient routing among multiple mobile stimuli and sink nodes. Simulation results show that our work significantly reduces average energy consumption while maintaining comparably higher data delivery ratio.
---
paper_title: RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks

paper_content:

In this paper, we propose a novel reliable probabilistic dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior. The protocol employs a combination of probabilistic forwarding with deterministic corrective measures. The forwarding probability is set based on the observed number of nodes in each one-hop neighborhood, while the deterministic corrective measures include deterministic gossiping as well as timer based corrections of the probabilistic process. These aspects of the protocol are motivated by a theoretical analysis that is also presented in the paper, which explains why this unique protocol design is inherent to ad-hoc networks environments. Since the protocol only relies on local computations and probability, it is highly resilient to mobility and failures. The paper includes a detailed performance evaluation by simulation. We compare the performance and the overhead of RAPID with the performance of other probabilistic approaches. Our results show that RAPID achieves a significantly higher node coverage with a smaller overhead.
---
paper_title: GPSR: greedy perimeter stateless routing for wireless networks

paper_content:

We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.
---
paper_title: Railroad: virtual infrastructure for data dissemination in wireless sensor networks

paper_content:

In this paper, we present Railroad, a data dissemination architecture for large-scale wireless sensor networks. Railroad system proactively exploits a virtual infrastructure called Rail, which is an area where all the metadata of event data are stored. There is only one Rail in the network and it acts as a rendezvous area of the events and the queries. Rail is placed in the middle area of the field so that every node can easily access it. Once a query is issued, it circulates around Rail and searches relevant data stored in Rail. When a relevant metadata is found, the source node of the data transmits the corresponding data to the sink node which has issued the query. By using Rail, Railroad achieves a scalable and energy-efficient data dissemination architecture under dynamic conditions with multiple mobile observers and targets. We evaluate and compare the communication cost and the hot spot message complexity of Railroad with previous approaches.
---
paper_title: Hexagonal path data dissemination for energy efficiency in wireless sensor networks

paper_content:

As sensor technology continues to improve, sensors will be deployed in many more applications. Mobile services utilized by mobile users who wish to access the Internet and sensor networks are becoming more common. Two-Tier Data Dissemination (TTDD) is a scheme that transmits data using square virtual paths. TTDD uses energy efficiently by consuming energy only in sensor nodes that are on virtual paths even if the user who collects the information moves. However, this scheme must use fixed square virtual paths to communicate. It incurs overhead by using a detouring path instead of the shortest practical path. Therefore, the proposed scheme can use both a straight line path and a diagonal line path of a hexagon by constructing a hexagonal virtual path. Compared to TTDD, the energy efficiency is improved because fewer sensor nodes are employed for data communication. The energy consumption of the sensor nodes is decreased by using less energy to generate and to maintain the virtual path and the data transmission path. The energy efficiency and the transmission success rate can be improved by as much as 61% and by approximately 15%, respectively.
---
paper_title: Multi-hop counter based data dissemination protocol for communicating materials

paper_content:

The communicating material is a new paradigm of Internet of Things. It is designed to perform efficient product control and ensure an information continuum all along the product life cycle. Therefore, storage of life cycle information and data dissemination in communicating materials are very important issues. This paper provides a solution for storing data on the material by systematic dissemination through integrated ultra-small wireless sensors nodes via multi-hop counter based algorithm. The performance of our protocol is evaluated for non-localized and localized dissemination, then for not segmented and segmented data. Simulation results using Castalia/OMNeT++ show that our algorithm provides uniform dissemination for different limited density level and efficient localized storage.
---
paper_title: CRBcast: a reliable and energy-efficient broadcast scheme for wireless sensor networks using rateless codes

paper_content:

This paper introduces a novel two-phase broadcast scheme referred to as collaborative rateless broadcast (CRBcast). CRBcast is a scalable approach for reliable and energy-efficient broadcasting in a multihop wireless sensor networks that also addresses load balancing, while requiring no knowledge of network topology. CRBcast combines the energy-efficiency offered by probabilistic broadcasting (PBcast) with the reliability features offered by application-layer rateless coding. In the first phase of CRBcast, packets encoded using a rateless code are dispersed into the network based on PBcast. In the second phase, simple collaboration of neighboring nodes ensures that all nodes recover original data with a very high probability of success. Since the performance of CRBcast rests heavily on that of PBcast, first part of this paper analyzes both analytically and via simulations the probabilistic broadcasting scheme. We then study the effectiveness of CRBcast. We show that CRBcast provides both reliability and energy efficiency simultaneously. Simulation results indicate that CRBcast provides an energy savings of at least 72% and 60% in comparison with flooding and PBcast, respectively.
---
paper_title: Distributed Mobile Sink Routing for Wireless Sensor Networks: A Survey

paper_content:

The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
---
paper_title: DEEP: Density-based proactive data dissemination protocol for wireless sensor networks with uncontrolled sink mobility

paper_content:

This paper investigates proactive data dissemination and storage schemes for wireless sensor networks (WSNs) with mobile sinks. The focus is on schemes that do not impose any restrictions on the sink's mobility pattern. The goal is to enable the sink to collect a representative view of the network's sensed data by visiting any set of x out of n nodes, where x@?n. The question is how to obtain this while maintaining a good trade-off between the communication overhead of the scheme, the storage space requirements on the nodes, and the ratio between the number of visited nodes x and the representativeness of the gathered data. To answer this question, we propose density-based proactivE data dissEmination Protocol (DEEP), which combines a probabilistic flooding with a probabilistic storing scheme. The DEEP protocol is formally analyzed and its performance is studied under simulations using different network densities and compared with a scheme based on random walks, called RaWMS.
---
paper_title: Querying sensor fields by using quadtree based dynamic clusters and task sets

paper_content:

In this paper a dynamic clustering scheme is introduced where a task set of sensors is formed for each task by using quadtree based addressing. The number of nodes in a task set depends on the task specifications. Hence, the sensed data is retrieved from a sensor field in the level of detail specified by users. Experiments show that quadtree based dynamic clustering scheme reduces the number of sensors involved in a query in the orders of magnitude.
---
paper_title: Compressed sensing

paper_content:

Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements n can be dramatically smaller than the size m. Thus, certain natural classes of images with m pixels need only n=O(m1/4log5/2(m)) nonadaptive nonpixel samples for faithful recovery, as opposed to the usual m pixel samples. More specifically, suppose x has a sparse representation in some orthonormal basis (e.g., wavelet, Fourier) or tight frame (e.g., curvelet, Gabor)-so the coefficients belong to an lscrp ball for 0<ples1. The N most important coefficients in that expansion allow reconstruction with lscr2 error O(N1/2-1p/). It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients. Moreover, a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing. The nonadaptive measurements have the character of "random" linear combinations of basis/frame elements. Our results use the notions of optimal recovery, of n-widths, and information-based complexity. We estimate the Gel'fand n-widths of lscrp balls in high-dimensional Euclidean space in the case 0<ples1, and give a criterion identifying near- optimal subspaces for Gel'fand n-widths. We show that "most" subspaces are near-optimal, and show that convex optimization (Basis Pursuit) is a near-optimal way to extract information derived from these near-optimal subspaces
---
paper_title: Energy management in Wireless Sensor Networks: A survey

paper_content:

Energy management in Wireless Sensor Networks (WSNs) is of paramount importance for the remotely deployed energy stringent sensor nodes. These nodes are typically powered by attached batteries. Several battery-driven energy conservation schemes are proposed to ensure energy efficient network operation. The constraints associated to the limited battery capacity shifted the research trend towards finding alternate sources by harvesting ambient energy. This survey presents a high level taxonomy of energy management in WSNs. We analyze different battery-driven energy consumption based schemes and energy harvesting based energy provisioning schemes. We also highlight the recent breakthrough of wireless energy transference to a sensor node as an alternative to typical batteries. We recommend taking into account recent energy provisioning advancements in parallel with the traditional energy conservation approaches for a sensor network while designing energy efficient schemes.
---
paper_title: tinyDSM: A highly reliable cooperative data storage for Wireless Sensor Networks

paper_content:

The advantage of a Wireless Sensor Network (WSN) compared to a centric approach is the distribution of sensing suites. However, in order for such a system of distributed resources to work in a reliable and effective way a smart cooperation between nodes is needed. In this paper we propose a middleware approach for a highly reliable data storage that helps to assure data availability despite the well known WSN resource problems and disappearing or inactive nodes by providing a reasonable data redundancy in the system. Such a solution helps to ease the design and optimization of the data exchange between nodes as well. Our solution is configurable in order to satisfy the needs of the application on top regarding performance/requirements trade-off. The options specify the quantity and quality of the data replication. Additional features like event mechanism that monitors the data and the possibility to issue database like queries increase the applicability of our middleware. In this paper we focus on the evaluation of its capabilities regarding reliability, the consistency of replicates and the costs of the data management. The simulation results for a reasonable set-up show that the CPU load caused by the data replication is low (below 3 percent) and the average inconsistency time is as small as about 0,06 seconds for a single hop and about 0,15 seconds for a two hops replication area. There is still room for improvements, but a clear definition of problems helps to find ways to cope with them in order to achieve the chosen goals.
---
paper_title: Information discovery in mission-critical wireless sensor networks

paper_content:

Wireless sensor networks (WSN) are attractive for information gathering in large-scale data rich environments and can add value to mission-critical applications such as battlefield surveillance and reconnaissance. However, in order to fully exploit these networks for such applications, energy-efficient and scalable solutions for data storage and information discovery are essential. In this paper, we propose a novel method of information management in wireless sensor networks that can significantly increase network lifetime and minimize query processing delay resulting in quality of service (QoS) improvements that are of significant benefit to mission-critical applications. We propose novel methods for data dissemination, information storage and discovery that are totally distributed and also take into account the energy limitations of individual sensors. We present analytical and simulations results that prove the proposed methods of information management to offer significant improvements in the resolution of global ALL-type as well as individual ANY-type queries in comparison to current approaches. In addition, the results prove that the QoS improvements come with significant network-wide energy savings that will result in an increase of the network lifetime.
---
paper_title: A grid-based dynamic load balancing approach for data-centric storage in wireless sensor networks

paper_content:

In many data-centric storage techniques, each event corresponds to a hashing location by event type. However, most of them fail to deal with storage memory space due to high percentage of the load is assigned to a relatively small portion of the sensor nodes. Hence, these nodes may fail to deal with the storage of the sensor nodes effectively. To solve the problem, we propose a grid-based dynamic load balancing approach for data-centric storage in sensor networks that relies on two schemes: (1) a cover-up scheme to deal with a problem of a storage node whose memory space is depleted. This scheme can adjust the number of storage nodes dynamically; (2) the multi-threshold levels to achieve load balancing in each grid and all nodes get load balancing. Simulations have shown that our scheme can enhance the quality of data and avoid hotspot of the storage while there are a vast number of the events in a sensor network.
---
paper_title: Ring Routing: An Energy-Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink

paper_content:

In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.
---
paper_title: Double-Blind Data Discovery Using Double Cross for Large-Scale Wireless Sensor Networks With Mobile Sinks

paper_content:

Large-scale wireless sensor networks (WSNs) with mobile sinks present new challenges on data discovery because the locations of the mobile sinks cannot be predetermined. In this paper, we study the double-blind data discovery problem in a WSN, where the mobile sink(s) and the sensed data do not know the locations of each other a priori. To address this problem, we first propose a Random Line Walk (RLW) mechanism for message forwarding, and based on this forwarding mechanism, we further propose an efficient data discovery mechanism called Double Cross. Double Cross exploits a simple geometric property of a planar, i.e., for a couple of pairs of orthogonal lines in a planar, the probability that they intersect within the planar is larger than 99%. However, it does not depend on the geographic location or directional information on a node, which is difficult to obtain in such networks. Instead, each sensor node only needs to know the distances between the neighbor nodes within its transmission range. Analytical and simulation results show that Double Cross can achieve a higher successful discovery rate with lower energy consumption, compared existing work.
---
paper_title: Energy-efficient communication protocol for wireless microsensor networks

paper_content:

Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
---
paper_title: RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks

paper_content:

This article presents RaWMS, a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership service is useful, for example, in data dissemination algorithms, lookup and discovery services, peer sampling services, and complete membership construction. The design of RaWMS is based on a novel reverse random walk (RW) sampling technique. The article includes a formal analysis of both the reverse RW sampling technique and RaWMS and verifies it through a detailed simulation study. In addition, RaWMS is compared both analytically and by simulations with a number of other known methods such as flooding and gossip-based techniques.
---
paper_title: Double Cross: A Double-Blind Data Discovery Scheme for Large-Scale Wireless Sensor Networks

paper_content:

In this paper, we consider the double-blindness problem in large-scale wireless sensor networks (WSNs) with mobile sinks, where the mobile sink(s) and data do not know the locations of each other a priori. We first propose a random line walk mechanism for message forwarding and based on this forwarding mechanism we further propose an efficient data discovery scheme called Double Cross to address the double-blindness problem. Double Cross exploits a simple geometric property of a planar, i.e., for a couple of pairs of orthogonal lines in a planar, the probability that they intersect within the planar is larger than 99%. However, it does not depend on the geographic location or directional information of a node, which is difficult to obtain in such networks. Instead, each sensor only needs to know the distances between neighbor nodes within its transmission range. Analytical and simulation results show that Double Cross can achieve a high successful discovery rate with low energy consumption.
---
paper_title: USEE: A uniform data dissemination and energy efficient protocol for communicating materials

paper_content:

Abstract A new Internet of Things area is coming with communicating materials, which are able to provide diverse functionalities to users all along the product lifecycle. As example, it can track its own evolution which leads to gather helpful information. This new paradigm is fulfilled via the integration of specific electronic components into the product material. In this work, ultra-small Wireless Sensor Networks (WSN) are used for large scale materials such as concrete in smart building. Indeed, storage of lifecycle information and data dissemination in communicating materials are very important issues. Therefore, this paper provides solution for storing data by systematic dissemination through the integrated WSN. It presents USEE, a uniform data storage protocol for large scale communicating material. USEE guarantees that information could be retrieved in each piece of the material by intelligently managing data replication among each neighborhood of the WSN. Unlike related protocols of the literature, USEE considers in the same set uniformity storage in the whole network, the data importance level, and the resource constraints of sensor nodes. When compared with related protocols such as RaWMS, DEEP, and Supple, USEE shows a uniform dissemination and low communication overhead tradeoff for all the data importance levels.
---
paper_title: An efficient k-means clustering algorithm: Analysis and implementation

paper_content:

In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's (1982) algorithm. We present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm's running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation.
---
paper_title: Data Centric Storage in ZigBee Wireless Sensor Networks

paper_content:

Data Centric Storage is a recent paradigm that results more efficient than other storage techniques (such as local or external storage) in Wireless Sensor Networks (WSN). In this work we consider the use of this storage paradigm in WSN based on the ZigBee standard. In particular we propose a novel protocol (Z-DaSt) that exploits the routing and addressing features of ZigBee (that are based on routing trees) to distribute data to the sensors. The protocol also features Quality of Service in the storage of data by enabling the user to specify the amount of redundancy to be used in the storage of each datum. This work evaluates Z-DaSt by analysis and simulation, and compares its performance to DCS-GHT. The simulation results show that Z-DaSt is a viable alternative to DCS-GHT for practical cases, in particular for low to moderate network densities.
---
paper_title: Data Storage Algorithms Based on Clustering in Wireless Sensor Networks

paper_content:

Wireless sensor’s traditional data storage algorithms exist many problems, such as lack of adaptability and load balancing, great energy consumption, long network cycle lifetime, high delay access rate and so on. This paper proposes an adaptive clustering based on data storage (CBDS) algorithm to deal with these problems. Through analysis of the available data storage methods, we studied how to determine data storage nodes under the premise of limited energy of sensor networks and more consumers exist in the network. We concluded a common storage strategy which combines sensor networks set’s centralized storage, local storage and distributed storage. Finally, we did compared experiments between the CBDS algorithm and other related algorithms. Experiments showed that: CBDS has obvious advantages like self-adaptive, load balancing, low access latency and less energy consumption than traditional algorithm. CBDS is more conducive to data storage.
---
paper_title: Communicating Aircraft Structure for Solving Black-Box Loss on Ocean Crash

paper_content:

Commercial aircrafts use black-box required for crash investigation purposes. While a black-box can be easily recovered in crash events on land, the same does not apply to crash events in great deep ocean water. This paper presents a new solution towards solving black-box data loss on ocean crash using a paradigm called communicating materials. The solution is developed through uniformly integrating hundreds of micro sensors nodes in the aircraft structure. The nodes could then construct a Wireless Sensor Network (WSN) inside the aircraft. When a crash is detected by the aircraft system, the black-box data could be stored in all nodes using data storage protocols for WSN. Since nodes are uniformly deployed in the whole aircraft structure, investigators could thus gather preliminary crash causes information from the nodes inside any floated aircraft wreckage in the ocean. This solution was evaluated using Castalia simulator in terms of reliability, storage capacity, and energy efficiency.
---
paper_title: Energy-Efficient Sensing in Wireless Sensor Networks Using Compressed Sensing

paper_content:

Sensing of the application environment is the main purpose of a wireless sensor network. Most existing energy management strategies and compression techniques assume that the sensing operation consumes significantly less energy than radio transmission and reception. This assumption does not hold in a number of practical applications. Sensing energy consumption in these applications may be comparable to, or even greater than, that of the radio. In this work, we support this claim by a quantitative analysis of the main operational energy costs of popular sensors, radios and sensor motes. In light of the importance of sensing level energy costs, especially for power hungry sensors, we consider compressed sensing and distributed compressed sensing as potential approaches to provide energy efficient sensing in wireless sensor networks. Numerical experiments investigating the effectiveness of compressed sensing and distributed compressed sensing using real datasets show their potential for efficient utilization of sensing and overall energy costs in wireless sensor networks. It is shown that, for some applications, compressed sensing and distributed compressed sensing can provide greater energy efficiency than transform coding and model-based adaptive sensing in wireless sensor networks.
---
paper_title: Energy-Efficient Distributed Data Storage for Wireless Sensor Networks Based on Compressed Sensing and Network Coding

paper_content:

Recently, distributed data storage (DDS) for Wireless Sensor Networks (WSNs) has attracted great attention, especially in catastrophic scenarios. Since power consumption is one of the most critical factors that affect the lifetime of WSNs, the energy efficiency of DDS in WSNs is investigated in this paper. Based on Compressed Sensing (CS) and network coding theories, we propose a Compressed Network Coding based Distributed data Storage (CNCDS) scheme by exploiting the correlation of sensor readings. The CNCDS scheme achieves high energy efficiency by reducing the total number of transmissions Nttot and receptions Nrtot during the data dissemination process. Theoretical analysis proves that the CNCDS scheme guarantees good CS recovery performance. In order to theoretically verify the efficiency of the CNCDS scheme, the expressions for Nttot and Nrtot are derived based on random geometric graphs (RGG) theory. Furthermore, based on the derived expressions, an adaptive CNCDS scheme is proposed to further reduce Nttot and Nrtot. Simulation results validate that, compared with the conventional ICStorage scheme, the proposed CNCDS scheme reduces Nttot, Nrtot, and the CS recovery mean squared error (MSE) by up to 55%, 74%, and 76% respectively. In addition, compared with the CNCDS scheme, the adaptive CNCDS scheme further reduces Nttot and Nrtot by up to 63% and 32% respectively.
---
paper_title: A distributed data storage protocol for heterogeneous wireless sensor networks with mobile sinks

paper_content:

Abstract This paper presents ProFlex, a distributed data storage protocol for large-scale Heterogeneous Wireless Sensor Networks (HWSNs) with mobile sinks. ProFlex guarantees robustness in data collection by intelligently managing data replication among selected storage nodes in the network. Contrarily to related protocols in the literature, ProFlex considers the resource constraints of sensor nodes and constructs multiple data replication structures, which are managed by more powerful nodes. Additionally, ProFlex takes advantage of the higher communication range of such powerful nodes and uses the long-range links to improve data distribution by storage nodes. When compared with related protocols, we show through simulation that Proflex has an acceptable performance under message loss scenarios, decreases the overhead of transmitted messages, and decreases the occurrence of the energy hole problem. Moreover, we propose an improvement that allows the protocol to leverage the inherent data correlation and redundancy of wireless sensor networks in order to decrease even further the protocol’s overhead without affecting the quality of the data distribution by storage nodes.
---
paper_title: Performance analysis and improvement of Zigbee routing protocol

paper_content:

Abstract ZigBee is a recent wireless standard based on IEEE 802.15.4 for Personal Area Networks. Its use in Wireless Sensor Networks arouses many interests. In this paper, a performance analysis and an improvement of ZigBee routing protocol are carried out. ZigBee routing protocol uses a modified AODV by default and Hierarchical Tree Routing as last resort. Firstly, these two algorithms are compared in terms of delay performance and energy consumption. The results showed that Hierarchical Tree Routing provides shorter average end to end delay but performs poorly in terms of energy consumption. So for supporting real time communication, it is desirable to freely choose one or another according to the type of traffic (realtime and non real-time). Secondly, Hierarchical Tree Routing algorithm is slightly modified to provide shorter delays than the original one.
---
paper_title: A Distributed Spatial-Temporal Similarity Data Storage Scheme in Wireless Sensor Networks

paper_content:

Since centralized data storage and search schemes often lead to high overhead and latency, distributed data-centric storage becomes a preferable approach in large-scale wireless sensor networks (WSNs). However, most of existing distributed methods lack optimization for spatial-temporal search to query events occurred in a certain geographical area and a certain time period. Furthermore, for data search routing, most methods rely on locating systems (e.g., GPS), which consume high energy. This paper proposes a distributed spatial-temporal Similarity Data Storage (SDS) scheme. SDS provides efficient spatial-temporal and similarity data searching service, and is applicable for both static and dynamic WSNs. It disseminates event data in such a way that the distance between WSN neighborhoods represents the similarity of data stored in them. In addition, SDS carpooling routing algorithm efficiently routes messages without the aid of GPS. Theoretical and experimental results show that SDS yields significant improvements on the efficiency of data querying compared with existing approaches, and obtains stable performance in dynamic environments.
---
paper_title: DEEP: Density-based proactive data dissemination protocol for wireless sensor networks with uncontrolled sink mobility

paper_content:

This paper investigates proactive data dissemination and storage schemes for wireless sensor networks (WSNs) with mobile sinks. The focus is on schemes that do not impose any restrictions on the sink's mobility pattern. The goal is to enable the sink to collect a representative view of the network's sensed data by visiting any set of x out of n nodes, where x@?n. The question is how to obtain this while maintaining a good trade-off between the communication overhead of the scheme, the storage space requirements on the nodes, and the ratio between the number of visited nodes x and the representativeness of the gathered data. To answer this question, we propose density-based proactivE data dissEmination Protocol (DEEP), which combines a probabilistic flooding with a probabilistic storing scheme. The DEEP protocol is formally analyzed and its performance is studied under simulations using different network densities and compared with a scheme based on random walks, called RaWMS.
---
paper_title: TwinRoute: Energy-Efficient Data Collection in Fixed Sensor Networks with Mobile Sinks

paper_content:

Collecting data from source sensor nodes to designated sinks is a common and challenging task in a wide spectrum of sensor network applications, ranging from animal monitoring to security surveillance. A number of approaches exploiting sink mobility have been proposed in recent years: some are proactive, in that sensor nodes push their readings to storage nodes from where they are collected by roaming mobile sinks, whereas others are reactive, in that mobile sinks pull readings from nearby sensor nodes as they traverse the sensor network. In this paper, we point out that deciding which data collection approach is more energy-efficient depends on application characteristics, including the mobility patterns of sinks and the desired freshness of collected data. We illustrate cases where combining proactive and reactive modes of data collection is particularly beneficial. This motivates the design of TwinRoute, a novel hybrid algorithm that can flexibly mix the two collection modes at appropriate levels depending on the application scenario. Our extensive experimental evaluation, using synthetic and real-world network topologies and sink traces, shows that TwinRoute outperforms the pure approaches, achieving desirable tradeoffs between energy expenditure and timely delivery of sensor data.
---
paper_title: Supple: a flexible probabilistic data dissemination protocol for wireless sensor networks

paper_content:

We propose a flexible proactive data dissemination approach for data gathering in self-organized Wireless Sensor Networks (WSN). Our protocol Supple, effectively distributes and stores monitored data in WSNs such that it can be later sent to or retrieved by a sink. Supple empowers sensors with the ability to make on the fly forwarding and data storing decisions and relies on flexible and self-organizing selection criteria, which can follow any predefined distribution law. Using formal analysis and simulation, we show that Supple is effective in selecting storing nodes that respect the predefined distribution criterion with low overhead and limited network knowledge.
---
paper_title: A Greedy Scanning Data Collection Strategy for Large-Scale Wireless Sensor Networks with a Mobile Sink

paper_content:

Mobile sink is widely used for data collection in wireless sensor networks. It can avoid ‘hot spot’ problems but energy consumption caused by multihop transmission is still inefficient in real-time application scenarios. In this paper, a greedy scanning data collection strategy (GSDCS) is proposed, and we focus on how to reduce routing energy consumption by shortening total length of routing paths. We propose that the mobile sink adjusts its trajectory dynamically according to the changes of network, instead of predetermined trajectory or random walk. Next, the mobile sink determines which area has more source nodes, then it moves toward this area. The benefit of GSDCS is that most source nodes are no longer needed to upload sensory data for long distances. Especially in event-driven application scenarios, when event area changes, the mobile sink could arrive at the new event area where most source nodes are located currently. Hence energy can be saved. Analytical and simulation results show that compared with existing work, our GSDCS has a better performance in specific application scenarios.
---
paper_title: A scalable code dissemination protocol in heterogeneous wireless sensor networks

paper_content:

Code dissemination is currently a major research issue in wireless sensor networks (WSNs). Many studies focus on code dissemination in homogeneous WSNs, mainly using a broadcast approach to solve this problem; few studies on code dissemination in heterogeneous WSNs. Furthermore, broadcasting cannot readily be used to solve the heterogenous WSN code dissemination problem directly, which is where we have focused our attention. We transformed this problem into a minimum non-leaf nodes (MNN) Steiner tree problem. We designed a scalable multicast protocol, named Heterogeneous Sensor Networks Scalable Reprogramming Protocol (HSR) to solve the MNN problem. HSR can build different multicast trees according to different nodes or code modules to disseminate different codes to them. HSR is able to approximate the MNN tree problem to a ratio of ln|R| (R is the set of all destinations) best known lowest bound. Therefore, the communication cost is significantly decreased and the total energy required by WSNs is reduced. We further designed two scalable schemes, special routing log and hops-restricted local broadcast, which compress the multicast tree information and deliver the multicast messages without loss. We also designed a 3-stage pipeline to speed up the transmission of packets, which alleviated interference and hidden terminal issues. We evaluated our design through comprehensive simulations and prototype implementations on Mica2 motes. Experimental results demonstrate that HSR outperforms previous protocols including the most recent studies on Sprinkler and uCast.
---
paper_title: Secure and Efficient Data Transmission for Cluster Based Wireless Sensor Networks

paper_content:

In the past few years secure transmission of data along with efficiency is a critical issue for wireless sensor networks (WSNs). Clustering is an effective and convenient way to enhance performance of the WSNs system. efficient data transmission is one of the most important issues for WSNs. Meanwhile, many WSNs are deployed in harsh, neglected and often adversarial physical environments for certain applications, such as military domains and sensing tasks with trustless surroundings In this project work, we study a secure transmission of data for cluster-based WSNs (CWSNs), where the clusters are formed dynamically and sporadically,periodically. We make use of two Secure and Efficient data Transmission (SET) protocols for CWSNs, called SET-IBS and SET-IBOOS, by means of the Identity- Based digital Signature (IBS) scheme and the Identity- Based Online/Offline digital Signature (IBOOS) scheme, correspondingly. In this paper, after rigorous practical and theoretical analysis, we have designed efficient protocols to provide defense against innumerable security attacks in the clustered wireless sensor deployment environments. We have tried to address challenges like communication and computation overhead along with security to increase the performance of the deployed sensors. The results show that the proposed protocols have better performance than the existing secure protocols for CWSNs, in terms of security overhead and energy consumption.  Most existing time synchronization schemes are vulnerable to several attacks.  Their low costs impede use of expensive tamper- resistant hardware. Existing solutions are provided for distributed WSNs, but not for CWSNs.It reduces the possibility of a node joining with a CH.Problem occurs when a node does not share a pairwise key with others in its preloaded key ring. In the proposed protocols pairing parameters are distributed and preloaded in all sensor nodes by the BS initially. It overcomes the key escrow problem of the ID-based cryptosystem and is efficient in communication and saves energy. And Solve the orphan node problem in the secure data transmission with asymmetric key management and is more feasible.
---
paper_title: A survey of simulators, emulators and testbeds for wireless sensor networks

paper_content:

Simulators, emulators and testbeds are invaluable tools for performance evaluation of algorithms and protocols in wireless sensor networks (WSNs). It is extremely difficult to choose an appropriate tool for performance testing without the horizontal and vertical analysis of existing tools. This paper presents a survey of thirty five performance evaluation tools for WSNs. Unlike most other studies, tools were selected based on their popularity, support for WSNs, active maintenance and the help available. On the horizontal dimension, prominent competitors at each stage were selected. For vertical analysis, tools for simulation, emulation and testbeds were categorized accordingly. We believe that this survey will aid researchers, application and tool developers while selecting an appropriate tool for their implementation. We have highlighted an open research issue to have an integrated tool that supports modeling, simulation, emulation and testbed implementation for algorithm validation, performance evaluation and proof-of-concept implementation in WSNs.
---
paper_title: Optimized secure and reliable distributed data storage scheme and performance evaluation in unattended WSNs

paper_content:

Unattended Wireless Sensor Networks (UWSNs), characterized by the absence of real-time communication between sensors and sinks, impose sensors to retain data till the next visit of a mobile sink to off-load their data. In such networks, if a sensor is compromised, data accumulated in the sensor are exposed to attackers. In addition, by holding the secret key of the compromised sensor, attackers can also learn post-compromise data accumulated by the sensor. Furthermore, once sensors stop working due to, for instance, node crash or battery depletion, all the accumulated data will be lost. In this paper, we propose a secure and reliable data distribution scheme that addresses these challenges. Detailed analysis shows that our scheme can provide forward secrecy, probabilistic backward secrecy and data reliability. To further improve probabilistic backward secrecy and data reliability, a constrained optimization data distribution scheme is also proposed. Detailed analysis and simulation results show the superiority of the proposed scheme in comparison with several existing schemes developed for UWSNs.
---
paper_title: Efficient clustering-based data aggregation techniques for wireless sensor networks

paper_content:

In wireless sensor network applications for surveillance and reconnaissance, large amounts of redundant sensing data are frequently generated. It is important to control these data with efficient data aggregation techniques to reduce energy consumption in the network. Several clustering methods were utilized in previous works to aggregate large amounts of data produced from sensors in target tracking applications (Park in A dissertation for Doctoral in North Carolina State University, 2006). However, such data aggregation algorithms show effectiveness only in restricted environments, while posing great problems when adapting to other various situations. To alleviate these problems, we propose two hybrid clustering based data aggregation mechanisms. The combined clustering-based data aggregation mechanism can apply multiple clustering techniques simultaneously in a single network depending on the network environment. The adaptive clustering-based data aggregation mechanism can adaptively choose a suitable clustering technique, depending on the status of the network. The proposed mechanisms can increase the data aggregation efficiency as well as improve energy efficiency and other important issues compared to previous works. Performance evaluation via mathematical analysis and simulation has been made to show the effectiveness of the proposed mechanisms.
---
paper_title: A confidential and DoS-resistant multi-hop code dissemination protocol for wireless sensor networks

paper_content:

Due to the open environment in which Wireless Sensor Networks (WSNs) are typically deployed, it is important to be able to authenticate transmitted data. In some applications it is also required that the data be kept confidential in spite of message interception. Authentication and confidentiality are typically implemented through cryptographic operations which may be expensive in power consumption, making a protocol with these features vulnerable to attack by an adversary who transmits forged data, so forcing nodes to waste energy in identifying it as invalid. Additionally, in multi-hop code dissemination protocols, a sensor node is required to broadcast its program image when requested by its neighbors. An adversary could repeatedly send spurious program image requests to its neighbors, making them exhaust their energy reserves. In this paper, we present a new approach to achieve confidentiality in multi-hop code dissemination. We propose countermeasures against both these types of attack. Our approach is based on Deluge, an open source, state-of-the-art code dissemination protocol for WSNs. We provide theoretical analysis and simulation/experimental results which show that our approach outperforms earlier attempts when a malicious code injector is present, as well as a performance evaluation of latency, energy consumption, dissemination rate, and other factors (Liu and Ning, November 2006).
---
paper_title: YA-LEACH: Yet another LEACH for wireless sensor networks

paper_content:

Wireless Sensor Networks (WSN) is an ever growing field owing to their extensive variety of applications. WSN have limited battery energy, consequently, an energy efficient routing protocol is of major concern. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the fundamental clustering protocols in WSN that provides high energy efficiency. Many protocols have been derived from LEACH which mostly address a single inherent challenge. Instead of focusing on a single parameter, combining independent techniques can compound gains in energy efficiency. This paper proposes Yet Another LEACH (YA-LEACH) which uses centralised cluster formation to ensure optimal clusters and allow Cluster Heads (CH) to extend operation into multiple rounds to achieve energy savings. Also, the proposed protocol will have an alternative (vice) CH that takes over when CH residual energy reaches a critically low level. The extended protocol was simulated on NS2 with results showing an improvement in network lifetime and overall data throughput.
---
paper_title: A Survey on Cryptography using Optimization algorithms in WSNs

paper_content:

Objective: The main intent of this research is to provide the secure communication in the wireless sensor networks. For that, several cryptography using optimization algorithms is investigated. Methods: In this manuscript, a survey has been made on the cryptography using optimization methods for secure communication. Several optimization algorithms are presented for cryptography to create the keys for the encryption. One of the suggested techniques is ant Colony Optimization Key Generation based image encryption method that is used to create the keys for encryption of text. The ant colony optimization method is used to generate the keys for encryption. Results: This survey comprehensively studies the issues in the cryptographic optimization methods for providing security in the wireless sensor networks. The performance of the different methods is compared with various parameters such as maximum number of keys stored, battery capacity, and runtime. The maximum number of keys store in the Ant Colony Optimization based key generation is 52, for Novel stream cipher cryptosystem 256, for fast and secure stream cipher 256, and also for RC4 256 keys. Conclusion: This survey investigates the several cryptographic optimization methods and provides the idea for efficient methods for future work.
---
paper_title: A survey and evaluation of free and open source simulators suitable for teaching courses in wireless sensor networks

paper_content:

This paper attempts to give a survey of some free software tools for wireless sensor networks. It targets teachers and students who might have the need for education in this area. As a first stage in creating this survey, a process of software collection is presented. First collection step is search through the Shanghai list for the first 50 universities. From these universities, available information about used software for wsn-related courses is collected. Additionally, other wsn software surveys are considered. Then, only free, open source and available software are kept, because they are the easiest for students to get it. Then evaluation based on topics coverage and software features is done. Topics are selected from IEEE Curriculum guidelines, while features give emphasis on practical usage from user aspect. Selected topics are embedded systems, computer networks, operating system and system resource management. Features used in the evaluation are support for GUI and command line, programming language learning overhead, ease of installation, extensibility, and platform portability. As a result, following software tools are described: TinyOS, Prowler, Riot, Castalia, Avrora, Shawn, TRMSim-WSN, and Shox.
---
paper_title: LEACH-MAC: a new cluster head selection algorithm for Wireless Sensor Networks

paper_content:

Battery power is a critical resource of Wireless Sensor Networks (WSNs). Therefore, an effective operation of WSNs depend upon the efficient use of its battery resource. Cluster based routing protocols are proven to be more energy efficient as compared to other routing protocols. Most of the cluster based routing protocols, especially Low Energy Adaptive Clustering Hierarchy (LEACH) protocol, follows Dynamic, Distributed and Randomized (DDR) algorithm for clustering. Due to the randomness present in clustering algorithms, number of cluster heads generated varies highly from the optimal count. In this paper, we present an approach which attempts to control the randomness present in LEACH's clustering algorithm. This approach makes the cluster head count stable. NS-2 simulation results show that proposed approach improved the First Node Death (FND) time and Last Node Death (LND) time by 21 and 24 % over LEACH, 10 and 20 % as compared to Advance LEACH (ALEACH) and 5 and 35 % over LEACH with Deterministic Cluster Head Selection (LEACH-DCHS) respectively.
---
paper_title: P-LEACH: Energy efficient routing protocol for Wireless Sensor Networks

paper_content:

Wireless Sensor Network (WSN) are of paramount significance since they are responsible for maintaining the routes in the network, data forwarding, and ensuring reliable multi-hop communication. The main requirement of a wireless sensor network is to prolong network energy efficiency and lifetime. Researchers have developed protocols Low Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information Systems (PEGASIS) for reducing energy consumption in the network. However, the existing routing protocols experience many shortcomings with respect to energy and power consumption. LEACH features the dynamicity but has limitations due to its cluster-based architecture, while PEGASIS overcomes the limitations of LEACH but lacks dynamicity. In this paper, we introduce PEGASIS-LEACH (P-LEACH), a near optimal cluster-based chain protocol that is an improvement over PEGASIS and LEACH both. This protocol uses an energy-efficient routing algorithm to transfer the data in WSN. To validate the energy effectiveness of P-LEACH, we simulate the performance using Network Simulator (NS2) and MATLAB.
---
paper_title: The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks

paper_content:

Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient data accumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However, in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment and authentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates a new security challenge: in the basic probabilistic and q-composite key predistribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network by deploying a replicated mobile sink preloaded with some compromised keys. This article describes a three-tier general framework that permits the use of any pairwise key predistribution scheme as its basic component. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pairwise key establishment between the sensors. To further reduce the damages caused by stationary access node replication attacks, we have strengthened the authentication mechanism between the sensor and the stationary access node in the proposed framework. Through detailed analysis, we show that our security framework has a higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme.
---
paper_title: Management and security of remote sensor networks in hazardous environments using over the air programming

paper_content:

Wireless Sensor Networks (WSNs) face many challenges including reliability, flexibility and security. When WSNs deployed in remote locations need to be reprogrammed, environmental conditions often make it impossible to physically retrieve them. Over the Air Programming (OAP) plays an important role in achieving this task. Additionally remote management of the WSN is crucial as it allows the user to monitor the download process. Cybersecurity of the WSN helps to ensure that the communication is properly authenticated. Several platform dependent protocols have been developed for OAP including Deluge and MOAP. Due to the restrictions of these platform-dependent protocols, any modifications to the hardware require modifications to the underlying protocol. For example, using OAP for iMote2 sensors requires porting Deluge from an existing hardware. We present the many challenges that we faced in making OAP possible on an iMote2 sensor network platform, including changes and upgrades to: file system management, Java toolbase and GUI implementation, reboot mechanism, robustness and boot loader. The performance of our OAP on the iMote2 platform is evaluated using a real sensor network along the completion time, overhead, and robustness dimensions.
---
paper_title: Improvement of Leach Protocol for Wireless Sensor Networks

paper_content:

LEACH is a hierarchical routing protocol special for WSN. Many researchers have proposed many improved algorithms based on LEACH, such as LEACH-C, LEACH-M and so on, and these algorithms have much improvements on efficiency of energy in certain extent. Within the lifetime of networks, based on the shortcomings of LEACH that each node is frequently repeated several times elected cluster-head and consumed some energy, this paper proposes a hierarchical routing improved algorithm based on the LEACH algorithm(i.e., LEACH-R). The simulation results show that the improved algorithm makes the energy distribution more balanced, and LEACH-R outperforms LEACH-M nearly 20%.
---
paper_title: Cluster-Head Election Algorithm for Wireless Sensor Networks Based on LEACH Protocol

paper_content:

Nowadays, extending the service life of the WSN and reducing energy consumption are very important in the research of sensor networks. This paper proposes LEACH-ICE (LEACH Inner Cluster Election) algorithm based on LEACH algorithm. By adjusting the threshold function of the node selected to be cluster head and communicating with base station when node is closer to the base station, LEACH-ICE elects new cluster head inside the cluster when the resident energy of the former cluster head is lower than standard in order to improve the clustering mechanism. Simulation results show that the algorithm achieves saving energy and extending the service life of the WSN.
---
paper_title: Security in Mobile Wireless Sensor Networks – A Survey

paper_content:

Thanks to recent advances in robotics, sensors and wireless communications, it is feasible to develop a variety of new architectures for Mobile Wireless Sensor Networks (MWSNs) that play an important role in various applications such as battlefield surveillance, harbor monitoring, etc. However, due to the dynamic of mobile network topology in MWSNs, many new security challenges have emerged. In this article, we give a survey on the state of the art technologies in security aspects of MWSNs. We review existing work that provides security in MWSNs, with an emphasis on data survival, forward secrecy, backward secrecy, authentication, and methods for sensor capture detection. Furthermore, in order to stimulate the exploration of new research areas, we point out a few open research topics that can be further pursued, and also shed light on these topics.
---
paper_title: A survey on clustering algorithms for wireless sensor networks

paper_content:

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
---
paper_title: Performance evaluation of selective and adaptive heads clustering algorithms over wireless sensor networks

paper_content:

Target tracking in wireless sensor networks can be considered as a milestone of a wide range of applications to permanently report, through network sensors, the positions of a mobile target to the base station during its move across a certain path. While tracking a mobile target, a lot of open challenges arise and need to be investigated and maintained which mainly include energy efficiency and tracking accuracy. In this paper, we propose three algorithms for tracking a mobile target in wireless sensor network utilizing cluster-based architecture, namely adaptive head, static head, and selective static head. Our goal is to achieve a promising tracking accuracy and energy efficiency by choosing the candidate sensor nodes nearby the target to participate in the tracking process while preserving the others in sleep state. Through Matlab simulation, we investigate the performance of the proposed algorithms in terms of energy consumption, tracking error, sensor density, as well as target speed. The results show that the adaptive head is the most efficient algorithm in terms of energy consumption while static and selective static heads algorithms are preferred as far as the tracking error is concerned especially when the target moves rapidly. Furthermore, the effectiveness of our proposed algorithms is verified through comparing their results with those obtained from previous algorithms.
---

Title: In-network data storage protocols for wireless sensor networks: A state-of-the-art survey

Section 1: Introduction
Description 1: Provide an introduction to wireless sensor networks (WSNs), including the problem statement and the significance of in-network storage in overcoming the limitations of local and external storage schemes.

Section 2: Requirements and challenges
Description 2: Discuss the requirements and challenges of in-network storage in WSNs, including reliability, efficiency, scalability, communication overhead, hotspot problem, memory overhead, and energy efficiency.

Section 3: WSN features
Description 3: Describe the specific features of WSNs that impact in-network storage, such as large scale, limited resources, low power, and dynamic network characteristics.

Section 4: Requirements of in-network storage
Description 4: List and explain the specific requirements for effective in-network storage, including reliability, efficiency, and scalability.

Section 5: Challenges of in-network storage
Description 5: Identify and elaborate on the key challenges faced by in-network storage schemes, considering aspects like reliability, communication overhead, hotspot problem, and memory overhead.

Section 6: In-network storage protocols for WSN
Description 6: Provide a comprehensive classification and overview of existing in-network storage protocols. Discuss the methodologies used, categorize the protocols into reactive and proactive schemes, and present the benefits and disadvantages of each protocol.

Section 7: Research methodology
Description 7: Detail the research methodology used to collect and analyze the surveyed articles on in-network storage protocols for WSNs.

Section 8: Overview results
Description 8: Summarize the results of the overview, including the classification of protocols, their advantages and drawbacks, and performance metrics used for evaluation.

Section 9: Opportunity and open issues for efficient in-network data storage in WSN
Description 9: Highlight the opportunities for future research and the open issues that need to be addressed to enhance the effectiveness of in-network storage in WSNs, such as improving cluster-based approaches, addressing security concerns, and evaluating protocols using realistic simulation models and testbeds.

Section 10: Conclusion
Description 10: Provide a summary of the survey, emphasizing the main findings, benefits, and challenges of in-network storage protocols, and suggest potential directions for future research.