Design Optimization of Multi-Sink Sensor Networks by Analogy to Electrostatic Theory

In this work we introduce a new mathematical tool for optimization of routes, and topology design in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. Our mathematical machinery is based on partial differential equations analogous to the Maxwell equations in electrostatic theory. We use our vector field model to solve the optimization problem for the case in which there are multiple destinations (sinks) in the network. In order to optimally determine the destination for each sensor, we partition the network into areas, each corresponding to one of the destinations. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar function (also known as a potential function). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential function should be equal at the locations of all the destinations. Also, we show that such an optimal partitioning of the network load among the destination is unique, and we give iterations to find the optimal solution

Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks

We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both the global optimal solution as well as the non-cooperative routing problem among a large population of users where each user seeks a path from its origin to its destination so as to minimize its individual cost. Finally, we seek for a (continuum version of the) Wardrop equilibrium. We first show how to derive meaningful cost models as a function of the scaling properties of the capacity of the network and of the density of nodes. We present various solution methodologies for the problem: (1) the viscosity solution of the Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a method based on Green's Theorem for the least cost problem of an individual, and (3) a solution of the Wardrop equilibrium problem using a transformation into an equivalent global optimization problem

SUSTAINABLE ENERGY HARVESTING TECHNOLOGIES – PAST, PRESENT AND FUTURE

Chapter 8: Energy Harvesting Technologies: Thick-Film Piezoelectric Microgenerato

DESIGN AND IMPLEMENTATION OF INFORMATION PATHS IN DENSE WIRELESS SENSOR NETWORKS

In large-scale sensor networks with monitoring applications, sensor nodes are responsible to send periodic reports to the destination which is located far away from the area to be monitored. We model this area (referred to as the distributed source) with a positive load density function which determines the total rate of traffic generated inside any closed contour within the area. With tight limitations in energy consumption of wireless sensors and the many-to-one nature of communications in wireless sensor networks, the traditional definition of connectivity in graph theory does not seem to be sufficient to satisfy the requirements of sensor networks. In this work, a new notion of connectivity (called implementability) is defined which represents the ability of sensor nodes to relay traffic along a given direction field, referred to as information flow vector field $\vec{D}$. The magnitude of information flow is proportional to the traffic flux (per unit length) passing through any point in the network, and its direction is toward the flow of traffic. The flow field may be obtained from engineering knowledge or as a solution to an optimization problem. In either case, information flow flux lines represent a set of abstract paths (not constrained by the actual location of sensor nodes) which can be used for data transmission to the destination. In this work, we present conditions to be placed on $\vec{D}$ such that the resulting optimal vector field generates a desirable set of paths. In a sensor network with a given irrotational flow field $\vec{D}(x,y)$, we show that a density of $n(x,y)=O(|\vec{D}(x,y)|^2)$ sensor nodes is not sufficient to implement the flow field as $|\vec{D}|$ scales linearly to infinity. On the other hand, by increasing the density of wireless nodes to $n(x,y)=O(|\vec{D}(x,y)|^2 \log |\vec{D}(x,y)|)$, the flow field becomes implementable. Implementability requires more nodes than simple connectivity. However, results on connectivity are based on the implicit assumption of exhaustively searching all possible routes which contradicts the tight limitation of energy in sensor networks. We propose a joint MAC and routing protocol to forward traffic along the flow field. The proposed tier-based scheme can be further exploited to build lightweight protocol stacks which meet the specific requirements of dense sensor networks. We also investigate buffer scalability of sensor nodes routing along flux lines of a given irrotational vector field, and show that nodes distributed according to the sufficient bound provided above can relay traffic from the source to the destination with sensor nodes having limited buffer space. This is particularly interesting for dense wireless sensor networks where nodes are assumed to have very limited resources

Continuum Equilibria for Routing in Dense Ad-hoc Networks

International audienceWe consider massively dense ad-hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both the global optimal solution as well as the non-cooperative routing problem among a large population of users. Each user seeks a path from its source to its destination so as to minimize its individual cost. We seek for a (continuum version of the) Wardrop equilibrium. We first show how to derive meaningful cost models as a function of the scaling properties of the capacity of the network as a function of the density of nodes. We present various solution methodologies for the problem: (1) the viscosity solution of the Hamilton-Jacobi-Bellman equation, (2) a transformation into an equivalent global optimization problem that is obtained by identifying some potential related to the costs. We finally study the problem in which the routing decisions are taken by a finite number of competing service providers

Information Potential Fields Navigation in Wireless Ad-Hoc Sensor Networks

As wireless sensor networks (WSNs) are increasingly being deployed in some important applications, it becomes imperative that we consider application requirements in in-network processes. We intend to use a WSN to aid information querying and navigation within a dynamic and real-time environment. We propose a novel method that relies on the heat diffusion equation to finish the navigation process conveniently and easily. From the perspective of theoretical analysis, our proposed work holds the lower constraint condition. We use multiple scales to reach the goal of accurate navigation. We present a multi-scale gradient descent method to satisfy users’ requirements in WSNs. Formula derivations and simulations show that the method is accurately and efficiently able to solve typical sensor network configuration information navigation problems. Simultaneously, the structure of heat diffusion equation allows more flexibility and adaptability in searching algorithm designs

Magneto-inductive wireless underground sensor networks: novel longevity model, communication concepts and workarounds to key theoretical issues using analogical thinking

This research has attempted to devise novel workarounds to key theoretical issues in magneto-inductive wireless underground sensor networks (WUSNs), founded on analogical thinking (Gassmann & Zeschky 2008). The problem statement for this research can be summarized as follows. There has been a substantial output of research publications in the past 5 years, devoted to theoretically analysing and resolving the issues pertaining to deployment of MI based WUSNs. However, no alternate solution approaches to such theoretical analyses have been considered. The goal of this research was to explore such alternate solution approaches. This research has used the principle of analogical thinking in devising such alternate solution approaches. This research has made several key contributions to the existing body of work. First, this research is the first of its kind to demonstrate by means of review of state-of-the-art research on MI based WUSNs, the largely theoretical genus of the research to the exclusion of alternate solution approaches to circumvent key theoretical issues. Second, this research is the first of its kind to introduce the notion of analogical thinking as a solution approach in finding viable workarounds to theoretical impediments in MI based WUSNs, and validate such solution approach by means of simulations. Third, this research is the first of its kind to explore novel communication concepts in the realm of MI based WUSNs, based on analogical thinking. Fourth, this research is the first of its kind to explore a novel longevity model in the realm of MI based WUSNs, based on analogical thinking. Fifth, this research is also the first to extend the notion of analogical thinking to futuristic directions in MI based WUSNs research, by means of providing possible indicators drawn from various other areas of contemporary research. In essence, the author believes that the findings of this research mark a paradigm shift in the research on MI based WUSNs

Wind energy harvester interface for sensor nodes

The research topic is developping a power converting interface for the novel FLEHAP wind energy harvester allowing the produced energy to be used for powering small wireless nodes. The harvester\u2019s electrical characteristics were studied and a strategy was developped to control and mainting a maximum power transfer. The electronic power converter interface was designed, containing an AC/DC Buck-Boost converter and controlled with a low power microcontroller. Different prototypes were developped that evolved by reducing the sources of power loss and rendering the system more efficient. The validation of the system was done through simulations in the COSMIC/DITEN lab using generated signals, and then follow-up experiments were conducted with a controllable wind tunnel in the DIFI department University of Genoa. The experiment results proved the functionality of the control algorithm as well as the efficiency that was ramped up by the hardware solutions that were implemented, and generally met the requirement to provide a power source for low-power sensor nodes

Routing protocol for anycast communications in a wireless sensor network

Abstract. In wireless sensor networks, there is usually a sink which gathers data from the battery-powered sensor nodes. As sensor nodes around the sink consume their energy faster than the other nodes, several sinks have to be deployed to increase the network lifetime. In this paper, we motivate the need of anycast communications in wireless networks, where all the sinks are identical and can gather data from any source. To reduce interference and congestion areas on the wireless medium, the path from a source to a sink has to be distant from the path connecting another source to another sink. We show that determining distant paths from sources to sinks is an NP-hard problem, and we propose a linear formulation in order to obtain optimal solutions. Then, we propose a sink selection and routing protocol called S4 and based on realistic assumptions and we evaluate it through simulations. Finally, we conclude that anycast routing protocols in wireless sensor networks should not compute paths independently for each source, but rather consider all the sources simultaneously