Skip to main content

Advertisement

SpringerLink
Log in

Efficient Nearest Neighbor Heuristic TSP Algorithms for Reducing Data Acquisition Latency of UAV Relay WSN

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The use of unmanned aerial vehicle (UAV) as a relay in wireless sensor networks significantly reduces sensor nodes’ energy consumption as the UAV replaces the multi-hop communication among nodes. As a consequence, the functional lifetime of the network is elongated in exchange for higher data delivery latency. Due to the NP-hardness of the travelling salesman problem (TSP) whose computational complexity increases exponentially as an increment of number of nodes, heuristic algorithms, such as nearest neighbor (NN) heuristic TSP algorithm, have been developed for reducing this data delivery latency in shortest possible time. In this paper, we proposed three efficient algorithms that modify the existing NN algorithm to gain a reduction in the data delivery latency with no significant change in computational time. Analytical and simulation results demonstrated that our proposed algorithms outperform the existing NN algorithm in reducing the data delivery latency, especially for nodes that are densely deployed and having relatively larger transmission ranges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Lin, C., Xiong, N., Park, J., & Kim, T.-H. (2009). Dynamic power management in new architecture of wireless sensor networks. International Journal of Communication Systems, 22, 671–693.

    Article  Google Scholar 

  2. Charles Lai, B., Hwang, D. D., Pete Kim, S., & Verbauwhede, I. (2004). Reducing radio energy consumption of key management protocols for wireless sensor networks. In Proceedings of the ACM/IEEE International symposium on low power electronics and design (ISLPED) (pp. 351–356).

  3. Cobano, J. A., Martinez-de Dios, J. R., Conde, R., Sanchez-Matamoros, J. M., & Ollero, A. (2010). Data retrieving from heterogeneous wireless sensor network nodes using UAVs. Journal of Intelligent & Robotic Systems, 60(1), 133–151.

  4. de Freitas, E. P., et al. (2010). UAV relay network to support WSN connectivity. In Proceedings of IEEE international congress on ultramodern telecommunications and control systems (ICUMT’10) (pp. 309–314). Moscow.

  5. Tekdas, O., Isler, V., Lim, J., & Terzis, A. (2009). Using mobile robots to harvest data from sensor fields. IEEE Wireless Communications in Robotic Networks, 16, 22–28.

    Article  Google Scholar 

  6. Sugihara, R., & Gupta, R. (2009). Optimizing energy-latency trade-off in sensor networks with controlled mobility. In IEEE INFOCOM (pp. 2566–2570).

  7. Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints. Operation Research letters, 10, 27–36. [Elsevier Science Publishers B.V. (North-Holland)].

    Article  MathSciNet  MATH  Google Scholar 

  8. Gutin, G., & Punnen, A. P. (2002). The traveling salesman problem and its variations (pp. 1–28). New York: Springer.

    MATH  Google Scholar 

  9. Papadimitriou, C. H. (1978). Euclidean traveling salesman problem is NP complete. Theoretical Computer Science, 4, 237–244.

    Article  MathSciNet  MATH  Google Scholar 

  10. Lawler, E. L., Lenstra, J. K., Kan, R. A., & Shmoys, D. B. (1985). The traveling salesman problem: A guided tour of combinatorial optimization. New York: Wiley.

    MATH  Google Scholar 

  11. Wu, X., Chen, G., & Das, S. (2008). Avoiding energy holes in wireless sensor networks with non-uniform node distribution. IEEE Transactions on Parallel and Distributed Systems, 19(5), 710–720.

    Article  Google Scholar 

  12. Yuan, B., Orlowska, M., & Sadiq, S. (2007). On the optimal robot routing problem in wireless sensor networks. IEEE Transactions on Knowledge and Data Engineering, 19(9), 1252–1261.

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (2015R1D1A1A01060034).

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Ajou University, Suwon, 443-749, South Korea

    Temesgen Seyoum Alemayehu

  2. Department of Cyber Security, Ajou University, Suwon, 443-749, South Korea

    Jai-Hoon Kim

Authors
  1. Temesgen Seyoum Alemayehu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jai-Hoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jai-Hoon Kim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alemayehu, T.S., Kim, JH. Efficient Nearest Neighbor Heuristic TSP Algorithms for Reducing Data Acquisition Latency of UAV Relay WSN. Wireless Pers Commun 95, 3271–3285 (2017). https://doi.org/10.1007/s11277-017-3994-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-3994-9

Keywords

Search

Navigation