Constructing a Shortest Path Overhearing Tree with Maximum Lifetime in WSNs

—Secure data collection is an important problem in wireless sensor networks. Different approaches have been proposed. One of them is overhearing. We investigate the problem of constructing a shortest path overhearing tree with the maximum lifetime. We propose three approaches. The first one is a polynomial-time heuristic. The second one uses ILP (Integer Linear Programming) to iteratively find a monitoring node and a parent for each sensor node. The last one optimally solves the problem by using MINLP (MixedInteger Non-Linear Programming). We have implemented the three approaches using MIDACO solver and MATLAB Intlinprog, and performed extensive simulations using NS2.35. The simulation results show that the average lifetime of all the network instances achieved by the heuristic approach is 85.69%

• Type: Journal
• Year: 2016
• Where: HICSS
• Authors: Wael Y. Alghamdi, Hui Wu, Wenguang Zheng, Salil S. Kanhere
• Keywords: Biometrics, HICSS 2016