To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside to aggregate data. In this paper, an adaptive energy aware data aggregation tree (AEDT) is proposed. The proposed tree uses the maximum energy available node as the data aggregator node. The tree incorporates sleep and awake technology where the communicating node and the parent node are only in awake state rest all the nodes go to sleep state saving the network energy and enhancing the network lifetime. When the traffic load crosses the threshold value, then the packets are accepted adaptively according to the communication capacity of the parent node. The proposed tree maintains a memory table which stores the value of each selected path. Path selection is based on shortest path algorithm where the node with highest available energy is always selected as forwarding node. By simulation results, we show that our proposed tree enhances network lifetime minimizes energy consumption and achieves good delivery ratio with reduced delay.
In the widely used 802.11 standard, the so called performance anomaly is a well known issue. Several works have tried to solve this problem by introducing mechanisms such as packet fragmentation, backoff adaptation, or packet aggregation during a fixed time interval. In this paper, we propose a novel approach solving the performance anomaly problem by packet aggregation using a dynamic time interval, which depends on the busy time of the wireless medium. Our solution differs from other proposition in the literature because of this dynamic time interval, which allows increasing fairness, reacti…
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption, minimizing the dista…
In this paper we suggest a novel idea to improve the Throughput of a rapidly chang- ing WiFi channel by exploiting the standard aggregation schemes in IEEE 802.11ac networks, and by transmitting several copies of the same MPDU(s) in a single trans- mission attempt. We test this idea in scenarios where Link Adaptation is not used and show a significant improvement, in the order of tens of percents, in the achieved Throughput. Keywords
Recently, many researchers have studied efficiently gathering data in wireless sensor networks to minimize the total energy consumption when a fixed number of data are allowed to be aggregated into one packet. However, minimizing the total energy consumption does not imply the network lifetime is maximized. In this paper, we study the problem of scheduling data aggregation trees working for different time periods to maximize the network lifetime when a fixed number of data are allowed to be aggregated into one packet. In addition, we propose a heuristic to balance the lifetime of nodes in data…
Data aggregation is a fundamental technique in wireless sensor networks (WSNs) in which sensory data collected by intermediate nodes is merged by in-network computation using maximum, average, or sum functions. Because sensors run on batteries, energy conservation is a critical issue. Duty cycle is a well-known energy-saving mechanism in WSNs, but it causes data aggregation latency to increase. As a result, the use of multichannel technology allows more sensor nodes to send data simultaneously, reducing data aggregation latency. We investigate the minimum latency aggregation scheduling problem…
In this paper, we propose a novel energy efficient environment monitoring scheme for wireless sensor networks, based on data mining formulation. The proposed adapting routing scheme for sensors for achieving energy efficiency from temperature wireless sensor network data set. The experimental validation of the proposed approach using publicly available Intel Berkeley lab Wireless Sensor Network dataset shows that it is possible to achieve energy efficient environment monitoring for wireless sensor networks, with a trade-off between accuracy and life time extension factor of sensors, using the …
Energy preservation is one of the most important challenges in wireless sensor networks. In most applications, sensor networks consist of hundreds or thousands nodes that are dispersed in a wide field. Hierarchical architectures and data aggregation methods are increasingly gaining more popularity in such large-scale networks. In this paper, we propose a novel adaptive Energy-Efficient Multi-layered Architecture (EEMA) protocol for large-scale sensor networks, wherein both hierarchical architecture and data aggregation are efficiently utilized. EEMA divides the network into some layers as well…
This paper presents Area coverage of homogenous wireless sensor network using computational geometry. The concepts related to both coverage wireless sensor network and computational geometry have been introduced. Then, the problem has been formulated. After that, current proposed algorithms of hole detection and healing have been investigated and discussed. This survey has two aims: firstly, to explore effectiveness of computational geometry to deal with wireless sensor network coverage problems. Secondly, it will direct scholars who want to enable computational geometry solutions in coverage …
In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor networ…
This paper is about the wireless sensor network in environmental monitoring applications. A Wireless Sensor Network consists of many sensor nodes and a base station. The number and type of sensor nodes and the design protocols for any wireless sensor network is application specific. The sensor data in this application may be light intensity, temperature, pressure, humidity and their variations .Clustering and routing are the two areas which are given more attention in this paper.
-This paper presents an efficient approach to data collection in mobile wireless sensor networks, with the specific application of sensing in bike races. Recent sensor technology permits to track GPS position of each bike. Because of the inherent correlation between bike positions in a bike race, a simple GPS log is inefficient. The idea presented in this work is to aggregate GPS data at sensors using compressive sensing techniques. We enforce, in addition to signal sparsity, a spatial prior on biker motion because of the group behaviour (peloton) in bike races. The spatial prior is modeled by…
In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A definition of the life time of the network based on three different criteria is introduced; percentage of available power to total power, percentage of alive sensors to total sensors, and percentage of alive sink sensors to total sink sensors. A Matlab based simulator is developed for the introduced model. A number of…
In this research paper, the problems dealing with sensor network architecture, sensor fusion are addressed. Time/Computationally optimal network architectures are investigated. Some novel ideas on sensor fusion are proposed.
Wireless Sensor Network (WSN) is an emerging technology that shows great promise for various futuristic applications both for mass public and military. The sensing technology combined with processing power and wireless communication makes it lucrative for being exploited in abundance in future. The inclusion of wireless communication technology also incurs various types of security threats. The intent of this paper is to investigate the security related issues and challenges in wireless sensor networks. We identify the security threats, review proposed security mechanisms for wireless sensor n…
Clustering is an important concept to reduce the energy consumption and prolonging the life of a wireless sensor network. In heterogeneous wireless sensor network some of the nodes are equipped with more energy than the other nodes. Many routing algorithms are proposed for heterogeneous wireless sensor network. Stable Election Protocol (SEP) is one of the important protocol in this category. In this research paper a novel energy efficient distance based cluster protocol (DBCP) is proposed for single hop heterogeneous wireless sensor network to increase the life and energy efficiency of a senso…
One of the most fundamental tasks in sensor networks is the computation of a (compressible) aggregation function of the input measurements. What rate of computation can be maintained, by properly choosing the aggregation tree, the TDMA schedule of the tree edges, and the transmission powers? This can be viewed as the convergecast capacity of a wireless network. We show here that the optimal rate is effectively a constant. This holds even in \emph{arbitrary} networks, under the physical model of interference. This compares with previous bounds that are logarithmic (e.g., $Ω(1/\log n)$). Namely,…
This paper collects heuristics of Go Game and employs them to achieve coverage of dense wireless sensor networks. In this paper, we propose an algorithm based on Go heuristics and validate it. Investigations show that it is very promising and could be seen as a good optimization. Keywords: Go Heuristics, Wireless Sensor Networks, Coverage, Density
In this paper, we analyze the bit-error-rate (BER) performance of wireless sensor networks. A wireless sensor node with a single transmitter antenna and multiple receiver antennas is considered here. We consider M (M greater or equal ro 1) receiver antennas to mitigate channel fading effects. BER performance is analyzed in the presence of a co-channel interference source. Wireless channel is assumed to follow independently Nakagami fading for the wireless sensor network and Rayleigh fading for the interference signal. Based on the derived analytical expressions, the effects of different fading…
In this paper we propose wireless sensor network architecture with layered protocols, targeting different aspects of the awareness requirements in wireless sensor networks. Under such a unified framework, we pay special attention to the most important awareness issues in wireless sensor networks: namely dynamic awareness, energy awareness and spatiotemporal awareness. First, we propose the spatiotemporal aware routing protocol for wireless sensor networks, which maintains a constant delivery speed for soft real-time communication. Second, we introduce the time-energy aware aggregation scheme, …
In this paper, a family of ant colony algorithms called DAACA for data aggregation has been presented which contains three phases: the initialization, packet transmission and operations on pheromones. After initialization, each node estimates the remaining energy and the amount of pheromones to compute the probabilities used for dynamically selecting the next hop. After certain rounds of transmissions, the pheromones adjustment is performed periodically, which combines the advantages of both global and local pheromones adjustment for evaporating or depositing pheromones. Four different pheromo…
Reliable transport protocols such as TCP are tuned to perform well in traditional networks where packet losses occur mostly because of congestion. Many applications of wireless sensor networks are useful only when connected to an external network. Previous research on transport layer protocols for sensor networks has focused on designing protocols specifically targeted for sensor networks. The deployment of TCP/IP in sensor networks would, however, enable direct connection between the sensor network and external TCP/IP networks. In this paper we focus on the performance of TCP in the context o…
In this article we revisit Wireless Sensor Networks from a contemporary perspective, after the surge of the Internet of Things. First, we analyze the evolution of distributed monitoring applications, which we consider inherited from the early idea of collaborative sensor networks. Second, we evaluate, within the current context of networked objects, the level of adoption of low-power multi-hop wireless, a technology pivotal to the Wireless Sensor Network paradigm. This article assesses the transformation of this technology in its integration into the Internet of Things, identifying outdated re…
An energy cooperation policy for energy harvesting wireless sensor networks (WSNs) with wireless power transfer is proposed in this paper to balance the energy at each sensor node and increase the total energy utilization ratio of the whole WSNs. Considering the unbalanced spatio-temporal properties of the energy supply across the deployment terrain of energy harvesting WSNs and the dynamic traffic load at each sensor node, the energy cooperation problem among sensor nodes is decomposed into two steps: the local energy storage at each sensor node based on its traffic load to meet its own needs…
Energy Conservation and prolonging the life of Wireless Sensor Network is one of the major issues in the wireless sensor network as sensor nodes are highly energy constrained devices. Many routing protocols have been proposed for sensor network, especially cluster based routing protocols. Cluster based routing protocols are best known for its energy efficiency, network stability and for increasing the life time of the sensor network. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the fundamental protocols in this class. In this research paper we propose a new energy efficient clust…
Routing in Wireless Sensor Network (WSN) aims to interconnect sensor nodes via single or multi-hop paths. The routes are established to forward data packets from sensor nodes to the sink. Establishing a single path to report each data packet results in increasing energy consumption in WSN, hence, data aggregation routing is used to combine data packets and consequently reduce the number of transmissions. This reduces the routing overhead by eliminating redundant and meaningless data. There are two models for data aggregation routing in WSN: mobile agent and client/server. This paper describes …
In this paper a scheme for handoff and connectivity, based on wireless sensor nodetechniques is proposed. Scenes are created in Qualnet and simulated for a simple case. Results are discussed.
Wireless sensor networks have significant potential to increase our ability to view and control the physical environment, but the issue of power consumption in these networks has become an important parameter in their reliability and since in many applications of networks. Wireless sensor needs to guarantee end-to-end quality parameters, support for quality of service in these networks is of utmost importance. In wireless sensor networks, one of the most important issues is the lifetime of each network, which is directly related to the energy consumption of the network sensors. Increasing netw…
Localization is widely used in Wireless Sensor Networks (WSNs) to identify the current location of the sensor odes. A WSN consist of thousands of nodes that make the installation of GPS on each sensor node expensive and moreover GPS may not provide exact localization results in an indoor environment. Manually configuring location reference on each sensor node is also not possible for dense network. This gives rise to a problem where the sensor nodes must identify its current location without using any special hardware like GPS and without the help of manual configuration. In this paper we revi…
To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper, we propose a novel technique to create one such tree, which preserves the energy and minimizes the lifetime of event sources while they are constantly transmitting for data aggregation in future WSNs. We use the term Decentralized Lifetime-Minimizing Tree (DLMT) to denote this tree. DLMT features in nodes with higher energy tend to be chosen as data aggre…
In this paper, we present the performance of different broadcast schemes for multihop sensor networks based on mathematical modeling. In near future many applications will demand multicast (Broadcast) communication feature from the sensor networks. This broadcast feature does not use virtual carrier sensing but relies on physical carrier sensing to reduce collision. For this paper, we analyze the different broadcast schemes for multihop wireless sensor networks and also calculated the achievable throughput.
Wireless Sensor networks are dense networks of small, low-cost sensors, which collect and disseminate environmental data and thus facilitate monitoring and controlling of physical environment from remote locations with better accuracy. The major challenge is to achieve energy efficiency during the communication among the nodes. This paper aims at proposing a solution to schedule the node's activities to reduce the energy consumption. We propose the construction of a decentralized lifetime maximizing tree within clusters. We aim at minimizing the distance of transmission with minimization of en…
Sensor networks can nowadays deliver 99.9% of their data with duty cycles below 1%. This remarkable performance is, however, dependent on some important underlying assumptions: low traffic rates, medium size densities and static nodes. In this thesis, we investigate the performance of these same resource-constrained devices, but under scenarios that present extreme conditions: high traffic rates, high densities and mobility: the so-called Extreme Wireless Sensor Networks (EWSNs).
Wireless sensor networks are finally becoming a reality. In this paper, we present a scalable architecture for using wireless sensor networks in combination with wireless Ethernet networks to provide a complete end-to-end solution to narrow the gap between the low-level information and context awareness. We developed and implemented a complete proximity detector in order to give a wearable computer, such as a PDA, location context. Since location is only one element of contextawareness, we pursued utilizing photo sensors and temperature sensors in learning as much as possible about the environ…
Battery is a major hardware component of wireless sensor networks. Most of them have no power supply and are generally deployed for a long time. Researches have been done on battery physical model and their adaptation for sensors. We present an implementation on a real sensor operating system and how architectural constraints have been assumed. Experiments have been made in order to test the impact of some parameter, as the application throughput, on the battery lifetime.
Compressive sensing (CS) has been widely used for the data gathering in wireless sensor networks for the purpose of reducing the communication overhead recent years. In this paper, we first show that with simple modification, 1-bit compressive sensing can also been used for the data gathering in wireless sensor networks to further reduce the communication overhead. We also propose a novel blind 1-bit CS reconstruction algorithm which outperforms other state of the art blind 1-bit CS reconstruction algorithms. Experimental results on real sensor datasets demonstrate the efficiency of our method…
This paper introduces the concept of rate privacy in the context of wireless sensor networks. Our discussion reveals that the concept indeed is of a great importance for the privacy preservation of such networks. As a result, we propose a buffering scheme to protect the rate from adversaries. Simulation results verify the applicability of our approach.
Routing is one of the critical and ongoing challenges in Wireless Sensor Networks. The main challenge has always been to have a routing protocol that reduces the communication overhead, hence saving the energy of the sensors in the network. Hierarchical routing protocols are known to be the most energy-efficient routing protocols for Wireless Sensor Networks. In this paper, a more generalized hierarchical routing protocol is introduced for Wireless Sensor Network, which is based on tree data structures. The clustering in the proposed protocol has the format of a general tree, which is construc…
Wireless Sensor Networks (WSNs) are used to perform distributed sensing in various fields, such as health, military, home etc. In WSNs, sensor nodes should communicate among themselves and do distributed computation over the sensed values to identify the occurrence of an event. This paper assumes the no memory computation model for sensor nodes, i.e. the sensor nodes only have two registers. This paper presents an optimal architecture for the distributed computation in WSN and also claims that this architecture is the optimal for the described computation model.
The main challenge in wireless sensor network is to improve the fault tolerance of each node and also provide an energy efficient fast data routing service. In this paper we propose an energy efficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant multipath routing scheme for energy efficient wireless sensor network (FTMRS).The FTMRS is based on multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic…
A wireless sensor network comprises of small sensor nodes each of which consists of a processing device, small amount of memory, battery and radio transceiver for communication. The sensor nodes are autonomous and spatially distributed in an area of investigation. Certain applications and protocols of wireless sensor networks require that the sensor nodes should be aware of their position relative to the sensor network. For it to be significant and to be of value, the data such as temperature, humidity and pressure, gathered by sensor nodes must be ascribed to the relative position from where …
In wireless multi-hop networks, the instability of the wireless links leads to unstable networking. Even in the newly designed Software-Defined Wireless Sensor Networks (SDWSN), similar problems exist. To further improve the stability of SDWSN, we introduce a Link Quality (LQ) prediction model into the SDWSN architecture. The prediction model is used to improve the stability between neighbor nodes, and thus the stability of wireless multi-hop routes. Simulation results show that the LQ prediction model can make reasonable corrections to the reality wireless link model, which can well address t…
This paper aims to propose a significant way of remote access and real time monitoring of a particular geographic area by integrating wireless sensor clouds with existing Telecom infrastructure and applications built around them through a gateway. This utility is very potent for environment monitoring in harsh and inaccessible places like mines, nuclear reactors, etc. We demonstrate a scaled down version of multi-hop network of wireless sensor nodes and its integration with existing telecom network infrastructure via a gateway.
Now days, interests in the application of Wireless Body Area Network (WBAN) have grown considerably. A number of tiny wireless sensors, strategically placed on the human body, create a wireless body area network that can monitor various vital signs, providing real-time feedback to the user and medical personnel. This communication needs to be energy efficient and highly reliable while keeping delays low. In this paper we present hardware and software architecture for BAN and also we offer reliable communication and data aggregation.
Wireless Sensor Networks (WSNs) are groups of spatially distributed and dedicated autonomous sensors for monitoring (and recording) the physical conditions of the environment (and organizing the collected data at a central location). They have been a topic of interest due to their versatility and diverse capabilities despite having simple sensors measuring local quantities such as temperature, pH, or pressure. We delve into understanding how such networks can be utilized for localization, and propose a technique for improving conditions of living for animals and humans on the IIT Bombay campus…
This chapter discusses the need of security and privacy protection mechanisms in aggregation protocols used in wireless sensor networks (WSN). It presents a comprehensive state of the art discussion on the various privacy protection mechanisms used in WSNs and particularly focuses on the CPDA protocols proposed by He et al. (INFOCOM 2007). It identifies a security vulnerability in the CPDA protocol and proposes a mechanism to plug that vulnerability. To demonstrate the need of security in aggregation process, the chapter further presents various threats in WSN aggregation mechanisms. A large n…
This paper examines the use of Wireless Sensor Networks interfaced with light fittings to allow for daylight substitution techniques to reduce energy usage in existing buildings. This creates a wire free system for existing buildings with minimal disruption and cost.
This paper deals with the coverage problem of wireless sensor network. We use the density based clustering technique - OPTICS to cover a target region with less number of sensor nodes. OPTICS works well to identify the outliers, core points and it obtains the denser regions. We define a level of acceptance to find next appropriate sensor in the region. We eliminate overlapped area and obtain a decision tree to minimally cover up the target region.
This paper addresses an overview of the wireless sensor networks. It is shown that MEMS/NEMS technologies and SIP concept are well suited for advanced architectures. It is also shown analog architectures have to be compatible with digital signal techniques to develop smart network of microsystem.
Considering an energy harvesting sensor network, the overall probability of event loss is derived. Based on this result, a variety of harvesting resource allocation schemes (sizing the energy storages and the harvesting devices, under a total cost constraint) are provided. Their performances are verified and compared through simulations.
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
Clustering in wireless sensor networks (WSNs) is an important technique to ease topology management and routing. Clustering provides an effective method for prolonging lifetime of a WSN. This paper proposes energy efficient multi-level clustering schemes for wireless sensor networks. Wireless sensor nodes are extremely energy constrained with a limited transmission range. Due to large area of deployment, the network needs to have a multi-level clustering protocol that will enable far-off nodes to communicate with the base station. Simulation is used to analyze the proposed protocols and compar…
A Wireless Sensor Network (WSN) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, pressure,etc. In sensing applications, data packets are flowing from sensor nodes to base station. In data collection processes, bottom up approach is used. In bottom up approach, all nodes send their sensed data packets to base station directly. In this approach will lead to increased delay, which will lead to higher energy consumption. To reduce the energy consumption of sensor nodes,Clustering Algorithm and Low-Energy Adaptive Clus…
In wireless sensor networks, an important issue of Geographic Routing is local minimum problem, which is caused by hole that blocks the greedy forwarding process. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole.
The main focus of this article is to achieve prolonged network lifetime with overall energy efficiency in wireless sensor networks through controlled utilization of limited energy. Major percentage of energy in wireless sensor network is consumed during routing from source to destination, retransmission of data on packet loss. For improvement, cross layered algorithm is proposed for routing and retransmission scheme. Simulation and results shows that this approach can save the overall energy consumption
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance, congestion control are the important metrics that affect the performance of wireless sensor network. As many approaches were proposed to increase the performance of a wireless sensor network among them clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above metrics in wireless sensor network where nodes are densely deployed in a given network area. As th…
Energy Efficiency in wireless sensor networks is an important topic in which the nodes rely on battery power, and efficient energy usage is a key issue for sensitive applications that require long working times. This stimulates many scientists at all levels of communication protocols Medium Access Control (MAC) who control the use of the wireless transmitter and receiver unit to create new protocols. Many protocols were suggested that primarily take energy efficiency as the primary objective of sustaining the function of the network for as long as possible into account with different objective…
There is now an increased understanding of the need for realistic link layer models in the wireless sensor networks. In this paper, we have used mathematical techniques from communication theory to model and analyze low power wireless links. Our work provides theoretical models for the link layer showing how Packet Reception Rate vary with Signal to Noise Ratio and distance for different modulation schemes and a comparison between MICA2 and TinyNode in terms of PRR.
Today 2.4 GHz based wireless sensor networks are increasing at a tremendous pace, and are seen in widespread applications. Product innovation and support by many vendors in 2.4 GHz makes it a preferred choice, but the networks are prone to issues like interference, and range issues. On the other hand, the less popular 868 MHz in the ISM band has not seen significant usage. In this paper we explore the use of 868 MHz channel to implement a wireless sensor network, and study the efficacy of this channel
In this paper we describe three methods for localizing a wireless sensor network node, using anchor nodes in its neighbourhood, when there is an error in distance estimation present. We use the intersection points of the circles formed with the estimated distances from each anchors and we apply different methods to form clusters. We then use the cluster points to calculate the final position.
