By Topic

Optimal queries processing in a heterogeneous sensor network using multicommodity network flow method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Begum, N. ; Dept. of Comput. Sci. & Eng., Bangladesh Univ. of Eng. & Technol., Dhaka, Bangladesh ; Tasnim, S. ; Naznin, M.

In a wireless sensor network, it is a common practice to have in network partial data processing. As part of this, the mitigation of the demands issued by sink nodes in a heterogeneous resource constrained sensor network requires optimal resource sharing, which is a very challenging task. We find this task analogous to finding the optimal flow in a multi commodity flow network. The minimum cost multi commodity flow problem is an NP hard one. In our paper, we give an optimal cost algorithm to solve this problem where a special data structure is built, which we call Data Forwarding Tree. We compare our algorithm to a well known auction method where a commodity wins the bid based on the lowest cost path, and the other looser commodities are shipped using more expensive paths incurring more cost. An algorithmic analysis shows that our method is free of deadlock as well.

Published in:

Industrial Engineering and Engineering Management (IE&EM), 2010 IEEE 17Th International Conference on

Date of Conference:

29-31 Oct. 2010