Int J Performability Eng ›› 2017, Vol. 13 ›› Issue (4): 540-550.doi: 10.23940/ijpe.17.04.p21.540550

• Original articles • Previous Articles     Next Articles

LAPDK: A Novel Dynamic-Programming-Based Algorithm for the LAP-(D, k) Query Problem in Wireless Sensor Networks

Xingpo Maa, Yanli Lia, Ran Lia, Yin Lia, and Junbin Liangb   

  1. aSchool of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, P.R.China
    bSchool of Computer and Electronics Information, Guangxi University, Nanning 530004, P.R.China

Abstract:

In wireless sensor networks, the LAP-(D, k) query problem can be seen as a special Top-k query problem with the constraint that the Euclidean distance between any two locations corresponding to the data items in the Top-k query results should not be smaller than the given value D. To solve this problem, a novel dynamic-programming-based heuristic algorithm named LAPDK is proposed. LAPDK firstly divides the sensing field into hexagonal cells using some geometry methods. Then, it finds the approximate solution of the LAP-(D, k) query problem based on parts of the data generated by the sensor nodes in some preferential cells using the dynamic programming technique. Finally, it further optimizes the solution based on the sensing data received by the Sink node. Simulation results show that LAPDK not only decreases the energy cost of WSNs but also obtains a better approximation ratio compared to the existing state-of-the-art scheme for the LAP-(D, k) query problem.


Submitted on February 24, 2017; Revised on April 26, 2017; Accepted on May 30, 2017
References: 16