Parallel Routing in Wireless Sensor Network

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parallel, each node on its associated sub-domain. With this method power consumption by the central node which is responsible to compute routing in the network is reduced

Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory

Abstract — In this paper we introduce a novel approach for the routing problem in wireless ad hoc networks. Our approach is based on the analogy of the routing problem to the distribution of electric field in a physical media with a given density of charges. We show that the throughput can be significantly increased by choosing routes in such a way that the traffic is spread as uniformly as possible throughout the network. Achieving this uniform spreading requires solution of a set of partial differential equations similar to Maxwell’s equations in the electrostatic theory. While the main focus in the paper is on the case in which many sources communicate with a single destination, extension to the case of multiple destinations is also described. I