A priority based routing protocol for wireless sensor networks

Recently, the demands on wireless sensor networks have switched from low traffic rate and static topology to more challenging requirements in order to meet the rapid expansion of WSN into various domain applications. This paper proposes a seamless cross layer solution that integrates network layer and medium access control to accommodate some of the new challenges. This new solution allows routing paths being generated dynamically to meet the requirement of potential mobile nodes. Higher data throughput and flow control are part of the new demands required to be addressed urgently. The proposed solution integrates a priority based MAC to handle congestion and packet loss problems which commonly happened in WSN when an occurrence of event spread into wide are

Adaptive Reliable Routing Protocol for Wireless Sensor Networks

International audienceMany Wireless Sensor Networks (WSN) applications success is contingent upon the reliable delivery of high-priority events from many scattered sensors to one or more sink nodes. In particular, WSN has to be self-adaptive and resilient to errors by providing efficient mechanisms for information distribution especially in the multi-hop scenario. To meet the stringent requirement of reliably transmitting data, we propose a lightweight and energy-efficient joint mechanism for packet loss recovery and route quality awareness in WSNs. In this protocol, we use the overhearing feature characterizing the wireless channels as an implicit acknowledgment (ACK) mechanism. In addition, the protocol allows for an adaptive selection of the routing path, based on a collective cooperation within neighborhood

RELIABLITY CONTROL USING LOSS RECOVERY RATIO IN WIRELESS SENSOR NETWORK

In Wireless Sensor Network congestion leads to the degradation of communication links that result in the decreased the reliability and waste of energy which one of the scarcest resources of sensor network. In cluster based environment each sensor senses the information and forwarded to its cluster head and cluster head will forward that data packet towards the sink. But the cluster heads are one hop from sink node so that they acts as intermediate nodes and hence there are more chances of congestion and leads to packet drop i.e. nothing but data loss. In my model I recover this data loss by using my loss recovery model where I attach the database to the cluster heads and those packets which are drop at cluster head due to congestion are push into the database and re-transmitted to the sink with high priority

TCP over low-power and lossy networks: tuning the segment size to minimize energy consumption

Low-power and Lossy Networks (LLNs), like wireless networks based upon the IEEE 802.15.4 standard, have strong energy constraints, and are moreover subject to frequent transmission errors, not only due to congestion but also to collisions and to radio channel conditions. This paper introduces an analytical model to compute the total energy consumption in an LLN due to the TCP protocol. The model allows us to highlight some tradeoffs as regards the choice of the TCP maximum segment size, of the Forward Error Correction (FEC) redundancy ratio, and of the number of link-layer retransmissions, in order to minimize the total energy consumption.Comment: TELECOM Bretagne Research Repor

Distributed Optimal Rate-Reliability-Lifetime Tradeoff in Wireless Sensor Networks

The transmission rate, delivery reliability and network lifetime are three fundamental but conflicting design objectives in energy-constrained wireless sensor networks. In this paper, we address the optimal rate-reliability-lifetime tradeoff with link capacity constraint, reliability constraint and energy constraint. By introducing the weight parameters, we combine the objectives at rate, reliability, and lifetime into a single objective to characterize the tradeoff among them. However, the optimization formulation of the rate-reliability-reliability tradeoff is neither separable nor convex. Through a series of transformations, a separable and convex problem is derived, and an efficient distributed Subgradient Dual Decomposition algorithm (SDD) is proposed. Numerical examples confirm its convergence. Also, numerical examples investigate the impact of weight parameters on the rate utility, reliability utility and network lifetime, which provide a guidance to properly set the value of weight parameters for a desired performance of WSNs according to the realistic application's requirements.Comment: 27 pages, 10 figure

Time constrained fault tolerance and management framework for k-connected distributed wireless sensor networks based on composite event detection

Wireless sensor nodes themselves are exceptionally complex systems where a variety of components interact in a complex way. In enterprise scenarios it becomes highly important to hide the details of the underlying sensor networks from the applications and to guarantee a minimum level of reliability of the system. One of the challenges faced to achieve this level of reliability is to overcome the failures frequently faced by sensor networks due to their tight integration with the environment. Failures can generate false information, which may trigger incorrect business processes, resulting in additional costs. Sensor networks are inherently fault prone due to the shared wireless communication medium. Thus, sensor nodes can lose synchrony and their programs can reach arbitrary states. Since on-site maintenance is not feasible, sensor network applications should be local and communication-efficient self-healing. Also, as per my knowledge, no such general framework exist that addresses all the fault issues one may encounter in a WSN, based on the extensive, exhaustive and comprehensive literature survey in the related areas of research. As one of the main goals of enterprise applications is to reduce the costs of business processes, a complete and more general Fault Tolerance and management framework for a general WSN, irrespective of the node types and deployment conditions is proposed which would help to mitigate the propagation of failures in a business environment, reduce the installation and maintenance costs and to gain deployment flexibility to allow for unobtrusive installation

Pump Slowly, Fetch Quickly (PSFQ): a Reliable Transport Protocol for Sensor Networks

Abstract—There is a growing need to support reliable data communications in sensor networks that are capable of supporting new applications, such as, assured delivery of high-priority events to sinks, reliable control and management of sensor networks, and remotely programming/retasking sensor nodes over-the-air. We present the design, implementation, and evaluation of pump slowly, fetch quickly (PSFQ), a simple, scalable, and robust transport protocol that is customizable to meet the needs of emerging reliable data applications in sensor networks. PSFQ represents a simple approach because it makes minimum assumptions about the underlying routing infrastructure, it is scalable and energyefficient because it supports minimum signaling, thereby reducing the communication cost for data reliability, and importantly, it is robust because it is responsive to a wide range of operational error conditions found in sensor network, allowing for the successful operation of the protocol even under highly error-prone conditions. The key idea that underpins the design of PSFQ is to distribute data from a source node by pacing data at a relatively slow speed (“pump slowly”), but allowing nodes that experience data loss to fetch (i.e., recover) any missing segments from their local immediate neighbors aggressively (“fetch quickly”). We present the design and implementation of PSFQ, and evaluate the protocol using the ns-2 simulator and an experimental wireless sensor testbed based on Berkeley motes and the TinyOS operating system. We show that PSFQ can outperform existing related techniques and is highly responsive to the various error conditions experienced in sensor networks. The source code for PSFQ is freely available for experimentation. Index Terms—Energy-efficient reliable transport protocols, error control, rate control, sensor networks. I

Dynamic Routing Framework for Wireless Sensor Networks

Numerous routing protocols have been proposed for wireless sensor networks. Each such protocol carries with it a set of assumptions about the trafï¬c type that it caters to, and hence has limited interoperability. Also, most protocols are validated over workloads which only form a fraction of an actual deployment’s requirement. Most real world and commercial deployments, however, would generate multiple trafï¬c types simultaneously throughout the lifetime of the network. For example, most deployments would want all of the following to happen concurrently from the network: periodic reliable sense and disseminate, real time streams, patched updates, network reprogramming, query-response dialogs, mission critical alerts and so on. Naturally, no one routing protocol can completely cater to all of a deployments requirements. This chapter presents a routing framework that captures the communication intent of an application by using just three bits. The traditional routing layer is replaced with a collection of routing components that can cater to various communication patterns. The framework dynamically switches routing component for every packet in question. Data structure requirements of component protocols are regularized, and core protocol features are distilled to build a highly composable collection of routing modules. This creates a framework for developing, testing, integrating, and validating protocols that are highly portable from one deployment to another. Communication patterns can be easily described to lower layer protocols using this framework. One such real world application scenario is also investigated: that of predictive maintenance (PdM). The requirements of a large scale PdM are used to generate a fairly complete and realistic trafï¬c workload to drive an evaluation of such a framework

Availability and End-to-end Reliability in Low Duty Cycle Multihop Wireless Sensor Networks

A wireless sensor network (WSN) is an ad-hoc technology that may even consist of thousands of nodes, which necessitates autonomic, self-organizing and multihop operations. A typical WSN node is battery powered, which makes the network lifetime the primary concern. The highest energy efficiency is achieved with low duty cycle operation, however, this alone is not enough. WSNs are deployed for different uses, each requiring acceptable Quality of Service (QoS). Due to the unique characteristics of WSNs, such as dynamic wireless multihop routing and resource constraints, the legacy QoS metrics are not feasible as such. We give a new definition to measure and implement QoS in low duty cycle WSNs, namely availability and reliability. Then, we analyze the effect of duty cycling for reaching the availability and reliability. The results are obtained by simulations with ZigBee and proprietary TUTWSN protocols. Based on the results, we also propose a data forwarding algorithm suitable for resource constrained WSNs that guarantees end-to-end reliability while adding a small overhead that is relative to the packet error rate (PER). The forwarding algorithm guarantees reliability up to 30% PER