{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:33:58Z","timestamp":1781105638840,"version":"3.54.1"},"reference-count":10,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/ijitn.2019040102","type":"journal-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T10:07:54Z","timestamp":1563530874000},"page":"12-23","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Data Collection Algorithm for Wireless Sensor Networks"],"prefix":"10.4018","volume":"11","author":[{"given":"Vemula Manohar","family":"Reddy","sequence":"first","affiliation":[{"name":"Sam Houston State University, Huntsville, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min Kyung","family":"An","sequence":"additional","affiliation":[{"name":"Sam Houston State University, Huntsville, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hyuk","family":"Cho","sequence":"additional","affiliation":[{"name":"Sam Houston State University, Huntsville, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJITN.2019040102-0","first-page":"658","article-title":"Efficient Data Collection in Interference-Aware Wireless Sensor Networks.","volume":"10","author":"M. K.An","year":"2015","journal-title":"Journal of Networks"},{"key":"IJITN.2019040102-1","first-page":"254","article-title":"Minimum Data Aggregation Schedule in Wireless Sensor Networks.","volume":"18","author":"M. K.An","year":"2011","journal-title":"International Journal of Computers and Their Applications"},{"key":"IJITN.2019040102-2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626406002551"},{"key":"IJITN.2019040102-3","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830913500043"},{"key":"IJITN.2019040102-4","author":"J.-C.Bermond","year":"2013","journal-title":"Data Gathering and Personalized Broadcasting in Radio Grids with Interferences"},{"key":"IJITN.2019040102-5","doi-asserted-by":"publisher","DOI":"10.1007\/11785293_31"},{"key":"IJITN.2019040102-6","author":"T. H.Cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"IJITN.2019040102-7","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-009-0183-0"},{"key":"IJITN.2019040102-8","first-page":"1069","article-title":"Packet Distribution Algorithms for Sensor Networks.","author":"C.Florens","year":"2003","journal-title":"Proceedings of the 22nd Annual Joint Conference of the Computer and Communications Societies (INFOCOM)"},{"key":"IJITN.2019040102-9","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0613-x"}],"container-title":["International Journal of Interdisciplinary Telecommunications and Networking"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=233897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T21:50:54Z","timestamp":1651873854000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJITN.2019040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,4,1]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijitn.2019040102","relation":{},"ISSN":["1941-8663","1941-8671"],"issn-type":[{"value":"1941-8663","type":"print"},{"value":"1941-8671","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,1]]}}}