Conference Paper

Energy Conservation with Network Coding for Wireless Sensor Networks with Multiple Crossed Information Flows

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

The theory of network coding is hardly ever used and cannot be mapped to general wireless sensor network (WSN) topologies without careful consideration of technology constraints. Severe energy constraints and low bandwidth are faced by platforms of low computational power. We show how network coding methods can be implemented with low computational power. We discuss extensive experimentation in simulation of scalability for arbitrarily large networks. It is configured according to the results from mote hardware measurements. The testbed implementation and the mote software implementation is kept completely generic. All phases, including the initialization, are implemented and work for mesh networks of any size without modification. Our work explains important considerations for applying network coding to WSNs. The gain from applying the method over ad-hoc on-demand (AODV) like routing closely approaches the optimum value of 2. Thereby WSN resource constraints are relaxed and network lifetime is prolonged.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

Chapter
Resource aware sensor grid middleware is subject to optimization of services and performance on one side and has to deal with non-functional requirements and hardware constraints on the other side. Implementing different applications and systems on different types of hardware and architectures demands for sophisticated techniques for modeling and testing. This chapter highlights common misconceptions in design, simulation, test and measurement that need to be overcome or at least be considered for successfully building a system. Rules of thumb are given for how to design sensor grids such that they can easily be simulated and tested. Errors that are to be expected are highlighted. Several practical issues will be discussed using real world examples. A sensor grid utilizing network coding and duty cycling services serves as an example as well as a multi-application middleware and a localization system. The approach shows how to implement performance optimizations and resource awareness with a minimum of negative impact from mutual side effects. This type of view on system development of sensor grids has not been looked at before in detail. Therefore the reader will get valuable insights to state of the art and novel techniques of networking and energy management for sensor grids, power profile optimization, simulation and measurement and on how to translate designs from one stage to another.
Article
Wireless sensor network WSN nodes called motes are small wireless embedded devices. They suffer from limitations of their power supplies and available bandwidth as well as in their memory and computational power. As a promising approach, network coding NC provides means of relaxing the combined problem of limited supplies and bandwidth. We present experimentation in modelling, simulation and measurement of a novel approach for robust scalable NC in dynamic environments. It is compared to routing in mesh structured, low data rate WSNs. For keeping it from being purely academic, we discuss the scalable concept's applicability to different applications, systems and topologies. We evaluate its energy conservation capabilities for Mica2 motes and show savings of up to 50%. This paper also highlights trade-offs and solutions that are applicable to other state-of-the-art systems as well.
Conference Paper
Wireless Sensor Networks (WSNs) have been deployed for the purpose of structural health monitoring (SHM) of bridges. SHM applications can potentially produce a very high volume of sensing data, which consumes much transmission power and thus decreases the lifetime of battery-run networks. We employ the network-coding technique to improve network efficiency and prolong its lifetime. By increasing the transmission power, we change the node connectivity and control the number of nodes that can overhear transmitted messages so as to hopefully realize the capacity gain by use of network coding. We propose here to control transmission power as a means to adjust the number of nodes that can overhear a message transmission by a neighboring node. However, too much overhearing by high power transmission consumes too much limited battery energy. We investigate the interplay between transmission power and network coding operations. We show that our solution reduces the overall volume of data transfer, thus leading to significant energy savings and prolonged network lifetime. We present the mathematical analysis of our proposed algorithm. By simulation, we study the tradeoffs between overhearing and power consumption for the network-coding scheme. Specifically, we consider a bridge with fixed length and sensor nodes are deployed at a uniform distance along one or both sides of the bridge. Our numerical results reveal that appropriate choices of transmission power can achieve the optimal extent of overhearing for network coding gain, while minimizing the overall power consumption for the WSN.
Conference Paper
Large scale deployments of small, wireless, networked, embedded systems demand for cost reduction in development and maintenance. Most often, this translates into the need for reliable methods for energy conservation as it is the case for wireless sensor networks (WSNs). Our work considers energy harvesting system (EHS)-enhanced WSN technology which is the state-of-the-art technology for perpetual systems supplied from ambient environmental energy. Therefore several aspects have been considered in literature so far: EHS design, energy prediction modeling, harvesting aware media access control (MAC) and routing and finally power management. This paper postulates that identifying and optimizing these aspects on their own does not necessarily lead to feasible solutions. We take a cross-layer perspective and provide a networking protocol for implicit or explicit EHS policy negotiation under the constraint of two prototypical communication patterns. The methods presented show how to combine energy aware routing or conservation from network coding with EHS power management policies under the constraint of state-of-the-art MAC. Evaluation of different end-user communication patterns lets the reader interpret the results for an application at hand.
Article
Full-text available
The authors propose two practical power- and bandwidth-efficient systems based on amplify-and-forward and decode-and-forward schemes to address the problem of information exchange via a relay. The key idea is to channel encode each source's message by using a high-performance non-binary turbo code based on partial unit memory codes to enhance the bit-error-rate performance, then reduce the energy consumption and increase spectrum efficiency by using network coding (NC) to combine individual nodes' messages at the relay before forwarding to the destination. Two simple and low complexity physical layer NC schemes are proposed based on combinations of received source messages at the relay. The authors also present the theoretical limits and numerical analysis of the proposed schemes. Simulation results under additive white Gaussian noise confirm that the proposed schemes achieve significant bandwidth savings and fewer transmissions over the benchmark systems which do not resort to NC. Theoretical limits for capacity and signal-to-noise ratio behaviour for the proposed schemes are derived. This study also proposes a cooperative strategy that is useful when insufficient combined messages are received at a node to recover the desired source messages, thus enabling the system to retrieve all packets with significantly fewer retransmission request messages.
Article
Wireless sensor network (WSN) motes are resource constrained devices. Especially, bandwidth and energy are scarce resources. Therefore, lots of effort is put into the optimization of low-power networking protocols. While network control overhead is an issue for many to most of such protocols, we present an approach that is virtually overheadfree. We introduce the implementation of an autonomous network coding implementation that can be implemented for existing applications and added over existing routing mechanisms with no need to change the application or networking protocols. We discuss and carefully evaluate the approach for applicability and gain according to the most prominent optimization metrics for WSN networking protocols. Especially, we consider the comparison of autonomous network coding to state-of-the-art collection protocols and multipath routing. The completely autonomously acting network coding plug-in implementation is profiled to conserve up to 29% of the messages that need to be sent locally without the need for centralized network control.
Article
Large scale deployments of small, wireless, networked, embedded systems demand for cost reduction in development and maintenance. Most often, this translates into the need for reliable methods for energy conservation as it is the case for wireless sensor networks (WSNs). Our work considers energy harvesting system (EHS)enhanced WSN technology which is the state-of-the-art technology for perpetual systems supplied from ambient environmental energy. Therefore several aspects have been considered in literature so far: EHS design, energy prediction modeling, harvesting aware media access control (MAC) and routing and finally power management. This paper postulates that identifying and optimizing these aspects on their own does not necessarily lead to feasible solutions. We take a cross-layer perspective and provide a networking protocol for implicit or explicit EHS policy negotiation under the constraint of two prototypical communication patterns. The methods presented show how to combine energy aware routing or conservation from network coding with EHS power management policies under the constraint of stateof-the-art MAC. Evaluation of different end-user communication patterns lets the reader interpret the results for an application at hand.
Article
Full-text available
Network coding promises to significantly impact the way communications networks are designed, operated, and understood. The first book to present a unified and intuitive overview of the theory, applications, challenges, and future directions of this emerging field, this is a must-have resource for those working in wireline or wireless networking. *Uses an engineering approach – explains the ideas and practical techniques *Covers mathematical underpinnings, practical algorithms, code selection, security, and network management *Discusses key topics of inter-session (non-multicast) network coding, lossy networks, lossless networks, and subgraph-selection algorithms Starting with basic concepts, models, and theory, then covering a core subset of results with full proofs, Ho and Lun provide an authoritative introduction to network coding that supplies both the background to support research and the practical considerations for designing coded networks. This is an essential resource for graduate students and researchers in electronic and computer engineering and for practitioners in the communications industry.
Article
Full-text available
This paper describes the concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are also discussed.
Article
Full-text available
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing the integration of network coding in the current network stack. We evaluate our design on a 20-node wireless network, and discuss the results of the first testbed deployment of wireless network coding. The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput. The gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
Article
Full-text available
The Steiner packing problem is to find the maximum number of edge-disjoint subgraphs of a given graph G that connect a given set of required points S. This problem is motivated by practical applications in VLSI-layout and broadcasting, as well as theoretical reasons. In this paper, we study this problem and present an algorithm with an asymptotic approximation factor of jSj=4. This gives a sufficient condition for the existence of k edge-disjoint Steiner trees in a graph in terms of the edge-connectivity of the graph. We will show that this condition is the best possible if the number of terminals is 3. At the end, we consider the fractional version of this problem, and observe that it can be reduced to the minimum Steiner tree problem via the ellipsoid algorithm.
Article
We study a new class of multiuser source coding problems inspired by network communications. We propose the use of coding in networks for the purpose of multicasting. This concept may have significant impact on future design of switching systems
Conference Paper
Wireless Sensor Network (WSN) nodes are resource- constrained computing devices. Adaptive behavior of autonomously working WSNs tries to maximize the cost efficiency of deployments. This includes maximizing the lifetime through power consumption optimization and recharging energy reservoirs with the use of energy harvesting. The adaptive behavior that leads to efficient resource usage needs information about the WSNs energy balance for decision making. We present a novel platform to measure the harvested, stored and dissipated energy. For being applicable to different environments it allows to attach different energy harvesting devices (EHDs). EHDs do not provide power continuously. Power availability patterns are used to determine how these sources can be used efficiently. Models from harvesting theory try to adapt to it. We implement a model that targets energy neutrality on our platform. It is used to evaluate the model and improve it. Our novel platform can be used to evaluate theories that model different sources. It can utilize and characterize thermoelectric, piezoelectric and magnetic induction generators and solar cells. The measurement platform tracks energy dissipation too. Mote software is implemented to establish communication to the platform. A sample application on top of it shows that the system can be used for software characterization. This paper contributes a novel modular and low-power design for measurement platforms for WSNs. It shows utilization of different energy sources and the ability to supply different mote types. Our work shows how theories for energy harvesting can be evaluated and improved. Our work also contributes to the field of simulation and emulation through online software characterization. The approach improves in accuracy and completeness over the capabilities of offline simulation.
Conference Paper
Network coding is an emerging and powerful solution that can significantly improve the throughput and power efficiency of wireless networks by allowing mixing of various traffic flows via algebraic operations. With network coding, however, a packet has to wait to be network-coded with others given the stochastic nature of the packet arrival process of the various flows. This may result in large delay and packet-loss rate. To overcome this limitation, a novel network coding approach, which we shall refer to as opportunistic network coding (ONQ, is presented in this paper. In this proposed approach, whether a packet is transmitted with or without network coding is determined by the buffer's queue state at a given node. We shall derive ONC's performance in terms of delay, packet-loss, and power consumption by formulating a Markov Chain and a Hidden Markov Model for the delay and power analysis. More importantly, we will develop an optimal ONC strategy with minimal average delay and zero packet-loss rate. In particular, we will show that there exists a fundamental tradeoff between average delay and power, which characterizes the performance limit of ONC.
Conference Paper
This paper discusses the limitations of implementing low power listening (LPL) on the contention-based IEEE 802.15.4 MAC protocol, and proposes an implementation technique called virtual preamble cross-checking (VPCC), which enables LPL. The proposed technique uses the concept of virtual preamble and a cross-checking method to meet the requirements of the relationship between preamble length and listening interval. These methods lead to reliable data communication, as well as the reduction of the idle listening. We implemented the mechanism on IEEE 802.15.4-compatible RF hardware and validated the performance. The experiment results show that increasing the listening interval within a tolerable latency can optimize the duty cycle of the RF transceiver for low power consumption.
Article
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. In this paper, we study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the Max-flow Min-cut Theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a 'fluid' which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.
Conference Paper
The minimum energy required to transmit a bit of information through a network characterizes the most economical way to communicate in a network. In this paper, we show that under a simplified layered model of wireless networks, the minimum-energy multicast problem in mobile ad hoc networks is solvable as a linear program, assuming network coding. Compared with conventional routing solutions, network coding not only promises a potentially lower energy-per-bit, but also enables finding the optimal solution in polynomial time, in sharp contrast with the NP-hardness of constructing the minimum-energy multicast tree as the optimal routing solution.
Article
The minimum energy required to transmit one bit of information through a network characterizes the most economical way to communicate in a network. In this paper, we show that, under a layered model of wireless networks, the minimum energy-per-bit for multicasting in a mobile ad hoc network can be found by a linear program; the minimum energy-per-bit can be attained by performing network coding. Compared with conventional routing solutions, network coding not only allows a potentially lower energy-per-bit to be achieved, but also enables the optimal solution to be found in polynomial time, in sharp contrast with the NP-hardness of constructing the minimum-energy multicast tree as the optimal routing solution. We further show that the minimum energy multicast formulation is equivalent to a cost minimization with linear edge-based pricing, where the edge prices are the energy-per-bits of the corresponding physical broadcast links. This paper also investigates minimum energy multicasting with routing. Due to the linearity of the pricing scheme, the minimum energy-per-bit for routing is achievable by using a single distribution tree. A characterization of the admissible rate region for routing with a single tree is presented. The minimum energy-per-bit for multicasting with routing is found by an integer linear program. We show that the relaxation of this integer linear program, studied earlier in the Steiner tree literature, can now be interpreted as the optimization for minimum energy multicasting with network coding. In short, this paper presents a unifying study of minimum energy multicasting with network coding and routing.