Parallel Routing in Wireless Sensor Network
Main Article Content
Abstract
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.
Article Details
How to Cite
Publication Dates
References
Andreas Adelmann1, Peter Arbenz, and Yves Ineichen1;"Improvements of a Fast Parallel Poisson Solver on Irregular Domains ".July 2010.
Azali Saudi1 and Jumat Sulaiman"Path Planning for Mobile Robot with Half-Sweep Successive Over Relaxation Iterative Method".Symposium on Progress in Information & Communication Technology 2009.
Mathew N.O Sadiku,"Numarical Techniques in Electromagnatics", second eddition, 2001.
M. Kalantari and M. Shayman, "Routing in Multi-Commodity Sensor Networks Based on Partial Differential Equations" IEEE ,2006, pp.402-406.
M. Kalantari and M. Shayman, "Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory" IEEE, 2004,pp. 4028-4033.
Vijay K. Garg "Wireless Communictions and Networking"© 2007 by Elsevier.
http://www.mhpcc.edu/training/workshop/mpi/M ain.html parallel Programming Workshop_ Message Passing Interface.