Optimal Queries Processing in a Heterogeneous Sensor Network Using Multicommodity Network Flow Method
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.
Multicommodity Sensor Network Query Processing Optimal Algorithm
Nurjahan Begum Samia Tasnim Mahmuda Naznin
Department of Computer Science and Engineering,Bangladesh University of Engineering and Technology,Dhaka - 1000,Bangladesh
国际会议
厦门
英文
665-670
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）