Reference Hub3
An Improved Data Collection Algorithm for Wireless Sensor Networks

An Improved Data Collection Algorithm for Wireless Sensor Networks

Vemula Manohar Reddy, Min Kyung An, Hyuk Cho
Copyright: © 2019 |Volume: 11 |Issue: 2 |Pages: 12
ISSN: 1941-8663|EISSN: 1941-8671|EISBN13: 9781522565499|DOI: 10.4018/IJITN.2019040102
Cite Article Cite Article

MLA

Reddy, Vemula Manohar, et al. "An Improved Data Collection Algorithm for Wireless Sensor Networks." IJITN vol.11, no.2 2019: pp.12-23. http://doi.org/10.4018/IJITN.2019040102

APA

Reddy, V. M., An, M. K., & Cho, H. (2019). An Improved Data Collection Algorithm for Wireless Sensor Networks. International Journal of Interdisciplinary Telecommunications and Networking (IJITN), 11(2), 12-23. http://doi.org/10.4018/IJITN.2019040102

Chicago

Reddy, Vemula Manohar, Min Kyung An, and Hyuk Cho. "An Improved Data Collection Algorithm for Wireless Sensor Networks," International Journal of Interdisciplinary Telecommunications and Networking (IJITN) 11, no.2: 12-23. http://doi.org/10.4018/IJITN.2019040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article studies the minimum latency collection scheduling (MLCS) problem in wireless sensor networks (WSNs). The MLCS problem targets to compute a schedule with minimum number of timeslots that guarantees to collect data from all nodes to a sink node without any collision. Several scheduling algorithms have been proposed for the NP-hard problem, and they assign timeslots based on hop distances among nodes. The proposed algorithm not only uses hop distances, but also partitions a network into square cells and assign timeslots based on cell distances among nodes. The latency performance of the proposed algorithm is compared with an existing algorithm whose approximation ratio is currently the best, and the simulations show that the proposed algorithm performs better.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.