In Wireless Sensor Networks (WSN), typically composed of nodes with resource constraints, leveraging efficient processes is crucial to enhance the network lifetime and, consequently, the sustainability in ultra-dense and heterogeneous environments, such as smart cities. Particularly, balancing the energy required to transport data efficiently across such dynamic environments poses significant challenges to routing protocol design and operation, being the trade-off of reducing data redundancy while achieving an acceptable delivery rate a fundamental research topic. In this way, this work proposes a new energy-aware epidemic protocol that uses the current state of the network energy to create a dynamic distribution topology by self-adjusting each node forwarding behavior as eager or lazy according to the local residual battery. Simulated evaluations demonstrate its efficiency in energy consumption, delivery rate, and reduced computational burden when compared with classical gossip protocols as well as with a directional protocol.
Conserving power in mobile ad-hoc and sensor networks is a big challenge. Most of the nodes in these networks, in general, are battery powered, therefore, an efficient power saving protocol is required to extend the lifetime of such networks. A lot of work has been done and several protocols have been proposed to address this problem. Gossip based protocols, which are based on the results of percolation theory, significantly reduce power consumption with very little implementation overhead. However, not much work has been done to make gossiping battery aware. In this paper we introduce a simpl…
Wireless sensor networks (WSN) have recently received an increasing interest. They are now expected to be deployed for long periods of time, thus requiring software updates. Updating the software code automatically on a huge number of sensors is a tremendous task, as ''by hand'' updates can obviously not be considered, especially when all participating sensors are embedded on mobile entities. In this paper, we investigate an approach to automatically update software in mobile sensor-based application when no localization mechanism is available. We leverage the peer-to-peer cooperation paradigm…
Wireless sensor networks require communication protocols for efficiently propagating data in a distributed fashion. The Trickle algorithm is a popular protocol serving as the basis for many of the current standard communication protocols. In this paper we develop a mathematical model describing how Trickle propagates new data across a network consisting of nodes placed on a line. The model is analyzed and asymptotic results on the hop count and end-to-end delay distributions in terms of the Trickle parameters and network density are given. Additionally, we show that by only a small modificatio…
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing …
Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to…
Wireless Sensor Networks (WSNs) generate massive amount of live data and events sensed through dispersedly deployed tiny sensors. This generated data needed to be disseminate to the sink with slight consumption of network resources. One of the ways to efficiently transmit this bulk data is gossiping. An important consideration in gossip-based dissemination protocols is to keep routing table up to date. Considering the inherent resource constrained nature of adhoc wireless sensor networks, we propose a gossip based protocol that consumes little resources. Our proposed scheme aims to keep the ro…
We consider gossiping in a fully-connected wireless network consisting of $n$ nodes. The network receives Poisson updates from a source, which generates new information. The nodes gossip their available information with the neighboring nodes to maintain network timeliness. In this work, we propose two gossiping schemes, one semi-distributed and the other one fully-distributed. In the semi-distributed scheme, the freshest nodes use pilot signals to interact with the network and gossip with the full available update rate $B$. In the fully-distributed scheme, each node gossips for a fixed amount …
We introduce models of gossip based communication networks in which each node is simultaneously a sensor, a relay and a user of information. We model the status of ages of information between nodes as a discrete time Markov chain. In this setting a gossip transmission policy is a decision made at each node regarding what type of information to relay at any given time (if any). When transmission policies are based on random decisions, we are able to analyze the age of information in certain illustrative structured examples either by means of an explicit analysis, an algorithm or asymptotic appr…
Neighbor discovery (ND) is a key initial step of network configuration and prerequisite of vehicular ad hoc network (VANET). However, the convergence efficiency of ND is facing the requirements of multi-vehicle fast networking of VANET with frequent topology changes. This paper proposes gossip-based information dissemination and sensing information assisted ND with MPR (GSIM-ND) algorithm for VANET. GSIM-ND algorithm leverages efficient gossip-based information dissemination in the case of multi-packet reception (MPR). Besides, through multi-target detection function of multiple sensors instal…
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 …
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 …
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.
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…
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…
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…
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…
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.
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…
Designing distributed, fast and reliable wireless consensus protocols is instrumental in enabling mission-critical decentralized systems, such as robotic networks in the industrial Internet of Things (IIoT), drone swarms in rescue missions, and so forth. However, chasing both low-latency and reliability of consensus protocols is a challenging task. The problem is aggravated under wireless connectivity that may be slower and less reliable, compared to wired connections. To tackle this issue, we investigate fundamental relationships between consensus latency and reliability through the lens of w…
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 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 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 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.
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimize maintenance and maximize overall system performance. We investigate a new routing algorithm that uses diffusion in order to achieve relatively even power dissipation throughout a wireless sensor network by making good local decisions. We leverage from concepts of peer-to-peer networks in which the system acts completely decentralized and all …
