An Improved Data Collection Algorithm for Wireless Sensor Networks

Vemula Manohar Reddy, Min Kyung An and Hyuk Cho
Additional contact information
Vemula Manohar Reddy: Sam Houston State University, Huntsville, USA
Min Kyung An: Sam Houston State University, Huntsville, USA
Hyuk Cho: Sam Houston State University, Huntsville, USA

International Journal of Interdisciplinary Telecommunications and Networking (IJITN), 2019, vol. 11, issue 2, 12-23

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.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJITN.2019040102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jitn00:v:11:y:2019:i:2:p:12-23

Access Statistics for this article

International Journal of Interdisciplinary Telecommunications and Networking (IJITN) is currently edited by Efosa Carroll Idemudia

More articles in International Journal of Interdisciplinary Telecommunications and Networking (IJITN) from IGI Global
Bibliographic data for series maintained by Journal Editor ().